2 # An OrderedCollectionLib instance that provides a red-black tree
3 # implementation, and allocates and releases tree nodes with
6 # This library instance is useful when a fast associative container is needed.
7 # Worst case time complexity is O(log n) for Find(), Next(), Prev(), Min(),
8 # Max(), Insert(), and Delete(), where "n" is the number of elements in the
9 # tree. Complete ordered traversal takes O(n) time.
11 # The implementation is also useful as a fast priority queue.
13 # Copyright (c) 2018, Intel Corporation. All rights reserved.<BR>
14 # Copyright (C) 2014, Red Hat, Inc.
16 # SPDX-License-Identifier: BSD-2-Clause-Patent
21 INF_VERSION = 0x00010005
22 BASE_NAME = BaseOrderedCollectionRedBlackTreeLib
23 MODULE_UNI_FILE = BaseOrderedCollectionRedBlackTreeLib.uni
24 FILE_GUID = 699F73C3-0058-484C-A9E5-61189276A985
27 LIBRARY_CLASS = OrderedCollectionLib
30 # VALID_ARCHITECTURES = IA32 X64 EBC
34 BaseOrderedCollectionRedBlackTreeLib.c
44 gEfiMdePkgTokenSpaceGuid.PcdValidateOrderedCollection ## CONSUMES