[no description] https://git.osdyson.ru/mirror/pkgsrc/atom?h=pkgsrc_2008Q2 2008-04-04T15:30:00Z 2008-04-04T15:30:00Z jlam jlam 2008-04-04T15:30:00Z urn:sha1:bb91d465009f79ffc1ee660432fbd12aad691235 directly into site_ruby. 2007-04-21T10:20:05Z wiz wiz 2007-04-21T10:20:05Z urn:sha1:49feff6d167a8162dbf1e7bcd256840362060963 RBTree is a sorted associative collection using Red-Black Tree as the internal data structure. The elements of RBTree are ordered and the interface is the almost same as Hash, so simply you can consider RBTree sorted Hash. Red-Black Tree is a kind of binary tree that automatically balances by itself when a node is inserted or deleted. Thus the complexity for insert, search and delete is O(log N) in expected and worst case. On the other hand the complexity of Hash is O(1). Because Hash is unordered the data structure is more effective than Red-Black Tree as an associative collection. The interface of RBTree is the almost same as Hash although there are some limitations.