| /dports/graphics/opendx/dx-4.4.4/src/exec/hwrender/ |
| H A D | hwSort.h | 45 SortList _dxf_newSortList();
46 void _dxf_deleteSortList(SortList sl);
47 void _dxf_clearSortList(SortList sl);
48 int _dxf_Insert_Translucent(SortList sl, void *xfp, int i);
49 int _dxf_Sort_Translucent(SortList sl);
|
| H A D | hwSort.c | 16 SortList
28 return (SortList)sl; in _dxf_newSortList()
32 _dxf_clearSortList(SortList sl) in _dxf_clearSortList()
48 void _dxf_deleteSortList(SortList sl) in _dxf_deleteSortList()
58 _dxf_Insert_Translucent(SortList sl, void *xfp, int i) in _dxf_Insert_Translucent()
99 _dxf_Sort_Translucent(SortList sl) in _dxf_Sort_Translucent()
|
| /dports/databases/percona57-server/percona-server-5.7.36-39/storage/rocksdb/rocksdb/utilities/merge_operators/ |
| H A D | sortlist.cc | 13 bool SortList::FullMergeV2(const MergeOperationInput& merge_in, in FullMergeV2()
28 bool SortList::PartialMerge(const Slice& /*key*/, const Slice& left_operand, in PartialMerge()
43 bool SortList::PartialMergeMulti(const Slice& /*key*/, in PartialMergeMulti()
52 const char* SortList::Name() const { return "MergeSortOperator"; } in Name()
54 void SortList::MakeVector(std::vector<int>& operand, Slice slice) const { in MakeVector()
62 std::vector<int> SortList::Merge(std::vector<int>& left, in Merge()
95 return std::make_shared<SortList>(); in CreateSortOperator()
|
| /dports/textproc/sonic/sonic-1.3.0/cargo-crates/librocksdb-sys-6.7.4/rocksdb/utilities/merge_operators/ |
| H A D | sortlist.cc | 16 bool SortList::FullMergeV2(const MergeOperationInput& merge_in, in FullMergeV2()
31 bool SortList::PartialMerge(const Slice& /*key*/, const Slice& left_operand, in PartialMerge()
46 bool SortList::PartialMergeMulti(const Slice& /*key*/, in PartialMergeMulti()
55 const char* SortList::Name() const { return "MergeSortOperator"; } in Name()
57 void SortList::MakeVector(std::vector<int>& operand, Slice slice) const { in MakeVector()
65 std::vector<int> SortList::Merge(std::vector<int>& left, in Merge()
98 return std::make_shared<SortList>(); in CreateSortOperator()
|
| /dports/databases/percona57-client/percona-server-5.7.36-39/storage/rocksdb/rocksdb/utilities/merge_operators/ |
| H A D | sortlist.cc | 13 bool SortList::FullMergeV2(const MergeOperationInput& merge_in, in FullMergeV2()
28 bool SortList::PartialMerge(const Slice& /*key*/, const Slice& left_operand, in PartialMerge()
43 bool SortList::PartialMergeMulti(const Slice& /*key*/, in PartialMergeMulti()
52 const char* SortList::Name() const { return "MergeSortOperator"; } in Name()
54 void SortList::MakeVector(std::vector<int>& operand, Slice slice) const { in MakeVector()
62 std::vector<int> SortList::Merge(std::vector<int>& left, in Merge()
95 return std::make_shared<SortList>(); in CreateSortOperator()
|
| /dports/databases/percona57-pam-for-mysql/percona-server-5.7.36-39/storage/rocksdb/rocksdb/utilities/merge_operators/ |
| H A D | sortlist.cc | 13 bool SortList::FullMergeV2(const MergeOperationInput& merge_in, in FullMergeV2()
28 bool SortList::PartialMerge(const Slice& /*key*/, const Slice& left_operand, in PartialMerge()
43 bool SortList::PartialMergeMulti(const Slice& /*key*/, in PartialMergeMulti()
52 const char* SortList::Name() const { return "MergeSortOperator"; } in Name()
54 void SortList::MakeVector(std::vector<int>& operand, Slice slice) const { in MakeVector()
62 std::vector<int> SortList::Merge(std::vector<int>& left, in Merge()
95 return std::make_shared<SortList>(); in CreateSortOperator()
|
| /dports/databases/mariadb104-client/mariadb-10.4.24/storage/rocksdb/rocksdb/utilities/merge_operators/ |
| H A D | sortlist.cc | 16 bool SortList::FullMergeV2(const MergeOperationInput& merge_in, in FullMergeV2()
31 bool SortList::PartialMerge(const Slice& /*key*/, const Slice& left_operand, in PartialMerge()
46 bool SortList::PartialMergeMulti(const Slice& /*key*/, in PartialMergeMulti()
55 const char* SortList::Name() const { return "MergeSortOperator"; } in Name()
57 void SortList::MakeVector(std::vector<int>& operand, Slice slice) const { in MakeVector()
65 std::vector<int> SortList::Merge(std::vector<int>& left, in Merge()
98 return std::make_shared<SortList>(); in CreateSortOperator()
|
| /dports/databases/mariadb104-server/mariadb-10.4.24/storage/rocksdb/rocksdb/utilities/merge_operators/ |
| H A D | sortlist.cc | 16 bool SortList::FullMergeV2(const MergeOperationInput& merge_in, in FullMergeV2()
31 bool SortList::PartialMerge(const Slice& /*key*/, const Slice& left_operand, in PartialMerge()
46 bool SortList::PartialMergeMulti(const Slice& /*key*/, in PartialMergeMulti()
55 const char* SortList::Name() const { return "MergeSortOperator"; } in Name()
57 void SortList::MakeVector(std::vector<int>& operand, Slice slice) const { in MakeVector()
65 std::vector<int> SortList::Merge(std::vector<int>& left, in Merge()
98 return std::make_shared<SortList>(); in CreateSortOperator()
|
| /dports/databases/mariadb103-client/mariadb-10.3.34/storage/rocksdb/rocksdb/utilities/merge_operators/ |
| H A D | sortlist.cc | 16 bool SortList::FullMergeV2(const MergeOperationInput& merge_in,
31 bool SortList::PartialMerge(const Slice& /*key*/, const Slice& left_operand,
46 bool SortList::PartialMergeMulti(const Slice& /*key*/,
55 const char* SortList::Name() const { return "MergeSortOperator"; }
57 void SortList::MakeVector(std::vector<int>& operand, Slice slice) const {
65 std::vector<int> SortList::Merge(std::vector<int>& left,
98 return std::make_shared<SortList>();
|
| /dports/databases/mariadb103-server/mariadb-10.3.34/storage/rocksdb/rocksdb/utilities/merge_operators/ |
| H A D | sortlist.cc | 16 bool SortList::FullMergeV2(const MergeOperationInput& merge_in, in FullMergeV2()
31 bool SortList::PartialMerge(const Slice& /*key*/, const Slice& left_operand, in PartialMerge()
46 bool SortList::PartialMergeMulti(const Slice& /*key*/, in PartialMergeMulti()
55 const char* SortList::Name() const { return "MergeSortOperator"; } in Name()
57 void SortList::MakeVector(std::vector<int>& operand, Slice slice) const { in MakeVector()
65 std::vector<int> SortList::Merge(std::vector<int>& left, in Merge()
98 return std::make_shared<SortList>(); in CreateSortOperator()
|
| /dports/databases/mariadb105-client/mariadb-10.5.15/storage/rocksdb/rocksdb/utilities/merge_operators/ |
| H A D | sortlist.cc | 16 bool SortList::FullMergeV2(const MergeOperationInput& merge_in, in FullMergeV2()
31 bool SortList::PartialMerge(const Slice& /*key*/, const Slice& left_operand, in PartialMerge()
46 bool SortList::PartialMergeMulti(const Slice& /*key*/, in PartialMergeMulti()
55 const char* SortList::Name() const { return "MergeSortOperator"; } in Name()
57 void SortList::MakeVector(std::vector<int>& operand, Slice slice) const { in MakeVector()
65 std::vector<int> SortList::Merge(std::vector<int>& left, in Merge()
98 return std::make_shared<SortList>(); in CreateSortOperator()
|
| /dports/databases/mariadb105-server/mariadb-10.5.15/storage/rocksdb/rocksdb/utilities/merge_operators/ |
| H A D | sortlist.cc | 16 bool SortList::FullMergeV2(const MergeOperationInput& merge_in, in FullMergeV2()
31 bool SortList::PartialMerge(const Slice& /*key*/, const Slice& left_operand, in PartialMerge()
46 bool SortList::PartialMergeMulti(const Slice& /*key*/, in PartialMergeMulti()
55 const char* SortList::Name() const { return "MergeSortOperator"; } in Name()
57 void SortList::MakeVector(std::vector<int>& operand, Slice slice) const { in MakeVector()
65 std::vector<int> SortList::Merge(std::vector<int>& left, in Merge()
98 return std::make_shared<SortList>(); in CreateSortOperator()
|
| /dports/databases/rocksdb/rocksdb-6.26.1/utilities/merge_operators/ |
| H A D | sortlist.cc | 13 bool SortList::FullMergeV2(const MergeOperationInput& merge_in, in FullMergeV2()
28 bool SortList::PartialMerge(const Slice& /*key*/, const Slice& left_operand, in PartialMerge()
43 bool SortList::PartialMergeMulti(const Slice& /*key*/, in PartialMergeMulti()
52 void SortList::MakeVector(std::vector<int>& operand, Slice slice) const { in MakeVector()
60 std::vector<int> SortList::Merge(std::vector<int>& left, in Merge()
93 return std::make_shared<SortList>(); in CreateSortOperator()
|
| /dports/databases/rocksdb-lite/rocksdb-6.26.1/utilities/merge_operators/ |
| H A D | sortlist.cc | 13 bool SortList::FullMergeV2(const MergeOperationInput& merge_in, in FullMergeV2()
28 bool SortList::PartialMerge(const Slice& /*key*/, const Slice& left_operand, in PartialMerge()
43 bool SortList::PartialMergeMulti(const Slice& /*key*/, in PartialMergeMulti()
52 void SortList::MakeVector(std::vector<int>& operand, Slice slice) const { in MakeVector()
60 std::vector<int> SortList::Merge(std::vector<int>& left, in Merge()
93 return std::make_shared<SortList>(); in CreateSortOperator()
|
| /dports/math/vampire/vampire-4.5.1/Kernel/ |
| H A D | Formula.hpp | 52 typedef List<unsigned> SortList; typedef in Kernel::Formula
77 const SortList* sorts() const;
78 SortList* sorts();
194 QuantifiedFormula(Connective con, VarList* vs, SortList* ss, Formula* arg) in QuantifiedFormula()
202 ASS(!ss || VarList::length(vs) == SortList::length(ss)); in QuantifiedFormula()
214 const SortList* sortList() const { return _sorts; } in sortList()
216 SortList* sortList() { return _sorts; } in sortList()
225 SortList* _sorts;
404 const Formula::SortList* Formula::sorts() const in sorts()
411 Formula::SortList* Formula::sorts() in sorts()
|
| /dports/databases/rocksdb/rocksdb-6.26.1/utilities/ |
| H A D | merge_operators.cc | 45 } else if (id == SortList::kNickName() || id == SortList::kClassName()) { in LoadMergeOperator()
82 AsRegex(SortList::kClassName(), SortList::kNickName()), in RegisterBuiltinMergeOperators()
85 guard->reset(new SortList()); in RegisterBuiltinMergeOperators()
|
| /dports/databases/rocksdb-lite/rocksdb-6.26.1/utilities/ |
| H A D | merge_operators.cc | 45 } else if (id == SortList::kNickName() || id == SortList::kClassName()) { in LoadMergeOperator()
82 AsRegex(SortList::kClassName(), SortList::kNickName()), in RegisterBuiltinMergeOperators()
85 guard->reset(new SortList()); in RegisterBuiltinMergeOperators()
|
| /dports/games/openrct2/OpenRCT2-0.3.5.1/src/openrct2-ui/windows/ |
| H A D | RideList.cpp | 789 currentListPosition = SortList( in RefreshList()
795 currentListPosition = SortList( in RefreshList()
801 currentListPosition = SortList( in RefreshList()
807 currentListPosition = SortList( in RefreshList()
813 currentListPosition = SortList( in RefreshList()
819 currentListPosition = SortList( in RefreshList()
825 currentListPosition = SortList( in RefreshList()
831 currentListPosition = SortList( in RefreshList()
837 currentListPosition = SortList( in RefreshList()
843 currentListPosition = SortList( in RefreshList()
[all …]
|
| /dports/editors/libreoffice/libreoffice-7.2.6.2/wizards/com/sun/star/wizards/common/ |
| H A D | JavaTools.java | 187 public static String[][] bubblesortList(String[][] SortList) in bubblesortList() argument
190 int SortCount = SortList[0].length; in bubblesortList()
191 int DimCount = SortList.length; in bubblesortList()
196 if (SortList[0][t].compareTo(SortList[0][t + 1]) > 0) in bubblesortList()
200 DisplayDummy = SortList[k][t]; in bubblesortList()
201 SortList[k][t] = SortList[k][t + 1]; in bubblesortList()
202 SortList[k][t + 1] = DisplayDummy; in bubblesortList()
207 return SortList; in bubblesortList()
|
| /dports/editors/libreoffice6/libreoffice-6.4.7.2/wizards/com/sun/star/wizards/common/ |
| H A D | JavaTools.java | 187 public static String[][] bubblesortList(String[][] SortList) in bubblesortList() argument
190 int SortCount = SortList[0].length; in bubblesortList()
191 int DimCount = SortList.length; in bubblesortList()
196 if (SortList[0][t].compareTo(SortList[0][t + 1]) > 0) in bubblesortList()
200 DisplayDummy = SortList[k][t]; in bubblesortList()
201 SortList[k][t] = SortList[k][t + 1]; in bubblesortList()
202 SortList[k][t + 1] = DisplayDummy; in bubblesortList()
207 return SortList; in bubblesortList()
|
| /dports/editors/lazarus-devel/lazarus-6df7e8756882f7d7f28f662011ee72f21746c580/components/filebrowser/ |
| H A D | frmfilebrowser.pas | 229 SortList: TStringListUTF8Fast;
241 SortList := TStringListUTF8Fast.Create;
260 SortList.Add(FileInfo.Name);
263 SortList.Sorted := True;
264 for i := 0 to SortList.Count - 1 do
266 NewNode := TV.Items.AddChild(Node, SortList[i]);
271 SortList.Free;
|
| /dports/editors/lazarus/lazarus/components/filebrowser/ |
| H A D | frmfilebrowser.pas | 226 SortList: TStringList;
238 SortList := TStringList.Create;
239 SortList.Sorted := True;
258 SortList.Add(FileInfo.Name);
261 for i := 0 to SortList.Count - 1 do
263 NewNode := TV.Items.AddChild(Node, SortList[i]);
268 SortList.Free;
|
| /dports/editors/lazarus-qt5/lazarus/components/filebrowser/ |
| H A D | frmfilebrowser.pas | 226 SortList: TStringList;
238 SortList := TStringList.Create;
239 SortList.Sorted := True;
258 SortList.Add(FileInfo.Name);
261 for i := 0 to SortList.Count - 1 do
263 NewNode := TV.Items.AddChild(Node, SortList[i]);
268 SortList.Free;
|
| /dports/editors/lazarus-qt5-devel/lazarus-6df7e8756882f7d7f28f662011ee72f21746c580/components/filebrowser/ |
| H A D | frmfilebrowser.pas | 229 SortList: TStringListUTF8Fast;
241 SortList := TStringListUTF8Fast.Create;
260 SortList.Add(FileInfo.Name);
263 SortList.Sorted := True;
264 for i := 0 to SortList.Count - 1 do
266 NewNode := TV.Items.AddChild(Node, SortList[i]);
271 SortList.Free;
|
| /dports/japanese/kasumi/kasumi-2.5/ |
| H A D | KasumiMainWindow.cxx | 283 GTK_TREE_MODEL(SortList)); in createWordList()
325 GtkTreeModel *model = GTK_TREE_MODEL(SortList); in refresh()
410 GtkTreeModel *model = GTK_TREE_MODEL(SortList); in ClickedRemoveButton()
451 gtk_tree_model_get_iter(SortList, &iter, editingPath); in editedTextColumn()
454 gtk_tree_model_get(SortList, &iter, COL_ID, &id, -1); in editedTextColumn()
544 gtk_tree_model_get_iter(SortList, &iter, editingPath); in changedWordTypeColumn()
546 gtk_tree_model_get(SortList, &iter, COL_ID, &id, -1); in changedWordTypeColumn()
559 GtkTreeModel *model = GTK_TREE_MODEL(SortList); in FindNext()
656 gtk_tree_sortable_set_sort_column_id(GTK_TREE_SORTABLE(SortList), in SortBy()
659 gtk_tree_sortable_set_sort_column_id(GTK_TREE_SORTABLE(SortList), in SortBy()
[all …]
|