Spelling src

These are non-functional changes.

* accounting
* activation
* actual
* added
* addresult
* aggregable
* aligned
* alternatively
* ambiguous
* analysis
* analyzer
* anticlimactic
* apparently
* application
* appropriate
* arithmetic
* assignment
* assigns
* associated
* authentication
* authoritative
* barrier
* boundary
* broccoli
* buffering
* caching
* called
* canonicalized
* capturing
* certificates
* ciphersuite
* columns
* communication
* comparison
* comparisons
* compilation
* component
* concatenating
* concatenation
* connection
* convenience
* correctly
* corresponding
* could
* counting
* data
* declared
* decryption
* defining
* dependent
* deprecated
* detached
* dictionary
* directional
* directly
* directory
* discarding
* disconnecting
* distinguishes
* documentation
* elsewhere
* emitted
* empty
* endianness
* endpoint
* enumerator
* essentially
* evaluated
* everything
* exactly
* execute
* explicit
* expressions
* facilitates
* fiddling
* filesystem
* flag
* flagged
* for
* fragments
* guarantee
* guaranteed
* happen
* happening
* hemisphere
* identifier
* identifies
* identify
* implementation
* implemented
* implementing
* including
* inconsistency
* indeterminate
* indices
* individual
* information
* initial
* initialization
* initialize
* initialized
* initializes
* instantiate
* instantiated
* instantiates
* interface
* internal
* interpreted
* interpreter
* into
* it
* iterators
* length
* likely
* log
* longer
* mainly
* mark
* maximum
* message
* minimum
* module
* must
* name
* namespace
* necessary
* nonexistent
* not
* notifications
* notifier
* number
* objects
* occurred
* operations
* original
* otherwise
* output
* overridden
* override
* overriding
* overwriting
* ownership
* parameters
* particular
* payload
* persistent
* potential
* precision
* preexisting
* preservation
* preserved
* primarily
* probably
* procedure
* proceed
* process
* processed
* processes
* processing
* propagate
* propagated
* prototype
* provides
* publishing
* purposes
* queue
* reached
* reason
* reassem
* reassemble
* reassembler
* recommend
* record
* reduction
* reference
* regularly
* representation
* request
* reserved
* retrieve
* returning
* separate
* should
* shouldn't
* significant
* signing
* simplified
* simultaneously
* single
* somebody
* sources
* specific
* specification
* specified
* specifies
* specify
* statement
* subdirectories
* succeeded
* successful
* successfully
* supplied
* synchronization
* tag
* temporarily
* terminating
* that
* the
* transmitted
* true
* truncated
* try
* understand
* unescaped
* unforwarding
* unknown
* unknowndata
* unspecified
* update
* usually
* which
* wildcard

Signed-off-by: Josh Soref <2119212+jsoref@users.noreply.github.com>

src/probabilistic/BitVector.h

@@ -298,7 +298,7 @@ private:
 	block_type extra_bits() const;
 
 	/**
-	 * If the number of bits in the vector are not not a multiple of
+	 * If the number of bits in the vector are not a multiple of
 	 * bitvector::bits_per_block, then the last block exhibits unused bits which
 	 * this function resets.
 	 */

src/probabilistic/CardinalityCounter.cc

@@ -141,7 +141,7 @@ void CardinalityCounter::AddElement(uint64_t hash)
 	}
 
 /**
- * Estimate the size by using the the "raw" HyperLogLog estimate. Then,
+ * Estimate the size by using the "raw" HyperLogLog estimate. Then,
  * check if it's too "large" or "small" because the raw estimate doesn't
  * do well in those cases.
  * Thus, we correct for those errors as specified in the paper.

src/probabilistic/CardinalityCounter.h

@@ -83,7 +83,7 @@ public:
 
 	/**
 	 * Merges the argument cardinality counter with this one. The error
-	 * margins of both counters have to be the same, otherwhise the merge
+	 * margins of both counters have to be the same, otherwise the merge
 	 * operation will not be carried out.
 	 *
 	 * @param c Cardinality counter to merge into the current counter.

src/probabilistic/CounterVector.h

@@ -134,7 +134,7 @@ public:
 
 	/**
 	 * Converts a counter vector into a BitVector. Each cell that has a value
-	 * of 1 or more set is set in the BitVector; otherwhise the bit remains unset.
+	 * of 1 or more set is set in the BitVector; otherwise the bit remains unset.
 	 *
 	 * @return The newly created BitVector
 	 */

src/probabilistic/Topk.cc

@@ -345,7 +345,7 @@ void TopkVal::Encountered(ValPtr encountered)
 
 	// ok, we now have an element in e
 	delete key;
-	IncrementCounter(e); // well, this certainly was anticlimatic.
+	IncrementCounter(e); // well, this certainly was anticlimactic.
 	}
 
 // increment by count

src/probabilistic/bloom-filter.bif

@@ -96,7 +96,7 @@ function bloomfilter_basic_init2%(k: count, cells: count,
 ## cells: The number of cells of the underlying counter vector. As there's
 ##        no single answer to what's the best parameterization for a
 ##        counting Bloom filter, we refer to the Bloom filter literature
-##        here for choosing an appropiate value.
+##        here for choosing an appropriate value.
 ##
 ## max: The maximum counter value associated with each element
 ##      described by *w = ceil(log_2(max))* bits. Each bit in the underlying
@@ -163,7 +163,7 @@ function bloomfilter_add%(bf: opaque of bloomfilter, x: any%): any
 ## Note that decrement operations can lead to false negatives if used on a counting bloom-filter
 ## that exceeded the width of its counter.
 ##
-## bf: The coubting bloom filter handle.
+## bf: The counting bloom filter handle.
 ##
 ## x: The element to decrement
 ##