| /openbsd-src/gnu/usr.bin/perl/cpan/CPAN-Meta/t/data-valid/ |
| H A D | 1206545041-META.yml | 24 PDF::Template::Container:
25 file: lib/PDF/Template/Container.pm
27 PDF::Template::Container::Always:
28 file: lib/PDF/Template/Container/Always.pm
30 PDF::Template::Container::Conditional:
31 file: lib/PDF/Template/Container/Conditional.pm
33 PDF::Template::Container::Font:
34 file: lib/PDF/Template/Container/Font.pm
36 PDF::Template::Container::Footer:
37 file: lib/PDF/Template/Container/Footer.pm
[all …]
|
| /openbsd-src/gnu/gcc/libstdc++-v3/include/ext/pb_ds/ |
| H A D | assoc_container.hpp | 61 // An abstract basic associative container.
124 // An abstract basic hash-based associative container.
161 // A concrete collision-chaining hash-based associative container.
185 // copied by the Hash_Fn object of the container object.
190 // copied by the hash_fn object of the container object, and
191 // r_eq_fn will be copied by the eq_fn object of the container
197 // copied by the hash_fn object of the container object, r_eq_fn
198 // will be copied by the eq_fn object of the container object, and
200 // container object.
205 // copied by the hash_fn object of the container object, r_eq_fn
[all …]
|
| /openbsd-src/gnu/llvm/clang/include/clang/AST/ |
| H A D | AttrIterator.h | 32 template <typename SpecificAttr, typename Container = AttrVec>
34 using Iterator = typename Container::const_iterator;
99 template <typename SpecificAttr, typename Container>
100 inline specific_attr_iterator<SpecificAttr, Container>
101 specific_attr_begin(const Container& container) { in specific_attr_begin() argument
102 return specific_attr_iterator<SpecificAttr, Container>(container.begin()); in specific_attr_begin()
104 template <typename SpecificAttr, typename Container>
105 inline specific_attr_iterator<SpecificAttr, Container>
106 specific_attr_end(const Container& container) { in specific_attr_end() argument
107 return specific_attr_iterator<SpecificAttr, Container>(container.end()); in specific_attr_end()
[all …]
|
| /openbsd-src/gnu/llvm/libcxx/benchmarks/ |
| H A D | ContainerBenchmarks.h | 20 template <class Container>
21 void BM_ConstructSize(benchmark::State& st, Container) { in BM_ConstructSize() argument
24 Container c(size); in BM_ConstructSize()
29 template <class Container>
30 void BM_ConstructSizeValue(benchmark::State& st, Container, typename Container::value_type const& v… in BM_ConstructSizeValue() argument
33 Container c(size, val); in BM_ConstructSizeValue()
38 template <class Container, class GenInputs>
39 void BM_ConstructIterIter(benchmark::State& st, Container, GenInputs gen) { in BM_ConstructIterIter() argument
45 Container c(begin, end); in BM_ConstructIterIter()
50 template <class Container, class GenInputs>
[all …]
|
| H A D | Utilities.h | 19 template <class Container>
20 auto HaveDataImpl(int) -> decltype((std::declval<Container&>().data(), std::true_type{}));
21 template <class Container>
27 template <class Container, std::enable_if_t<UtilitiesInternal::HasData<Container>::value>* = nullpt…
28 void DoNotOptimizeData(Container &c) { benchmark::DoNotOptimize(c.data()); } in DoNotOptimizeData()
29 template <class Container, std::enable_if_t<!UtilitiesInternal::HasData<Container>::value>* = nullp…
30 void DoNotOptimizeData(Container &c) { benchmark::DoNotOptimize(&c); } in DoNotOptimizeData()
|
| /openbsd-src/gnu/llvm/libcxx/include/ |
| H A D | stack | 19 template <class T, class Container = deque<T>>
23 typedef Container container_type;
63 void swap(stack& c) noexcept(is_nothrow_swappable_v<Container>)
66 template<class Container>
67 stack(Container) -> stack<typename Container::value_type, Container>; // C++17
72 template<class Container, class Allocator>
73 stack(Container, Allocator) -> stack<typename Container::value_type, Container>; // C++17
80 template <class T, class Container>
81 bool operator==(const stack<T, Container>& x, const stack<T, Container>& y);
82 template <class T, class Container>
[all …]
|
| H A D | queue | 19 template <class T, class Container = deque<T>>
23 typedef Container container_type;
72 void swap(queue& q) noexcept(is_nothrow_swappable_v<Container>)
75 template<class Container>
76 queue(Container) -> queue<typename Container::value_type, Container>; // C++17
81 template<class Container, class Allocator>
82 queue(Container, Allocator) -> queue<typename Container::value_type, Container>; // C++17
89 template <class T, class Container>
90 bool operator==(const queue<T, Container>& x,const queue<T, Container>& y);
92 template <class T, class Container>
[all …]
|
| H A D | iterator | 313 template <class Container>
318 Container* container;
320 typedef Container container_type;
327 explicit back_insert_iterator(Container& x); // constexpr in C++20
328 …back_insert_iterator& operator=(const typename Container::value_type& value); // constexpr in C++…
334 template <class Container> back_insert_iterator<Container> back_inserter(Container& x); // constex…
336 template <class Container>
341 Container* container;
343 typedef Container container_type;
350 explicit front_insert_iterator(Container& x); // constexpr in C++20
[all …]
|
| /openbsd-src/sys/dev/pci/drm/amd/display/dc/basics/ |
| H A D | amdgpu_vector.c | 35 vector->container = NULL; in dal_vector_construct()
38 /* Container must be non-zero size*/ in dal_vector_construct()
43 vector->container = kcalloc(capacity, struct_size, GFP_KERNEL); in dal_vector_construct()
44 if (vector->container == NULL) in dal_vector_construct()
61 vector->container = NULL; in dal_vector_presized_costruct()
64 /* Container must be non-zero size*/ in dal_vector_presized_costruct()
69 vector->container = kcalloc(count, struct_size, GFP_KERNEL); in dal_vector_presized_costruct()
71 if (vector->container == NULL) in dal_vector_presized_costruct()
80 vector->container + i * struct_size, in dal_vector_presized_costruct()
132 kfree(vector->container); in dal_vector_destruct()
[all …]
|
| /openbsd-src/gnu/lib/libstdc++/libstdc++/include/bits/ |
| H A D | stl_iterator.h | 325 * These are output iterators, constructed from a container-of-T.
326 * Assigning a T to the iterator appends it to the container using
337 _Container* container;
340 /// A nested typedef for the type of whatever container you used.
343 /// The only way to create this %iterator is with a container.
345 back_insert_iterator(_Container& __x) : container(&__x) { } in back_insert_iterator()
350 * reference-to-const T for container<T>.
354 * container (you can think of the position as being permanently at
356 * always append the value to the end of the container.
361 container->push_back(__value);
[all …]
|
| /openbsd-src/gnu/gcc/gcc/ |
| H A D | tree-iterator.c | 73 gcc_assert (t != i->container); in tsi_link_before()
100 TREE_SIDE_EFFECTS (i->container) = 1; in tsi_link_before()
111 STATEMENT_LIST_HEAD (i->container) = head; in tsi_link_before()
117 head->prev = STATEMENT_LIST_TAIL (i->container); in tsi_link_before()
121 STATEMENT_LIST_HEAD (i->container) = head; in tsi_link_before()
122 STATEMENT_LIST_TAIL (i->container) = tail; in tsi_link_before()
149 gcc_assert (t != i->container); in tsi_link_after()
176 TREE_SIDE_EFFECTS (i->container) = 1; in tsi_link_after()
187 STATEMENT_LIST_TAIL (i->container) = tail; in tsi_link_after()
193 gcc_assert (!STATEMENT_LIST_TAIL (i->container)); in tsi_link_after()
[all …]
|
| /openbsd-src/gnu/gcc/libstdc++-v3/docs/html/ext/pb_ds/ |
| H A D | ds_gen.html | 21 writing a function manipulating a generic container object,
43 <li>What are the guarantees of <tt>Cntnr</tt>? A container
50 <li>How does the container maintain its elements? Tree-based
52 others, typically, do not. A container based on a splay trees
60 <h2><a name="ds_hierarchy" id="ds_hierarchy">Container
63 <p>Figure <a href="#cd">Container class hierarchy</a> shows the
64 container hierarchy.</p>
69 <h6 class="c1">Container class hierarchy.</h6>
121 list-based update-policy associative container</li>
135 to query which types and methods each container supports.</p>
[all …]
|
| H A D | assoc_performance_tests.html | 7 <title>Associative-Container Performance Tests</title>
12 <h1><a name="assoc" id="assoc">Associative-Container
124 Containers::Tree-Based Containers</a>) or trie-based container
136 container (see <a href="lu_based_containers.html">Design::Associative
140 Container Types</a></h3>
148 collision-chaining table should be used. A probing container,
153 manipulates a hash-based container: in the STL, allocators have
155 probing container might incur less contention in this case.</p>
184 <h3><a name="tree_like_based_types" id="tree_like_based_types">Tree-Like-Based Container
251 associative container mapping values to size types.) In this
[all …]
|
| H A D | concepts.html | 24 associative-container's <tt>find</tt> method; a range-type
26 elements, <i>e.g.</i>, as returned by a container's
42 <p>If one manipulates a container object, then iterators
49 container (in compile time) what are its invalidation
59 associative-container of the (originally) non-unique parts of
60 the key - the secondary key. A primary associative-container is
61 an associative container of primary keys; a secondary
62 associative-container is an associative container of secondary
71 container is parametrized by a hash-functor, transforming each
83 For example, a hash-based associative container might transform
[all …]
|
| H A D | motivation.html | 18 <p>Many fine associative-container libraries were already
65 "assoc_performance_tests.html#hash_based">Associative-Container
82 nodes (including itself) in its sub-tree.) A container based
84 whether 0.3 is in the container object, but it can also
86 container object [<a href=
88 "assoc_examples.html#tree_like_based">Associative Container
100 container based on this data structure can obviously answer
101 efficiently whether <i>[3, 41)</i> is in the container
103 container object has intervals that intersect <i>[3,
105 "assoc_examples.html#tree_like_based">Associative Container
[all …]
|
| H A D | gp_hash_table.html | 19 container.</p>
232 "c2"><tt>null_hash_fn</tt></span></a>, then the container
432 the container object.</p>
451 the container object, and <span class=
454 container object.</p>
475 the container object, <span class=
478 container object, and <span class=
482 object of the container object.</p>
505 the container object, <span class=
508 container object, <span class=
[all …]
|
| H A D | tutorial.html | 29 container classes themselves. For example, this shows basic
30 operations on a collision-chaining hash-based container:</p>
41 <p>The container is called <a href=
48 "assoc_performance_tests.html#msc">Associative-Container
54 <p>This snippet shows a red-black tree based container:</p>
64 <p>The container is called <a href=
73 "assoc_examples.html#basic_usage">Associative-Container
79 given the container requirments and interfaces in the C++
85 some type of hash-based container, then</p>
89 hash-based container object, then
[all …]
|
| /openbsd-src/gnu/gcc/libstdc++-v3/include/bits/ |
| H A D | stl_iterator.h | 377 * These are output iterators, constructed from a container-of-T.
378 * Assigning a T to the iterator appends it to the container using
389 _Container* container;
392 /// A nested typedef for the type of whatever container you used.
395 /// The only way to create this %iterator is with a container.
397 back_insert_iterator(_Container& __x) : container(&__x) { } in back_insert_iterator()
402 * reference-to-const T for container<T>.
406 * container (you can think of the position as being permanently at
408 * always append the value to the end of the container.
413 container->push_back(__value);
[all …]
|
| /openbsd-src/gnu/llvm/libcxx/utils/ci/ |
| H A D | run-buildbot-container | 3 # This script starts a shell in a container running the libc++ build bot Docker
11 # monorepo will be mounted as `/llvm` inside the container. Be careful, the
12 # state in `/llvm` is shared between the container and the host machine, which
14 # in the container.
17 # the user in the container doesn't have permissions to do so.
19 # the container or add this flag to run the container as your local user IDs:
|
| /openbsd-src/gnu/llvm/llvm/tools/obj2yaml/ |
| H A D | dxcontainer2yaml.cpp | 26 DXContainer Container = *ExDXC; in dumpDXContainer() local
31 for (uint8_t Byte : Container.getHeader().FileHash.Digest) in dumpDXContainer()
33 Obj->Header.Version.Major = Container.getHeader().Version.Major; in dumpDXContainer()
34 Obj->Header.Version.Minor = Container.getHeader().Version.Minor; in dumpDXContainer()
35 Obj->Header.FileSize = Container.getHeader().FileSize; in dumpDXContainer()
36 Obj->Header.PartCount = Container.getHeader().PartCount; in dumpDXContainer()
39 for (const auto P : Container) { in dumpDXContainer()
47 std::optional<DXContainer::DXILData> DXIL = Container.getDXIL(); in dumpDXContainer()
64 std::optional<uint64_t> Flags = Container.getShaderFlags(); in dumpDXContainer()
71 std::optional<dxbc::ShaderHash> Hash = Container.getShaderHash(); in dumpDXContainer()
|
| /openbsd-src/gnu/llvm/llvm/include/llvm/DebugInfo/CodeView/ |
| H A D | SymbolRecordMapping.h | 23 CodeViewContainer Container) in SymbolRecordMapping() argument
24 : IO(Reader), Container(Container) {} in SymbolRecordMapping()
26 CodeViewContainer Container) in SymbolRecordMapping() argument
27 : IO(Writer), Container(Container) {} in SymbolRecordMapping()
41 CodeViewContainer Container; variable
|
| /openbsd-src/gnu/llvm/clang/lib/ExtractAPI/ |
| H A D | API.cpp | 157 ObjCContainerRecord *Container, StringRef Name, StringRef USR, in addObjCMethod() argument
173 Container->USR, Container->Name, Container->getKind(), Container); in addObjCMethod()
175 return Container->Methods.emplace_back(std::move(Record)).get(); in addObjCMethod()
179 ObjCContainerRecord *Container, StringRef Name, StringRef USR, in addObjCProperty() argument
197 Container->USR, Container->Name, Container->getKind(), Container); in addObjCProperty()
199 return Container->Properties.emplace_back(std::move(Record)).get(); in addObjCProperty()
203 ObjCContainerRecord *Container, StringRef Name, StringRef USR, in addObjCInstanceVariable() argument
211 Container->USR, Container->Name, Container->getKind(), Container); in addObjCInstanceVariable()
213 return Container->Ivars.emplace_back(std::move(Record)).get(); in addObjCInstanceVariable()
|
| /openbsd-src/gnu/llvm/llvm/include/llvm/Remarks/ |
| H A D | BitstreamRemarkContainer.h | 1 //===-- BitstreamRemarkContainer.h - Container for remarks --------------*-===//
24 /// The current version of the remark container.
30 /// Type of the remark container.
31 /// The remark container has two modes:
38 /// * Container version and type
44 /// * Container version and type
49 /// * Container version and type
58 /// container.
92 constexpr StringRef MetaContainerInfoName = StringRef("Container info", 14);
|
| /openbsd-src/sys/dev/ic/ |
| H A D | aacreg.h | 203 /* Container Commands */
296 * Container types
332 FT_VOLUME, /* Container - Volume Set */
333 FT_STRIPE, /* Container - Stripe Set */
334 FT_MIRROR, /* Container - Mirror Set */
335 FT_RAID5, /* Container - Raid 5 Set */
366 * Container creation data
670 AifJobCtrZero, /* Container clear operation */
671 AifJobCtrCopy, /* Container copy operation */
672 AifJobCtrCreateMirror, /* Container Create Mirror operation */
[all …]
|
| /openbsd-src/gnu/lib/libstdc++/libstdc++/docs/html/21_strings/ |
| H A D | stringtok_std_h.txt | 10 template <typename Container>
12 stringtok (Container &container, string const &in,
30 container.push_back (in.substr(i));
33 container.push_back (in.substr(i, j-i));
|