diff options
Diffstat (limited to 'MdePkg/Library/BaseOrderedCollectionRedBlackTreeLib/BaseOrderedCollectionRedBlackTreeLib.uni')
| -rw-r--r-- | MdePkg/Library/BaseOrderedCollectionRedBlackTreeLib/BaseOrderedCollectionRedBlackTreeLib.uni | 13 |
1 files changed, 3 insertions, 10 deletions
diff --git a/MdePkg/Library/BaseOrderedCollectionRedBlackTreeLib/BaseOrderedCollectionRedBlackTreeLib.uni b/MdePkg/Library/BaseOrderedCollectionRedBlackTreeLib/BaseOrderedCollectionRedBlackTreeLib.uni index 1cce727843057..02279b18319fd 100644 --- a/MdePkg/Library/BaseOrderedCollectionRedBlackTreeLib/BaseOrderedCollectionRedBlackTreeLib.uni +++ b/MdePkg/Library/BaseOrderedCollectionRedBlackTreeLib/BaseOrderedCollectionRedBlackTreeLib.uni @@ -3,24 +3,17 @@ // // 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. // -// This program and the accompanying materials are licensed and made available -// under the terms and conditions of the BSD License that accompanies this -// distribution. The full text of the license may be found at -// http://opensource.org/licenses/bsd-license.php. -// -// THE PROGRAM IS DISTRIBUTED UNDER THE BSD LICENSE ON AN "AS IS" BASIS, -// WITHOUT WARRANTIES OR REPRESENTATIONS OF ANY KIND, EITHER EXPRESS OR -// IMPLIED. +// SPDX-License-Identifier: BSD-2-Clause-Patent // // **/ |