| /dports/lang/mono/mono-5.10.1.57/external/corefx/src/System.DirectoryServices.Protocols/tests/ |
| H A D | SortRequestControlTests.cs | 19 var control = new SortRequestControl(sortKeys); in Ctor_SortKeys()
24 Assert.NotSame(sortKeys, control.SortKeys); in Ctor_SortKeys()
25 for (int i = 0; i < sortKeys.Length; i++) in Ctor_SortKeys()
27 Assert.Equal(sortKeys[i].AttributeName, control.SortKeys[i].AttributeName); in Ctor_SortKeys()
28 Assert.Equal(sortKeys[i].MatchingRule, control.SortKeys[i].MatchingRule); in Ctor_SortKeys()
29 Assert.Equal(sortKeys[i].ReverseOrder, control.SortKeys[i].ReverseOrder); in Ctor_SortKeys()
84 var control = new SortRequestControl { SortKeys = sortKeys }; in SortKeys_SetValid_GetReturnsExpected()
85 Assert.NotSame(sortKeys, control.SortKeys); in SortKeys_SetValid_GetReturnsExpected()
86 for (int i = 0; i < sortKeys.Length; i++) in SortKeys_SetValid_GetReturnsExpected()
89 Assert.Equal(sortKeys[i].MatchingRule, control.SortKeys[i].MatchingRule); in SortKeys_SetValid_GetReturnsExpected()
[all …]
|
| /dports/java/openjdk11/jdk11u-jdk-11.0.13-8-1/test/jdk/javax/swing/JTable/6894632/ |
| H A D | bug6894632.java | 51 List<RowSorter.SortKey> sortKeys = new ArrayList<>(); in main()
52 sortKeys.add(0, new RowSorter.SortKey(0, SortOrder.UNSORTED)); in main()
53 test(sortKeys); in main()
60 static void test(final List<RowSorter.SortKey> sortKeys) { in test() argument
76 sorter.setSortKeys(sortKeys); in test()
97 sortKeys.clear(); in test()
98 sortKeys.add(0, new RowSorter.SortKey(0, SortOrder.ASCENDING)); in test()
99 sorter.setSortKeys(sortKeys); in test()
111 sortKeys.clear(); in test()
112 sortKeys.add(0, new RowSorter.SortKey(0, SortOrder.UNSORTED)); in test()
[all …]
|
| /dports/java/openjdk13/jdk13u-jdk-13.0.10-1-1/test/jdk/javax/swing/JTable/6894632/ |
| H A D | bug6894632.java | 51 List<RowSorter.SortKey> sortKeys = new ArrayList<>(); in main()
52 sortKeys.add(0, new RowSorter.SortKey(0, SortOrder.UNSORTED)); in main()
53 test(sortKeys); in main()
60 static void test(final List<RowSorter.SortKey> sortKeys) { in test() argument
76 sorter.setSortKeys(sortKeys); in test()
97 sortKeys.clear(); in test()
98 sortKeys.add(0, new RowSorter.SortKey(0, SortOrder.ASCENDING)); in test()
99 sorter.setSortKeys(sortKeys); in test()
111 sortKeys.clear(); in test()
112 sortKeys.add(0, new RowSorter.SortKey(0, SortOrder.UNSORTED)); in test()
[all …]
|
| /dports/java/openjdk11-jre/jdk11u-jdk-11.0.13-8-1/test/jdk/javax/swing/JTable/6894632/ |
| H A D | bug6894632.java | 51 List<RowSorter.SortKey> sortKeys = new ArrayList<>(); in main()
52 sortKeys.add(0, new RowSorter.SortKey(0, SortOrder.UNSORTED)); in main()
53 test(sortKeys); in main()
60 static void test(final List<RowSorter.SortKey> sortKeys) { in test() argument
76 sorter.setSortKeys(sortKeys); in test()
97 sortKeys.clear(); in test()
98 sortKeys.add(0, new RowSorter.SortKey(0, SortOrder.ASCENDING)); in test()
99 sorter.setSortKeys(sortKeys); in test()
111 sortKeys.clear(); in test()
112 sortKeys.add(0, new RowSorter.SortKey(0, SortOrder.UNSORTED)); in test()
[all …]
|
| /dports/java/openjdk12/openjdk-jdk12u-jdk-12.0.2-10-4/test/jdk/javax/swing/JTable/6894632/ |
| H A D | bug6894632.java | 51 List<RowSorter.SortKey> sortKeys = new ArrayList<>(); in main()
52 sortKeys.add(0, new RowSorter.SortKey(0, SortOrder.UNSORTED)); in main()
53 test(sortKeys); in main()
60 static void test(final List<RowSorter.SortKey> sortKeys) { in test() argument
76 sorter.setSortKeys(sortKeys); in test()
97 sortKeys.clear(); in test()
98 sortKeys.add(0, new RowSorter.SortKey(0, SortOrder.ASCENDING)); in test()
99 sorter.setSortKeys(sortKeys); in test()
111 sortKeys.clear(); in test()
112 sortKeys.add(0, new RowSorter.SortKey(0, SortOrder.UNSORTED)); in test()
[all …]
|
| /dports/java/openjdk15/jdk15u-jdk-15.0.6-1-1/test/jdk/javax/swing/JTable/6894632/ |
| H A D | bug6894632.java | 51 List<RowSorter.SortKey> sortKeys = new ArrayList<>(); in main()
52 sortKeys.add(0, new RowSorter.SortKey(0, SortOrder.UNSORTED)); in main()
53 test(sortKeys); in main()
60 static void test(final List<RowSorter.SortKey> sortKeys) { in test() argument
76 sorter.setSortKeys(sortKeys); in test()
97 sortKeys.clear(); in test()
98 sortKeys.add(0, new RowSorter.SortKey(0, SortOrder.ASCENDING)); in test()
99 sorter.setSortKeys(sortKeys); in test()
111 sortKeys.clear(); in test()
112 sortKeys.add(0, new RowSorter.SortKey(0, SortOrder.UNSORTED)); in test()
[all …]
|
| /dports/java/openjdk16/jdk16u-jdk-16.0.2-7-1/test/jdk/javax/swing/JTable/6894632/ |
| H A D | bug6894632.java | 51 List<RowSorter.SortKey> sortKeys = new ArrayList<>(); in main()
52 sortKeys.add(0, new RowSorter.SortKey(0, SortOrder.UNSORTED)); in main()
53 test(sortKeys); in main()
60 static void test(final List<RowSorter.SortKey> sortKeys) { in test() argument
76 sorter.setSortKeys(sortKeys); in test()
97 sortKeys.clear(); in test()
98 sortKeys.add(0, new RowSorter.SortKey(0, SortOrder.ASCENDING)); in test()
99 sorter.setSortKeys(sortKeys); in test()
111 sortKeys.clear(); in test()
112 sortKeys.add(0, new RowSorter.SortKey(0, SortOrder.UNSORTED)); in test()
[all …]
|
| /dports/java/openjdk14/jdk14u-jdk-14.0.2-12-1/test/jdk/javax/swing/JTable/6894632/ |
| H A D | bug6894632.java | 51 List<RowSorter.SortKey> sortKeys = new ArrayList<>(); in main()
52 sortKeys.add(0, new RowSorter.SortKey(0, SortOrder.UNSORTED)); in main()
53 test(sortKeys); in main()
60 static void test(final List<RowSorter.SortKey> sortKeys) { in test() argument
76 sorter.setSortKeys(sortKeys); in test()
97 sortKeys.clear(); in test()
98 sortKeys.add(0, new RowSorter.SortKey(0, SortOrder.ASCENDING)); in test()
99 sorter.setSortKeys(sortKeys); in test()
111 sortKeys.clear(); in test()
112 sortKeys.add(0, new RowSorter.SortKey(0, SortOrder.UNSORTED)); in test()
[all …]
|
| /dports/java/openjdk17/jdk17u-jdk-17.0.1-12-1/test/jdk/javax/swing/JTable/6894632/ |
| H A D | bug6894632.java | 51 List<RowSorter.SortKey> sortKeys = new ArrayList<>(); in main()
52 sortKeys.add(0, new RowSorter.SortKey(0, SortOrder.UNSORTED)); in main()
53 test(sortKeys); in main()
60 static void test(final List<RowSorter.SortKey> sortKeys) { in test() argument
76 sorter.setSortKeys(sortKeys); in test()
97 sortKeys.clear(); in test()
98 sortKeys.add(0, new RowSorter.SortKey(0, SortOrder.ASCENDING)); in test()
99 sorter.setSortKeys(sortKeys); in test()
111 sortKeys.clear(); in test()
112 sortKeys.add(0, new RowSorter.SortKey(0, SortOrder.UNSORTED)); in test()
[all …]
|
| /dports/java/openjdk11/jdk11u-jdk-11.0.13-8-1/src/java.naming/share/classes/javax/naming/ldap/ |
| H A D | SortControl.java | 159 SortKey[] sortKeys = new SortKey[sortBy.length]; in SortControl() local
161 sortKeys[i] = new SortKey(sortBy[i]); in SortControl()
163 super.value = setEncodedValue(sortKeys); in SortControl()
198 private byte[] setEncodedValue(SortKey[] sortKeys) throws IOException { in setEncodedValue() argument
201 BerEncoder ber = new BerEncoder(30 * sortKeys.length + 10); in setEncodedValue()
206 for (int i = 0; i < sortKeys.length; i++) { in setEncodedValue()
208 ber.encodeString(sortKeys[i].getAttributeID(), true); // v3 in setEncodedValue()
210 if ((matchingRule = sortKeys[i].getMatchingRuleID()) != null) { in setEncodedValue()
213 if (! sortKeys[i].isAscending()) { in setEncodedValue()
|
| /dports/java/openjdk13/jdk13u-jdk-13.0.10-1-1/src/java.naming/share/classes/javax/naming/ldap/ |
| H A D | SortControl.java | 159 SortKey[] sortKeys = new SortKey[sortBy.length]; in SortControl() local
161 sortKeys[i] = new SortKey(sortBy[i]); in SortControl()
163 super.value = setEncodedValue(sortKeys); in SortControl()
198 private byte[] setEncodedValue(SortKey[] sortKeys) throws IOException { in setEncodedValue() argument
201 BerEncoder ber = new BerEncoder(30 * sortKeys.length + 10); in setEncodedValue()
206 for (int i = 0; i < sortKeys.length; i++) { in setEncodedValue()
208 ber.encodeString(sortKeys[i].getAttributeID(), true); // v3 in setEncodedValue()
210 if ((matchingRule = sortKeys[i].getMatchingRuleID()) != null) { in setEncodedValue()
213 if (! sortKeys[i].isAscending()) { in setEncodedValue()
|
| /dports/java/openjdk11-jre/jdk11u-jdk-11.0.13-8-1/src/java.naming/share/classes/javax/naming/ldap/ |
| H A D | SortControl.java | 159 SortKey[] sortKeys = new SortKey[sortBy.length]; in SortControl() local
161 sortKeys[i] = new SortKey(sortBy[i]); in SortControl()
163 super.value = setEncodedValue(sortKeys); in SortControl()
198 private byte[] setEncodedValue(SortKey[] sortKeys) throws IOException { in setEncodedValue() argument
201 BerEncoder ber = new BerEncoder(30 * sortKeys.length + 10); in setEncodedValue()
206 for (int i = 0; i < sortKeys.length; i++) { in setEncodedValue()
208 ber.encodeString(sortKeys[i].getAttributeID(), true); // v3 in setEncodedValue()
210 if ((matchingRule = sortKeys[i].getMatchingRuleID()) != null) { in setEncodedValue()
213 if (! sortKeys[i].isAscending()) { in setEncodedValue()
|
| /dports/java/openjdk8/jdk8u-jdk8u312-b07.1/jdk/src/share/classes/javax/naming/ldap/ |
| H A D | SortControl.java | 159 SortKey[] sortKeys = new SortKey[sortBy.length]; in SortControl() local
161 sortKeys[i] = new SortKey(sortBy[i]); in SortControl()
163 super.value = setEncodedValue(sortKeys); in SortControl()
198 private byte[] setEncodedValue(SortKey[] sortKeys) throws IOException { in setEncodedValue() argument
201 BerEncoder ber = new BerEncoder(30 * sortKeys.length + 10); in setEncodedValue()
206 for (int i = 0; i < sortKeys.length; i++) { in setEncodedValue()
208 ber.encodeString(sortKeys[i].getAttributeID(), true); // v3 in setEncodedValue()
210 if ((matchingRule = sortKeys[i].getMatchingRuleID()) != null) { in setEncodedValue()
213 if (! sortKeys[i].isAscending()) { in setEncodedValue()
|
| /dports/java/openjdk16/jdk16u-jdk-16.0.2-7-1/src/java.naming/share/classes/javax/naming/ldap/ |
| H A D | SortControl.java | 159 SortKey[] sortKeys = new SortKey[sortBy.length]; in SortControl() local
161 sortKeys[i] = new SortKey(sortBy[i]); in SortControl()
163 super.value = setEncodedValue(sortKeys); in SortControl()
198 private byte[] setEncodedValue(SortKey[] sortKeys) throws IOException { in setEncodedValue() argument
201 BerEncoder ber = new BerEncoder(30 * sortKeys.length + 10); in setEncodedValue()
206 for (int i = 0; i < sortKeys.length; i++) { in setEncodedValue()
208 ber.encodeString(sortKeys[i].getAttributeID(), true); // v3 in setEncodedValue()
210 if ((matchingRule = sortKeys[i].getMatchingRuleID()) != null) { in setEncodedValue()
213 if (! sortKeys[i].isAscending()) { in setEncodedValue()
|
| /dports/java/openjdk12/openjdk-jdk12u-jdk-12.0.2-10-4/src/java.naming/share/classes/javax/naming/ldap/ |
| H A D | SortControl.java | 159 SortKey[] sortKeys = new SortKey[sortBy.length]; in SortControl() local
161 sortKeys[i] = new SortKey(sortBy[i]); in SortControl()
163 super.value = setEncodedValue(sortKeys); in SortControl()
198 private byte[] setEncodedValue(SortKey[] sortKeys) throws IOException { in setEncodedValue() argument
201 BerEncoder ber = new BerEncoder(30 * sortKeys.length + 10); in setEncodedValue()
206 for (int i = 0; i < sortKeys.length; i++) { in setEncodedValue()
208 ber.encodeString(sortKeys[i].getAttributeID(), true); // v3 in setEncodedValue()
210 if ((matchingRule = sortKeys[i].getMatchingRuleID()) != null) { in setEncodedValue()
213 if (! sortKeys[i].isAscending()) { in setEncodedValue()
|
| /dports/java/openjdk15/jdk15u-jdk-15.0.6-1-1/src/java.naming/share/classes/javax/naming/ldap/ |
| H A D | SortControl.java | 159 SortKey[] sortKeys = new SortKey[sortBy.length]; in SortControl() local
161 sortKeys[i] = new SortKey(sortBy[i]); in SortControl()
163 super.value = setEncodedValue(sortKeys); in SortControl()
198 private byte[] setEncodedValue(SortKey[] sortKeys) throws IOException { in setEncodedValue() argument
201 BerEncoder ber = new BerEncoder(30 * sortKeys.length + 10); in setEncodedValue()
206 for (int i = 0; i < sortKeys.length; i++) { in setEncodedValue()
208 ber.encodeString(sortKeys[i].getAttributeID(), true); // v3 in setEncodedValue()
210 if ((matchingRule = sortKeys[i].getMatchingRuleID()) != null) { in setEncodedValue()
213 if (! sortKeys[i].isAscending()) { in setEncodedValue()
|
| /dports/java/openjdk14/jdk14u-jdk-14.0.2-12-1/src/java.naming/share/classes/javax/naming/ldap/ |
| H A D | SortControl.java | 159 SortKey[] sortKeys = new SortKey[sortBy.length]; in SortControl() local
161 sortKeys[i] = new SortKey(sortBy[i]); in SortControl()
163 super.value = setEncodedValue(sortKeys); in SortControl()
198 private byte[] setEncodedValue(SortKey[] sortKeys) throws IOException { in setEncodedValue() argument
201 BerEncoder ber = new BerEncoder(30 * sortKeys.length + 10); in setEncodedValue()
206 for (int i = 0; i < sortKeys.length; i++) { in setEncodedValue()
208 ber.encodeString(sortKeys[i].getAttributeID(), true); // v3 in setEncodedValue()
210 if ((matchingRule = sortKeys[i].getMatchingRuleID()) != null) { in setEncodedValue()
213 if (! sortKeys[i].isAscending()) { in setEncodedValue()
|
| /dports/java/openjdk17/jdk17u-jdk-17.0.1-12-1/src/java.naming/share/classes/javax/naming/ldap/ |
| H A D | SortControl.java | 159 SortKey[] sortKeys = new SortKey[sortBy.length]; in SortControl() local
161 sortKeys[i] = new SortKey(sortBy[i]); in SortControl()
163 super.value = setEncodedValue(sortKeys); in SortControl()
198 private byte[] setEncodedValue(SortKey[] sortKeys) throws IOException { in setEncodedValue() argument
201 BerEncoder ber = new BerEncoder(30 * sortKeys.length + 10); in setEncodedValue()
206 for (int i = 0; i < sortKeys.length; i++) { in setEncodedValue()
208 ber.encodeString(sortKeys[i].getAttributeID(), true); // v3 in setEncodedValue()
210 if ((matchingRule = sortKeys[i].getMatchingRuleID()) != null) { in setEncodedValue()
213 if (! sortKeys[i].isAscending()) { in setEncodedValue()
|
| /dports/java/openjdk8-jre/jdk8u-jdk8u312-b07.1/jdk/src/share/classes/javax/naming/ldap/ |
| H A D | SortControl.java | 159 SortKey[] sortKeys = new SortKey[sortBy.length]; in SortControl() local
161 sortKeys[i] = new SortKey(sortBy[i]); in SortControl()
163 super.value = setEncodedValue(sortKeys); in SortControl()
198 private byte[] setEncodedValue(SortKey[] sortKeys) throws IOException { in setEncodedValue() argument
201 BerEncoder ber = new BerEncoder(30 * sortKeys.length + 10); in setEncodedValue()
206 for (int i = 0; i < sortKeys.length; i++) { in setEncodedValue()
208 ber.encodeString(sortKeys[i].getAttributeID(), true); // v3 in setEncodedValue()
210 if ((matchingRule = sortKeys[i].getMatchingRuleID()) != null) { in setEncodedValue()
213 if (! sortKeys[i].isAscending()) { in setEncodedValue()
|
| /dports/x11-toolkits/qt5-virtualkeyboard/kde-qtvirtualkeyboard-5.15.2p4/src/plugins/tcime/3rdparty/tcime/ |
| H A D | cangjiedictionary.cpp | 74 explicit DictionaryComparator(const std::vector<QCollatorSortKey> &sortKeys) : in DictionaryComparator() argument
75 sortKeys(sortKeys) in DictionaryComparator()
80 return sortKeys[a] < sortKeys[b]; in operator ()()
84 const std::vector<QCollatorSortKey> &sortKeys; member in DictionaryComparator
90 std::vector<QCollatorSortKey> sortKeys; in sortWords() local
92 sortKeys.reserve(length); in sortWords()
95 sortKeys.push_back(_collator.sortKey(data[length + i])); in sortWords()
98 DictionaryComparator dictionaryComparator(sortKeys); in sortWords()
|
| /dports/java/sablevm-classpath/sablevm-classpath-1.13/gnu/xml/transform/ |
| H A D | ForEachNode.java | 60 final List sortKeys; field in ForEachNode
62 ForEachNode(Expr select, List sortKeys) in ForEachNode() argument
65 this.sortKeys = sortKeys; in ForEachNode()
70 int len = sortKeys.size(); in clone()
74 sortKeys2.add(((Key) sortKeys.get(i)).clone(stylesheet)); in clone()
105 if (sortKeys != null) in doApply()
107 for (Iterator i = sortKeys.iterator(); i.hasNext(); ) in doApply()
113 Collections.sort(list, new XSLComparator(sortKeys)); in doApply()
148 if (sortKeys != null) in references()
150 for (Iterator i = sortKeys.iterator(); i.hasNext(); ) in references()
|
| /dports/editors/calligra/calligra-3.2.1/libs/text/ |
| H A D | BibliographyGenerator.cpp | 34 static QVector<SortKeyPair> sortKeys; variable
58 if ( keyIndex == sortKeys.size() ) return false; in compare_on()
59 else if (sortKeys[keyIndex].second == Qt::AscendingOrder) { in compare_on()
60 …if (c1->dataField( sortKeys[keyIndex].first ) < c2->dataField( sortKeys[keyIndex].first )) return … in compare_on()
61 …else if (c1->dataField( sortKeys[keyIndex].first ) > c2->dataField( sortKeys[keyIndex].first )) re… in compare_on()
62 } else if (sortKeys[keyIndex].second == Qt::DescendingOrder) { in compare_on()
63 …if (c1->dataField( sortKeys[keyIndex].first ) < c2->dataField( sortKeys[keyIndex].first )) return … in compare_on()
64 …else if (c1->dataField( sortKeys[keyIndex].first ) > c2->dataField( sortKeys[keyIndex].first )) re… in compare_on()
77 sortKeys = keys; in sort()
78 sortKeys << QPair<QString, Qt::SortOrder>("identifier", Qt::AscendingOrder); in sort()
[all …]
|
| /dports/lang/gcc6-aux/gcc-6-20180516/libjava/classpath/gnu/xml/transform/ |
| H A D | ForEachNode.java | 62 final List<SortKey> sortKeys; field in ForEachNode
64 ForEachNode(Expr select, List<SortKey> sortKeys) in ForEachNode() argument
67 this.sortKeys = sortKeys; in ForEachNode()
72 int len = sortKeys.size(); in clone()
75 sortKeys2.add(sortKeys.get(i).clone(stylesheet)); in clone()
104 if (!sortKeys.isEmpty()) in doApply()
106 for (SortKey sortKey : sortKeys) in doApply()
111 Collections.sort(list, new XSLComparator(sortKeys)); in doApply()
140 for (Iterator<SortKey> i = sortKeys.iterator(); i.hasNext(); ) in references()
|
| /dports/lang/gcc48/gcc-4.8.5/libjava/classpath/gnu/xml/transform/ |
| H A D | ForEachNode.java | 62 final List<SortKey> sortKeys; field in ForEachNode
64 ForEachNode(Expr select, List<SortKey> sortKeys) in ForEachNode() argument
67 this.sortKeys = sortKeys; in ForEachNode()
72 int len = sortKeys.size(); in clone()
75 sortKeys2.add(sortKeys.get(i).clone(stylesheet)); in clone()
104 if (!sortKeys.isEmpty()) in doApply()
106 for (SortKey sortKey : sortKeys) in doApply()
111 Collections.sort(list, new XSLComparator(sortKeys)); in doApply()
140 for (Iterator<SortKey> i = sortKeys.iterator(); i.hasNext(); ) in references()
|
| /dports/devel/arm-none-eabi-gcc492/gcc-4.9.2/libjava/classpath/gnu/xml/transform/ |
| H A D | ForEachNode.java | 62 final List<SortKey> sortKeys; field in ForEachNode
64 ForEachNode(Expr select, List<SortKey> sortKeys) in ForEachNode() argument
67 this.sortKeys = sortKeys; in ForEachNode()
72 int len = sortKeys.size(); in clone()
75 sortKeys2.add(sortKeys.get(i).clone(stylesheet)); in clone()
104 if (!sortKeys.isEmpty()) in doApply()
106 for (SortKey sortKey : sortKeys) in doApply()
111 Collections.sort(list, new XSLComparator(sortKeys)); in doApply()
140 for (Iterator<SortKey> i = sortKeys.iterator(); i.hasNext(); ) in references()
|