IN CONST VOID *UserStruct\r
);\r
\r
-\r
//\r
// Some functions below are read-only, while others are read-write. If any\r
// write operation is expected to run concurrently with any other operation on\r
VOID *\r
EFIAPI\r
OrderedCollectionUserStruct (\r
- IN CONST ORDERED_COLLECTION_ENTRY *Entry\r
+ IN CONST ORDERED_COLLECTION_ENTRY *Entry\r
);\r
\r
-\r
/**\r
Allocate and initialize the ORDERED_COLLECTION structure.\r
\r
ORDERED_COLLECTION *\r
EFIAPI\r
OrderedCollectionInit (\r
- IN ORDERED_COLLECTION_USER_COMPARE UserStructCompare,\r
- IN ORDERED_COLLECTION_KEY_COMPARE KeyCompare\r
+ IN ORDERED_COLLECTION_USER_COMPARE UserStructCompare,\r
+ IN ORDERED_COLLECTION_KEY_COMPARE KeyCompare\r
);\r
\r
-\r
/**\r
Check whether the collection is empty (has no entries).\r
\r
BOOLEAN\r
EFIAPI\r
OrderedCollectionIsEmpty (\r
- IN CONST ORDERED_COLLECTION *Collection\r
+ IN CONST ORDERED_COLLECTION *Collection\r
);\r
\r
-\r
/**\r
Uninitialize and release an empty ORDERED_COLLECTION structure.\r
\r
VOID\r
EFIAPI\r
OrderedCollectionUninit (\r
- IN ORDERED_COLLECTION *Collection\r
+ IN ORDERED_COLLECTION *Collection\r
);\r
\r
-\r
/**\r
Look up the collection entry that links the user structure that matches the\r
specified standalone key.\r
ORDERED_COLLECTION_ENTRY *\r
EFIAPI\r
OrderedCollectionFind (\r
- IN CONST ORDERED_COLLECTION *Collection,\r
- IN CONST VOID *StandaloneKey\r
+ IN CONST ORDERED_COLLECTION *Collection,\r
+ IN CONST VOID *StandaloneKey\r
);\r
\r
-\r
/**\r
Find the collection entry of the minimum user structure stored in the\r
collection.\r
ORDERED_COLLECTION_ENTRY *\r
EFIAPI\r
OrderedCollectionMin (\r
- IN CONST ORDERED_COLLECTION *Collection\r
+ IN CONST ORDERED_COLLECTION *Collection\r
);\r
\r
-\r
/**\r
Find the collection entry of the maximum user structure stored in the\r
collection.\r
ORDERED_COLLECTION_ENTRY *\r
EFIAPI\r
OrderedCollectionMax (\r
- IN CONST ORDERED_COLLECTION *Collection\r
+ IN CONST ORDERED_COLLECTION *Collection\r
);\r
\r
-\r
/**\r
Get the collection entry of the least user structure that is greater than the\r
one linked by Entry.\r
ORDERED_COLLECTION_ENTRY *\r
EFIAPI\r
OrderedCollectionNext (\r
- IN CONST ORDERED_COLLECTION_ENTRY *Entry\r
+ IN CONST ORDERED_COLLECTION_ENTRY *Entry\r
);\r
\r
-\r
/**\r
Get the collection entry of the greatest user structure that is less than the\r
one linked by Entry.\r
ORDERED_COLLECTION_ENTRY *\r
EFIAPI\r
OrderedCollectionPrev (\r
- IN CONST ORDERED_COLLECTION_ENTRY *Entry\r
+ IN CONST ORDERED_COLLECTION_ENTRY *Entry\r
);\r
\r
-\r
/**\r
Insert (link) a user structure into the collection, allocating a new\r
collection entry.\r
RETURN_STATUS\r
EFIAPI\r
OrderedCollectionInsert (\r
- IN OUT ORDERED_COLLECTION *Collection,\r
- OUT ORDERED_COLLECTION_ENTRY **Entry OPTIONAL,\r
- IN VOID *UserStruct\r
+ IN OUT ORDERED_COLLECTION *Collection,\r
+ OUT ORDERED_COLLECTION_ENTRY **Entry OPTIONAL,\r
+ IN VOID *UserStruct\r
);\r
\r
-\r
/**\r
Delete an entry from the collection, unlinking the associated user structure.\r
\r
VOID\r
EFIAPI\r
OrderedCollectionDelete (\r
- IN OUT ORDERED_COLLECTION *Collection,\r
- IN ORDERED_COLLECTION_ENTRY *Entry,\r
- OUT VOID **UserStruct OPTIONAL\r
+ IN OUT ORDERED_COLLECTION *Collection,\r
+ IN ORDERED_COLLECTION_ENTRY *Entry,\r
+ OUT VOID **UserStruct OPTIONAL\r
);\r
\r
#endif\r