[mirror_edk2.git] / MdePkg / Library / BaseOrderedCollectionRedBlackTreeLib / BaseOrderedCollectionRedBlackTreeLib.inf

## @file\r
#  An OrderedCollectionLib instance that provides a red-black tree\r
#  implementation, and allocates and releases tree nodes with\r
#  MemoryAllocationLib.\r
#\r
#  This library instance is useful when a fast associative container is needed.\r
#  Worst case time complexity is O(log n) for Find(), Next(), Prev(), Min(),\r
#  Max(), Insert(), and Delete(), where "n" is the number of elements in the\r
#  tree. Complete ordered traversal takes O(n) time.\r
#\r
#  The implementation is also useful as a fast priority queue.\r
#\r
#  Copyright (C) 2014, Red Hat, Inc.\r
#\r
#  This program and the accompanying materials are licensed and made available\r
#  under the terms and conditions of the BSD License that accompanies this\r
#  distribution. The full text of the license may be found at\r
#  http://opensource.org/licenses/bsd-license.php.\r
#\r
#  THE PROGRAM IS DISTRIBUTED UNDER THE BSD LICENSE ON AN "AS IS" BASIS,\r
#  WITHOUT WARRANTIES OR REPRESENTATIONS OF ANY KIND, EITHER EXPRESS OR\r
#  IMPLIED.\r
#\r
##\r
\r
[Defines]\r
  INF_VERSION                    = 0x00010005\r
  BASE_NAME                      = BaseOrderedCollectionRedBlackTreeLib\r
  FILE_GUID                      = 699F73C3-0058-484C-A9E5-61189276A985\r
  MODULE_TYPE                    = BASE\r
  VERSION_STRING                 = 1.0\r
  LIBRARY_CLASS                  = OrderedCollectionLib\r
\r
#\r
#  VALID_ARCHITECTURES           = IA32 X64 IPF EBC\r
#\r
\r
[Sources]\r
  BaseOrderedCollectionRedBlackTreeLib.c\r
\r
[Packages]\r
  MdePkg/MdePkg.dec\r
\r
[LibraryClasses]\r
  DebugLib\r
  MemoryAllocationLib\r
\r
[FeaturePcd]\r
  gEfiMdePkgTokenSpaceGuid.PcdValidateOrderedCollection\r
Commit	Line	Data
cf556c6a LE	1	## @file\r
	2	# An OrderedCollectionLib instance that provides a red-black tree\r
	3	# implementation, and allocates and releases tree nodes with\r
	4	# MemoryAllocationLib.\r
	5	#\r
	6	# This library instance is useful when a fast associative container is needed.\r
	7	# Worst case time complexity is O(log n) for Find(), Next(), Prev(), Min(),\r
	8	# Max(), Insert(), and Delete(), where "n" is the number of elements in the\r
	9	# tree. Complete ordered traversal takes O(n) time.\r
	10	#\r
	11	# The implementation is also useful as a fast priority queue.\r
	12	#\r
	13	# Copyright (C) 2014, Red Hat, Inc.\r
	14	#\r
	15	# This program and the accompanying materials are licensed and made available\r
	16	# under the terms and conditions of the BSD License that accompanies this\r
	17	# distribution. The full text of the license may be found at\r
	18	# http://opensource.org/licenses/bsd-license.php.\r
	19	#\r
	20	# THE PROGRAM IS DISTRIBUTED UNDER THE BSD LICENSE ON AN "AS IS" BASIS,\r
	21	# WITHOUT WARRANTIES OR REPRESENTATIONS OF ANY KIND, EITHER EXPRESS OR\r
	22	# IMPLIED.\r
	23	#\r
	24	##\r
	25	\r
	26	[Defines]\r
	27	INF_VERSION = 0x00010005\r
	28	BASE_NAME = BaseOrderedCollectionRedBlackTreeLib\r
	29	FILE_GUID = 699F73C3-0058-484C-A9E5-61189276A985\r
	30	MODULE_TYPE = BASE\r
	31	VERSION_STRING = 1.0\r
	32	LIBRARY_CLASS = OrderedCollectionLib\r
	33	\r
	34	#\r
	35	# VALID_ARCHITECTURES = IA32 X64 IPF EBC\r
	36	#\r
	37	\r
	38	[Sources]\r
	39	BaseOrderedCollectionRedBlackTreeLib.c\r
	40	\r
	41	[Packages]\r
	42	MdePkg/MdePkg.dec\r
	43	\r
	44	[LibraryClasses]\r
	45	DebugLib\r
	46	MemoryAllocationLib\r
	47	\r
da03183c LE	48	[FeaturePcd]\r
da03183c LE	49	gEfiMdePkgTokenSpaceGuid.PcdValidateOrderedCollection\r