Home
last modified time | relevance | path

Searched +full:- +full:- +full:bins (Results 1 – 25 of 339) sorted by relevance

12345678910>>...14

/external/rust/crates/grpcio-sys/grpc/tools/interop_matrix/testcases/
Dcxx__v1.31.14 echo "Testing ${docker_image:=grpc_interop_cxx:f5a2f91d-342a-4bc8-a5ca-eb113dd3a8a2}"
5-i --rm=true -w /var/local/git/grpc --net=host $docker_image bash -c "bins/opt/interop_client --se…
6-i --rm=true -w /var/local/git/grpc --net=host $docker_image bash -c "bins/opt/interop_client --se…
7-i --rm=true -w /var/local/git/grpc --net=host $docker_image bash -c "bins/opt/interop_client --se…
8-i --rm=true -w /var/local/git/grpc --net=host $docker_image bash -c "bins/opt/interop_client --se…
9-i --rm=true -w /var/local/git/grpc --net=host $docker_image bash -c "bins/opt/interop_client --se…
10-i --rm=true -w /var/local/git/grpc --net=host $docker_image bash -c "bins/opt/interop_client --se…
11-i --rm=true -w /var/local/git/grpc --net=host $docker_image bash -c "bins/opt/interop_client --se…
12-i --rm=true -w /var/local/git/grpc --net=host $docker_image bash -c "bins/opt/interop_client --se…
13-i --rm=true -w /var/local/git/grpc --net=host $docker_image bash -c "bins/opt/interop_client --se…
[all …]
Dcxx__v1.0.12 echo "Testing ${docker_image:=grpc_interop_cxx:78de6f80-524d-4bc9-bfb2-f00c24ceafed}"
3-i --rm=true -w /var/local/git/grpc --net=host $docker_image bash -c "bins/opt/interop_client --se…
4-i --rm=true -w /var/local/git/grpc --net=host $docker_image bash -c "bins/opt/interop_client --se…
5-i --rm=true -w /var/local/git/grpc --net=host $docker_image bash -c "bins/opt/interop_client --se…
6-i --rm=true -w /var/local/git/grpc --net=host $docker_image bash -c "bins/opt/interop_client --se…
7-i --rm=true -w /var/local/git/grpc --net=host $docker_image bash -c "bins/opt/interop_client --se…
8-i --rm=true -w /var/local/git/grpc --net=host $docker_image bash -c "bins/opt/interop_client --se…
9-i --rm=true -w /var/local/git/grpc --net=host $docker_image bash -c "bins/opt/interop_client --se…
10-i --rm=true -w /var/local/git/grpc --net=host $docker_image bash -c "bins/opt/interop_client --se…
11-i --rm=true -w /var/local/git/grpc --net=host $docker_image bash -c "bins/opt/interop_client --se…
[all …]
/external/tensorflow/tensorflow/python/ops/
Dhistogram_ops_test.py7 # http://www.apache.org/licenses/LICENSE-2.0
31 # Bins will be:
32 # (-inf, 1), [1, 2), [2, 3), [3, 4), [4, inf)
37 bins = histogram_ops.histogram_fixed_width_bins(
39 self.assertEqual(dtypes.int32, bins.dtype)
40 self.assertAllClose(expected_bins, self.evaluate(bins))
43 # Bins will be:
44 # (-inf, 1), [1, 2), [2, 3), [3, 4), [4, inf)
46 values = [-1.0, 0.0, 1.5, 2.0, 5.0, 15]
49 bins = histogram_ops.histogram_fixed_width_bins(
[all …]
Dhistogram_ops.py7 # http://www.apache.org/licenses/LICENSE-2.0
15 # pylint: disable=g-short-docstring-punctuation
37 """Bins the given values for use in a histogram.
41 of `values` would be binned. The bins are equal width and
48 values >= value_range[1] will be mapped to hist[-1].
49 nbins: Scalar `int32 Tensor`. Number of histogram bins.
64 >>> # Bins will be: (-inf, 1), [1, 2), [2, 3), [3, 4), [4, inf)
68 >>> new_values = [-1.0, 0.0, 1.5, 2.0, 5.0, 15]
78 values = array_ops.reshape(values, [-1])
88 values - value_range[0],
[all …]
/external/grpc-grpc/tools/interop_matrix/testcases/
Dcxx__master2 echo "Testing ${docker_image:=grpc_interop_cxx:78de6f80-524d-4bc9-bfb2-f00c24ceafed}"
3-i --rm=true -w /var/local/git/grpc --net=host $docker_image bash -c "bins/opt/interop_client --se…
4-i --rm=true -w /var/local/git/grpc --net=host $docker_image bash -c "bins/opt/interop_client --se…
5-i --rm=true -w /var/local/git/grpc --net=host $docker_image bash -c "bins/opt/interop_client --se…
6-i --rm=true -w /var/local/git/grpc --net=host $docker_image bash -c "bins/opt/interop_client --se…
7-i --rm=true -w /var/local/git/grpc --net=host $docker_image bash -c "bins/opt/interop_client --se…
8-i --rm=true -w /var/local/git/grpc --net=host $docker_image bash -c "bins/opt/interop_client --se…
9-i --rm=true -w /var/local/git/grpc --net=host $docker_image bash -c "bins/opt/interop_client --se…
10-i --rm=true -w /var/local/git/grpc --net=host $docker_image bash -c "bins/opt/interop_client --se…
11-i --rm=true -w /var/local/git/grpc --net=host $docker_image bash -c "bins/opt/interop_client --se…
[all …]
/external/eigen/test/
Drand.cpp27 Array<int,1,Dynamic> mask(y-x+1); in check_all_in_range()
29 long n = (y-x+1)*32; in check_all_in_range()
32 mask( check_in_range(x,y)-x )++; in check_all_in_range()
40 template<typename Scalar> void check_histogram(Scalar x, Scalar y, int bins) in check_histogram() argument
42 Array<int,1,Dynamic> hist(bins); in check_histogram()
45 int n = bins*f; in check_histogram()
46 int64 range = int64(y)-int64(x); in check_histogram()
47 int divisor = int((range+1)/bins); in check_histogram()
48 assert(((range+1)%bins)==0); in check_histogram()
52 hist( int((int64(r)-int64(x))/divisor) )++; in check_histogram()
[all …]
/external/rust/crates/which/tests/
Dbasic.rs18 pub bins: Vec<PathBuf>, field
25 fn mk_bin(dir: &Path, path: &str, extension: &str) -> io::Result<PathBuf> { in mk_bin()
36 fn touch(dir: &Path, path: &str, extension: &str) -> io::Result<PathBuf> { in touch()
42 fn mk_bin(dir: &Path, path: &str, extension: &str) -> io::Result<PathBuf> { in mk_bin()
56 pub fn new() -> TestFixture { in new()
61 let mut bins = vec![]; in new() localVariable
65 bins.push(mk_bin(&p, BIN_NAME, "").unwrap()); in new()
66 bins.push(mk_bin(&p, BIN_NAME, "exe").unwrap()); in new()
67 bins.push(mk_bin(&p, BIN_NAME, "cmd").unwrap()); in new()
70 let p = tempdir.path().join("win-bin"); in new()
[all …]
/external/skia/tests/
DRandomTest.cpp4 * Use of this source code is governed by a BSD-style license that can be
18 // Min and max Anderson-Darling values allowable for k=32 in anderson_darling_test()
19 const double kADMin32 = 0.202; // p-value of ~0.1 in anderson_darling_test()
20 const double kADMax32 = 3.89; // p-value of ~0.99 in anderson_darling_test()
25 // and compute Anderson-Darling statistic to ensure these are uniform in anderson_darling_test()
28 double v = p[k]*(1.0 - p[31-k]); in anderson_darling_test()
29 if (v < 1.0e-30) { in anderson_darling_test()
30 v = 1.0e-30; in anderson_darling_test()
32 s += (2.0*(k+1)-1.0)*log(v); in anderson_darling_test()
34 double a2 = -32.0 - 0.03125*s; in anderson_darling_test()
[all …]
/external/OpenCL-CTS/test_conformance/atomics/
Dtest_indexed_cases.cpp8 // http://www.apache.org/licenses/LICENSE-2.0
19 // clang-format off
34 // clang-format on
64 return -1; in test_atomic_add_index()
68 return -1; in test_atomic_add_index()
81 // Reset all those locations to -1 to indciate they have not been used. in test_atomic_add_index()
91 memset(values, -1, numLocalThreads); in test_atomic_add_index()
93 for (i = 0; i < numGlobalThreads; i++) values[i] = -1; in test_atomic_add_index()
175 // clang-format off
178 …"// This test assigns a bunch of values to bins and then tries to put them in the bins in parallel…
[all …]
/external/webp/src/utils/
Dfilters_utils.c3 // Use of this source code is governed by a BSD-style license
8 // -----------------------------------------------------------------------------
18 // -----------------------------------------------------------------------------
22 #define SDIFF(a, b) (abs((a) - (b)) >> 4) // Scoring diff, in [0..SMAX)
25 const int g = a + b - c; in GradientPredictor()
32 int bins[WEBP_FILTER_LAST][SMAX]; in WebPEstimateBestFilter() local
33 memset(bins, 0, sizeof(bins)); in WebPEstimateBestFilter()
36 for (j = 2; j < height - 1; j += 2) { in WebPEstimateBestFilter()
39 for (i = 2; i < width - 1; i += 2) { in WebPEstimateBestFilter()
41 const int diff1 = SDIFF(p[i], p[i - 1]); in WebPEstimateBestFilter()
[all …]
/external/libdrm/nouveau/
Dbufctx.c52 struct nouveau_bufbin_priv bins[]; member
62 nouveau_bufctx_new(struct nouveau_client *client, int bins, in nouveau_bufctx_new() argument
67 priv = calloc(1, sizeof(*priv) + sizeof(priv->bins[0]) * bins); in nouveau_bufctx_new()
69 DRMINITLISTHEAD(&priv->base.head); in nouveau_bufctx_new()
70 DRMINITLISTHEAD(&priv->base.pending); in nouveau_bufctx_new()
71 DRMINITLISTHEAD(&priv->base.current); in nouveau_bufctx_new()
72 priv->base.client = client; in nouveau_bufctx_new()
73 priv->nr_bins = bins; in nouveau_bufctx_new()
74 *pbctx = &priv->base; in nouveau_bufctx_new()
78 return -ENOMEM; in nouveau_bufctx_new()
[all …]
/external/bcc/examples/lua/
Dkprobe-latency.lua1 #!/usr/bin/env bcc-lua
2 --[[
9 http://www.apache.org/licenses/LICENSE-2.0
17 -- This example program measures latency of block device operations and plots it
18 -- in a histogram. It is similar to BPF example:
19 -- https://github.com/torvalds/linux/blob/master/samples/bpf/tracex3_kern.c
24 -- Shared part of the program
25 local bins = 100
27 local lat_map = bpf.map('array', bins)
29 -- Kernel-space part of the program
[all …]
/external/musl/src/malloc/oldmalloc/
Dmalloc.c24 struct bin bins[64]; member
49 lock(mal.bins[i].lock); in lock_bin()
50 if (!mal.bins[i].head) in lock_bin()
51 mal.bins[i].head = mal.bins[i].tail = BIN_TO_CHUNK(i); in lock_bin()
56 unlock(mal.bins[i].lock); in unlock_bin()
78 return 32 + debruijn32[(y&-y)*0x076be629 >> 27]; in first_set()
80 return debruijn32[(y&-y)*0x076be629 >> 27]; in first_set()
82 return debruijn64[(x&-x)*0x022fdd63cc95386dull >> 58]; in first_set()
95 x = x / SIZE_ALIGN - 1; in bin_index()
97 if (x < 512) return bin_tab[x/8-4]; in bin_index()
[all …]
/external/apache-commons-math/src/main/java/org/apache/commons/math/random/
DEmpiricalDistributionImpl.java9 * http://www.apache.org/licenses/LICENSE-2.0
43 * <li>Divide the range from min-max into <code>binCount</code> "bins."</li>
45 * statistics (mean, std dev.) for each of the bins </li>
46 * <li>Divide the interval (0,1) into subintervals associated with the bins,
61 * @version $Revision: 1003886 $ $Date: 2010-10-02 23:04:44 +0200 (sam. 02 oct. 2010) $
68 /** List of SummaryStatistics objects characterizing the bins */
83 /** number of bins */
89 /** upper bounds of subintervals in (0,1) "belonging" to the bins */
106 * @param binCount number of bins
327 delta = (max - min)/(Double.valueOf(binCount)).doubleValue(); in fillBinStats()
[all …]
DEmpiricalDistribution.java9 * http://www.apache.org/licenses/LICENSE-2.0
30 * empirical probability distribution</a> -- a probability distribution derived
45 * generate random values "like" those in the input file -- i.e., the values
48 * @version $Revision: 817128 $ $Date: 2009-09-21 03:30:53 +0200 (lun. 21 sept. 2009) $
108 * Returns the number of bins.
110 * @return the number of bins
117 * containing statistics describing the values in each of the bins. The
125 * Returns the array of upper bounds for the bins. Bins are: <br/>
127 * (upperBounds[binCount-2], upperBounds[binCount-1] = max].
/external/libvpx/build/make/
DMakefile4 ## Use of this source code is governed by a BSD-style license
18 $(MAKE) --no-print-directory target=$$t $(MAKECMDGOALS) || exit $$?;\
25 test-no-data-check: .DEFAULT
28 exampletest-no-data-check utiltest-no-data-check: .DEFAULT
37 md5sum := $(if $(filter %openssl,$(md5sum)),$(md5sum) dgst -md5,$(md5sum))
39 TGT_CC:=$(word 3, $(subst -, ,$(TOOLCHAIN)))
42 $(MAKE) --no-print-directory target=$$t $(MAKECMDGOALS) || exit $$?;\
45 @if [ -d "$(DIST_DIR)/src" ]; then \
46 mkdir -p "$(DIST_DIR)/build"; \
52 @if [ -d "$(DIST_DIR)" ]; then \
[all …]
/external/iproute2/man/man8/
Dtc-sfb.83 sfb \- Stochastic Fair Blue
28 non-responsive flows (i.e. flows that do not react to congestion marking
41 (SFB) algorithm is designed to protect TCP flows against non-responsive flows.
43 This SFB implementation maintains 8 levels of 16 bins each for accounting.
44 Each flow is mapped into a bin of each level using a per-level hash value.
51 The marking probability is based on the minimum value of all bins a flow is
55 In this case, the flow is rate-limited to
61 Due to SFBs nature, it is possible for responsive flows to share all of its bins
62 with a non-responsive flow, causing the responsive flow to be misidentified as
63 being non-responsive.
[all …]
/external/jemalloc_new/include/jemalloc/internal/
Dtcache_structs.h11 * To minimize our cache-footprint, we put the frequently accessed data
20 * The pointer stacks associated with bins follow as a contiguous array.
33 * The descriptor lets the arena find our cache bins without seeing the
43 /* For small bins, fill (ncached_max >> lg_fill_div). */
46 * We put the cache bins for large size classes at the end of the
50 cache_bin_t bins_large[NSIZES-NBINS];
/external/jemalloc_new/src/
Dstats.c99 name->justify = emitter_justify_left; in mutex_stats_init_cols()
100 name->width = 21; in mutex_stats_init_cols()
101 name->type = emitter_type_title; in mutex_stats_init_cols()
102 name->str_val = table_name; in mutex_stats_init_cols()
111 col->justify = emitter_justify_right; \ in mutex_stats_init_cols()
112 col->width = WIDTH_##counter_type; \ in mutex_stats_init_cols()
113 col->type = emitter_type_title; \ in mutex_stats_init_cols()
114 col->str_val = human; in mutex_stats_init_cols()
127 col_name->str_val = name; in mutex_stats_read_global()
134 dst->type = EMITTER_TYPE_##counter_type; \ in mutex_stats_read_global()
[all …]
/external/autotest/client/site_tests/hardware_UnsafeMemory/src/rowhammer-test-4d619293e1c7/
DMakefile2 # Use of this source code is governed by a BSD-style license that can be
5 TMPDIR = `mktemp -d`
6 BINS = rowhammer_test macro
10 all: $(BINS)
13 $(CXX) -static $(CXXFLAGS) -o $@ $^
16 $(CXX) $(CXXFLAGS) -c $< -o $@
19 @rm $(BINS) $(OBJS) || true
/external/llvm/test/Analysis/ScalarEvolution/
Dtrip-count.ll1 ; RUN: opt < %s -analyze -scalar-evolution -scalar-evolution-max-iterations=0 | FileCheck %s
2 ; RUN: opt < %s -passes='print<scalar-evolution>' -disable-output 2>&1 | FileCheck %s
5 target datalayout = "e-m:e-i64:64-f80:128-n8:16:32:64-S128"
6 target triple = "x86_64-unknown-linux-gnu"
10 ; CHECK-LABEL: Determining loop execution counts for: @test1
11 ; CHECK: backedge-taken count is 10000
36 ; CHECK-LABEL: Classifying expressions for: @test2
37 ; CHECK: %iv = phi i32 [ -1, %entry ], [ %next.1, %for.inc.1 ]
38 ; CHECK-NEXT: --> {-1,+,2}<%preheader> U: full-set S: full-set Exits: 13
42 %bins = alloca [16 x i64], align 16
[all …]
/external/libaom/av1/encoder/
Dintra_mode_search_utils.h35 // Macro for computing the speed-preset dependent threshold which is used for
38 #define INTRA_RD_VAR_THRESH(X) (1.0 - (0.25 * (X)))
40 #define BINS 32 macro
42 0.450578f, 0.695518f, -0.717944f, -0.639894f,
43 -0.602019f, -0.453454f, 0.055857f, -0.465480f,
46 static const float av1_intra_hog_model_weights[BINS * DIRECTIONAL_MODES] = {
47 -3.076402f, -3.757063f, -3.275266f, -3.180665f, -3.452105f, -3.216593f,
48 -2.871212f, -3.134296f, -1.822324f, -2.401411f, -1.541016f, -1.195322f,
49 -0.434156f, 0.322868f, 2.260546f, 3.368715f, 3.989290f, 3.308487f,
50 2.277893f, 0.923793f, 0.026412f, -0.385174f, -0.718622f, -1.408867f,
[all …]
/external/autotest/client/cros/crash/crasher/
DMakefile2 # Use of this source code is governed by a BSD-style license that can be
5 BINS = crasher_nobreakpad macro
8 # Use a non-standard extension to avoid the AUTOTEST_MASK that intends to
10 TGZ = crasher.tgz-unmasked
15 $(TGZ): $(BINS)
17 rm -f $(BINS)
20 $(CXX) $(CXXFLAGS) -o $@ $^
23 $(CXX) $(CXXFLAGS) -c $< -o $@
/external/libcap/cap/
Dtext.go17 // Un-named capabilities are referred to numerically (in decimal).
51 func (c *Set) histo(bins []int, patterns []uint, from, limit Value) uint {
61 bins[x]++
69 t--
70 if bins[t] >= bins[m] {
90 bins := make([]int, 8)
98 m := c.histo(bins, patterns, 0, Value(maxValues))
103 i--
104 if i == m || bins[i] == 0 {
127 z = "-" + combos[cf]
[all …]
/external/mesa3d/src/gallium/drivers/freedreno/a6xx/
Dfd6_vsc.c35 * https://github.com/freedreno/freedreno/wiki/Visibility-Stream-Format
45 * https://github.com/freedreno/freedreno/wiki/Visibility-Stream-Format#numbers
52 return n + (n - 1); in number_size_bits()
57 * https://github.com/freedreno/freedreno/wiki/Visibility-Stream-Format#bitfields
69 unsigned vtx_per_prim = (info->mode == PIPE_PRIM_MAX) ? 2 : in prim_count()
70 u_vertices_per_prim(info->mode); in prim_count()
71 return (info->count * info->instance_count) / vtx_per_prim; in prim_count()
75 * The primitive stream uses a run-length encoding, where each packet contains a
76 * bitfield of bins covered and then the number of primitives which have the same
79 * - The (compressed) bitfield of bins covered
[all …]

12345678910>>...14