/dports/graphics/freeimage/FreeImage/Source/OpenEXR/Imath/ |
H A D | ImathLimits.h | 122 static T smallest(); 138 static char smallest() {return 1;} 149 static signed char smallest() {return 1;} 160 static unsigned char smallest() {return 1;} 171 static short smallest() {return 1;} 193 static int smallest() {return 1;} 204 static unsigned int smallest() {return 1;} 215 static long smallest() {return 1;} 226 static unsigned long smallest() {return 1;} 237 static float smallest() {return FLT_MIN;} [all …]
|
/dports/graphics/povray37/povray-3.7.0.10/libraries/ilmbase/Imath/ |
H A D | ImathLimits.h | 122 static T smallest(); 138 static char smallest() {return 1;} 149 static signed char smallest() {return 1;} 160 static unsigned char smallest() {return 1;} 171 static short smallest() {return 1;} 193 static int smallest() {return 1;} 204 static unsigned int smallest() {return 1;} 215 static long smallest() {return 1;} 226 static unsigned long smallest() {return 1;} 237 static float smallest() {return FLT_MIN;} [all …]
|
/dports/graphics/opencv/opencv-4.5.3/3rdparty/openexr/Imath/ |
H A D | ImathLimits.h | 122 static T smallest(); 138 static char smallest() {return 1;} 149 static signed char smallest() {return 1;} 160 static unsigned char smallest() {return 1;} 171 static short smallest() {return 1;} 193 static int smallest() {return 1;} 204 static unsigned int smallest() {return 1;} 215 static long smallest() {return 1;} 226 static unsigned long smallest() {return 1;} 237 static float smallest() {return FLT_MIN;} [all …]
|
/dports/net/rabbitmq/rabbitmq-server-3.9.11/deps/rabbit/src/ |
H A D | rabbit_fifo_index.erl | 9 smallest/1, 41 smallest = Smallest, 56 smallest = undefined, 59 State#?MODULE{data = Data, smallest = Next} 68 -spec smallest(state()) -> undefined | integer(). 69 smallest(#?MODULE{smallest = Smallest}) -> function 100 undefined = smallest(S0), 106 1 = smallest(S1), 110 1 = smallest(S2), 112 2 = smallest(S3), [all …]
|
/dports/math/vtk6/VTK-6.2.0/Common/DataModel/ |
H A D | vtkGeometricErrorMetric.cxx | 72 double smallest; in SetRelativeGeometricTolerance() local 76 if(length < smallest || smallest == 0.0) in SetRelativeGeometricTolerance() 78 smallest = length; in SetRelativeGeometricTolerance() 81 if(length < smallest || smallest == 0.0) in SetRelativeGeometricTolerance() 83 smallest = length; in SetRelativeGeometricTolerance() 86 if(length < smallest || smallest == 0.0) in SetRelativeGeometricTolerance() 88 smallest = length; in SetRelativeGeometricTolerance() 90 if(smallest == 0) in SetRelativeGeometricTolerance() 92 smallest = 1; in SetRelativeGeometricTolerance() 94 double tmp = value*smallest; in SetRelativeGeometricTolerance() [all …]
|
/dports/math/vtk8/VTK-8.2.0/Common/DataModel/ |
H A D | vtkGeometricErrorMetric.cxx | 70 double smallest; in SetRelativeGeometricTolerance() local 74 if(length < smallest || smallest == 0.0) in SetRelativeGeometricTolerance() 76 smallest = length; in SetRelativeGeometricTolerance() 79 if(length < smallest || smallest == 0.0) in SetRelativeGeometricTolerance() 81 smallest = length; in SetRelativeGeometricTolerance() 84 if(length < smallest || smallest == 0.0) in SetRelativeGeometricTolerance() 86 smallest = length; in SetRelativeGeometricTolerance() 88 if(smallest == 0) in SetRelativeGeometricTolerance() 90 smallest = 1; in SetRelativeGeometricTolerance() 92 double tmp = value*smallest; in SetRelativeGeometricTolerance() [all …]
|
/dports/math/vtk9/VTK-9.1.0/Common/DataModel/ |
H A D | vtkGeometricErrorMetric.cxx | 69 double smallest; in SetRelativeGeometricTolerance() local 73 if (length < smallest || smallest == 0.0) in SetRelativeGeometricTolerance() 75 smallest = length; in SetRelativeGeometricTolerance() 78 if (length < smallest || smallest == 0.0) in SetRelativeGeometricTolerance() 80 smallest = length; in SetRelativeGeometricTolerance() 83 if (length < smallest || smallest == 0.0) in SetRelativeGeometricTolerance() 85 smallest = length; in SetRelativeGeometricTolerance() 87 if (smallest == 0) in SetRelativeGeometricTolerance() 89 smallest = 1; in SetRelativeGeometricTolerance() 91 double tmp = value * smallest; in SetRelativeGeometricTolerance() [all …]
|
/dports/www/grafana8/grafana-8.3.6/vendor/github.com/cortexproject/cortex/tools/blocksconvert/builder/ |
H A D | heap.go | 14 smallest := ix 18 if left < length && less(left, smallest) { 19 smallest = left 22 if right < length && less(right, smallest) { 23 smallest = right 26 if smallest != ix { 27 swap(ix, smallest) 28 heapify(length, smallest, less, swap)
|
/dports/math/gfan/gfan0.6.2/src/ |
H A D | vektor.cpp | 128 int smallest=0x7fffffff; in normalizedLowLevel() local 135 if(vv<smallest)smallest=vv; in normalizedLowLevel() 139 if(-vv<smallest)smallest=-vv; in normalizedLowLevel() 143 if(smallest==1)goto returnv; in normalizedLowLevel() 146 a=gcdOfVectorCandidate(v,smallest); in normalizedLowLevel() 157 int smallest=0x7fffffff; in normalized() local 162 if(v[i]<smallest)smallest=v[i]; in normalized() 166 if(-(v[i])<smallest)smallest=-(v[i]); in normalized() 169 if(smallest==1)return v; in normalized() 172 int a=gcdOfVectorCandidate(v,smallest); in normalized()
|
/dports/math/gfanlib/gfan0.6.2/src/ |
H A D | vektor.cpp | 128 int smallest=0x7fffffff; in normalizedLowLevel() local 135 if(vv<smallest)smallest=vv; in normalizedLowLevel() 139 if(-vv<smallest)smallest=-vv; in normalizedLowLevel() 143 if(smallest==1)goto returnv; in normalizedLowLevel() 146 a=gcdOfVectorCandidate(v,smallest); in normalizedLowLevel() 157 int smallest=0x7fffffff; in normalized() local 162 if(v[i]<smallest)smallest=v[i]; in normalized() 166 if(-(v[i])<smallest)smallest=-(v[i]); in normalized() 169 if(smallest==1)return v; in normalized() 172 int a=gcdOfVectorCandidate(v,smallest); in normalized()
|
/dports/graphics/openshadinglanguage/OpenShadingLanguage-Release-1.11.15.0/src/include/OSL/Imathx/ |
H A D | ImathLimits.h | 130 IMATH_HOSTDEVICE static constexpr T smallest(); 146 IMATH_HOSTDEVICE static constexpr char smallest() {return 1;} 157 IMATH_HOSTDEVICE static constexpr signed char smallest() {return 1;} 168 IMATH_HOSTDEVICE static constexpr unsigned char smallest() {return 1;} 179 IMATH_HOSTDEVICE static constexpr short smallest() {return 1;} 201 IMATH_HOSTDEVICE static constexpr int smallest() {return 1;} 212 IMATH_HOSTDEVICE static constexpr unsigned int smallest() {return 1;} 223 IMATH_HOSTDEVICE static constexpr long smallest() {return 1;} 234 IMATH_HOSTDEVICE static constexpr unsigned long smallest() {return 1;} 245 IMATH_HOSTDEVICE static constexpr float smallest() {return FLT_MIN;} [all …]
|
/dports/graphics/py-openshadinglanguage/OpenShadingLanguage-Release-1.11.15.0/src/include/OSL/Imathx/ |
H A D | ImathLimits.h | 130 IMATH_HOSTDEVICE static constexpr T smallest(); 146 IMATH_HOSTDEVICE static constexpr char smallest() {return 1;} 157 IMATH_HOSTDEVICE static constexpr signed char smallest() {return 1;} 168 IMATH_HOSTDEVICE static constexpr unsigned char smallest() {return 1;} 179 IMATH_HOSTDEVICE static constexpr short smallest() {return 1;} 201 IMATH_HOSTDEVICE static constexpr int smallest() {return 1;} 212 IMATH_HOSTDEVICE static constexpr unsigned int smallest() {return 1;} 223 IMATH_HOSTDEVICE static constexpr long smallest() {return 1;} 234 IMATH_HOSTDEVICE static constexpr unsigned long smallest() {return 1;} 245 IMATH_HOSTDEVICE static constexpr float smallest() {return FLT_MIN;} [all …]
|
/dports/comms/libfec/fec-3.0.1/ |
H A D | peakval_av.c | 16 vector signed short smallest,largest; in peakval_av() local 18 smallest = (vector signed short){0}; in peakval_av() 27 smallest = vec_min(smallest,x); in peakval_av() 35 smallest = vec_min(smallest,x); in peakval_av() 45 smallest = vec_min(smallest,x); in peakval_av() 49 largest = vec_max(largest,vec_abs(smallest)); in peakval_av()
|
/dports/net/ooni-probe-cli/probe-cli-3.10.1/vendor/github.com/ooni/psiphon/oopsi/github.com/dgraph-io/badger/y/ |
H A D | iterator.go | 152 if cap(s.curKey) < len(smallest.Key()) { 156 copy(s.curKey, smallest.Key()) 215 smallest := s.h[0].itr 216 smallest.Next() 219 smallest = s.h[0].itr 220 if !smallest.Valid() { 226 smallest = s.h[0].itr 227 if smallest.Valid() { 231 smallest.Next() 234 if !smallest.Valid() { [all …]
|
/dports/net/ooni-mini/probe-engine-0.23.0/vendor/github.com/ooni/psiphon/oopsi/github.com/dgraph-io/badger/y/ |
H A D | iterator.go | 152 if cap(s.curKey) < len(smallest.Key()) { 156 copy(s.curKey, smallest.Key()) 215 smallest := s.h[0].itr 216 smallest.Next() 219 smallest = s.h[0].itr 220 if !smallest.Valid() { 226 smallest = s.h[0].itr 227 if smallest.Valid() { 231 smallest.Next() 234 if !smallest.Valid() { [all …]
|
/dports/graphics/opencv/opencv-4.5.3/contrib/modules/videostab/src/ |
H A D | fast_marching.cpp | 97 int l, r, smallest; in heapDown() local 102 smallest = idx; in heapDown() 104 if (l < size_ && narrowBand_[l] < narrowBand_[smallest]) smallest = l; in heapDown() 105 if (r < size_ && narrowBand_[r] < narrowBand_[smallest]) smallest = r; in heapDown() 107 if (smallest == idx) in heapDown() 111 std::swap(indexOf(narrowBand_[idx]), indexOf(narrowBand_[smallest])); in heapDown() 112 std::swap(narrowBand_[idx], narrowBand_[smallest]); in heapDown() 113 idx = smallest; in heapDown()
|
/dports/biology/artemis/artemis-17.0.1-11-g3e43d27e/uk/ac/sanger/artemis/io/ |
H A D | KeyVector.java | 70 int smallest; in mysort() local 75 smallest = i; in mysort() 78 if(((Key)get(j)).compareTo( (Key)get(smallest)) < 0) in mysort() 79 smallest = j; in mysort() 82 if (smallest != i) in mysort() 85 setElementAt (get(smallest), i); in mysort() 86 setElementAt (tmp, smallest); in mysort()
|
/dports/lang/fpc-utils/fpc-3.2.2/utils/sim_pasc/ |
H A D | sortlist.bdy | 25 /* 0. the list is not empty -> there must be a smallest one */ 28 /* 1. find (the pointer to) the smallest element */ 32 /* assume initially that first element is smallest */ 43 /* 2. move the smallest element to front */ 45 register struct SORT_STRUCT *smallest = *hsmall; 48 *hsmall = smallest->SORT_NEXT; 50 smallest->SORT_NEXT = *listhook; 51 *listhook = smallest; 54 /* 3. skip over smallest element */
|
/dports/lang/fpc-source/fpc-3.2.2/utils/sim_pasc/ |
H A D | sortlist.bdy | 25 /* 0. the list is not empty -> there must be a smallest one */ 28 /* 1. find (the pointer to) the smallest element */ 32 /* assume initially that first element is smallest */ 43 /* 2. move the smallest element to front */ 45 register struct SORT_STRUCT *smallest = *hsmall; 48 *hsmall = smallest->SORT_NEXT; 50 smallest->SORT_NEXT = *listhook; 51 *listhook = smallest; 54 /* 3. skip over smallest element */
|
/dports/math/vtk8/VTK-8.2.0/Filters/Modeling/ |
H A D | vtkDijkstraGraphInternals.h | 74 int smallest = -1; in Heapify() local 82 smallest = l; in Heapify() 86 smallest = i; in Heapify() 91 this->CumulativeWeights[ this->Heap[ smallest ] ] ) ) in Heapify() 93 smallest = r; in Heapify() 96 if ( smallest != i ) in Heapify() 100 this->Heap[ i ] = this->Heap[ smallest ]; in Heapify() 106 this->Heap[ smallest ] = t; in Heapify() 107 this->HeapIndices[ t ] = smallest; in Heapify() 109 this->Heapify( smallest ); in Heapify()
|
/dports/math/vtk9/VTK-9.1.0/Filters/Modeling/ |
H A D | vtkDijkstraGraphInternals.h | 67 int smallest = -1; in Heapify() local 74 smallest = l; in Heapify() 78 smallest = i; in Heapify() 82 (this->CumulativeWeights[this->Heap[r]] < this->CumulativeWeights[this->Heap[smallest]])) in Heapify() 84 smallest = r; in Heapify() 87 if (smallest != i) in Heapify() 91 this->Heap[i] = this->Heap[smallest]; in Heapify() 97 this->Heap[smallest] = t; in Heapify() 98 this->HeapIndices[t] = smallest; in Heapify() 100 this->Heapify(smallest); in Heapify()
|
/dports/math/vtk6/VTK-6.2.0/Filters/Modeling/ |
H A D | vtkDijkstraGraphInternals.h | 71 int smallest = -1; in Heapify() local 79 smallest = l; in Heapify() 83 smallest = i; in Heapify() 88 this->CumulativeWeights[ this->Heap[ smallest ] ] ) ) in Heapify() 90 smallest = r; in Heapify() 93 if ( smallest != i ) in Heapify() 97 this->Heap[ i ] = this->Heap[ smallest ]; in Heapify() 103 this->Heap[ smallest ] = t; in Heapify() 104 this->HeapIndices[ t ] = smallest; in Heapify() 106 this->Heapify( smallest ); in Heapify()
|
/dports/java/openjdk11/jdk11u-jdk-11.0.13-8-1/src/java.xml/share/classes/com/sun/org/apache/xalan/internal/xsltc/dom/ |
H A D | MultiValuedNodeHeapIterator.java | 186 final int smallest = _heap[0]._node; in next() local 187 if (smallest == END) { // iterator _heap[0] is done in next() 198 else if (smallest == _returnedLast) { // duplicate in next() 204 return returnNode(_returnedLast = smallest); in next() 245 for (int r, l, smallest;;) { in heapify() 247 smallest = l < _heapSize in heapify() 250 smallest = r; in heapify() 252 if (smallest != i) { in heapify() 253 final HeapNode temp = _heap[smallest]; in heapify() 254 _heap[smallest] = _heap[i]; in heapify() [all …]
|
/dports/java/openjdk13/jdk13u-jdk-13.0.10-1-1/src/java.xml/share/classes/com/sun/org/apache/xalan/internal/xsltc/dom/ |
H A D | MultiValuedNodeHeapIterator.java | 186 final int smallest = _heap[0]._node; in next() local 187 if (smallest == END) { // iterator _heap[0] is done in next() 198 else if (smallest == _returnedLast) { // duplicate in next() 204 return returnNode(_returnedLast = smallest); in next() 245 for (int r, l, smallest;;) { in heapify() 247 smallest = l < _heapSize in heapify() 250 smallest = r; in heapify() 252 if (smallest != i) { in heapify() 253 final HeapNode temp = _heap[smallest]; in heapify() 254 _heap[smallest] = _heap[i]; in heapify() [all …]
|
/dports/java/openjdk16/jdk16u-jdk-16.0.2-7-1/src/java.xml/share/classes/com/sun/org/apache/xalan/internal/xsltc/dom/ |
H A D | MultiValuedNodeHeapIterator.java | 186 final int smallest = _heap[0]._node; in next() local 187 if (smallest == END) { // iterator _heap[0] is done in next() 198 else if (smallest == _returnedLast) { // duplicate in next() 204 return returnNode(_returnedLast = smallest); in next() 245 for (int r, l, smallest;;) { in heapify() 247 smallest = l < _heapSize in heapify() 250 smallest = r; in heapify() 252 if (smallest != i) { in heapify() 253 final HeapNode temp = _heap[smallest]; in heapify() 254 _heap[smallest] = _heap[i]; in heapify() [all …]
|