Skip to content

Commit 65d2402

Browse files
committed
Docstring fixes
1 parent 0f40943 commit 65d2402

File tree

2 files changed

+24
-12
lines changed

2 files changed

+24
-12
lines changed

include/cuco/bloom_filter.cuh

Lines changed: 12 additions & 6 deletions
Original file line numberDiff line numberDiff line change
@@ -336,7 +336,8 @@ class bloom_filter {
336336
* construction of a bloom filter on some set \f$X\f$, and let \f$A\f$ and \f$B\f$ be two sets,
337337
* then it holds that \f$f(A \cup B) = f(A) \cup f(B)\f$.
338338
*
339-
* @param other Other filter with matching type to this.
339+
* @param other Other filter with matching type to this. The policy object must be equal to that
340+
* of this filter, otherwise behavior is undefined.
340341
* @param stream CUDA stream used for device memory operations and kernel launches.
341342
*
342343
* @throws cuco::logic_error If the other filter does not have the same number of blocks as this.
@@ -353,7 +354,8 @@ class bloom_filter {
353354
* construction of a bloom filter on some set \f$X\f$, and let \f$A\f$ and \f$B\f$ be two sets,
354355
* then it holds that \f$f(A \cup B) = f(A) \cup f(B)\f$
355356
*
356-
* @param other Other filter with matching type to this.
357+
* @param other Other filter with matching type to this. The policy object must be equal to that
358+
* of this filter, otherwise behavior is undefined.
357359
* @param stream CUDA stream used for device memory operations and kernel launches.
358360
*
359361
* @throws cuco::logic_error If the other filter does not have the same number of blocks as this.
@@ -373,9 +375,11 @@ class bloom_filter {
373375
* does not distribute over filter construction and therefore only approximates the bloom filter
374376
* of the intersection of the input sets. In other words, let \f$f : X \to B\f$ denote the
375377
* construction of a bloom filter on some set \f$X\f$, and let \f$A\f$ and \f$B\f$ be two sets,
376-
* then \f$(A \cap B) \ne f(A) \cap f(B)\f$.
378+
* then \f$(A \cap B) \ne f(A) \cap f(B)\f$. Despite this, it is guaranteed that for all \f$x \in
379+
* (A \cap B)\f$, it holds \f$x \in f(A) \cap f(B)\f$.
377380
*
378-
* @param other Other filter with matching type to this.
381+
* @param other Other filter with matching type to this. The policy object must be equal to that
382+
* of this filter, otherwise behavior is undefined.
379383
* @param stream CUDA stream used for device memory operations and kernel launches.
380384
*
381385
* @throws cuco::logic_error If the other filter does not have the same number of blocks as this.
@@ -393,9 +397,11 @@ class bloom_filter {
393397
* operation does not distribute over filter construction and therefore only approximates the
394398
* bloom filter of the intersection of the input sets. In other words, let \f$f : X \to B\f$
395399
* denote the construction of a bloom filter on some set \f$X\f$, and let \f$A\f$ and \f$B\f$ be
396-
* two sets, then \f$(A \cap B) \ne f(A) \cap f(B)\f$.
400+
* two sets, then \f$(A \cap B) \ne f(A) \cap f(B)\f$. Despite this, it is guaranteed that for
401+
* all \f$x \in (A \cap B)\f$, it holds \f$x \in f(A) \cap f(B)\f$.
397402
*
398-
* @param other Other filter with matching type to this.
403+
* @param other Other filter with matching type to this. The policy object must be equal to that
404+
* of this filter, otherwise behavior is undefined.
399405
* @param stream CUDA stream used for device memory operations and kernel launches.
400406
*
401407
* @throws cuco::logic_error If the other filter does not have the same number of blocks as this.

include/cuco/bloom_filter_ref.cuh

Lines changed: 12 additions & 6 deletions
Original file line numberDiff line numberDiff line change
@@ -392,7 +392,8 @@ class bloom_filter_ref {
392392
* construction of a bloom filter on some set \f$X\f$, and let \f$A\f$ and \f$B\f$ be two sets,
393393
* then it holds that \f$f(A \cup B) = f(A) \cup f(B)\f$.
394394
*
395-
* @param other Other filter with matching type to this.
395+
* @param other Other filter with matching type to this. The policy object must be equal to that
396+
* of this filter, otherwise behavior is undefined.
396397
* @param stream CUDA stream used for device memory operations and kernel launches.
397398
*
398399
* @throws cuco::logic_error If the other filter does not have the same number of blocks as this.
@@ -409,7 +410,8 @@ class bloom_filter_ref {
409410
* construction of a bloom filter on some set \f$X\f$, and let \f$A\f$ and \f$B\f$ be two sets,
410411
* then it holds that \f$f(A \cup B) = f(A) \cup f(B)\f$
411412
*
412-
* @param other Other filter with matching type to this.
413+
* @param other Other filter with matching type to this. The policy object must be equal to that
414+
* of this filter, otherwise behavior is undefined.
413415
* @param stream CUDA stream used for device memory operations and kernel launches.
414416
*
415417
* @throws cuco::logic_error If the other filter does not have the same number of blocks as this.
@@ -429,9 +431,11 @@ class bloom_filter_ref {
429431
* does not distribute over filter construction and therefore only approximates the bloom filter
430432
* of the intersection of the input sets. In other words, let \f$f : X \to B\f$ denote the
431433
* construction of a bloom filter on some set \f$X\f$, and let \f$A\f$ and \f$B\f$ be two sets,
432-
* then \f$f(A \cap B) \ne f(A) \cap f(B)\f$.
434+
* then \f$f(A \cap B) \ne f(A) \cap f(B)\f$. Despite this, it is guaranteed that for all \f$x \in
435+
* (A \cap B)\f$, it holds \f$x \in f(A) \cap f(B)\f$.
433436
*
434-
* @param other Other filter with matching type to this.
437+
* @param other Other filter with matching type to this. The policy object must be equal to that
438+
* of this filter, otherwise behavior is undefined.
435439
* @param stream CUDA stream used for device memory operations and kernel launches.
436440
*
437441
* @throws cuco::logic_error If the other filter does not have the same number of blocks as this.
@@ -449,9 +453,11 @@ class bloom_filter_ref {
449453
* operation does not distribute over filter construction and therefore only approximates the
450454
* bloom filter of the intersection of the input sets. In other words, let \f$f : X \to B\f$
451455
* denote the construction of a bloom filter on some set \f$X\f$, and let \f$A\f$ and \f$B\f$ be
452-
* two sets, then \f$f(A \cap B) \ne f(A) \cap f(B)\f$.
456+
* two sets, then \f$f(A \cap B) \ne f(A) \cap f(B)\f$. Despite this, it is guaranteed that for
457+
* all \f$x \in (A \cap B)\f$, it holds \f$x \in f(A) \cap f(B)\f$.
453458
*
454-
* @param other Other filter with matching type to this.
459+
* @param other Other filter with matching type to this. The policy object must be equal to that
460+
* of this filter, otherwise behavior is undefined.
455461
* @param stream CUDA stream used for device memory operations and kernel launches.
456462
*
457463
* @throws cuco::logic_error If the other filter does not have the same number of blocks as this.

0 commit comments

Comments
 (0)