Home
last modified time | relevance | path

Searched +full:copy +full:- +full:item (Results 1 – 25 of 1077) sorted by relevance

12345678910>>...44

/external/icu/icu4c/packaging/
Ddistrelease.ps13 #-------------------------
6 # Date: 2017-04-14
7 #-------------------------
9 # This builds a zipfile containing the 64-bit (x64) and/or 32-bit (x86) Windows binaries.
15 # Set-ExecutionPolicy -Scope Process Unrestricted
16 # .\packaging\distrelease.ps1 -arch "x64 or x86 or ARM64"
18 # Will emit: c:\icu4c\icu\source\dist\icu-windows.zip
22 …wershell.core/about/about_execution_policies?view=powershell-5.1&viewFallbackFrom=powershell-Micro…
29 $icuDir = Split-Path -Path $MyInvocation.MyCommand.Definition -Parent
30 $icuDir = Resolve-Path -Path '$icuDir\..'
[all …]
/external/ImageMagick/.github/workflows/
Drelease.yml5 - main
7 - 'ChangeLog'
12 name: 'Windows ${{matrix.quantum}}${{matrix.hdri_flag}}-${{matrix.platform}} (${{matrix.type}})'
13 runs-on: windows-latest
16 fail-fast: false
23 - quantum: Q8
26 - platform: x64
29 - platform: x86
32 - type: dll
34 - type: static
[all …]
/external/rust/crates/criterion/src/stats/
Dtuple.rs8 type Distributions: TupledDistributions<Item = Self>;
11 type Builder: TupledDistributionsBuilder<Item = Self>;
17 type Item: Tuple<Distributions = Self>; typedef
23 type Item: Tuple<Builder = Self>; typedef
26 fn new(size: usize) -> Self; in new()
29 fn push(&mut self, tuple: Self::Item); in push() argument
35 fn complete(self) -> <Self::Item as Tuple>::Distributions; in complete()
40 A: Copy,
48 A: Copy,
50 type Item = (A,); typedef
[all …]
/external/protobuf/csharp/src/Google.Protobuf/Collections/
DRepeatedField.cs2 // Protocol Buffers - Google's data interchange format
4 // https://developers.google.com/protocol-buffers/
68 /// bytes, both of which are immutable) and so a simple copy is
102 // Non-nullable value types can be packed or not. in AddEntriesFrom()
115 // Empty packed field. Odd, but valid - just ignore. in AddEntriesFrom()
226 Array.Copy(array, 0, tmp, 0, array.Length); in EnsureSize()
232 /// Adds the specified item to the collection.
234 /// <param name="item">The item to add.</param>
235 public void Add(T item) in Add() argument
237 ProtoPreconditions.CheckNotNullUnconstrained(item, nameof(item)); in Add()
[all …]
/external/webrtc/sdk/objc/api/peerconnection/
DRTCStatisticsReport.mm4 * Use of this source code is governed by a BSD-style license
21 if (member->is_defined()) {
22 switch (member->type()) {
24 return [NSNumber numberWithBool:*member->cast_to<RTCStatsMember<bool>>()];
26 return [NSNumber numberWithInt:*member->cast_to<RTCStatsMember<int32_t>>()];
28 return [NSNumber numberWithUnsignedInt:*member->cast_to<RTCStatsMember<uint32_t>>()];
30 return [NSNumber numberWithLong:*member->cast_to<RTCStatsMember<int64_t>>()];
32 return [NSNumber numberWithUnsignedLong:*member->cast_to<RTCStatsMember<uint64_t>>()];
34 return [NSNumber numberWithDouble:*member->cast_to<RTCStatsMember<double>>()];
36 return [NSString stringForStdString:*member->cast_to<RTCStatsMember<std::string>>()];
[all …]
/external/rust/crates/rayon/src/iter/
Dextend.rs15 F: FnOnce(&mut C, &LinkedList<Vec<I::Item>>), in extend() argument
16 C: Extend<I::Item>, in extend() argument
25 pub(super) fn collect<I>(par_iter: I) -> LinkedList<Vec<I::Item>> in collect()
36 fn vec_push<T>(mut vec: Vec<T>, elem: T) -> Vec<T> { in vec_push()
41 fn as_list<T>(item: T) -> LinkedList<T> { in as_list()
43 list.push_back(item); in as_list()
47 fn list_append<T>(mut list1: LinkedList<T>, mut list2: LinkedList<T>) -> LinkedList<T> { in list_append()
53 pub(super) fn len<T>(list: &LinkedList<Vec<T>>) -> usize { in len()
70 I: IntoParallelIterator<Item = T>, in par_extend() argument
79 T: 'a + Copy + Ord + Send + Sync,
[all …]
Dcopied.rs23 pub(super) fn new(base: I) -> Self { in new()
30 I: ParallelIterator<Item = &'a T>,
31 T: 'a + Copy + Send + Sync,
33 type Item = T; typedef
35 fn drive_unindexed<C>(self, consumer: C) -> C::Result in drive_unindexed()
37 C: UnindexedConsumer<Self::Item>, in drive_unindexed() argument
43 fn opt_len(&self) -> Option<usize> { in opt_len()
50 I: IndexedParallelIterator<Item = &'a T>,
51 T: 'a + Copy + Send + Sync,
53 fn drive<C>(self, consumer: C) -> C::Result in drive()
[all …]
/external/python/cpython2/Lib/
D_weakrefset.py2 # This code is separated-out because it is needed
14 # This technique should be relatively thread-safe (since sets are).
38 def _remove(item, selfref=ref(self)): argument
42 self._pending_removals.append(item)
44 self.data.discard(item)
61 item = itemref()
62 if item is not None:
64 # `item` until it is resumed or closed.
65 yield item
68 return len(self.data) - len(self._pending_removals)
[all …]
/external/python/cpython3/Lib/test/
Dtest_xml_dom_minicompat.py3 import copy
15 # Test item access on an EmptyNodeList.
18 self.assertIsNone(node_list.item(0))
19 self.assertIsNone(node_list.item(-1)) # invalid item
24 node_list[-1]
51 self.assertIsNone(node_list.item(0))
52 self.assertIsNone(node_list.item(-1))
57 node_list[-1]
63 self.assertEqual(node_list.item(0), 111)
64 self.assertIsNone(node_list.item(-1)) # invalid item
[all …]
/external/python/cpython3/Lib/
D_weakrefset.py2 # This code is separated-out because it is needed
15 # This technique should be relatively thread-safe (since sets are).
39 def _remove(item, selfref=ref(self)): argument
43 self._pending_removals.append(item)
45 self.data.discard(item)
62 item = itemref()
63 if item is not None:
65 # `item` until it is resumed or closed.
66 yield item
69 return len(self.data) - len(self._pending_removals)
[all …]
/external/iperf3/src/
Dcjson.c2 Copyright (c) 2009-2017 Dave Gamble and cJSON contributors
4 Permission is hereby granted, free of charge, to any person obtaining a copy
7 to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
78 #define isinf(d) (isnan((d - d)) && !isnan(d))
98 #define LLONG_MIN (-LLONG_MAX - 1LL)
106 CJSON_PUBLIC(char *) cJSON_GetStringValue(cJSON *item) in cJSON_GetStringValue() argument
108 if (!cJSON_IsString(item)) in cJSON_GetStringValue()
113 return item->valuestring; in cJSON_GetStringValue()
116 CJSON_PUBLIC(double) cJSON_GetNumberValue(cJSON *item) in cJSON_GetNumberValue() argument
118 if (!cJSON_IsNumber(item)) in cJSON_GetNumberValue()
[all …]
/external/rust/crates/bindgen/src/ir/analysis/
Dderive.rs11 use crate::ir::item::{IsOpaque, Item};
19 #[derive(Debug, Copy, Clone, Hash, PartialEq, Eq)]
21 /// The `Copy` trait.
22 Copy, enumerator
33 /// An analysis that finds for each IR item whether a trait cannot be derived.
69 // Contains information whether particular item can derive `derive_trait`
82 type EdgePredicate = fn(EdgeKind) -> bool;
84 fn consider_edge_default(kind: EdgeKind) -> bool { in consider_edge_default()
111 ) -> ConstrainResult { in insert()
140 fn constrain_type(&mut self, item: &Item, ty: &Type) -> CanDerive { in constrain_type() argument
[all …]
/external/rust/crates/tinyvec/src-backup/
Darrayset.rs14 #[derive(Copy, Clone, Debug, PartialEq, Eq)]
20 fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result { in fmt()
25 /// An array-backed set
31 /// The item type must support `Default`.
42 pub fn new() -> Self { in new()
47 impl<A: Array, L: Copy + Into<usize>> ArraySet<A, L> {
52 pub fn from(arr: A, len: L) -> Self { in from()
62 L: Copy + PartialEq + From<u8> + Into<usize>,
66 pub fn capacity(&self) -> usize { in capacity()
72 pub fn len(&self) -> usize { in len()
[all …]
/external/libcups/cups/
Dstring.c4 * Copyright © 2007-2019 by Apple Inc.
5 * Copyright © 1997-2007 by Easy Software Products.
16 #include "cups-private.h"
17 #include "debug-internal.h"
40 * '_cupsStrAlloc()' - Allocate/reference a string.
43 char * /* O - String pointer */
44 _cupsStrAlloc(const char *s) /* I - String */ in _cupsStrAlloc()
47 _cups_sp_item_t *item, /* String pool item */ in _cupsStrAlloc() local
78 key = (_cups_sp_item_t *)(s - offsetof(_cups_sp_item_t, str)); in _cupsStrAlloc()
80 if ((item = (_cups_sp_item_t *)cupsArrayFind(stringpool, key)) != NULL) in _cupsStrAlloc()
[all …]
/external/bzip2/
Dbz-fo.xsl1 <?xml version="1.0" encoding="UTF-8"?> <!-- -*- sgml -*- -->
6 <xsl:import href="bz-common.xsl"/>
8 <!-- set indent = yes while debugging, then change to NO -->
11 <!-- ensure only passivetex extensions are on -->
13 <!-- fo extensions: PDF bookmarks and index terms -->
21 <!-- ensure we are using single sided -->
24 <!-- insert cross references to page numbers -->
27 <!-- <?custom-pagebreak?> inserts a page break at this point -->
28 <xsl:template match="processing-instruction('custom-pagebreak')">
29 <fo:block break-before='page'/>
[all …]
/external/mesa3d/src/mesa/drivers/dri/i965/
Dbrw_program_cache.c7 a copy of this software and associated documentation files (the
9 without limitation the rights to use, copy, modify, merge, publish,
40 * The inner workings are a simple hash table based on a FNV-1a of the
47 #include "main/streaming-load-memcpy.h"
69 /** 32-bit hash of the key data */
72 /** for variable-sized keys */
99 hash_key(struct brw_cache_item *item) in hash_key() argument
102 hash = XXH32(&item->cache_id, sizeof(item->cache_id), hash); in hash_key()
103 hash = XXH32(item->key, item->key_size, hash); in hash_key()
112 return a->cache_id == b->cache_id && in brw_cache_item_equals()
[all …]
/external/python/cpython3/Lib/venv/scripts/common/
DActivate.ps126 Activate.ps1 -Verbose
31 Activate.ps1 -VenvDir C:\Users\MyUser\Common\.venv
35 Activate.ps1 -Prompt "MyPython"
45 PS C:\> Set-ExecutionPolicy -ExecutionPolicy RemoteSigned -Scope CurrentUser
60 <# Function declarations --------------------------------------------------- #>
77 if (Test-Path -Path Function:_OLD_VIRTUAL_PROMPT) { in global:deactivate()
78 Copy-Item -Path Function:_OLD_VIRTUAL_PROMPT -Destination Function:prompt in global:deactivate()
79 Remove-Item -Path Function:_OLD_VIRTUAL_PROMPT in global:deactivate()
83 if (Test-Path -Path Env:_OLD_VIRTUAL_PYTHONHOME) { in global:deactivate()
84 Copy-Item -Path Env:_OLD_VIRTUAL_PYTHONHOME -Destination Env:PYTHONHOME in global:deactivate()
[all …]
/external/rust/crates/bindgen/src/ir/
Dcontext.rs16 use super::item::{IsOpaque, Item, ItemAncestors, ItemSet};
36 /// An identifier for some kind of IR item.
37 #[derive(Debug, Copy, Clone, Eq, PartialOrd, Ord, Hash)]
53 #[derive(Debug, Copy, Clone, Eq, PartialOrd, Ord, Hash)]
58 pub fn into_resolver(self) -> ItemResolver {
66 T: Copy + Into<ItemId>
68 fn eq(&self, rhs: &T) -> bool {
75 fn from(id: $name) -> ItemId {
81 fn from(id: &'a $name) -> ItemId {
88 pub fn $checked(&self, ctx: &BindgenContext) -> Option<$name> {
[all …]
Ditem.rs34 /// A trait to get the canonical name from an item.
45 /// Get the canonical name for this item.
46 fn canonical_name(&self, ctx: &BindgenContext) -> String; in canonical_name()
49 /// The same, but specifies the path that needs to be followed to reach an item.
62 /// Get the namespace-aware canonical path for this item. This means that if
63 /// namespaces are disabled, you'll get a single item, and otherwise you get
68 ) -> Vec<String>; in namespace_aware_canonical_path()
70 /// Get the canonical path for this item.
71 fn canonical_path(&self, ctx: &BindgenContext) -> Vec<String>; in canonical_path()
82 fn is_opaque(&self, ctx: &BindgenContext, extra: &Self::Extra) -> bool; in is_opaque()
[all …]
/external/libcppbor/
DREADME.md4 LibCppBor provides a natural and easy-to-use syntax for constructing and
13 LibCppBor requires C++-17.
17 LibCppBor represents CBOR data items as instances of the `Item` class or,
18 more precisely, as instances of subclasses of `Item`, since `Item` is a
19 pure interface. The subclasses of `Item` correspond almost one-to-one
24 up through (2^64 - 1).
25 * `Nint` corresponds to major type 1. It can only hold values from -1
26 to -(2^63 - 1), since it's internal representation is an int64_t.
28 the omitted range from -(2^63) to (2^64 - 1), since it's
35 variable-length array of `Item`s.
[all …]
/external/libdrm/
Dutil_double_list.h7 * copy of this software and associated documentation files (the
9 * without limitation the rights to use, copy, modify, merge, publish,
16 * FITNESS FOR A PARTICULAR PURPOSE AND NON-INFRINGEMENT. IN NO EVENT SHALL
47 static inline void list_inithead(struct list_head *item) in list_inithead() argument
49 item->prev = item; in list_inithead()
50 item->next = item; in list_inithead()
53 static inline void list_add(struct list_head *item, struct list_head *list) in list_add() argument
55 item->prev = list; in list_add()
56 item->next = list->next; in list_add()
57 list->next->prev = item; in list_add()
[all …]
/external/rust/crates/smallvec/src/
Dlib.rs1 // Licensed under the Apache License, Version 2.0 <LICENSE-APACHE or
2 // http://www.apache.org/licenses/LICENSE-2.0> or the MIT license
3 // <LICENSE-MIT or http://opensource.org/licenses/MIT>, at your
42 //! Tracking issue: [rust-lang/rust#55149](https://github.com/rust-lang/rust/issues/55149)
51 //! Tracking issue: [rust-lang/rust#44580](https://github.com/rust-lang/rust/issues/44580)
58 //! of `Copy` types. (Without this feature, you can use `SmallVec::from_slice` to get optimal
59 //! performance for `Copy` types.)
61 //! Tracking issue: [rust-lang/rust#31844](https://github.com/rust-lang/rust/issues/31844)
69 //! [Rustonomicon](https://doc.rust-lang.org/1.42.0/nomicon/dropck.html#an-escape-hatch).
71 //! Tracking issue: [rust-lang/rust#34761](https://github.com/rust-lang/rust/issues/34761)
[all …]
/external/mesa3d/src/gallium/drivers/r600/
Dcompute_memory_pool.c3 * copy of this software and associated documentation files (the "Software"),
5 * on the rights to use, copy, modify, merge, publish, distribute, sub
15 * FITNESS FOR A PARTICULAR PURPOSE AND NON-INFRINGEMENT. IN NO EVENT SHALL
56 struct compute_memory_item *item, struct pipe_context *pipe,
61 struct compute_memory_item *item, uint64_t new_start_in_dw,
82 pool->screen = rscreen; in compute_memory_pool_new()
83 pool->item_list = (struct list_head *) in compute_memory_pool_new()
85 pool->unallocated_list = (struct list_head *) in compute_memory_pool_new()
87 list_inithead(pool->item_list); in compute_memory_pool_new()
88 list_inithead(pool->unallocated_list); in compute_memory_pool_new()
[all …]
/external/virglrenderer/src/gallium/auxiliary/util/
Du_double_list.h7 * copy of this software and associated documentation files (the
9 * without limitation the rights to use, copy, modify, merge, publish,
16 * FITNESS FOR A PARTICULAR PURPOSE AND NON-INFRINGEMENT. IN NO EVENT SHALL
51 static inline void list_inithead(struct list_head *item) in list_inithead() argument
53 item->prev = item; in list_inithead()
54 item->next = item; in list_inithead()
57 static inline void list_add(struct list_head *item, struct list_head *list) in list_add() argument
59 item->prev = list; in list_add()
60 item->next = list->next; in list_add()
61 list->next->prev = item; in list_add()
[all …]
/external/libcppbor/tests/
Dcppbor_test.cpp6 * You may obtain a copy of the License at
8 * https://www.apache.org/licenses/LICENSE-2.0
86 EXPECT_EQ("\x20"s, Nint(-1).toString()); in TEST()
87 EXPECT_EQ("\x28"s, Nint(-9).toString()); in TEST()
88 EXPECT_EQ("\x29"s, Nint(-10).toString()); in TEST()
89 EXPECT_EQ("\x36"s, Nint(-23).toString()); in TEST()
90 EXPECT_EQ("\x37"s, Nint(-24).toString()); in TEST()
91 EXPECT_EQ("\x38\x18"s, Nint(-25).toString()); in TEST()
92 EXPECT_EQ("\x38\x62"s, Nint(-99).toString()); in TEST()
93 EXPECT_EQ("\x38\x63"s, Nint(-100).toString()); in TEST()
[all …]

12345678910>>...44