메소드 | 설명 | |
---|---|---|
AddSortKey ( |
Sometimes a key is composed of multiple parts. For example: (LastName, FirstName). Multi-part keys are linked together in a list. This method recursively adds a new key part to the end of the list. Returns the first (primary) key in the list.
|
|
CompareTo ( object that ) : int |
Base internal class is abstract and doesn't actually implement CompareTo; derived classes must do this.
|
메소드 | 설명 | |
---|---|---|
BreakSortingTie ( |
When two keys are compared and found to be equal, the tie must be broken. If there is a secondary key, then use that to break the tie. Otherwise, use the input ordering to break the tie. Since every key has a unique index, this is guaranteed to always break the tie.
|
|
CompareToEmpty ( object obj ) : int |
Compare a non-empty key (this) to an empty key (obj). The empty sequence always sorts either before all other values, or after all other values.
|
public AddSortKey ( |
||
sortKey | ||
리턴 |
protected BreakSortingTie ( |
||
that | ||
리턴 | int |