]> git.proxmox.com Git - mirror_edk2.git/blame - MdePkg/Library/BaseOrderedCollectionRedBlackTreeLib/BaseOrderedCollectionRedBlackTreeLib.uni
MdePkg/BaseLib: Add bit field population calculating methods
[mirror_edk2.git] / MdePkg / Library / BaseOrderedCollectionRedBlackTreeLib / BaseOrderedCollectionRedBlackTreeLib.uni
CommitLineData
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
16// This program and the accompanying materials are licensed and made available\r
17// under the terms and conditions of the BSD License that accompanies this\r
18// distribution. The full text of the license may be found at\r
19// http://opensource.org/licenses/bsd-license.php.\r
9095d37b 20//\r
1ffb3e01
JJ
21// THE PROGRAM IS DISTRIBUTED UNDER THE BSD LICENSE ON AN "AS IS" BASIS,\r
22// WITHOUT WARRANTIES OR REPRESENTATIONS OF ANY KIND, EITHER EXPRESS OR\r
23// IMPLIED.\r
24//\r
25// **/\r
26\r
27\r
28#string STR_MODULE_ABSTRACT #language en-US "An OrderedCollectionLib instance that provides a red-black tree implementation."\r
29\r
30#string STR_MODULE_DESCRIPTION #language en-US "An OrderedCollectionLib instance that provides a red-black tree implementation."\r
31\r