Searched refs:dist (Results 1 - 25 of 84) sorted by relevance

1234

/haiku-buildtools/gcc/gcc/testsuite/gfortran.dg/vect/
H A Dfast-math-pr33299.f904 REAL(8) :: f,dist(2) variable in program:test
5 dist = [1.0_8, 0.5_8]
6 if( f(1.0_8, dist) /= MINVAL(dist)) then
11 FUNCTION f( x, dist ) RESULT(s)
12 REAL(8) :: dist(2), x, s local in function:f
13 s = MINVAL(dist)
/haiku-buildtools/gcc/gcc/testsuite/g++.old-deja/g++.mike/
H A Dnet16.C8 int main() { S s; double dist = f (s); printf ("%g\n", dist); return 0; } local
/haiku-buildtools/gcc/gcc/testsuite/gcc.dg/graphite/
H A Dpr24309.c8 float dist; local
13 dist=dist+weight[j];
14 if (dist<0)
/haiku-buildtools/gcc/libstdc++-v3/testsuite/29_atomics/atomic/operators/
H A Dpointer_partial_void.cc36 ptrdiff_t __attribute__((unused)) dist(0);
44 dist = reinterpret_cast<char*>(vp2) - reinterpret_cast<char*>(vp3);
45 VERIFY ( std::abs(dist) == 1 );
51 dist = reinterpret_cast<char*>(vp4) - reinterpret_cast<char*>(vp5);
52 VERIFY ( std::abs(dist) == 1 );
58 dist = reinterpret_cast<char*>(vp6) - reinterpret_cast<char*>(vp7);
59 VERIFY ( std::abs(dist) == n );
65 dist = reinterpret_cast<char*>(vp8) - reinterpret_cast<char*>(vp9);
66 VERIFY ( std::abs(dist) == n );
H A D51811.cc46 ptrdiff_t dist = reinterpret_cast<char*>(vp) - reinterpret_cast<char*>(vp2); local
47 VERIFY ( std::abs(dist) == sizeof(value_type));
62 ptrdiff_t dist = reinterpret_cast<char*>(vp) - reinterpret_cast<char*>(vp2); local
63 VERIFY ( std::abs(dist) == sizeof(value_type));
76 ptrdiff_t dist = reinterpret_cast<char*>(vp) - reinterpret_cast<char*>(vp2); local
77 VERIFY ( std::abs(dist) == sizeof(value_type) * n);
86 ptrdiff_t dist = reinterpret_cast<char*>(vp) - reinterpret_cast<char*>(vp2); local
87 VERIFY ( std::abs(dist) == sizeof(value_type) * n);
/haiku-buildtools/gcc/libstdc++-v3/testsuite/26_numerics/random/negative_binomial_distribution/operators/
H A D58302.cc30 dist_type dist; local
33 dist(engine, param); // compile error!
/haiku-buildtools/gcc/gcc/testsuite/gcc.c-torture/compile/
H A D20071108-1.c9 int i, dist = 0; local
12 dist += (a[i] - b[i]) * (a[i] - b[i]);
13 return dist;
/haiku-buildtools/gcc/libstdc++-v3/testsuite/tr1/5_numerical_facilities/random/variate_generator/
H A D37986.cc28 std::tr1::uniform_real<double> dist; local
33 > g1(mt, dist);
38 > g2(mt, dist);
43 > g3(&mt, dist);
/haiku-buildtools/gcc/gcc/testsuite/gcc.target/i386/
H A Dpr34215.c9 void calc_score_dist (int mxdlen, long double d, long double **dist) argument
17 dist[i][scr2] *= pow (1.0 / d, i);
/haiku-buildtools/gcc/libstdc++-v3/testsuite/25_algorithms/push_heap/
H A Dcomplexity.cc38 std::uniform_int_distribution<int> dist; local
42 values.push_back(dist(dev));
45 values.push_back(dist(dev));
/haiku-buildtools/gcc/libstdc++-v3/testsuite/25_algorithms/make_heap/
H A Dcomplexity.cc35 std::uniform_int_distribution<int> dist; local
39 values.push_back(dist(dev));
/haiku-buildtools/gcc/libstdc++-v3/testsuite/25_algorithms/nth_element/
H A Drandom_test.cc43 auto dist = std::uniform_int_distribution<>(0, size); local
44 const int element = dist(rg);
/haiku-buildtools/gcc/libstdc++-v3/testsuite/25_algorithms/pop_heap/
H A Dcomplexity.cc38 std::uniform_int_distribution<int> dist; local
42 values.push_back(dist(dev));
/haiku-buildtools/gcc/libstdc++-v3/testsuite/25_algorithms/sort_heap/
H A Dcomplexity.cc37 std::uniform_int_distribution<int> dist; local
41 values.push_back(dist(dev));
/haiku-buildtools/gcc/libstdc++-v3/testsuite/25_algorithms/partial_sort/
H A Drandom_test.cc43 auto dist = std::uniform_int_distribution<>(0, size); local
44 const int element = dist(rg);
/haiku-buildtools/gcc/libstdc++-v3/testsuite/util/statistic/
H A Dresult_recorder.hpp89 size_t dist = std::distance(m_l.begin(), m_l.end()); local
91 dist, 0.1);
/haiku-buildtools/gcc/zlib/
H A Dinffast.c94 unsigned dist; /* match distance */ local
165 dist = (unsigned)(here.val);
175 dist += (unsigned)hold & ((1U << op) - 1);
177 if (dist > dmax) {
185 Tracevv((stderr, "inflate: distance %u\n", dist));
187 if (dist > op) { /* see if copy from window */
188 op = dist - op; /* distance back in window */
208 from = out - dist;
224 from = out - dist; /* rest from output */
242 from = out - dist; /* res
[all...]
H A Ddeflate.h297 int ZLIB_INTERNAL _tr_tally OF((deflate_state *s, unsigned dist, unsigned lc));
305 #define d_code(dist) \
306 ((dist) < 256 ? _dist_code[dist] : _dist_code[256+((dist)>>7)])
307 /* Mapping from a distance to a distance code. dist is the distance - 1 and
332 ush dist = (distance); \
333 s->d_buf[s->last_lit] = dist; \
335 dist--; \
337 s->dyn_dtree[d_code(dist)]
[all...]
/haiku-buildtools/gcc/libstdc++-v3/testsuite/ext/pb_ds/example/
H A Dpriority_queue_dijkstra.cc128 const size_t dist = r_v.second; local
132 << " is " << dist << endl;
141 const size_t pot_dist = dist + a_a_edge_legnth[node_id][neighbor_i];
/haiku-buildtools/binutils/zlib/
H A Dinffast.c94 unsigned dist; /* match distance */ local
165 dist = (unsigned)(here.val);
175 dist += (unsigned)hold & ((1U << op) - 1);
177 if (dist > dmax) {
185 Tracevv((stderr, "inflate: distance %u\n", dist));
187 if (dist > op) { /* see if copy from window */
188 op = dist - op; /* distance back in window */
208 from = out - dist;
224 from = out - dist; /* rest from output */
242 from = out - dist; /* res
[all...]
H A Ddeflate.h297 int ZLIB_INTERNAL _tr_tally OF((deflate_state *s, unsigned dist, unsigned lc));
305 #define d_code(dist) \
306 ((dist) < 256 ? _dist_code[dist] : _dist_code[256+((dist)>>7)])
307 /* Mapping from a distance to a distance code. dist is the distance - 1 and
332 ush dist = (distance); \
333 s->d_buf[s->last_lit] = dist; \
335 dist--; \
337 s->dyn_dtree[d_code(dist)]
[all...]
/haiku-buildtools/gcc/zlib/contrib/blast/
H A Dblast.c282 int dist; /* distance for copy */ local
333 dist = decode(s, &distcode) << symbol;
334 dist += bits(s, symbol);
335 dist++;
336 if (s->first && dist > s->next)
342 from = to - dist;
344 if (s->next < dist) {
346 copy = dist;
/haiku-buildtools/gcc/gcc/testsuite/go.test/test/fixedbugs/
H A Dbug283.go17 func dist(p0, p1 Point) float64 { func
/haiku-buildtools/gcc/libstdc++-v3/testsuite/25_algorithms/partial_sort_copy/
H A Drandom_test.cc44 auto dist = std::uniform_int_distribution<>(0, size); local
45 const int element = dist(rg);
/haiku-buildtools/binutils/zlib/contrib/blast/
H A Dblast.c284 unsigned dist; /* distance for copy */ local
335 dist = decode(s, &distcode) << symbol;
336 dist += bits(s, symbol);
337 dist++;
338 if (s->first && dist > s->next)
344 from = to - dist;
346 if (s->next < dist) {
348 copy = dist;

Completed in 281 milliseconds

1234