MdePkg/Library/BaseOrderedCollectionRedBlackTreeLib/BaseOrderedCollectionRedBlackTreeLib.uni

   1 // /** @file
   2 // An OrderedCollectionLib instance that provides a red-black tree
   3 //
   4 // implementation, and allocates and releases tree nodes with
   5 // MemoryAllocationLib.
   6 //
   7 // This library instance is useful when a fast associative container is needed.
   8 // Worst case time complexity is O(log n) for Find(), Next(), Prev(), Min(),
   9 // Max(), Insert(), and Delete(), where "n" is the number of elements in the
  10 // tree. Complete ordered traversal takes O(n) time.
  11 //
  12 // The implementation is also useful as a fast priority queue.
  13 //
  14 // Copyright (C) 2014, Red Hat, Inc.
  15 //
  16 // This program and the accompanying materials are licensed and made available
  17 // under the terms and conditions of the BSD License that accompanies this
  18 // distribution. The full text of the license may be found at
  19 // http://opensource.org/licenses/bsd-license.php.
  20 //
  21 // THE PROGRAM IS DISTRIBUTED UNDER THE BSD LICENSE ON AN "AS IS" BASIS,
  22 // WITHOUT WARRANTIES OR REPRESENTATIONS OF ANY KIND, EITHER EXPRESS OR
  23 // IMPLIED.
  24 //
  25 // **/
  26
  27
  28 #string STR_MODULE_ABSTRACT             #language en-US "An OrderedCollectionLib instance that provides a red-black tree implementation."
  29
  30 #string STR_MODULE_DESCRIPTION          #language en-US "An OrderedCollectionLib instance that provides a red-black tree implementation."
  31