Home
last modified time | relevance | path

Searched +full:fill +full:- +full:range (Results 1 – 25 of 1182) sorted by relevance

12345678910>>...48

/external/bouncycastle/repackaged/bcprov/src/main/java/com/android/org/bouncycastle/util/encoders/
DUTF8.java5 * Utilities for working with UTF-8 encodings.
7 * Decoding of UTF-8 is based on a presentation by Bob Steagall at CppCon2018 (see
9 * recognize and decode multi-byte code points.
15 … static final byte C_ILL = 0; //- C0..C1, F5..FF ILLEGAL octets that should never appe…
16 private static final byte C_CR1 = 1; //- 80..8F Continuation range 1
17 private static final byte C_CR2 = 2; //- 90..9F Continuation range 2
18 private static final byte C_CR3 = 3; //- A0..BF Continuation range 3
19 …private static final byte C_L2A = 4; //- C2..DF Leading byte range A / 2-byte …
20 …private static final byte C_L3A = 5; //- E0 Leading byte range A / 3-byte …
21 …private static final byte C_L3B = 6; //- E1..EC, EE..EF Leading byte range B / 3-byte …
[all …]
/external/bouncycastle/repackaged_platform/bcprov/src/main/java/com/android/internal/org/bouncycastle/util/encoders/
DUTF8.java5 * Utilities for working with UTF-8 encodings.
7 * Decoding of UTF-8 is based on a presentation by Bob Steagall at CppCon2018 (see
9 * recognize and decode multi-byte code points.
15 … static final byte C_ILL = 0; //- C0..C1, F5..FF ILLEGAL octets that should never appe…
16 private static final byte C_CR1 = 1; //- 80..8F Continuation range 1
17 private static final byte C_CR2 = 2; //- 90..9F Continuation range 2
18 private static final byte C_CR3 = 3; //- A0..BF Continuation range 3
19 …private static final byte C_L2A = 4; //- C2..DF Leading byte range A / 2-byte …
20 …private static final byte C_L3A = 5; //- E0 Leading byte range A / 3-byte …
21 …private static final byte C_L3B = 6; //- E1..EC, EE..EF Leading byte range B / 3-byte …
[all …]
/external/bouncycastle/bcprov/src/main/java/org/bouncycastle/util/encoders/
DUTF8.java4 * Utilities for working with UTF-8 encodings.
6 * Decoding of UTF-8 is based on a presentation by Bob Steagall at CppCon2018 (see
8 * recognize and decode multi-byte code points.
13 … static final byte C_ILL = 0; //- C0..C1, F5..FF ILLEGAL octets that should never appe…
14 private static final byte C_CR1 = 1; //- 80..8F Continuation range 1
15 private static final byte C_CR2 = 2; //- 90..9F Continuation range 2
16 private static final byte C_CR3 = 3; //- A0..BF Continuation range 3
17 …private static final byte C_L2A = 4; //- C2..DF Leading byte range A / 2-byte …
18 …private static final byte C_L3A = 5; //- E0 Leading byte range A / 3-byte …
19 …private static final byte C_L3B = 6; //- E1..EC, EE..EF Leading byte range B / 3-byte …
[all …]
/external/sdv/vsomeip/third_party/boost/range/include/boost/range/algorithm/
Dfill.hpp7 // For more information, see http://www.boost.org/libs/range/
13 #include <boost/range/begin.hpp>
14 #include <boost/range/end.hpp>
15 #include <boost/range/concepts.hpp>
20 namespace range namespace
23 /// \brief template function fill
25 /// range-based version of the fill std algorithm
29 inline ForwardRange& fill(ForwardRange& rng, const Value& val) in fill() function
32 std::fill(boost::begin(rng), boost::end(rng), val); in fill()
38 inline const ForwardRange& fill(const ForwardRange& rng, const Value& val) in fill() function
[all …]
/external/cronet/third_party/libc++/src/test/std/algorithms/alg.modifying.operations/alg.fill/
Dranges.fill.pass.cpp1 //===----------------------------------------------------------------------===//
5 // SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
7 //===----------------------------------------------------------------------===//
14 // constexpr O ranges::fill(O first, S last, const T& value);
16 // constexpr borrowed_iterator_t<R> ranges::fill(R&& r, const T& value);
28 concept HasFillIt = requires(Iter iter, Sent sent) { std::ranges::fill(iter, sent, int{}); };
36 template <class Range>
37 concept HasFillR = requires(Range range) { std::ranges::fill(range, int{}); };
50 std::same_as<It> auto ret = std::ranges::fill(It(a), Sent(It(a + 3)), 1); in test_iterators()
56 auto range = std::ranges::subrange(It(a), Sent(It(a + 3))); in test_iterators() local
[all …]
Dpstl.fill.pass.cpp1 //===----------------------------------------------------------------------===//
5 // SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
7 //===----------------------------------------------------------------------===//
13 // UNSUPPORTED: libcpp-has-no-incomplete-pstl
16 // void fill(ExecutionPolicy&& exec,
27 EXECUTION_POLICY_SFINAE_TEST(fill);
38 std::fill(policy, Iter(std::begin(a)), Iter(std::end(a)), 33); in operator ()()
41 { // check that an empty range works in operator ()()
43 std::fill(policy, Iter(std::begin(a)), Iter(std::begin(a)), 33); in operator ()()
46 { // check that a one-element range works in operator ()()
[all …]
/external/python/cpython3/Tools/demo/
Dsortvisu.py8 - an array visualizer with methods that implement basic sorting
12 - a number of sorting algorithms (currently quicksort, insertion sort,
17 - and a ``driver'' class which can be used as a Grail applet or as a
18 stand-alone application.
37 self.frame.pack(fill=X)
61 for i in range(self.size):
90 elif self.speed == "single-step":
108 for i in range(self.size):
111 self.canvas.itemconfig(item, fill='red')
113 self.canvas.itemconfig(item, fill='orange')
[all …]
/external/python/cpython2/Demo/tkinter/guido/
Dsortvisu.py7 - an array visualizer with methods that implement basic sorting
11 - a number of sorting algorithms (currently quicksort, insertion sort,
16 - and a ``driver'' class which can be used as a Grail applet or as a
17 stand-alone application.
37 self.frame.pack(fill=X)
61 for i in range(self.size):
92 elif self.speed == "single-step":
110 for i in range(self.size):
113 item.item.config(fill='red')
115 item.item.config(fill='orange')
[all …]
Dsolitaire.py7 - No cute graphical images for the playing cards faces or backs.
8 - No scoring or timer.
9 - No undo.
10 - No option to turn 3 cards at a time.
11 - No keyboard shortcuts.
12 - Less fancy animation when you win.
13 - The determination of which stack you drag to is more relaxed.
41 # Constants determining the size and lay-out of cards and stacks. We
87 # Card values are 1-13. We also define symbolic names for the picture
94 ALLVALUES = range(1, 14) # (one more than the highest value)
[all …]
/external/openthread/src/core/common/
Drandom.hpp37 #include "openthread-core-config.h"
71 * Generates and returns a random value using a non-crypto Pseudo Random Number Generator.
82 * @param[out] aBuffer A pointer to a buffer to fill with the random bytes.
83 * @param[in] aSize Size of buffer (number of bytes to fill).
92 class NonCryptoPrng // A non-crypto Pseudo Random Number Generator (PRNG)
133 * Generates and returns a random `uint8_t` value within a given range `[aMin, aMax)`.
138 * @returns A random `uint8_t` value in the given range (i.e., aMin <= random value < aMax).
144 * Generates and returns a random `uint16_t` value within a given range `[aMin, aMax)`.
151 * @returns A random `uint16_t` value in the given range (i.e., aMin <= random value < aMax).
157 * Generates and returns a random `uint32_t` value within a given range `[aMin, aMax)`.
[all …]
/external/python/cpython3/Modules/_decimal/tests/
Dformathelper.py2 # Copyright (c) 2008-2012 Stefan Krah. All rights reserved.
29 # Generate PEP-3101 format strings.
42 "chinese", "chinese-simplified", "chinese-traditional", "czech", "danish",
43 "dutch", "belgian", "english", "australian", "canadian", "english-nz",
44 "english-uk", "english-us", "finnish", "french", "french-belgian",
45 "french-canadian", "french-swiss", "german", "german-austrian",
46 "german-swiss", "greek", "hungarian", "icelandic", "italian", "italian-swiss",
47 "japanese", "korean", "norwegian", "norwegian-bokmal", "norwegian-nynorsk",
48 "polish", "portuguese", "portuguese-brazil", "russian", "slovak", "spanish",
49 "spanish-mexican", "spanish-modern", "swedish", "turkish",
[all …]
/external/tensorflow/tensorflow/python/data/experimental/kernel_tests/
Ddense_to_ragged_batch_test.py7 # http://www.apache.org/licenses/LICENSE-2.0
41 return _make_scalar_ds(nrows).map(lambda x: array_ops.fill([x], x))
46 return _make_scalar_ds(nrows).map(lambda x: array_ops.fill([x, 2], x))
51 return _make_scalar_ds(nrows).map(lambda x: array_ops.fill([2, x], x))
56 return _make_scalar_ds(nrows).map(lambda x: array_ops.fill([2, 3], x))
62 lambda x: array_ops.fill([2, x, 3, 2*x, 4], x))
67 values = [[[i] * (i % 3) for i in range(j)] * (j % 3) for j in range(nrows)]
77 'shape=[x]': math_ops.range(x),
78 'shape=[x, 2]': array_ops.fill([x, 2], x),
79 'shape=[2, x]': array_ops.fill([2, x], x),
[all …]
/external/eigen/bench/perf_monitoring/resources/
Dchart_header.html5 …<meta charset='utf-8'> …
6-axis line,.nvd3 .nv-axis path{fill:none;shape-rendering:crispEdges}.nv-brush .extent,.nvd3 .backg…
9 …box-sizing: border-box; …
18 …font-size: 0; …
21 …clip-path: none; …
24fill: #333; …
26 ….nv-axislabel { …
27 …font-size: 16px !important; …
32 …pointer-events: visible; …
34 …@media (min-width: 768px) { …
/external/rust/crates/rand/src/
Drng.rs2 // Copyright 2013-2017 The Rust Project Developers.
4 // Licensed under the Apache License, Version 2.0 <LICENSE-APACHE or
5 // https://www.apache.org/licenses/LICENSE-2.0> or the MIT license
6 // <LICENSE-MIT or https://opensource.org/licenses/MIT>, at your
18 /// An automatically-implemented extension trait on [`RngCore`] providing high-level
28 /// - Since `Rng: RngCore` and every `RngCore` implements `Rng`, it makes no
30 /// - The `+ ?Sized` un-bounding allows functions to be called directly on
31 /// type-erased references; i.e. `foo(r)` where `r: &mut dyn RngCore`. Without
35 /// trade-offs. It allows the argument to be consumed directly without a `&mut`
37 /// on references (including type-erased references). Unfortunately within the
[all …]
/external/tensorflow/tensorflow/python/data/kernel_tests/
Dpadded_batch_test.py1 # -*- coding: utf-8 -*-
8 # http://www.apache.org/licenses/LICENSE-2.0
50 lambda x: array_ops.fill([x], x)).padded_batch(
57 for i in range(num_full_batches):
60 if padded_len is None or padded_len == -1:
63 for j in range(batch_size):
66 self.assertAllEqual(result[j, seq_len:], [0] * (padded_len - seq_len))
71 if padded_len is None or padded_len == -1:
74 for j in range(len(seq_lens) % batch_size):
77 self.assertAllEqual(result[j, seq_len:], [0] * (padded_len - seq_len))
[all …]
/external/openthread/third_party/mbedtls/repo/tests/suites/
Dtest_suite_bignum.misc.data1 MPI - Valid parameters
4 MPI - Invalid parameters
26 mpi_read_write_string:10:"-0":10:"0":100:0:0
29 mpi_read_write_string:16:"-0":16:"00":100:0:0
32 mpi_read_write_string:10:"-23":10:"-23":100:0:0
35 mpi_read_write_string:10:"-023":10:"-23":100:0:0
37 Base test mpi_read_write_string #3 (Negative hex -> decimal)
38 mpi_read_write_string:16:"-20":10:"-32":100:0:0
41 mpi_read_write_string:16:"-23":16:"-23":100:0:0
44 mpi_read_write_string:16:"-023":16:"-23":100:0:0
[all …]
/external/sdv/vsomeip/third_party/boost/range/test/algorithm_test/
Dfill.cpp1 // Boost.Range library
9 // For more information, see http://www.boost.org/libs/range/
11 #include <boost/range/algorithm/fill.hpp>
32 std::fill(reference.begin(), reference.end(), 1); in test_fill_impl()
35 boost::fill(target, 1); in test_fill_impl()
41 boost::fill(boost::make_iterator_range(target2), 1); in test_fill_impl()
81 = BOOST_TEST_SUITE( "RangeTestSuite.algorithm.fill" ); in init_unit_test_suite()
83 test->add( BOOST_TEST_CASE( &boost::test_fill ) ); in init_unit_test_suite()
/external/python/cpython2/Demo/turtle/
Dtdemo_fractalcurves.py2 """ turtle-example-suite:
6 This program draws two fractal-curve-designs:
8 (2) A combination of Koch-curves.
10 The CurvesTurtle class and the fractal-curve-
12 scripts for turtle-graphics.
21 # p. 96-98
27 self.hilbert(size, level - 1, -parity)
31 self.hilbert(size, level - 1, parity)
34 self.hilbert(size, level - 1, parity)
38 self.hilbert(size, level - 1, -parity)
[all …]
/external/antlr/runtime/ObjC/Framework/
DBufferedTokenStream.m40 @synthesize range;
52 - (BufferedTokenStream *) init
58 index = -1;
59 range = -1;
64 -(id) initWithTokenSource:(id<TokenSource>)aSource
70 index = -1;
71 range = -1;
76 - (id) copyWithZone:(NSZone *)aZone
86 copy.range = self.range;
90 - (void)dealloc
[all …]
/external/tensorflow/tensorflow/python/kernel_tests/variables/
Ddense_update_ops_no_tsan_test.py7 # http://www.apache.org/licenses/LICENSE-2.0
37 ones_t = array_ops.fill([1024, 1024], 1.0)
41 p, ones_t, use_locking=False) for _ in range(20)
67 ones_t = array_ops.fill([1024, 1024], float(1))
71 for i in range(1, 21)
94 # contain non-benign but known data races between the variable assignment and
102 zeros_t = array_ops.fill([1024, 1024], 0.0)
103 ones_t = array_ops.fill([1024, 1024], 1.0)
107 p, ones_t, use_locking=True) for _ in range(20)
132 zeros_t = array_ops.fill([1024, 1024], 0.0)
[all …]
/external/python/google-api-python-client/docs/dyn/
Dslides_v1.presentations.html8 font-weight: inherit;
9 font-style: inherit;
10 font-size: 100%;
11 font-family: inherit;
12 vertical-align: baseline;
16 font-size: 13px;
21 font-size: 26px;
22 margin-bottom: 1em;
26 font-size: 24px;
27 margin-bottom: 1em;
[all …]
Dslides_v1.presentations.pages.html8 font-weight: inherit;
9 font-style: inherit;
10 font-size: 100%;
11 font-family: inherit;
12 vertical-align: baseline;
16 font-size: 13px;
21 font-size: 26px;
22 margin-bottom: 1em;
26 font-size: 24px;
27 margin-bottom: 1em;
[all …]
/external/python/cpython2/Demo/curses/
Dlife.py2 # life.py -- A curses-based version of Conway's Game of Life.
7 # R : Fill the board randomly
31 display(update_board) -- If update_board is true, compute the
34 erase() -- clear the entire board
35 makeRandom() -- fill the board randomly
36 set(y,x) -- set the given cell to Live; doesn't refresh the screen
37 toggle(y,x) -- change the given cell from live to dead, or vice
44 scr -- curses screen object to use for display
45 char -- character used to render live cells (default: '*')
50 self.X, self.Y = X-2, Y-2-1
[all …]
/external/cronet/third_party/libc++/src/benchmarks/
Ddeque_iterator.bench.cpp1 //===----------------------------------------------------------------------===//
5 // SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
7 //===----------------------------------------------------------------------===//
16 benchmark->Arg(0) in run_sizes()
17 ->Arg(1) in run_sizes()
18 ->Arg(2) in run_sizes()
19 ->Arg(64) in run_sizes()
20 ->Arg(512) in run_sizes()
21 ->Arg(1024) in run_sizes()
22 ->Arg(4000) in run_sizes()
[all …]
/external/rust/crates/plotters/src/drawing/
Darea.rs15 use std::ops::Range;
33 ) -> impl Iterator<Item = Rect> + 'a { in split()
55 fn split_evenly(&self, (row, col): (usize, usize)) -> impl Iterator<Item = Rect> + '_ { in split_evenly()
56 fn compute_evenly_split(from: i32, to: i32, n: usize, idx: usize) -> i32 { in split_evenly()
57 let size = (to - from) as usize; in split_evenly()
75 ) -> impl Iterator<Item = Rect> { in split_grid()
108 /// Make the coordinate in the range of the rectangle
109 pub fn truncate(&self, p: (i32, i32)) -> (i32, i32) { in truncate()
116 /// 1. Layout specification - Split the parent drawing area into sub-drawing-areas
117 /// 2. Coordinate Translation - Allows guest coordinate system attached and used for drawing.
[all …]

12345678910>>...48