chore: remove repeat words (#5053)

Signed-off-by: dashangcun <jchaodaohang@foxmail.com>
Co-authored-by: dashangcun <jchaodaohang@foxmail.com>
Co-authored-by: Zack Brunson <Zshooter@gmail.com>

src/test/csf/CollectorRef.h

@@ -40,7 +40,7 @@ namespace csf {
    level when adding to the simulation.
 
     The example code below demonstrates the reason for storing the collector
-    as a reference.  The collector's lifetime will generally be be longer than
+    as a reference.  The collector's lifetime will generally be longer than
     the simulation; perhaps several simulations are run for a single collector
     instance.  The collector potentially stores lots of data as well, so the
     simulation needs to point to the single instance, rather than requiring

src/test/csf/Digraph.h

@@ -220,7 +220,7 @@ public:
         @param fileName The output file (creates)
         @param vertexName A invokable T vertexName(Vertex const &) that
                           returns the name target use for the vertex in the file
-                          T must be be ostream-able
+                          T must be ostream-able
     */
     template <class VertexName>
     void

src/xrpld/shamap/detail/TaggedPointer.h

@@ -37,7 +37,7 @@ namespace ripple {
     low bits. When dereferencing the pointer, these low "tag" bits are set to
     zero. When accessing the tag bits, the high "pointer" bits are set to zero.
 
-    The "pointer" part points to to the equivalent to an array of
+    The "pointer" part points to the equivalent to an array of
     `SHAMapHash` followed immediately by an array of
     `shared_ptr<SHAMapTreeNode>`. The sizes of these arrays are
     determined by the tag. The tag is an index into an array (`boundaries`,

src/xrpld/shamap/detail/TaggedPointer.ipp

@@ -258,7 +258,7 @@ TaggedPointer::getChildIndex(std::uint16_t isBranch, int i) const
     // of a child in the array is the number of non-empty children
     // before it. Since `isBranch_` is a bitset of the stored
     // children, we simply need to mask out (and set to zero) all
-    // the bits in `isBranch_` equal to to higher than `i` and count
+    // the bits in `isBranch_` equal to higher than `i` and count
     // the bits.
 
     // mask sets all the bits >=i to zero and all the bits <i to