| /third_party/rust/crates/humantime/ |
| D | bulk.yaml | 1 minimum-bulk: v0.4.5
5 - file: Cargo.toml
6 block-start: ^\[package\]
7 block-end: ^\[.*\]
|
| /third_party/grpc/examples/python/flow_control/ |
| D | README.md | 1 ## Demo of Flow-Control mechanism in gRPC Python
2 …h flow-control by default and this example can be used to see this in action. [Read more about Flo…
6 1. The client sends a bulk amount of data(approx. 2 KB in each iteration) to the server in a stream…
7 2. The server applies back-pressure by delaying reading of the requests, which makes the client pau…
31 …, we want to use the smallest size for this example. 16384 (16kB) is the minimum value allowed by …
33 …<br>Bandwidth Delay Product (BDP) is the bandwidth of a network connection times its round-trip la…
35 2. The client then makes a bi-directional streaming call to the server, sending bulk amounts of dat…
40 * **grpc.http2.max_frame_size: 16384** - (Same reasoning as above)
41 * **grpc.http2.bdp_probe: 0** - (Same reasoning as above)
44 …s before starting to read requests. This is done intentionally to apply back-pressure on the clien…
[all …]
|
| /third_party/python/Doc/library/ |
| D | intro.rst | 1 .. _library-intro:
15 The library also contains built-in functions and exceptions --- objects that can
20 The bulk of the library, however, consists of a collection of modules. There are
32 This manual is organized "from the inside out:" it first describes the built-in
39 library. Of course, you don't *have* to read it like a novel --- you can also
45 :ref:`built-in-funcs`, as the remainder of the manual assumes familiarity with
63 * If an availability note contains both a minimum Kernel version and a minimum
68 .. _wasm-availability:
71 ---------------------
73 The `WebAssembly`_ platforms ``wasm32-emscripten`` (`Emscripten`_) and
[all …]
|
| /third_party/FreeBSD/sys/dev/usb/ |
| D | usb_dev.h | 1 /*-
2 * SPDX-License-Identifier: BSD-2-Clause
4 * Copyright (c) 2008-2023 Hans Petter Selasky
39 char src_path[32]; /* Source path - including terminating
41 char dst_path[32]; /* Destination path - including
48 * Private per-device information.
62 * The following structure defines a minimum re-implementation of the
74 * Private per-device and per-thread reference information
82 uint8_t is_usbfs; /* USB-FS is active */
120 usb_frlength_t bufsize; /* BULK and INTERRUPT buffer size */
|
| D | usb.h | 1 /*-
2 * SPDX-License-Identifier: BSD-2-Clause
71 * Minimum time a device needs to be powered down to go through a
96 /* Allow for marginal and non-conforming devices. */
116 * - USB config 0
117 * - USB interfaces
118 * - USB alternative interfaces
119 * - USB endpoints
121 * - USB config 1
122 * - USB interfaces
[all …]
|
| /third_party/skia/m133/src/gpu/graphite/geom/ |
| D | Transform.cpp | 4 * Use of this source code is governed by a BSD-style license that can be
28 // The (-tx,-ty) terms preserve the calculated values in (l,t,-r,-b) form so that the return in scale_translate_rect()
30 return rectVals * skvx::float4{sx,sy,sx,sy} + skvx::float4{tx,ty,-tx,-ty}; in scale_translate_rect()
42 // Which is not the case for general rect-stays-rect transforms in map_rect()
45 // Anti-diagonal matrix (90/270 rotation), so scale L+R by m10 and T+B by m01 and in map_rect()
66 // TODO: These maybe should go into SkM44, since bulk point mapping seems generally useful in map_points()
81 // no-persp, these are the singular values of [m00,m01][m10,m11], which is just the upper 2x2 in compute_svd()
85 float e = m00*m00 + m01*m01 - m10*m10 - m11*m11; in compute_svd()
89 // s2 >= 0, so (s1 - s2) <= (s1 + s2) so this always returns {min, max}. in compute_svd()
90 return {SkScalarSqrt(0.5f * (s1 - s2)), in compute_svd()
[all …]
|
| /third_party/libusb/libusb/libusb/ |
| D | libusb.h | 4 * Copyright © 2007-2008 Daniel Drake <dsd@gentoo.org>
6 * Copyright © 2012-2023 Nathan Hjelm <hjelmn@cs.unm.edu>
7 * Copyright © 2014-2020 Chris Dickens <christopher.a.dickens@gmail.com>
22 * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
30 /* Disable: warning C4200: nonstandard extension used : zero-sized array in struct/union */
53 #define LIBUSB_FLEXIBLE_ARRAY /* [] - valid C99 code */
55 #define LIBUSB_FLEXIBLE_ARRAY 0 /* [0] - non-standard, but usually working code */
110 * On non-Windows operating systems, this macro is defined as nothing. This
112 * cross-platform compatibility.
187 * Convert a 16-bit value from host-endian to little-endian format. On
[all …]
|
| /third_party/skia/m133/third_party/externals/harfbuzz/docs/ |
| D | usermanual-utilities.xml | 2 <!DOCTYPE book PUBLIC "-//OASIS//DTD DocBook XML V4.3//EN"
3 "http://www.oasis-open.org/docbook/xml/4.3/docbookx.dtd" [
11 main APIs. These include a set of command-line tools, a set of
12 lower-level APIs for common data types that may be of interest to
16 <section id="utilities-command-line-tools">
17 <title>Command-line tools</title>
19 HarfBuzz include three command-line tools:
20 <command>hb-shape</command>, <command>hb-view</command>, and
21 <command>hb-subset</command>. They can be used to examine
26 <section id="utilities-command-line-hbshape">
[all …]
|
| /third_party/skia/third_party/externals/harfbuzz/docs/ |
| D | usermanual-utilities.xml | 2 <!DOCTYPE book PUBLIC "-//OASIS//DTD DocBook XML V4.3//EN"
3 "http://www.oasis-open.org/docbook/xml/4.3/docbookx.dtd" [
11 main APIs. These include a set of command-line tools, a set of
12 lower-level APIs for common data types that may be of interest to
16 <section id="utilities-command-line-tools">
17 <title>Command-line tools</title>
19 HarfBuzz include three command-line tools:
20 <command>hb-shape</command>, <command>hb-view</command>, and
21 <command>hb-subset</command>. They can be used to examine
26 <section id="utilities-command-line-hbshape">
[all …]
|
| /third_party/mesa3d/src/gallium/drivers/llvmpipe/ |
| D | lp_scene.h | 20 * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NON-INFRINGEMENT.
30 * Binner data structures and bin-related functions.
46 * Will need a 64-bit version for larger framebuffers.
72 /* switch to a non-pointer value for this:
105 * This stores bulk data which is used for all memory allocations
109 * the per-tile bins will point to chunks of data in this structure.
137 * Per-bin data goes into the 'tile' bins.
140 * When there are multiple threads, will want to double-buffer between
154 /* Framebuffer mappings - valid only between begin_rasterization()
159 /* The amount of layers in the fb (minimum of all attachments) */
[all …]
|
| /third_party/vk-gl-cts/external/vulkan-docs/src/proposals/ |
| D | VK_QCOM_image_processing.adoc | 1 // Copyright 2021-2024 The Khronos Group Inc.
3 // SPDX-License-Identifier: CC-BY-4.0
7 :refpage: https://registry.khronos.org/vulkan/specs/1.3-extensions/man/html/
11 This document proposes a new extension that adds shader built-in functions and
16 GPUs commonly process images for a wide range of use-cases. These include enhancement
17 of externally sourced images (i.e., camera image enhancement), post processing of GPU-rendered
18 game content, image scaling, and image analysis (i.e., motion vector generation). For common use-c…
19 the existing texture built-ins combined with bilinear/bicubic filtering work well. In other cases,
20 higher-order filtering kernels or advanced image algorithms are required.
23 built-in functions, it requires many round-trips between the texture unit and shader unit.
[all …]
|
| /third_party/skia/third_party/externals/libwebp/src/utils/ |
| D | quant_levels_dec_utils.c | 3 // Use of this source code is governed by a BSD-style license
8 // -----------------------------------------------------------------------------
12 // than the minimum distance between two quantized level).
25 #define FIX 16 // fix-point precision for averaging
26 #define LFIX 2 // extra precision for look-up table
27 #define LUT_SIZE ((1 << (8 + LFIX)) - 1) // look-up table size
35 { 0, 8, 2, 10 }, // coefficients are in DFIX fixed-point precision
69 int16_t* correction_; // size = 1 + 2*LUT_SIZE -> ~4k memory
72 //------------------------------------------------------------------------------
82 const uint8_t* src = p->src_; in VFilter()
[all …]
|
| /third_party/skia/m133/third_party/externals/libwebp/src/utils/ |
| D | quant_levels_dec_utils.c | 3 // Use of this source code is governed by a BSD-style license
8 // -----------------------------------------------------------------------------
12 // than the minimum distance between two quantized level).
25 #define FIX 16 // fix-point precision for averaging
26 #define LFIX 2 // extra precision for look-up table
27 #define LUT_SIZE ((1 << (8 + LFIX)) - 1) // look-up table size
35 { 0, 8, 2, 10 }, // coefficients are in DFIX fixed-point precision
69 int16_t* correction_; // size = 1 + 2*LUT_SIZE -> ~4k memory
72 //------------------------------------------------------------------------------
82 const uint8_t* src = p->src_; in VFilter()
[all …]
|
| /third_party/backends/backend/pixma/ |
| D | pixma_bjnp_private.h | 1 /* SANE - Scanner Access Now Easy.
16 This file is subject to the Apple OS-Developed Software exception.
83 #define BJNP_TIMEOUT_DEFAULT 10000 /* minimum timeout value for network operations */
105 #define BJNP_RESTART_POLL -1
141 {PROTOCOL_NONE, -1, NULL, NULL, SANE_FALSE}
263 unsigned char result[4]; /* unknown stuff, result[2] = 80 -> status is available*/
305 BJNP_PAPER_UNKNOWN = -1,
365 /* TCP bulk read state information */
373 /* mac-address, used as device serial no */
374 bjnp_sockaddr_t * addr; /* ip-address of the scanner */
[all …]
|
| /third_party/lz4/lib/ |
| D | lz4frame.h | 2 LZ4F - LZ4-Frame library
4 Copyright (C) 2011-2020, Yann Collet.
5 BSD 2-Clause License (http://www.opensource.org/licenses/bsd-license.php)
31 - LZ4 source repository : https://github.com/lz4/lz4
32 - LZ4 public forum : https://groups.google.com/forum/#!forum/lz4c
35 /* LZ4F is a stand-alone API able to create and decode LZ4 frames
52 /* --- Dependency --- */
64 /*-***************************************************************
91 # define LZ4F_DEPRECATE(x) x /* __declspec(deprecated) x - only works with C++ */
100 /*-************************************
[all …]
|
| /third_party/benchmark/src/ |
| D | benchmark.cc | 7 // http://www.apache.org/licenses/LICENSE-2.0
71 // or a minimum number of seconds (specified as `<float>s`). If the latter
78 // For cpu-time based tests, this is the lower bound
80 // real-time based tests, this is the lower bound on the elapsed time of the
84 // Minimum number of seconds a benchmark should be run before results should be
133 // information about libpfm: https://man7.org/linux/man-pages/man3/libpfm.3.html
136 // Extra context to include in the output formatted as comma-separated key-value
188 perf_counters_measurement_->names()) { in State()
195 // currently provide well-defined behavior as an extension (which is in State()
204 #pragma GCC diagnostic ignored "-Winvalid-offsetof" in State()
[all …]
|
| /third_party/backends/backend/ |
| D | artec_eplus48u.h | 31 /* calculate the minimum/maximum values */
57 if ((dev)->fd == -1) \
67 if (!(dev)->active) \
115 /** Artec48U analog front-end (AFE) parameters.
183 * These parameters describe a low-level scan request; many such requests are
186 * scan to find the home position is always done at 300dpi 8-bit mono with
187 * fixed width and height, regardless of the high-level scan parameters.
205 /** Parameters for the high-level scan request.
249 Artec48U_Device *dev; /**< Low-level interface object */
317 * - #SANE_STATUS_GOOD - the device object was created.
[all …]
|
| /third_party/lz4/doc/ |
| D | lz4frame_manual.html | 3 <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
22 <li><a href="#Chapter12">Bulk processing dictionary compression</a></li>
84 …LZ4F_contentChecksum_t contentChecksumFlag; </b>/* 1: add a 32-bit checksum of frame's decompresse…
85 …LZ4F_frameType_t frameType; </b>/* read-only field : LZ4F_frame or LZ4F_skippableF…
114 </b><p> Compress srcBuffer content into an LZ4-compressed frame.
121 consider compiling `lz4frame.c` with compile-time macro LZ4F_HEAPMODE set to 1 instead.
185 </b><p> Provides minimum dstCapacity required to guarantee success of
190 if the output buffer is gradually filled up instead of emptied and re-used from its start,
195 …includes the possibility that internal buffer might already be filled by up to (blockSize-1) bytes.
209 After an error, the state is left in a UB state, and must be re-initialized or freed.
[all …]
|
| /third_party/skia/src/gpu/ |
| D | GrDrawOpAtlas.h | 4 * Use of this source code is governed by a BSD-style license that can be
118 // AtlasLocator handles atlas position information. It keeps a left-top, right-bottom pair of
121 // that width = fUVs[2] - fUVs[0]; the page encoding in the top bits subtracts to zero.
148 return fUVs[2] - fUVs[0]; in width()
152 return fUVs[3] - fUVs[1]; in height()
156 SkASSERT(2 * padding <= this->width()); in insetSrc()
157 SkASSERT(2 * padding <= this->height()); in insetSrc()
161 fUVs[2] -= padding; in insetSrc()
162 fUVs[3] -= padding; in insetSrc()
170 // high 2bit save in x-axis(fUVs[0],fUVs[2]),low 2bit save in y-axis(fUVs[1],fUVs[3]) in updatePlotLocator()
[all …]
|
| /third_party/rust/rust/library/alloc/src/ |
| D | raw_vec.rs | 28 /// A low-level utility for more ergonomically allocating, reallocating, and deallocating
33 /// * Produces `Unique::dangling()` on zero-sized types.
34 /// * Produces `Unique::dangling()` on zero-length allocations.
37 /// * Guards against 32-bit systems allocating more than isize::MAX bytes.
47 /// Note that the excess of a zero-sized types is always infinite, so `capacity()` always returns
48 /// `usize::MAX`. This means that you need to be careful when round-tripping this type with a
62 /// that would truly const-call something unstable.
67 /// `RawVec` with capacity `0`. If `T` is zero-sized, then it makes a
71 pub const fn new() -> Self { in new()
78 /// zero-sized. Note that if `T` is zero-sized this means you will
[all …]
|
| /third_party/openssl/crypto/pem/ |
| D | pem_lib.c | 2 * Copyright 1995-2023 The OpenSSL Project Authors. All Rights Reserved.
55 * We assume that for encryption, we want a minimum length, while for in PEM_def_callback()
56 * decryption, we cannot know any minimum length, so we assume zero. in PEM_def_callback()
64 return -1; in PEM_def_callback()
77 str = "MIC-CLEAR"; in PEM_proc_type()
79 str = "MIC-ONLY"; in PEM_proc_type()
81 str = "BAD-TYPE"; in PEM_proc_type()
83 BIO_snprintf(p, PEM_BUFSIZE - (size_t)(p - buf), "Proc-Type: 4,%s\n", str); in PEM_proc_type()
90 int j = PEM_BUFSIZE - (size_t)(p - buf), n; in PEM_dek_info()
92 n = BIO_snprintf(p, j, "DEK-Info: %s,", type); in PEM_dek_info()
[all …]
|
| /third_party/icu/icu4c/source/samples/ucnv/ |
| D | convsamp.cpp | 9 * Copyright (C) 2000-2016, International Business Machines
14 * encoding: ASCII (7-bit)
99 int32_t len = -1 ) in printUChars()
103 if( (len == -1) && (uch) ) { in printUChars()
109 printf("%-6d ", i); in printUChars()
128 int32_t len = -1 ) in printBytes()
132 if( (len == -1) && (uch) ) { in printBytes()
138 printf("%-4d ", i); in printBytes()
172 followed by an exclamation mark (!) into the KOI8-R Russian code page.
181 same value in both KOI8-R and Unicode.
[all …]
|
| /third_party/skia/third_party/externals/icu/source/samples/ucnv/ |
| D | convsamp.cpp | 9 * Copyright (C) 2000-2016, International Business Machines
14 * encoding: ASCII (7-bit)
99 int32_t len = -1 ) in printUChars()
103 if( (len == -1) && (uch) ) { in printUChars()
109 printf("%-6d ", i); in printUChars()
128 int32_t len = -1 ) in printBytes()
132 if( (len == -1) && (uch) ) { in printBytes()
138 printf("%-4d ", i); in printBytes()
172 followed by an exclamation mark (!) into the KOI8-R Russian code page.
181 same value in both KOI8-R and Unicode.
[all …]
|
| /third_party/skia/m133/third_party/externals/icu/source/samples/ucnv/ |
| D | convsamp.cpp | 9 * Copyright (C) 2000-2016, International Business Machines
14 * encoding: ASCII (7-bit)
99 int32_t len = -1 ) in printUChars()
103 if( (len == -1) && (uch) ) { in printUChars()
109 printf("%-6d ", i); in printUChars()
128 int32_t len = -1 ) in printBytes()
132 if( (len == -1) && (uch) ) { in printBytes()
138 printf("%-4d ", i); in printBytes()
172 followed by an exclamation mark (!) into the KOI8-R Russian code page.
181 same value in both KOI8-R and Unicode.
[all …]
|
| /third_party/rust/rust/library/std/src/collections/ |
| D | mod.rs | 25 //! These are fairly high-level and quick break-downs of when each collection
36 //! * You want a heap-allocated array.
42 //! * You want a double-ended queue (deque).
58 //! * You want to be able to get a range of entries on-demand.
59 //! * You're interested in what the smallest or largest key-value pair is.
101 //! |----------------|------------------------|-------------------------|------------------------|-…
102 …`] | *O*(1) | *O*(*n*-*i*)* | *O*(*n*-*i*) | *O*(*m*)* …
103 … | *O*(1) | *O*(min(*i*, *n*-*i*))* | *O*(min(*i*, *n*-*i*)) | *O*(*m*)* | *O*(min…
104 …`LinkedList`] | *O*(min(*i*, *n*-*i*)) | *O*(min(*i*, *n*-*i*)) | *O*(min(*i*, *n*-*i*)) | *O*(1)…
114 //! |--------------|---------------|---------------|---------------|---------------|--------------|
[all …]
|