<commit_before># circular_vector
An STL-Compliant Circular Vector (Container) Data Structure written in C++

Shares similaries to a Circular Buffer Data Structure, except allows access to all elements in the container.

Contains all the same member functions as C++98 std::vector from the STL, except for vector::insert and vector::erase. Newly introduced member functions include: push_front and pop_front which unlike the counterpart operations in std::vector are O(1) time (Constant).

#CONSTRUCTORS:#
circular_vector(size_type capacity = kDefaultCapacity)

#ITERATORS:#
circular_vector::begin
@brief  An iterator pointing to array\_[0], i.e. the first element
@warn  Iterator should be repositioned upon capacity reallocation or after push_front call
      `iterator begin();`
`const_iterator begin() const;`

circular_vector::end
@brief  An iterator pointing to array\_[size()], i.e. past-the-end element
@warn  Iterator should be repositioned upon capacity reallocation or after push_back call
      `iterator end();`
`const_iterator end() const;`

circular_vector::rbegin
@brief  Returns a reverse iterator pointing to the last element in the vector (i.e., its reverse beginning). Reverse iterators iterate backwards: increasing them moves them towards the beginning of the container. rbegin points to the element right before the one that would be pointed to by member end. Notice that unlike member vector::back, which returns a reference to this same element, this function returns a reverse random access iterator.
@warn  Iterator should be repositioned upon capacity reallocation or after push_back call
      `reverse_iterator rbegin();`
`const_reverse_iterator rbegin() const;`

circular_vector::rend
@brief  Returns a reverse iterator pointing to the theoretical element preceding the first element in the vector (which is considered its reverse end). The range between vector::rbegin and vector::rend contains all the elements of the vector (in reverse order).
@warn  Iterator should be repositioned upon capacity reallocation or after push_front call
      `reverse_iterator rend();`
`const_reverse_iterator rend() const;`

#ALLOCATORS:#
circular_vector::get_allocator<commit_msg>formating test<commit_after># circular_vector
An STL-Compliant Circular Vector (Container) Data Structure written in C++

Shares similaries to a Circular Buffer Data Structure, except allows access to all elements in the container.

Contains all the same member functions as C++98 std::vector from the STL, except for vector::insert and vector::erase. Newly introduced member functions include: push_front and pop_front which unlike the counterpart operations in std::vector are O(1) time (Constant).

#CONSTRUCTORS:#
circular_vector(size_type capacity = kDefaultCapacity)

#ITERATORS:#
**<dt>circular_vector::_begin_</dt>**
<p>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;<code>iterator begin();</code></p>
`const_iterator begin() const;`
<dd><em>@brief</em>  <ul>An iterator pointing to array\_[0], i.e. the first element</ul></dd>
<dd><em>@warn</em>  <ul>Iterator should be repositioned upon capacity reallocation or after push_front call</ul></dd>


#####*circular_vector::end*#####
@brief  An iterator pointing to array\_[size()], i.e. past-the-end element
@warn  Iterator should be repositioned upon capacity reallocation or after push_back call
<p>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;<code>iterator end();</code></p>
`const_iterator end() const;`

circular_vector::rbegin
@brief  Returns a reverse iterator pointing to the last element in the vector (i.e., its reverse beginning). Reverse iterators iterate backwards: increasing them moves them towards the beginning of the container. rbegin points to the element right before the one that would be pointed to by member end. Notice that unlike member vector::back, which returns a reference to this same element, this function returns a reverse random access iterator.
@warn  Iterator should be repositioned upon capacity reallocation or after push_back call
`reverse_iterator rbegin();`
`const_reverse_iterator rbegin() const;`

circular_vector::rend
@brief  Returns a reverse iterator pointing to the theoretical element preceding the first element in the vector (which is considered its reverse end). The range between vector::rbegin and vector::rend contains all the elements of the vector (in reverse order).
@warn  Iterator should be repositioned upon capacity reallocation or after push_front call
      `reverse_iterator rend();`
`const_reverse_iterator rend() const;`

#ALLOCATORS:#
circular_vector::get_allocator
{'fraction_non_alphanumeric': 0.08407175275556517, 'fraction_numerical': 0.0017289820618111088, 'mean_word_length': 6.033434650455927, 'pattern_counts': {'":': 0, '<': 25, '<?xml version=': 0, '>': 25, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
{'dir': 'git-commits-cleaned', 'id': '1130497', 'n_tokens_mistral': 1215, 'n_tokens_neox': 1183, 'n_words': 542}