diff --git a/annotated.html b/annotated.html
index a854321d3..2078d76e6 100644
--- a/annotated.html
+++ b/annotated.html
@@ -208,8 +208,9 @@ $(document).ready(function(){initNavTree('annotated.html',''); initResizable();
| CHLD | The Heavy-Light Decomposition class |
| CSG | Segment Tree, to store heavy chains |
| CTree | A Basic Tree, which supports binary lifting |
-| ►CperSegTree | Range query here is range sum, but the code can be modified to make different queries like range max or min |
-| CNode | |
+| Cfenwick_tree | The class that initializes the Fenwick Tree |
+| ►CperSegTree | Range query here is range sum, but the code can be modified to make different queries like range max or min |
+| CNode | |
| ►Nsearch | For std::vector |
| ►Nsublist_search | |
| CNode | A Node structure representing a single link Node in a linked list |
@@ -239,35 +240,34 @@ $(document).ready(function(){initNavTree('annotated.html',''); initResizable();
| CEasterYearMonthDay | For IO operations |
| CEdge | |
| CFCFS | Class which implements the FCFS scheduling algorithm |
-| CFenwickTree | |
-| CGraph | |
-| Chash_chain | Chain class with a given modulus |
-| CItem | |
-| Clarge_number | |
-| Clinkedlist | |
-| Clist | |
-| CListNode | For IO operations |
-| CMinHeap | |
-| CMinHeapNode | |
-| Cmst | |
-| CNode | |
-| Cnode | |
-| CPoint | |
-| Cquery | |
-| CQueue | |
-| Cqueue | |
-| CRBtree | |
-| CSegmentIntersection | |
-| CSolution | |
-| Cstack | For std::invalid_argument |
-| Cstack_linkedList | |
-| CTestCase | Single example inputs and expected output of the function longest_common_string_length |
-| CTestCases | Class encapsulating the necessary test cases |
-| Ctower | |
-| ►CTrie | |
-| CTrieNode | |
-| Cuint128_t | Class for 128-bit unsigned integer |
-| Cuint256_t | Class for 256-bit unsigned integer |
+| CGraph | |
+| Chash_chain | Chain class with a given modulus |
+| CItem | |
+| Clarge_number | |
+| Clinkedlist | |
+| Clist | |
+| CListNode | For IO operations |
+| CMinHeap | |
+| CMinHeapNode | |
+| Cmst | |
+| CNode | |
+| Cnode | |
+| CPoint | |
+| Cquery | |
+| CQueue | |
+| Cqueue | |
+| CRBtree | |
+| CSegmentIntersection | |
+| CSolution | |
+| Cstack | For std::invalid_argument |
+| Cstack_linkedList | |
+| CTestCase | Single example inputs and expected output of the function longest_common_string_length |
+| CTestCases | Class encapsulating the necessary test cases |
+| Ctower | |
+| ►CTrie | |
+| CTrieNode | |
+| Cuint128_t | Class for 128-bit unsigned integer |
+| Cuint256_t | Class for 256-bit unsigned integer |
diff --git a/annotated_dup.js b/annotated_dup.js
index 03b7bcfc6..b9e1c0ab8 100644
--- a/annotated_dup.js
+++ b/annotated_dup.js
@@ -148,6 +148,7 @@ var annotated_dup =
[ "SG", "d9/d35/classrange__queries_1_1heavy__light__decomposition_1_1_s_g.html", "d9/d35/classrange__queries_1_1heavy__light__decomposition_1_1_s_g" ],
[ "Tree", "d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html", "d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree" ]
] ],
+ [ "fenwick_tree", "de/d0d/classrange__queries_1_1fenwick__tree.html", "de/d0d/classrange__queries_1_1fenwick__tree" ],
[ "perSegTree", "d8/d28/classrange__queries_1_1per_seg_tree.html", "d8/d28/classrange__queries_1_1per_seg_tree" ]
] ],
[ "search", "d9/dca/namespacesearch.html", [
@@ -184,7 +185,6 @@ var annotated_dup =
[ "EasterYearMonthDay", "d1/df6/class_easter_year_month_day.html", "d1/df6/class_easter_year_month_day" ],
[ "Edge", "d7/d77/class_edge.html", "d7/d77/class_edge" ],
[ "FCFS", "dd/dca/class_f_c_f_s.html", "dd/dca/class_f_c_f_s" ],
- [ "FenwickTree", "dd/d91/class_fenwick_tree.html", "dd/d91/class_fenwick_tree" ],
[ "Graph", "da/d9a/class_graph.html", "da/d9a/class_graph" ],
[ "hash_chain", "dd/d1c/classhash__chain.html", "dd/d1c/classhash__chain" ],
[ "Item", "db/d66/struct_item.html", null ],
diff --git a/classes.html b/classes.html
index 62b840e5d..c99c9ac0d 100644
--- a/classes.html
+++ b/classes.html
@@ -119,7 +119,7 @@ $(document).ready(function(){initNavTree('classes.html',''); initResizable(); })
EasterYearMonthDayEdgeEightPuzzle (machine_learning::aystar_search)Entry (double_hashing)Entry (linear_probing)Entry (quadratic_probing)
- F
-- FCFS
- FenwickTree
+FCFSfenwick_tree (range_queries)
- G
- generate_parentheses (backtracking)
- geometric_distribution (probability::geometric_dist)
- Graph
- Graph (graph)
- Graph (graph::is_graph_bipartite)
diff --git a/d0/d24/classgraph_1_1_rooted_tree__coll__graph.map b/d0/d24/classgraph_1_1_rooted_tree__coll__graph.map
index 516334f92..fb8fb3c25 100644
--- a/d0/d24/classgraph_1_1_rooted_tree__coll__graph.map
+++ b/d0/d24/classgraph_1_1_rooted_tree__coll__graph.map
@@ -1,14 +1,13 @@
diff --git a/d0/d24/classgraph_1_1_rooted_tree__coll__graph.md5 b/d0/d24/classgraph_1_1_rooted_tree__coll__graph.md5
index 6432e748c..b59483ff6 100644
--- a/d0/d24/classgraph_1_1_rooted_tree__coll__graph.md5
+++ b/d0/d24/classgraph_1_1_rooted_tree__coll__graph.md5
@@ -1 +1 @@
-d7fdab7e12b21d866ecbe482d26e55be
\ No newline at end of file
+050eb78f2fe068cc94e311fbe15511ee
\ No newline at end of file
diff --git a/d0/d24/classgraph_1_1_rooted_tree__coll__graph.svg b/d0/d24/classgraph_1_1_rooted_tree__coll__graph.svg
index ce124c1fa..6291eb606 100644
--- a/d0/d24/classgraph_1_1_rooted_tree__coll__graph.svg
+++ b/d0/d24/classgraph_1_1_rooted_tree__coll__graph.svg
@@ -4,8 +4,8 @@
-