]>
Commit | Line | Data |
---|---|---|
1ffb3e01 JJ |
1 | // /** @file\r |
2 | // An OrderedCollectionLib instance that provides a red-black tree\r | |
3 | //\r | |
4 | // implementation, and allocates and releases tree nodes with\r | |
5 | // MemoryAllocationLib.\r | |
9095d37b | 6 | //\r |
1ffb3e01 JJ |
7 | // This library instance is useful when a fast associative container is needed.\r |
8 | // Worst case time complexity is O(log n) for Find(), Next(), Prev(), Min(),\r | |
9 | // Max(), Insert(), and Delete(), where "n" is the number of elements in the\r | |
10 | // tree. Complete ordered traversal takes O(n) time.\r | |
9095d37b | 11 | //\r |
1ffb3e01 JJ |
12 | // The implementation is also useful as a fast priority queue.\r |
13 | //\r | |
14 | // Copyright (C) 2014, Red Hat, Inc.\r | |
15 | //\r | |
9344f092 | 16 | // SPDX-License-Identifier: BSD-2-Clause-Patent\r |
1ffb3e01 JJ |
17 | //\r |
18 | // **/\r | |
19 | \r | |
20 | \r | |
21 | #string STR_MODULE_ABSTRACT #language en-US "An OrderedCollectionLib instance that provides a red-black tree implementation."\r | |
22 | \r | |
23 | #string STR_MODULE_DESCRIPTION #language en-US "An OrderedCollectionLib instance that provides a red-black tree implementation."\r | |
24 | \r |