AfanasevGad7

commit 4e68c2debce3180cf30fe2db8bb1b6d60a2434b7
parent 0bf7a5c993f84df90bb85f459689e95d5966f5b6
Author: Plat <plat@stellar-nexus.ru>
Date:   Fri,  7 Nov 2025 19:35:18 +0000

Fixed function name clash in ntree.cxx

Diffstat:
M
ntree.cxx
 | 
10
+++++-----

1 file changed, 5 insertions(+), 5 deletions(-)
diff --git a/ntree.cxx b/ntree.cxx
@@ -68,7 +68,7 @@ public:
     }
 
     
-    bool add(int parent_id, int data, Node *rt) {
+    bool insert(int parent_id, int data, Node *rt) {
 
         if (rt->id == parent_id) return this->push_node(++this->last_id, data, rt);
 
@@ -77,7 +77,7 @@ public:
         std::vector<bool> r;
 
         for (auto c : rt->children) {
-            r.push_back(this->add(parent_id, data, c));
+            r.push_back(this->insert(parent_id, data, c));
         }
 
         for (bool a : r) {
@@ -190,7 +190,7 @@ main(int argc, char *argv[])
 	if (cflag)
 		start_time = clock();
 	for (int i = 0; i < TESTNUMBER; ++i)
-		r.add(arr[i] % (i+1) - 1, arr[i], r.root);
+		r.insert(arr[i] % (i+1), arr[i], r.root);
 	if (cflag)
 		elapsed += clock() - start_time;
 	
@@ -198,14 +198,14 @@ main(int argc, char *argv[])
 	if (sflag) {
 		start_time = clock();
 		for (int i = 0; i < TESTNUMBER; ++i)
-			checksum = (uintptr_t)r.search(arr[i] % (i+1) - 1, r.root);
+			checksum = (uintptr_t)r.search(arr[i] % (i+1), r.root);
 		elapsed += clock() - start_time;
 	}
 
 	if (dflag) {
 		start_time = clock();
 		for (int i = 0; i < TESTNUMBER; ++i)
-			r.remove(arr[i] % (i+1) - 1);
+			r.remove(arr[i] % (i+1));
 		elapsed += clock() - start_time;
 	}