/dports/multimedia/assimp/assimp-5.1.3/code/AssetLib/FBX/ |
H A D | FBXDocument.h | 978 uint64_t InsertionOrder() const { in InsertionOrder() function 986 if(InsertionOrder() > c->InsertionOrder()) { in CompareTo() 989 else if(InsertionOrder() < c->InsertionOrder()) { in CompareTo() 998 return InsertionOrder() < c->InsertionOrder(); in Compare()
|
/dports/games/doomsday/doomsday-2.3.1/doomsday/external/assimp/code/ |
H A D | FBXDocument.h | 968 uint64_t InsertionOrder() const { in InsertionOrder() function 976 if(InsertionOrder() > c->InsertionOrder()) { in CompareTo() 979 else if(InsertionOrder() < c->InsertionOrder()) { in CompareTo() 988 return InsertionOrder() < c->InsertionOrder(); in Compare()
|
/dports/graphics/qt5-3d/kde-qt3d-5.15.2p39/src/3rdparty/assimp/code/ |
H A D | FBXDocument.h | 959 uint64_t InsertionOrder() const { in InsertionOrder() function 967 if(InsertionOrder() > c->InsertionOrder()) { in CompareTo() 970 else if(InsertionOrder() < c->InsertionOrder()) { in CompareTo() 979 return InsertionOrder() < c->InsertionOrder(); in Compare()
|
/dports/devel/godot-tools/godot-3.2.3-stable/thirdparty/assimp/code/FBX/ |
H A D | FBXDocument.h | 986 uint64_t InsertionOrder() const { in InsertionOrder() function 994 if(InsertionOrder() > c->InsertionOrder()) { in CompareTo() 997 else if(InsertionOrder() < c->InsertionOrder()) { in CompareTo() 1006 return InsertionOrder() < c->InsertionOrder(); in Compare()
|
/dports/devel/upp/upp/bazaar/plugin/assimp/code/FBX/ |
H A D | FBXDocument.h | 986 uint64_t InsertionOrder() const { in InsertionOrder() function 994 if(InsertionOrder() > c->InsertionOrder()) { in CompareTo() 997 else if(InsertionOrder() < c->InsertionOrder()) { in CompareTo() 1006 return InsertionOrder() < c->InsertionOrder(); in Compare()
|
/dports/devel/godot/godot-3.2.3-stable/thirdparty/assimp/code/FBX/ |
H A D | FBXDocument.h | 986 uint64_t InsertionOrder() const { in InsertionOrder() function 994 if(InsertionOrder() > c->InsertionOrder()) { in CompareTo() 997 else if(InsertionOrder() < c->InsertionOrder()) { in CompareTo() 1006 return InsertionOrder() < c->InsertionOrder(); in Compare()
|
/dports/graphics/urho3d/Urho3D-1.7.1/Source/ThirdParty/Assimp/code/ |
H A D | FBXDocument.h | 1186 uint64_t InsertionOrder() const { in InsertionOrder() function 1192 if(InsertionOrder() > c->InsertionOrder()) { in CompareTo() 1195 else if(InsertionOrder() < c->InsertionOrder()) { in CompareTo() 1202 return InsertionOrder() < c->InsertionOrder(); in Compare()
|
/dports/www/chromium-legacy/chromium-88.0.4324.182/third_party/llvm/llvm/lib/Target/Hexagon/ |
H A D | HexagonISelDAGToDAG.cpp | 1654 int InsertionOrder; member 1658 WeightedLeaf(SDValue Value, int Weight, int InsertionOrder) : in WeightedLeaf() 1659 Value(Value), Weight(Weight), InsertionOrder(InsertionOrder) { in WeightedLeaf() 1666 (A.InsertionOrder > B.InsertionOrder) : in Compare() 1755 (Result.Weight == L.Weight && Result.InsertionOrder > L.InsertionOrder)) in findSHL() 1782 (Result.Weight == L.Weight && Result.InsertionOrder > L.InsertionOrder)) in findMULbyConst() 1968 int InsertionOrder = 0; in balanceSubTree() local 2002 Mul1 = WeightedLeaf(Child, Weight, InsertionOrder++); in balanceSubTree() 2005 Mul2 = WeightedLeaf(Child, Weight, InsertionOrder++); in balanceSubTree() 2024 GA = WeightedLeaf(Child, Weight, InsertionOrder++); in balanceSubTree() [all …]
|
/dports/devel/tinygo/tinygo-0.14.1/llvm-project/llvm/lib/Target/Hexagon/ |
H A D | HexagonISelDAGToDAG.cpp | 1647 int InsertionOrder; member 1651 WeightedLeaf(SDValue Value, int Weight, int InsertionOrder) : in WeightedLeaf() 1652 Value(Value), Weight(Weight), InsertionOrder(InsertionOrder) { in WeightedLeaf() 1659 (A.InsertionOrder > B.InsertionOrder) : in Compare() 1748 (Result.Weight == L.Weight && Result.InsertionOrder > L.InsertionOrder)) in findSHL() 1775 (Result.Weight == L.Weight && Result.InsertionOrder > L.InsertionOrder)) in findMULbyConst() 1961 int InsertionOrder = 0; in balanceSubTree() local 1995 Mul1 = WeightedLeaf(Child, Weight, InsertionOrder++); in balanceSubTree() 1998 Mul2 = WeightedLeaf(Child, Weight, InsertionOrder++); in balanceSubTree() 2017 GA = WeightedLeaf(Child, Weight, InsertionOrder++); in balanceSubTree() [all …]
|
/dports/devel/llvm-cheri/llvm-project-37c49ff00e3eadce5d8703fdc4497f28458c64a8/llvm/lib/Target/Hexagon/ |
H A D | HexagonISelDAGToDAG.cpp | 1654 int InsertionOrder; member 1658 WeightedLeaf(SDValue Value, int Weight, int InsertionOrder) : in WeightedLeaf() 1659 Value(Value), Weight(Weight), InsertionOrder(InsertionOrder) { in WeightedLeaf() 1666 (A.InsertionOrder > B.InsertionOrder) : in Compare() 1755 (Result.Weight == L.Weight && Result.InsertionOrder > L.InsertionOrder)) in findSHL() 1782 (Result.Weight == L.Weight && Result.InsertionOrder > L.InsertionOrder)) in findMULbyConst() 1968 int InsertionOrder = 0; in balanceSubTree() local 2002 Mul1 = WeightedLeaf(Child, Weight, InsertionOrder++); in balanceSubTree() 2005 Mul2 = WeightedLeaf(Child, Weight, InsertionOrder++); in balanceSubTree() 2024 GA = WeightedLeaf(Child, Weight, InsertionOrder++); in balanceSubTree() [all …]
|
/dports/devel/llvm10/llvm-10.0.1.src/lib/Target/Hexagon/ |
H A D | HexagonISelDAGToDAG.cpp | 1647 int InsertionOrder; member 1651 WeightedLeaf(SDValue Value, int Weight, int InsertionOrder) : in WeightedLeaf() 1652 Value(Value), Weight(Weight), InsertionOrder(InsertionOrder) { in WeightedLeaf() 1659 (A.InsertionOrder > B.InsertionOrder) : in Compare() 1748 (Result.Weight == L.Weight && Result.InsertionOrder > L.InsertionOrder)) in findSHL() 1775 (Result.Weight == L.Weight && Result.InsertionOrder > L.InsertionOrder)) in findMULbyConst() 1961 int InsertionOrder = 0; in balanceSubTree() local 1995 Mul1 = WeightedLeaf(Child, Weight, InsertionOrder++); in balanceSubTree() 1998 Mul2 = WeightedLeaf(Child, Weight, InsertionOrder++); in balanceSubTree() 2017 GA = WeightedLeaf(Child, Weight, InsertionOrder++); in balanceSubTree() [all …]
|
/dports/devel/wasi-libcxx/llvm-project-13.0.1.src/llvm/lib/Target/Hexagon/ |
H A D | HexagonISelDAGToDAG.cpp | 1653 int InsertionOrder; member 1657 WeightedLeaf(SDValue Value, int Weight, int InsertionOrder) : in WeightedLeaf() 1658 Value(Value), Weight(Weight), InsertionOrder(InsertionOrder) { in WeightedLeaf() 1665 (A.InsertionOrder > B.InsertionOrder) : in Compare() 1754 (Result.Weight == L.Weight && Result.InsertionOrder > L.InsertionOrder)) in findSHL() 1781 (Result.Weight == L.Weight && Result.InsertionOrder > L.InsertionOrder)) in findMULbyConst() 1967 int InsertionOrder = 0; in balanceSubTree() local 2001 Mul1 = WeightedLeaf(Child, Weight, InsertionOrder++); in balanceSubTree() 2004 Mul2 = WeightedLeaf(Child, Weight, InsertionOrder++); in balanceSubTree() 2023 GA = WeightedLeaf(Child, Weight, InsertionOrder++); in balanceSubTree() [all …]
|
/dports/graphics/llvm-mesa/llvm-13.0.1.src/lib/Target/Hexagon/ |
H A D | HexagonISelDAGToDAG.cpp | 1653 int InsertionOrder; member 1657 WeightedLeaf(SDValue Value, int Weight, int InsertionOrder) : in WeightedLeaf() 1658 Value(Value), Weight(Weight), InsertionOrder(InsertionOrder) { in WeightedLeaf() 1665 (A.InsertionOrder > B.InsertionOrder) : in Compare() 1754 (Result.Weight == L.Weight && Result.InsertionOrder > L.InsertionOrder)) in findSHL() 1781 (Result.Weight == L.Weight && Result.InsertionOrder > L.InsertionOrder)) in findMULbyConst() 1967 int InsertionOrder = 0; in balanceSubTree() local 2001 Mul1 = WeightedLeaf(Child, Weight, InsertionOrder++); in balanceSubTree() 2004 Mul2 = WeightedLeaf(Child, Weight, InsertionOrder++); in balanceSubTree() 2023 GA = WeightedLeaf(Child, Weight, InsertionOrder++); in balanceSubTree() [all …]
|
/dports/devel/llvm12/llvm-project-12.0.1.src/llvm/lib/Target/Hexagon/ |
H A D | HexagonISelDAGToDAG.cpp | 1654 int InsertionOrder; member 1658 WeightedLeaf(SDValue Value, int Weight, int InsertionOrder) : in WeightedLeaf() 1659 Value(Value), Weight(Weight), InsertionOrder(InsertionOrder) { in WeightedLeaf() 1666 (A.InsertionOrder > B.InsertionOrder) : in Compare() 1755 (Result.Weight == L.Weight && Result.InsertionOrder > L.InsertionOrder)) in findSHL() 1782 (Result.Weight == L.Weight && Result.InsertionOrder > L.InsertionOrder)) in findMULbyConst() 1968 int InsertionOrder = 0; in balanceSubTree() local 2002 Mul1 = WeightedLeaf(Child, Weight, InsertionOrder++); in balanceSubTree() 2005 Mul2 = WeightedLeaf(Child, Weight, InsertionOrder++); in balanceSubTree() 2024 GA = WeightedLeaf(Child, Weight, InsertionOrder++); in balanceSubTree() [all …]
|
/dports/devel/llvm11/llvm-11.0.1.src/lib/Target/Hexagon/ |
H A D | HexagonISelDAGToDAG.cpp | 1654 int InsertionOrder; member 1658 WeightedLeaf(SDValue Value, int Weight, int InsertionOrder) : in WeightedLeaf() 1659 Value(Value), Weight(Weight), InsertionOrder(InsertionOrder) { in WeightedLeaf() 1666 (A.InsertionOrder > B.InsertionOrder) : in Compare() 1755 (Result.Weight == L.Weight && Result.InsertionOrder > L.InsertionOrder)) in findSHL() 1782 (Result.Weight == L.Weight && Result.InsertionOrder > L.InsertionOrder)) in findMULbyConst() 1968 int InsertionOrder = 0; in balanceSubTree() local 2002 Mul1 = WeightedLeaf(Child, Weight, InsertionOrder++); in balanceSubTree() 2005 Mul2 = WeightedLeaf(Child, Weight, InsertionOrder++); in balanceSubTree() 2024 GA = WeightedLeaf(Child, Weight, InsertionOrder++); in balanceSubTree() [all …]
|
/dports/lang/rust/rustc-1.58.1-src/src/llvm-project/llvm/lib/Target/Hexagon/ |
H A D | HexagonISelDAGToDAG.cpp | 1653 int InsertionOrder; member 1657 WeightedLeaf(SDValue Value, int Weight, int InsertionOrder) : in WeightedLeaf() 1658 Value(Value), Weight(Weight), InsertionOrder(InsertionOrder) { in WeightedLeaf() 1665 (A.InsertionOrder > B.InsertionOrder) : in Compare() 1754 (Result.Weight == L.Weight && Result.InsertionOrder > L.InsertionOrder)) in findSHL() 1781 (Result.Weight == L.Weight && Result.InsertionOrder > L.InsertionOrder)) in findMULbyConst() 1967 int InsertionOrder = 0; in balanceSubTree() local 2001 Mul1 = WeightedLeaf(Child, Weight, InsertionOrder++); in balanceSubTree() 2004 Mul2 = WeightedLeaf(Child, Weight, InsertionOrder++); in balanceSubTree() 2023 GA = WeightedLeaf(Child, Weight, InsertionOrder++); in balanceSubTree() [all …]
|
/dports/www/chromium-legacy/chromium-88.0.4324.182/third_party/swiftshader/third_party/llvm-10.0/llvm/lib/Target/Hexagon/ |
H A D | HexagonISelDAGToDAG.cpp | 1647 int InsertionOrder; member 1651 WeightedLeaf(SDValue Value, int Weight, int InsertionOrder) : in WeightedLeaf() 1652 Value(Value), Weight(Weight), InsertionOrder(InsertionOrder) { in WeightedLeaf() 1659 (A.InsertionOrder > B.InsertionOrder) : in Compare() 1748 (Result.Weight == L.Weight && Result.InsertionOrder > L.InsertionOrder)) in findSHL() 1775 (Result.Weight == L.Weight && Result.InsertionOrder > L.InsertionOrder)) in findMULbyConst() 1961 int InsertionOrder = 0; in balanceSubTree() local 1995 Mul1 = WeightedLeaf(Child, Weight, InsertionOrder++); in balanceSubTree() 1998 Mul2 = WeightedLeaf(Child, Weight, InsertionOrder++); in balanceSubTree() 2017 GA = WeightedLeaf(Child, Weight, InsertionOrder++); in balanceSubTree() [all …]
|
/dports/devel/llvm-devel/llvm-project-f05c95f10fc1d8171071735af8ad3a9e87633120/llvm/lib/Target/Hexagon/ |
H A D | HexagonISelDAGToDAG.cpp | 1653 int InsertionOrder; member 1657 WeightedLeaf(SDValue Value, int Weight, int InsertionOrder) : in WeightedLeaf() 1658 Value(Value), Weight(Weight), InsertionOrder(InsertionOrder) { in WeightedLeaf() 1665 (A.InsertionOrder > B.InsertionOrder) : in Compare() 1754 (Result.Weight == L.Weight && Result.InsertionOrder > L.InsertionOrder)) in findSHL() 1781 (Result.Weight == L.Weight && Result.InsertionOrder > L.InsertionOrder)) in findMULbyConst() 1967 int InsertionOrder = 0; in balanceSubTree() local 2001 Mul1 = WeightedLeaf(Child, Weight, InsertionOrder++); in balanceSubTree() 2004 Mul2 = WeightedLeaf(Child, Weight, InsertionOrder++); in balanceSubTree() 2023 GA = WeightedLeaf(Child, Weight, InsertionOrder++); in balanceSubTree() [all …]
|
/dports/devel/wasi-compiler-rt13/llvm-project-13.0.1.src/llvm/lib/Target/Hexagon/ |
H A D | HexagonISelDAGToDAG.cpp | 1653 int InsertionOrder; member 1657 WeightedLeaf(SDValue Value, int Weight, int InsertionOrder) : in WeightedLeaf() 1658 Value(Value), Weight(Weight), InsertionOrder(InsertionOrder) { in WeightedLeaf() 1665 (A.InsertionOrder > B.InsertionOrder) : in Compare() 1754 (Result.Weight == L.Weight && Result.InsertionOrder > L.InsertionOrder)) in findSHL() 1781 (Result.Weight == L.Weight && Result.InsertionOrder > L.InsertionOrder)) in findMULbyConst() 1967 int InsertionOrder = 0; in balanceSubTree() local 2001 Mul1 = WeightedLeaf(Child, Weight, InsertionOrder++); in balanceSubTree() 2004 Mul2 = WeightedLeaf(Child, Weight, InsertionOrder++); in balanceSubTree() 2023 GA = WeightedLeaf(Child, Weight, InsertionOrder++); in balanceSubTree() [all …]
|
/dports/devel/wasi-compiler-rt12/llvm-project-12.0.1.src/llvm/lib/Target/Hexagon/ |
H A D | HexagonISelDAGToDAG.cpp | 1654 int InsertionOrder; member 1658 WeightedLeaf(SDValue Value, int Weight, int InsertionOrder) : in WeightedLeaf() 1659 Value(Value), Weight(Weight), InsertionOrder(InsertionOrder) { in WeightedLeaf() 1666 (A.InsertionOrder > B.InsertionOrder) : in Compare() 1755 (Result.Weight == L.Weight && Result.InsertionOrder > L.InsertionOrder)) in findSHL() 1782 (Result.Weight == L.Weight && Result.InsertionOrder > L.InsertionOrder)) in findMULbyConst() 1968 int InsertionOrder = 0; in balanceSubTree() local 2002 Mul1 = WeightedLeaf(Child, Weight, InsertionOrder++); in balanceSubTree() 2005 Mul2 = WeightedLeaf(Child, Weight, InsertionOrder++); in balanceSubTree() 2024 GA = WeightedLeaf(Child, Weight, InsertionOrder++); in balanceSubTree() [all …]
|
/dports/devel/llvm13/llvm-project-13.0.1.src/llvm/lib/Target/Hexagon/ |
H A D | HexagonISelDAGToDAG.cpp | 1653 int InsertionOrder; member 1657 WeightedLeaf(SDValue Value, int Weight, int InsertionOrder) : in WeightedLeaf() 1658 Value(Value), Weight(Weight), InsertionOrder(InsertionOrder) { in WeightedLeaf() 1665 (A.InsertionOrder > B.InsertionOrder) : in Compare() 1754 (Result.Weight == L.Weight && Result.InsertionOrder > L.InsertionOrder)) in findSHL() 1781 (Result.Weight == L.Weight && Result.InsertionOrder > L.InsertionOrder)) in findMULbyConst() 1967 int InsertionOrder = 0; in balanceSubTree() local 2001 Mul1 = WeightedLeaf(Child, Weight, InsertionOrder++); in balanceSubTree() 2004 Mul2 = WeightedLeaf(Child, Weight, InsertionOrder++); in balanceSubTree() 2023 GA = WeightedLeaf(Child, Weight, InsertionOrder++); in balanceSubTree() [all …]
|
/dports/devel/llvm90/llvm-9.0.1.src/lib/Target/Hexagon/ |
H A D | HexagonISelDAGToDAG.cpp | 1636 int InsertionOrder; member 1640 WeightedLeaf(SDValue Value, int Weight, int InsertionOrder) : in WeightedLeaf() 1641 Value(Value), Weight(Weight), InsertionOrder(InsertionOrder) { in WeightedLeaf() 1648 (A.InsertionOrder > B.InsertionOrder) : in Compare() 1737 (Result.Weight == L.Weight && Result.InsertionOrder > L.InsertionOrder)) in findSHL() 1764 (Result.Weight == L.Weight && Result.InsertionOrder > L.InsertionOrder)) in findMULbyConst() 1950 int InsertionOrder = 0; in balanceSubTree() local 1984 Mul1 = WeightedLeaf(Child, Weight, InsertionOrder++); in balanceSubTree() 1987 Mul2 = WeightedLeaf(Child, Weight, InsertionOrder++); in balanceSubTree() 2006 GA = WeightedLeaf(Child, Weight, InsertionOrder++); in balanceSubTree() [all …]
|
/dports/devel/llvm80/llvm-8.0.1.src/lib/Target/Hexagon/ |
H A D | HexagonISelDAGToDAG.cpp | 1632 int InsertionOrder; member 1636 WeightedLeaf(SDValue Value, int Weight, int InsertionOrder) : in WeightedLeaf() 1637 Value(Value), Weight(Weight), InsertionOrder(InsertionOrder) { in WeightedLeaf() 1644 (A.InsertionOrder > B.InsertionOrder) : in Compare() 1733 (Result.Weight == L.Weight && Result.InsertionOrder > L.InsertionOrder)) in findSHL() 1760 (Result.Weight == L.Weight && Result.InsertionOrder > L.InsertionOrder)) in findMULbyConst() 1946 int InsertionOrder = 0; in balanceSubTree() local 1980 Mul1 = WeightedLeaf(Child, Weight, InsertionOrder++); in balanceSubTree() 1983 Mul2 = WeightedLeaf(Child, Weight, InsertionOrder++); in balanceSubTree() 2002 GA = WeightedLeaf(Child, Weight, InsertionOrder++); in balanceSubTree() [all …]
|
/dports/devel/llvm70/llvm-7.0.1.src/lib/Target/Hexagon/ |
H A D | HexagonISelDAGToDAG.cpp | 1634 int InsertionOrder; member 1638 WeightedLeaf(SDValue Value, int Weight, int InsertionOrder) : in WeightedLeaf() 1639 Value(Value), Weight(Weight), InsertionOrder(InsertionOrder) { in WeightedLeaf() 1646 (A.InsertionOrder > B.InsertionOrder) : in Compare() 1735 (Result.Weight == L.Weight && Result.InsertionOrder > L.InsertionOrder)) in findSHL() 1762 (Result.Weight == L.Weight && Result.InsertionOrder > L.InsertionOrder)) in findMULbyConst() 1948 int InsertionOrder = 0; in balanceSubTree() local 1982 Mul1 = WeightedLeaf(Child, Weight, InsertionOrder++); in balanceSubTree() 1985 Mul2 = WeightedLeaf(Child, Weight, InsertionOrder++); in balanceSubTree() 2004 GA = WeightedLeaf(Child, Weight, InsertionOrder++); in balanceSubTree() [all …]
|
/dports/math/py-Pyomo/Pyomo-6.1.2/pyomo/core/base/ |
H A D | set.py | 1835 class InsertionOrder(object): pass class in Set 1837 _ValidOrderedAuguments = {True, False, InsertionOrder, SortedOrder} 1859 ordered = kwds.get('ordered', Set.InsertionOrder) 1861 ordered = Set.InsertionOrder 1880 if ordered is Set.InsertionOrder: 1888 if ordered is Set.InsertionOrder: 1902 if _ordered and _ordered is not Set.InsertionOrder \ 2219 kwds.setdefault('ordered', Set.InsertionOrder)
|