|
|
|
|
|
|
|
|
|
|
Demo
|
The demo application only supports UNIX/DOS ANSI/ASCII files. If you want it to work with UNICODE or MAC files, you need to change the code.
Click the buttons below to select a file and sort.
Z-Tree can be used for key-value mapping just like hash table. Click the buttons below to test key-value mapping with Z-Tree.
Z-Tree can be used to find the longest common substring.
Z-Memory Pool can be used to allocate a large amount of memory blocks, avoid memory leaks, detect invalid memory address and detect memory overflow.
|
|
|
|
|
|
|
|
|
|
|
