Home
last modified time | relevance | path

Searched refs:mindim (Results 1 – 25 of 120) sorted by relevance

12345

/dports/misc/elki/elki-release0.7.1-1166-gfb1fffdf3/elki-core-api/src/main/java/de/lmu/ifi/dbs/elki/data/type/
H A DVectorTypeInformation.java67 protected final int mindim; field in VectorTypeInformation
84 assert (mindim <= maxdim); in VectorTypeInformation()
85 this.mindim = mindim; in VectorTypeInformation()
100 assert (mindim <= maxdim); in VectorTypeInformation()
101 this.mindim = mindim; in VectorTypeInformation()
115 if(this.mindim > othertype.mindim) { in isAssignableFromType()
130 return odim >= mindim && odim <= maxdim; in isAssignableFrom()
150 public int mindim() { in mindim() method in VectorTypeInformation
151 if(mindim < 0) { in mindim()
154 return mindim; in mindim()
[all …]
H A DVectorFieldTypeInformation.java54 return new VectorFieldTypeInformation<>(cls, mindim, maxdim); in typeRequest()
85 super(factory, serializer, mindim, maxdim); in VectorFieldTypeInformation()
119 private VectorFieldTypeInformation(Class<? super V> cls, int mindim, int maxdim) { in VectorFieldTypeInformation() argument
120 super(cls, mindim, maxdim); in VectorFieldTypeInformation()
144 return other.mindim == other.maxdim; in isAssignableFromType()
149 if(mindim != maxdim) { in getDimensionality()
152 return mindim; in getDimensionality()
158 if(mindim == maxdim) { in toString()
159 buf.append(",dim=").append(mindim); in toString()
163 if(mindim >= 0) { in toString()
[all …]
/dports/misc/elki/elki-release0.7.1-1166-gfb1fffdf3/elki-core-distance/src/main/java/de/lmu/ifi/dbs/elki/distance/distancefunction/minkowski/
H A DSquaredEuclideanDistanceFunction.java137 if(dim1 > mindim) { in distance()
138 agg += preNorm(v1, mindim, dim1); in distance()
140 else if(dim2 > mindim) { in distance()
153 if(dim1 > mindim) { in distance()
156 else if(dim2 > mindim) { in distance()
176 ? (v2 != null) ? preDistance(v1, v2, 0, mindim) : preDistanceVM(v1, mbr2, 0, mindim) // in minDist()
177 : (v2 != null) ? preDistanceVM(v2, mbr1, 0, mindim) : preDistanceMBR(mbr1, mbr2, 0, mindim); in minDist()
179 if(dim1 > mindim) { in minDist()
180 agg += (v1 != null) ? preNorm(v1, mindim, dim1) : preNormMBR(mbr1, mindim, dim1); in minDist()
183 if(dim2 > mindim) { in minDist()
[all …]
H A DEuclideanDistanceFunction.java118 if(dim1 > mindim) { in distance()
119 agg += preNorm(v1, mindim, dim1); in distance()
121 else if(dim2 > mindim) { in distance()
122 agg += preNorm(v2, mindim, dim2); in distance()
141 ? (v2 != null) ? preDistance(v1, v2, 0, mindim) : preDistanceVM(v1, mbr2, 0, mindim) // in minDist()
142 : (v2 != null) ? preDistanceVM(v2, mbr1, 0, mindim) : preDistanceMBR(mbr1, mbr2, 0, mindim); in minDist()
144 if(dim1 > mindim) { in minDist()
145 agg += (v1 != null) ? preNorm(v1, mindim, dim1) : preNormMBR(mbr1, mindim, dim1); in minDist()
148 if(dim2 > mindim) { in minDist()
149 agg += (v2 != null) ? preNorm(v2, mindim, dim2) : preNormMBR(mbr2, mindim, dim2); in minDist()
[all …]
H A DWeightedEuclideanDistanceFunction.java111 double agg = preDistance(v1, v2, 0, mindim); in distance()
112 if(dim1 > mindim) { in distance()
113 agg += preNorm(v1, mindim, dim1); in distance()
115 else if(dim2 > mindim) { in distance()
116 agg += preNorm(v2, mindim, dim2); in distance()
135 ? (v2 != null) ? preDistance(v1, v2, 0, mindim) : preDistanceVM(v1, mbr2, 0, mindim) // in minDist()
136 : (v2 != null) ? preDistanceVM(v2, mbr1, 0, mindim) : preDistanceMBR(mbr1, mbr2, 0, mindim); in minDist()
138 if(dim1 > mindim) { in minDist()
139 agg += (v1 != null) ? preNorm(v1, mindim, dim1) : preNormMBR(mbr1, mindim, dim1); in minDist()
142 if(dim2 > mindim) { in minDist()
[all …]
H A DManhattanDistanceFunction.java116 double agg = preDistance(v1, v2, 0, mindim); in distance()
117 if(dim1 > mindim) { in distance()
118 agg += preNorm(v1, mindim, dim1); in distance()
120 else if(dim2 > mindim) { in distance()
121 agg += preNorm(v2, mindim, dim2); in distance()
140 ? (v2 != null) ? preDistance(v1, v2, 0, mindim) : preDistanceVM(v1, mbr2, 0, mindim) // in minDist()
141 : (v2 != null) ? preDistanceVM(v2, mbr1, 0, mindim) : preDistanceMBR(mbr1, mbr2, 0, mindim); in minDist()
143 if(dim1 > mindim) { in minDist()
144 agg += (v1 != null) ? preNorm(v1, mindim, dim1) : preNormMBR(mbr1, mindim, dim1); in minDist()
147 if(dim2 > mindim) { in minDist()
[all …]
H A DWeightedManhattanDistanceFunction.java109 double agg = preDistance(v1, v2, 0, mindim); in distance()
110 if(dim1 > mindim) { in distance()
111 agg += preNorm(v1, mindim, dim1); in distance()
113 else if(dim2 > mindim) { in distance()
114 agg += preNorm(v2, mindim, dim2); in distance()
133 ? (v2 != null) ? preDistance(v1, v2, 0, mindim) : preDistanceVM(v1, mbr2, 0, mindim) // in minDist()
134 : (v2 != null) ? preDistanceVM(v2, mbr1, 0, mindim) : preDistanceMBR(mbr1, mbr2, 0, mindim); in minDist()
136 if(dim1 > mindim) { in minDist()
137 agg += (v1 != null) ? preNorm(v1, mindim, dim1) : preNormMBR(mbr1, mindim, dim1); in minDist()
140 if(dim2 > mindim) { in minDist()
[all …]
H A DMaximumDistanceFunction.java111 double agg = preDistance(v1, v2, 0, mindim); in distance()
112 if(dim1 > mindim) { in distance()
113 double b = preNorm(v1, mindim, dim1); in distance()
116 else if(dim2 > mindim) { in distance()
117 double b = preNorm(v2, mindim, dim2); in distance()
137 ? (v2 != null) ? preDistance(v1, v2, 0, mindim) : preDistanceVM(v1, mbr2, 0, mindim) // in minDist()
138 : (v2 != null) ? preDistanceVM(v2, mbr1, 0, mindim) : preDistanceMBR(mbr1, mbr2, 0, mindim); in minDist()
140 if(dim1 > mindim) { in minDist()
141 double b = (v1 != null) ? preNorm(v1, mindim, dim1) : preNormMBR(mbr1, mindim, dim1); in minDist()
145 if(dim2 > mindim) { in minDist()
[all …]
H A DWeightedMaximumDistanceFunction.java107 double agg = preDistance(v1, v2, 0, mindim);
108 if(dim1 > mindim) {
109 double b = preNorm(v1, mindim, dim1);
112 else if(dim2 > mindim) {
113 double b = preNorm(v2, mindim, dim2);
133 ? (v2 != null) ? preDistance(v1, v2, 0, mindim) : preDistanceVM(v1, mbr2, 0, mindim) //
134 : (v2 != null) ? preDistanceVM(v2, mbr1, 0, mindim) : preDistanceMBR(mbr1, mbr2, 0, mindim);
136 if(dim1 > mindim) {
137 double b = (v1 != null) ? preNorm(v1, mindim, dim1) : preNormMBR(mbr1, mindim, dim1);
141 if(dim2 > mindim) {
[all …]
H A DLPIntegerNormDistanceFunction.java169 double agg = preDistance(v1, v2, 0, mindim); in distance()
170 if(dim1 > mindim) { in distance()
171 agg += preNorm(v1, mindim, dim1); in distance()
173 else if(dim2 > mindim) { in distance()
174 agg += preNorm(v2, mindim, dim2); in distance()
193 ? (v2 != null) ? preDistance(v1, v2, 0, mindim) : preDistanceVM(v1, mbr2, 0, mindim) // in minDist()
194 : (v2 != null) ? preDistanceVM(v2, mbr1, 0, mindim) : preDistanceMBR(mbr1, mbr2, 0, mindim); in minDist()
196 if(dim1 > mindim) { in minDist()
197 agg += (v1 != null) ? preNorm(v1, mindim, dim1) : preNormMBR(mbr1, mindim, dim1); in minDist()
200 if(dim2 > mindim) { in minDist()
[all …]
H A DWeightedLPNormDistanceFunction.java125 double agg = preDistance(v1, v2, 0, mindim); in distance()
126 if(dim1 > mindim) { in distance()
127 agg += preNorm(v1, mindim, dim1); in distance()
129 else if(dim2 > mindim) { in distance()
130 agg += preNorm(v2, mindim, dim2); in distance()
149 ? (v2 != null) ? preDistance(v1, v2, 0, mindim) : preDistanceVM(v1, mbr2, 0, mindim) // in minDist()
150 : (v2 != null) ? preDistanceVM(v2, mbr1, 0, mindim) : preDistanceMBR(mbr1, mbr2, 0, mindim); in minDist()
152 if(dim1 > mindim) { in minDist()
153 agg += (v1 != null) ? preNorm(v1, mindim, dim1) : preNormMBR(mbr1, mindim, dim1); in minDist()
156 if(dim2 > mindim) { in minDist()
[all …]
H A DLPNormDistanceFunction.java178 double agg = preDistance(v1, v2, 0, mindim); in distance()
179 if(dim1 > mindim) { in distance()
180 agg += preNorm(v1, mindim, dim1); in distance()
182 else if(dim2 > mindim) { in distance()
183 agg += preNorm(v2, mindim, dim2); in distance()
202 ? (v2 != null) ? preDistance(v1, v2, 0, mindim) : preDistanceVM(v1, mbr2, 0, mindim) // in minDist()
203 : (v2 != null) ? preDistanceVM(v2, mbr1, 0, mindim) : preDistanceMBR(mbr1, mbr2, 0, mindim); in minDist()
205 if(dim1 > mindim) { in minDist()
206 agg += (v1 != null) ? preNorm(v1, mindim, dim1) : preNormMBR(mbr1, mindim, dim1); in minDist()
209 if(dim2 > mindim) { in minDist()
[all …]
/dports/graphics/box/box-0.4.0/libs/g/
H A Dbuffer.c43 for( buffer->dim = buffer->mindim; \
64 if (buffer->dim > buffer->mindim) { \
66 if (buffer->dim < buffer->mindim) \
67 buffer->dim = buffer->mindim; \
84 int buff_create(buff *buffer, short elsize, long mindim) { in buff_create() argument
85 if (elsize<1 || mindim<1) { in buff_create()
96 buffer->mindim = mindim; in buff_create()
123 int buff_recycle(buff *buffer, short elsize, long mindim) { in buff_recycle() argument
124 if ( (elsize<1) || (mindim<1) ) { in buff_recycle()
145 return buff_create(buffer, elsize, mindim); in buff_recycle()
[all …]
/dports/misc/elki/elki-release0.7.1-1166-gfb1fffdf3/elki-input/src/main/java/de/lmu/ifi/dbs/elki/datasource/parser/
H A DNumberVectorLabelParser.java91 protected int mindim, maxdim; field in NumberVectorLabelParser
191 mindim = Integer.MAX_VALUE; in initStream()
214 if(curdim > maxdim || mindim > curdim) { in nextEvent()
215 mindim = (curdim < mindim) ? curdim : mindim; in nextEvent()
251 meta.add(getTypeInformation(mindim, maxdim)); in buildMeta()
256 meta.add(getTypeInformation(mindim, maxdim)); in buildMeta()
335 if(mindim > maxdim) { in getTypeInformation()
338 if(mindim == maxdim) { in getTypeInformation()
341 colnames = new String[mindim]; in getTypeInformation()
343 for(int i = 0; i < mindim; i++) { in getTypeInformation()
[all …]
/dports/math/blaze/blaze-3.8/blaze/math/lapack/
H A Dgesvdx.h152 const size_t mindim( min( M, N ) );
243 const size_t mindim( min( M, N ) );
368 resize( *s, mindim, false ); in gesvdx()
584 utmp.reset( new ET[M*mindim] );
850 resize( *s, mindim, false ); in gesvdx()
851 resize( *U, M, mindim, false ); in gesvdx()
1355 resize( *s, mindim, false ); in gesvdx()
1356 resize( *V, mindim, N, false ); in gesvdx()
1914 resize( *s, mindim, false ); in gesvdx()
1915 resize( *U, M, mindim, false ); in gesvdx()
[all …]
/dports/math/vtk8/VTK-8.2.0/Common/DataModel/
H A DvtkOctreePointLocatorNode.cxx329 int mindim=0; in _GetDistance2ToBoundary() local
336 mindim = 0; in _GetDistance2ToBoundary()
340 mindim = 1; in _GetDistance2ToBoundary()
345 mindim = 2; in _GetDistance2ToBoundary()
350 mindim = 3; in _GetDistance2ToBoundary()
355 mindim = 4; in _GetDistance2ToBoundary()
360 mindim = 5; in _GetDistance2ToBoundary()
373 mindim = 0; in _GetDistance2ToBoundary()
381 mindim = 1; in _GetDistance2ToBoundary()
389 mindim = 2; in _GetDistance2ToBoundary()
[all …]
/dports/math/vtk9/VTK-9.1.0/Common/DataModel/
H A DvtkOctreePointLocatorNode.cxx345 int mindim = 0; in _GetDistance2ToBoundary() local
352 mindim = 0; in _GetDistance2ToBoundary()
356 mindim = 1; in _GetDistance2ToBoundary()
361 mindim = 2; in _GetDistance2ToBoundary()
366 mindim = 3; in _GetDistance2ToBoundary()
371 mindim = 4; in _GetDistance2ToBoundary()
376 mindim = 5; in _GetDistance2ToBoundary()
388 mindim = 0; in _GetDistance2ToBoundary()
395 mindim = 1; in _GetDistance2ToBoundary()
402 mindim = 2; in _GetDistance2ToBoundary()
[all …]
/dports/math/vtk6/VTK-6.2.0/Common/DataModel/
H A DvtkOctreePointLocatorNode.cxx329 int mindim=0; in _GetDistance2ToBoundary() local
336 mindim = 0; in _GetDistance2ToBoundary()
340 mindim = 1; in _GetDistance2ToBoundary()
345 mindim = 2; in _GetDistance2ToBoundary()
350 mindim = 3; in _GetDistance2ToBoundary()
355 mindim = 4; in _GetDistance2ToBoundary()
360 mindim = 5; in _GetDistance2ToBoundary()
373 mindim = 0; in _GetDistance2ToBoundary()
381 mindim = 1; in _GetDistance2ToBoundary()
389 mindim = 2; in _GetDistance2ToBoundary()
[all …]
/dports/math/cddlib/cddlib-0.94l/src/
H A Dallfaces.c60 dd_boolean FaceEnum(dd_MatrixPtr M, dd_rowset R, dd_rowset S, dd_boolean rip, dd_colrange mindim) in FaceEnum() argument
93 if (dim>mindim){ in FaceEnum()
103 FaceEnum(M, RR, SS, rip, mindim); in FaceEnum()
129 dd_colrange mindim; in main() local
166 scanf("%ld", &mindim); in main()
167 if (mindim>=M->colsize) mindim=M->colsize-1; in main()
168 printf("Minimum dimension is set to %ld.", mindim); in main()
171 FaceEnum(M, R, S, rip, mindim); in main()
/dports/misc/elki/elki-release0.7.1-1166-gfb1fffdf3/elki-core-distance/src/main/java/de/lmu/ifi/dbs/elki/distance/distancefunction/probabilistic/
H A DHellingerDistanceFunction.java132 final int mindim = dim1 < dim2 ? dim1 : dim2; in distance() local
134 for(int d = 0; d < mindim; d++) { in distance()
142 for(int d = mindim; d < dim1; d++) { in distance()
147 for(int d = mindim; d < dim2; d++) { in distance()
158 final int mindim = (dim1 < dim2) ? dim1 : dim2; in minDist() local
160 for(int d = 0; d < mindim; d++) { in minDist()
173 for(int d = mindim; d < dim1; d++) { in minDist()
178 for(int d = mindim; d < dim2; d++) { in minDist()
190 final int mindim = dim1 < dim2 ? dim1 : dim2; in similarity()
192 for(int d = 0; d < mindim; d++) { in similarity()
H A DChiSquaredDistanceFunction.java74 final int mindim = (dim1 < dim2) ? dim1 : dim2; in distance() local
76 for(int d = 0; d < mindim; d++) { in distance()
87 for(int d = mindim; d < dim1; d++) { in distance()
91 for(int d = mindim; d < dim2; d++) { in distance()
101 final int mindim = (dim1 < dim2) ? dim1 : dim2; in minDist() local
103 for(int d = 0; d < mindim; d++) { in minDist()
115 for(int d = mindim; d < dim1; d++) { in minDist()
127 for(int d = mindim; d < dim2; d++) { in minDist()
/dports/misc/elki/elki-release0.7.1-1166-gfb1fffdf3/elki-core-distance/src/main/java/de/lmu/ifi/dbs/elki/distance/distancefunction/
H A DCanberraDistanceFunction.java70 final int mindim = (dim1 < dim2) ? dim1 : dim2; in distance() local
72 for(int d = 0; d < mindim; d++) { in distance()
79 for(int d = mindim; d < dim1; d++) { in distance()
84 for(int d = mindim; d < dim2; d++) { in distance()
95 final int mindim = (dim1 < dim2) ? dim1 : dim2; in minDist() local
97 for(int d = 0; d < mindim; d++) { in minDist()
114 for(int d = mindim; d < dim1; d++) { in minDist()
119 for(int d = mindim; d < dim2; d++) { in minDist()
H A DClarkDistanceFunction.java71 final int mindim = (dim1 < dim2) ? dim1 : dim2; in distance() local
73 for(int d = 0; d < mindim; d++) { in distance()
81 for(int d = mindim; d < dim1; d++) { in distance()
86 for(int d = mindim; d < dim2; d++) { in distance()
97 final int mindim = (dim1 < dim2) ? dim1 : dim2; in minDist() local
99 for(int d = 0; d < mindim; d++) { in minDist()
119 for(int d = mindim; d < dim1; d++) { in minDist()
124 for(int d = mindim; d < dim2; d++) { in minDist()
/dports/science/gromacs/gromacs-2021.4/src/gromacs/linearalgebra/gmx_lapack/
H A Ddgetrf.cpp13 int mindim,jb; in F77_FUNC() local
24 mindim = (*m < *n) ? *m : *n; in F77_FUNC()
26 if(DGETRF_BLOCKSIZE>=mindim) { in F77_FUNC()
35 for(j=1;j<=mindim;j+=DGETRF_BLOCKSIZE) { in F77_FUNC()
36 jb = ( DGETRF_BLOCKSIZE < (mindim-j+1)) ? DGETRF_BLOCKSIZE : (mindim-j+1); in F77_FUNC()
H A Dsgetrf.cpp13 int mindim,jb; in F77_FUNC() local
24 mindim = (*m < *n) ? *m : *n; in F77_FUNC()
26 if(DGETRF_BLOCKSIZE>=mindim) { in F77_FUNC()
35 for(j=1;j<=mindim;j+=DGETRF_BLOCKSIZE) { in F77_FUNC()
36 jb = ( DGETRF_BLOCKSIZE < (mindim-j+1)) ? DGETRF_BLOCKSIZE : (mindim-j+1); in F77_FUNC()

12345