This is an automated email from the ASF dual-hosted git repository.

git-site-role pushed a commit to branch asf-site
in repository https://gitbox.apache.org/repos/asf/datasketches-website.git


The following commit(s) were added to refs/heads/asf-site by this push:
     new 2d69859d Automatic Site Publish by Buildbot
2d69859d is described below

commit 2d69859d300b297a2d2c4d27f8979c8e41a8fb80
Author: buildbot <[email protected]>
AuthorDate: Mon Dec 22 20:30:04 2025 +0000

    Automatic Site Publish by Buildbot
---
 output/datasketches-doap.rdf                                     | 4 +++-
 output/docs/QuantilesAll/SketchingQuantilesAndRanksTutorial.html | 2 +-
 2 files changed, 4 insertions(+), 2 deletions(-)

diff --git a/output/datasketches-doap.rdf b/output/datasketches-doap.rdf
index ff02e8f4..d7a9c373 100644
--- a/output/datasketches-doap.rdf
+++ b/output/datasketches-doap.rdf
@@ -35,12 +35,14 @@ If approximate results are acceptable, there is a class of 
specialized algorithm
     <bug-database 
rdf:resource="https://github.com/apache/datasketches-cpp/issues"; />
     <bug-database 
rdf:resource="https://github.com/apache/datasketches-python/issues"; />
     <bug-database 
rdf:resource="https://github.com/apache/datasketches-go/issues"; />
+    <bug-database 
rdf:resource="https://github.com/apache/datasketches-rust/issues"; />
     <mailing-list 
rdf:resource="https://lists.apache.org/[email protected]"; 
/>
     <download-page 
rdf:resource="https//datasketches.apache.org/docs/Community/Downloads.html" />
     <programming-language>Java</programming-language>
     <programming-language>C++</programming-language>
     <programming-language>Python</programming-language>
     <programming-language>Go</programming-language>
+    <programming-language>Rust</programming-language>
     <category rdf:resource="https://projects.apache.org/category/library"; />
     <category rdf:resource="https://projects.apache.org/category/big-data"; />
     <repository>
@@ -55,7 +57,7 @@ If approximate results are acceptable, there is a class of 
specialized algorithm
     </repository>
     <maintainer>
       <foaf:Person>
-        <foaf:name>Lee Rhodes</foaf:name>
+        <foaf:name>Lee Rhodes (leerho)</foaf:name>
           <foaf:mbox rdf:resource="mailto:[email protected]"/>
       </foaf:Person>
     </maintainer>
diff --git a/output/docs/QuantilesAll/SketchingQuantilesAndRanksTutorial.html 
b/output/docs/QuantilesAll/SketchingQuantilesAndRanksTutorial.html
index 1b108ddc..0c9dfde8 100644
--- a/output/docs/QuantilesAll/SketchingQuantilesAndRanksTutorial.html
+++ b/output/docs/QuantilesAll/SketchingQuantilesAndRanksTutorial.html
@@ -575,7 +575,7 @@ To wit:</p>
 <h2 id="the-need-for-inequality-search">The need for inequality search</h2>
 <p>The quantile sketch algorithms discussed in the literature primarily differ 
by how they choose which quantiles in the stream should be discarded. After the 
elimination process, all of the quantiles sketch implementations are left with 
the challenge of how to reconstruct the actual distribution of the stream, 
approximately and with good accuracy.</p>
 
-<p>Given the presence of duplicates and absence of values from the stream we 
must redefine the above quantile and rank functions as inequalities while 
retaining the properties of 1:1 functions as closely as possible.**</p>
+<p>Given the presence of duplicates and absence of values from the stream we 
must redefine the above quantile and rank functions as inequalities while 
retaining the properties of 1:1 functions as closely as possible.</p>
 
 <p>One can find examples of the following definitions in the research 
literature.  All of our library quantile sketches allow the user to choose the 
searching criteria.</p>
 


---------------------------------------------------------------------
To unsubscribe, e-mail: [email protected]
For additional commands, e-mail: [email protected]

Reply via email to