MdePkg: Clean up source files

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

diff --git a/MdePkg/Library/BaseOrderedCollectionRedBlackTreeLib/BaseOrderedCollectionRedBlackTreeLib.uni b/MdePkg/Library/BaseOrderedCollectionRedBlackTreeLib/BaseOrderedCollectionRedBlackTreeLib.uni
index f3e9a40aa486b11e5ae25ba7f239213aeb457039..8660ace7acc82c19abe070279b17796655c1dbf1 100644 (file)
--- a/MdePkg/Library/BaseOrderedCollectionRedBlackTreeLib/BaseOrderedCollectionRedBlackTreeLib.uni
+++ b/MdePkg/Library/BaseOrderedCollectionRedBlackTreeLib/BaseOrderedCollectionRedBlackTreeLib.uni
@@ -3,12 +3,12 @@
 //\r
 // implementation, and allocates and releases tree nodes with\r
 // MemoryAllocationLib.\r
-// \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
+//\r
 // The implementation is also useful as a fast priority queue.\r
 //\r
 // Copyright (C) 2014, Red Hat, Inc.\r
@@ -17,7 +17,7 @@
 // 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
+//\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