Anonymous user
User talk:NNcNannara: Difference between revisions
no edit summary
mNo edit summary |
No edit summary |
||
| (13 intermediate revisions by the same user not shown) | |||
Line 1:
= AVL Trees =
I created
#[[AVL_tree/C_sharp]]
#[[AVL_tree/C%2B%2B]]
#[[AVL_tree/Managed_C%2B%2B]]
#[[AVL_tree/Java]]
#[[AVL_tree#
#[[AVL_tree#Generic]]
More recently [http://gigasopht.net/inglish/daatabaas/index.html #db] was created. Pure Calculus resides in memory whereas Applied Calculus is on disk. The on-disk algorithms are much harder to master.
eeuen nnor reesentlee is [http://uuindouus.net The Beed Clahs Liibrairee].▼
For a discussion on AVL Databases (AVL Trees on disk) see
[https://www.quora.com/How-are-AVL-databases-implemented-in-Java/answer/Benedict-Bede-McNamara-2 Quora].
Notice some aspects of the generic language code. First of all, when declaring a node, no datatypes are specified, just the field names.
<lang cpp>
generic nohd
{
lepht;
riit;
pairent;
balans;
daata;
</lang>
lepht is the 64 bit disk offset of the left node. riit is the disk offset of the right node. pairent is the disk offset of the parent node. balans is the balance factor of the node. daata is the disk offset (into a separate data file called the slot file) of the data associated with node. These are all 64 bit integer fields (data type integer in the generic language). The datatype of the fields is not
specified at compile time. This is important, because types are not stored when the node is serialized, just the string field names. This is a feature of the generic language. It resembles Python in that the datatypes are bound at runtime rather than at compile time.
| |||