| /third_party/boost/libs/icl/doc/ |
| D | functions_erasure.qbk | 25 The effects of ['*erasure*] implemented by `erase` and ['*subtraction*]
29 For Map-types, `erase` provides the *stl* semantics of erasure in
53 [table Time Complexity for erasure of elements and segments on icl containers
64 more type combinations are available for /erasure/ than for
82 The second group can be viewed as an /erasure by key objects/
93 ['*erasure by key objects (2)*] works like the erase function
100 Complexity characteristics for inplace erasure operations are
107 [table Time Complexity for inplace erasure on element containers
114 [table Time Complexity for inplace erasure on interval containers
124 The next table shows the *icl* containers that erasure with iterators is
|
| D | icl.qbk | 166 [def __biLErasure__ [link boost_icl.function_reference.erasure ['*Erasure*]]]
167 [def __biLerasure__ [link boost_icl.function_reference.erasure ['*erasure*]]]
|
| D | functions_subtraction.qbk | 192 [[[link boost_icl.function_reference.erasure ['*Erasure*]] ]]
|
| /third_party/ffmpeg/libavcodec/ |
| D | acelp_pitch_delay.c | 77 int erasure) in ff_acelp_update_past_gain() argument
88 if(erasure) in ff_acelp_update_past_gain()
|
| D | qcelpdec.c | 707 goto erasure; in qcelp_decode_frame()
713 goto erasure; in qcelp_decode_frame()
733 goto erasure; in qcelp_decode_frame()
738 goto erasure; in qcelp_decode_frame()
745 goto erasure; in qcelp_decode_frame()
756 goto erasure; in qcelp_decode_frame()
762 erasure: in qcelp_decode_frame()
|
| D | evrcdec.c | 760 goto erasure; in evrc_decode_frame()
763 goto erasure; in evrc_decode_frame()
766 goto erasure; in evrc_decode_frame()
781 goto erasure; in evrc_decode_frame()
785 goto erasure; in evrc_decode_frame()
789 goto erasure; in evrc_decode_frame()
794 goto erasure; in evrc_decode_frame()
802 goto erasure; in evrc_decode_frame()
894 erasure: in evrc_decode_frame()
|
| D | acelp_pitch_delay.h | 138 int erasure);
|
| /third_party/boost/libs/outcome/doc/src/content/motivation/ |
| D | error_codes.md | 30 allocation or type erasure is required. This technique is very efficient.
|
| D | std_error_code.md | 63 of type erasure, but one that does allow type `std::error_code` to be trivial
|
| /third_party/boost/boost/icl/concept/ |
| D | element_map.hpp | 124 erase(Type& object, const typename Type::set_type& erasure) in erase() argument
127 ICL_const_FORALL(typename set_type, elem_, erasure) in erase()
|
| D | element_associator.hpp | 307 erase(Type& object, const Type& erasure) in erase() argument
309 ICL_const_FORALL(typename Type, elem_, erasure) in erase()
|
| /third_party/boost/libs/range/doc/reference/ranges/ |
| D | any_range.qbk | 13 The __type_erasure_article__ covers the motivation and goals of type erasure in this context. Clear…
|
| /third_party/boost/libs/log/test/run/ |
| D | attr_attribute_set.cpp | 236 BOOST_AUTO_TEST_CASE(erasure) in BOOST_AUTO_TEST_CASE() argument
|
| /third_party/boost/libs/icl/doc/html/ |
| D | standalone_HTML.manifest | 49 boost_icl/function_reference/erasure.html
|
| /third_party/boost/libs/range/doc/ |
| D | boost_range.qbk | 180 [def __type_erasure_article__ [@http://www.artima.com/cppsource/type_erasure.html type erasure ar…
|
| /third_party/boost/libs/functional/factory/doc/ |
| D | factory.qbk | 211 // Note that we are also free to have the type erasure happen
|
| /third_party/boost/libs/thread/doc/ |
| D | async_executors.qbk | 15 …an abstract class Executor. Static polymorphism is used instead and type erasure is used internall…
137 …erality. In the end an executor class is going to need some kind of type erasure to handle all the…
141 …oring closures on an executor’s queue will have to use some form of type erasure. There’s no reaso…
|
| /third_party/boost/libs/beast/doc/qbk/08_design/ |
| D | 3_websocket_zaphoyd.qbk | 152 that the websocketpp interface performs type-erasure on this handler.
|
| /third_party/gptfdisk/ |
| D | README | 114 data, this erasure occurs immediately, unlike other changes the program
|
| /third_party/boost/libs/container/doc/ |
| D | container.qbk | 133 [@http://en.wikipedia.org/wiki/Type_erasure [*type erasure ]] and
446 erasure times considerably. Flat associative containers have the following attributes:
457 * Slower insertion and erasure than standard associative containers (specially for non-movable type…
498 with every insertion/erasure, allowing constant-time
955 includes classes that provide allocator type erasure and runtime polymorphism. As Pablo Halpern, th…
|
| /third_party/boost/libs/intrusive/doc/ |
| D | intrusive.qbk | 230 …[[Insertion/erasure predictability] [High] …
597 updated with every insertion/erasure. This implies that the `size()` function doesn't have constant
603 with every insertion/erasure. This implies that the `size()` function has constant time
1900 Moreover, treap erasure operations require rotations based on the priority order function and
1975 have some inefficiencies caused by the interface in several search, insertion or erasure functions
1997 * For ordered associative containers, lookup and erasure functions, the container to be searched sh…
2064 no other insertion or erasure must be executed between an `insert_check` and an `insert_commit`
3596 for every erasure (or container destruction).
|
| /third_party/boost/libs/poly_collection/doc/ |
| D | reference.qbk | 134 Insertion and erasure do not invalidate iterators (global or local)
135 except those from the insertion/erasure point to the end of the
|
| D | poly_collection.qbk | 115 known, an indirection through `base*` (a particular form of /type erasure/)
|
| /third_party/boost/libs/log/doc/ |
| D | attributes.qbk | 29 … type. The former is in most cases not needed by users and provides type erasure, but the latter i…
|
| /third_party/boost/libs/stl_interfaces/doc/ |
| D | tutorial.qbk | 499 any user-defined insertion or erasure member functions into your container.
|