/dports/lang/maude/maude-2.7.1/src/Core/ |
H A D | sortTable.hh | 34 class SortTable class 36 NO_COPYING(SortTable); 46 SortTable(int arity); 137 SortTable::arity() const in arity() 151 SortTable::specialSortHandling() const in specialSortHandling() 169 SortTable::getOpDeclarations() const in getOpDeclarations() 175 SortTable::rangeComponent() const in rangeComponent() 181 SortTable::getRangeSort() const in getRangeSort() 192 SortTable::domainComponent(int argNr) const in domainComponent() 198 SortTable::getSingleNonErrorSort() const in getSingleNonErrorSort() [all …]
|
H A D | sortTable.cc | 61 SortTable::SortTable(int arity) in SortTable() function in SortTable 69 SortTable::domainSubsumes(int subsumer, int victim) const in domainSubsumes() 82 SortTable::computeMaximalOpDeclSetTable() in computeMaximalOpDeclSetTable() 129 SortTable::compileOpDeclarations() in compileOpDeclarations() 164 SortTable::kindLevelDeclarationsOnly() const in kindLevelDeclarationsOnly() 175 SortTable::canProduceErrorSort() const in canProduceErrorSort() 203 SortTable::finalizeSortInfo() in finalizeSortInfo() 225 SortTable::minimize(NatSet& alive, int argNr) in minimize() 252 SortTable::buildSortDiagram() in buildSortDiagram() 511 SortTable::computeBddVector(const SortBdds& sortBdds, in computeBddVector() [all …]
|
H A D | ctorDiagram.cc | 28 SortTable::containsConstructor(const NatSet& state, bool& unique) in containsConstructor() 45 SortTable::partlyMoreGeneral(const OpDeclaration& subsumer, in partlyMoreGeneral() 61 SortTable::ctorSubsumes(const OpDeclaration& subsumer, in ctorSubsumes() 97 SortTable::minimizeWrtCtor(NatSet& alive, int argNr) const in minimizeWrtCtor() 166 SortTable::buildCtorDiagram() in buildCtorDiagram()
|
H A D | sortErrorAnalysis.cc | 30 struct SortTable::Node 38 SortTable::sortErrorAnalysis(bool preregProblem, in sortErrorAnalysis()
|
H A D | core.hh | 53 class SortTable;
|
H A D | ChangeLog | 715 (SortTable::computeSortFunctionBdds): call both 719 * sortTable.hh (class SortTable): added dec for 737 * sortTable.hh (class SortTable): added decl for 741 (SortTable::minimize, SortTable::buildSortDiagram): add comments 1619 * sortTable.hh (class SortTable): adde decl for 1629 * sortTable.hh (class SortTable): added decl for 1814 (class SortTable): added decls for struct Node 1932 * sortTable.hh (class SortTable): added decl for 2518 * sortTable.cc (SortTable): clear ctorStatus 2550 (class SortTable): added data member ctorStatus [all …]
|
/dports/games/wargus/wargus-3.2.0/StormLib/src/ |
H A D | SFileListFile.cpp | 315 char ** SortTable = NULL; in CreateListFile() local 324 SortTable = STORM_ALLOC(char*, ha->dwFileTableSize); in CreateListFile() 325 if(SortTable == NULL) in CreateListFile() 340 SortTable[nFileNodes++] = pFileEntry->szFileName; in CreateListFile() 349 qsort(SortTable, nFileNodes, sizeof(char *), CompareFileNodes); in CreateListFile() 352 cbListFile += strlen(SortTable[0]) + 2; in CreateListFile() 358 if(_stricmp(SortTable[nIndex1], SortTable[nIndex0]) != 0) in CreateListFile() 360 cbListFile += strlen(SortTable[nIndex1]) + 2; in CreateListFile() 370 szListLine = CopyListLine(szListLine, SortTable[0]); in CreateListFile() 376 if(_stricmp(SortTable[nIndex1], SortTable[nIndex0]) != 0) in CreateListFile() [all …]
|
/dports/textproc/zorba/zorba-2.7.0/src/runtime/core/gflwor/ |
H A D | orderby_iterator.h | 156 typedef std::vector<SortTuple> SortTable; typedef 160 SortTable theSortTable;
|
H A D | orderby_iterator.cpp | 377 OrderByState::SortTable& sortTable = iterState->theSortTable; in materializeResultForSort()
|
/dports/lang/maude/maude-2.7.1/src/Interface/ |
H A D | symbol.cc | 61 SortTable(arity), in Symbol() 473 case SortTable::IS_CTOR: in isConstructor() 475 case SortTable::IS_COMPLEX: in isConstructor()
|
H A D | symbol.hh | 46 public SortTable,
|
H A D | associativeSymbol.cc | 396 return getCtorStatus() == SortTable::IS_CTOR; // HACK in isConstructor()
|
/dports/textproc/zorba/zorba-2.7.0/src/runtime/core/ |
H A D | flwor_iterator.h | 359 typedef std::vector<SortTuple> SortTable; typedef 374 SortTable theSortTable;
|
H A D | flwor_iterator.cpp | 1353 FlworState::SortTable& sortTable = iterState->theSortTable; in materializeStreamTuple() 1398 FlworState::SortTable& sortTable = iterState->theSortTable; in materializeSortTupleAndResult()
|
/dports/lang/maude/maude-2.7.1/src/S_Theory/ |
H A D | S_Symbol.cc | 80 case SortTable::IS_NON_CTOR: in computePath() 85 case SortTable::IS_COMPLEX: in computePath()
|
/dports/devel/raknet/raknet-3.9.2_10,1/Source/ |
H A D | DS_Table.h | 289 void SortTable(Table::SortQuery *sortQueries, unsigned numSortQueries, Table::Row** out);
|
/dports/www/free-sa-devel/free-sa-2.0.0b6p7/ |
H A D | README | 6 SortTable code Copyright (C) 2007 Stuart Langridge
|
/dports/lang/mono/mono-5.10.1.57/mcs/class/PEAPI/ |
H A D | Metadata.cs | 5495 private void SortTable (ArrayList mTable) in SortTable() method in PEAPI.MetaData 5552 SortTable(metaDataTables[(int)MDTable.Constant]); in BuildMetaData() 5553 SortTable(metaDataTables[(int)MDTable.FieldMarshal]); in BuildMetaData() 5554 SortTable(metaDataTables[(int)MDTable.DeclSecurity]); in BuildMetaData() 5555 SortTable(metaDataTables[(int)MDTable.MethodSemantics]); in BuildMetaData() 5556 SortTable(metaDataTables[(int)MDTable.MethodImpl]); in BuildMetaData() 5557 SortTable(metaDataTables[(int)MDTable.ImplMap]); in BuildMetaData() 5559 SortTable(metaDataTables[(int)MDTable.GenericParam]); in BuildMetaData() 5565 SortTable(metaDataTables[(int)MDTable.GenericParamConstraint]); in BuildMetaData() 5566 SortTable(metaDataTables[(int)MDTable.InterfaceImpl]); in BuildMetaData() [all …]
|
/dports/devel/upp/upp/bazaar/MAPIEx/ |
H A D | MAPIFolder.cpp | 199 return (m_pContents->SortTable((LPSSortOrderSet)&SortColums, 0) == S_OK); in SortContents()
|
/dports/biology/lamarc/lamarc-2.1.8/src/report/ |
H A D | reportpage.h | 110 StringVec2d SortTable(StringVec2d intable, unsigned long sortcol,
|
H A D | reportpage.cpp | 561 StringVec2d ReportPage::SortTable(StringVec2d intable, unsigned long sortcol, in SortTable() function in ReportPage 1152 allforcetable[table] = SortTable(allforcetable[table], 2, 5); in WrapOutput() 1885 StringVec2d sortedtable = SortTable(forcetable, 2, (mixedmult ? 2 : 1)); in DisplayParameters() 1919 sortedtable = SortTable(forcetable, 2, (mixedmult ? 2 : 1)); in DisplayParameters()
|
/dports/editors/libreoffice/libreoffice-7.2.6.2/sw/source/core/doc/ |
H A D | docsort.cxx | 467 bool SwDoc::SortTable(const SwSelBoxes& rBoxes, const SwSortOptions& rOpt) in SortTable() function in SwDoc
|
/dports/editors/libreoffice6/libreoffice-6.4.7.2/sw/source/core/doc/ |
H A D | docsort.cxx | 471 bool SwDoc::SortTable(const SwSelBoxes& rBoxes, const SwSortOptions& rOpt) in SortTable() function in SwDoc
|
/dports/editors/libreoffice/libreoffice-7.2.6.2/sw/source/core/frmedt/ |
H A D | fews.cxx | 547 bRet = mxDoc->SortTable(aBoxes, rOpt); in Sort()
|
/dports/editors/libreoffice6/libreoffice-6.4.7.2/sw/source/core/frmedt/ |
H A D | fews.cxx | 547 bRet = mxDoc->SortTable(aBoxes, rOpt); in Sort()
|