9344f09215
https://bugzilla.tianocore.org/show_bug.cgi?id=1373 Replace BSD 2-Clause License with BSD+Patent License. This change is based on the following emails: https://lists.01.org/pipermail/edk2-devel/2019-February/036260.html https://lists.01.org/pipermail/edk2-devel/2018-October/030385.html RFCs with detailed process for the license change: V3: https://lists.01.org/pipermail/edk2-devel/2019-March/038116.html V2: https://lists.01.org/pipermail/edk2-devel/2019-March/037669.html V1: https://lists.01.org/pipermail/edk2-devel/2019-March/037500.html Contributed-under: TianoCore Contribution Agreement 1.1 Signed-off-by: Michael D Kinney <michael.d.kinney@intel.com> Reviewed-by: Liming Gao <liming.gao@intel.com>
25 lines
930 B
Plaintext
25 lines
930 B
Plaintext
// /** @file
|
|
// An OrderedCollectionLib instance that provides a red-black tree
|
|
//
|
|
// implementation, and allocates and releases tree nodes with
|
|
// MemoryAllocationLib.
|
|
//
|
|
// This library instance is useful when a fast associative container is needed.
|
|
// Worst case time complexity is O(log n) for Find(), Next(), Prev(), Min(),
|
|
// Max(), Insert(), and Delete(), where "n" is the number of elements in the
|
|
// tree. Complete ordered traversal takes O(n) time.
|
|
//
|
|
// The implementation is also useful as a fast priority queue.
|
|
//
|
|
// Copyright (C) 2014, Red Hat, Inc.
|
|
//
|
|
// SPDX-License-Identifier: BSD-2-Clause-Patent
|
|
//
|
|
// **/
|
|
|
|
|
|
#string STR_MODULE_ABSTRACT #language en-US "An OrderedCollectionLib instance that provides a red-black tree implementation."
|
|
|
|
#string STR_MODULE_DESCRIPTION #language en-US "An OrderedCollectionLib instance that provides a red-black tree implementation."
|
|
|