developer
/
xiuos
forked from xuos/xiuos
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

Fix test

This commit is contained in:
JasenChao 2023-08-02 21:13:41 +08:00
parent c56298fa99
commit 8effd59528
3 changed files with 9 additions and 9 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

BIN
APP_Framework/Applications/app_test/test_radix_tree/fig6.png
View File

Binary file not shown.
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 61 KiB

After

Width:  |  Height:  |  Size: 91 KiB

BIN
APP_Framework/Applications/app_test/test_radix_tree/fig7.png
View File

Binary file not shown.
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 238 KiB

After

Width:  |  Height:  |  Size: 96 KiB

18
APP_Framework/Applications/app_test/test_radix_tree/test_radix_tree.c
View File

@ -57,7 +57,7 @@ int InsertNode(radix_node *root, unsigned int key, void *value)
return -3; // Repeat insertion return -3; // Repeat insertion
if (cur->value != NULL) if (cur->value != NULL)
return -4; // Already occupied return -4; // Already occupied
cur->value == value; cur->value = value;
return 0; return 0;
} }
@ -159,9 +159,9 @@ void TestRadix()
for (int i = 0; i < num; ++i) for (int i = 0; i < num; ++i)
{ {
int *v = (int *)FindNode(root, keys[i]); char *v = (char *)FindNode(root, keys[i]);
if (v) if (v)
printf("keys[%d] %x, values[%d] = %s\n", i, keys[i], i, *v); printf("keys[%d] %x, values[%d] = %s\n", i, keys[i], i, v);
else else
printf("keys[%d] %x not found\n", i, keys[i]); printf("keys[%d] %x not found\n", i, keys[i]);
} }
@ -172,9 +172,9 @@ void TestRadix()
for (int i = 0; i < num; ++i) for (int i = 0; i < num; ++i)
{ {
int *v = (int *)FindNode(root, keys[i]); char *v = (char *)FindNode(root, keys[i]);
if (v) if (v)
printf("keys[%d] %x, values[%d] = %s\n", i, keys[i], i, *v); printf("keys[%d] %x, values[%d] = %s\n", i, keys[i], i, v);
else else
printf("keys[%d] %x not found\n", i, keys[i]); printf("keys[%d] %x not found\n", i, keys[i]);
} }
@ -185,9 +185,9 @@ void TestRadix()
for (int i = 0; i < num; ++i) for (int i = 0; i < num; ++i)
{ {
int *v = (int *)FindNode(root, keys[i]); char *v = (char *)FindNode(root, keys[i]);
if (v) if (v)
printf("keys[%d] %x, values[%d] = %s\n", i, keys[i], i, *v); printf("keys[%d] %x, values[%d] = %s\n", i, keys[i], i, v);
else else
printf("keys[%d] %x not found\n", i, keys[i]); printf("keys[%d] %x not found\n", i, keys[i]);
} }
@ -198,9 +198,9 @@ void TestRadix()
for (int i = 0; i < num; ++i) for (int i = 0; i < num; ++i)
{ {
int *v = (int *)FindNode(root, keys[i]); char *v = (char *)FindNode(root, keys[i]);
if (v) if (v)
printf("keys[%d] %x, values[%d] = %s\n", i, keys[i], i, *v); printf("keys[%d] %x, values[%d] = %s\n", i, keys[i], i, v);
else else
printf("keys[%d] %x not found\n", i, keys[i]); printf("keys[%d] %x not found\n", i, keys[i]);
} }