Home
last modified time | relevance | path

Searched refs:using (Results 76 - 100 of 3307) sorted by relevance

12345678910>>...133

/third_party/node/deps/googletest/include/gtest/internal/
H A Dgtest-type-util.h46 // #ifdef __GNUC__ is too general here. It is possible to use gcc without using
98 using abi::__cxa_demangle; in GetTypeName()
107 // "struct std::pair<int,bool>" when using MSVC vs "std::pair<int, bool>" with in GetTypeName()
164 using Head = TemplateSel<Head_>;
165 using Tail = Templates<Tail_...>;
170 using Head = TemplateSel<Head_>;
171 using Tail = None;
177 using Head = Head_;
178 using Tail = Types<Tail_...>;
183 using Hea
[all...]
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/include/llvm/IR/
H A DInstIterator.h33 using BBty = BB_t;
34 using BBIty = BB_i_t;
35 using BIty = BI_t;
36 using IIty = II_t;
42 using iterator_category = std::bidirectional_iterator_tag;
43 using value_type = IIty;
44 using difference_type = signed;
45 using pointer = IIty *;
46 using reference = IIty &;
121 using inst_iterato
[all...]
H A DCFG.h44 using super =
46 using Self = PredIterator<Ptr, USE_iterator>;
61 using pointer = typename super::pointer;
62 using reference = typename super::reference;
102 using pred_iterator = PredIterator<BasicBlock, Value::user_iterator>;
103 using const_pred_iterator =
105 using pred_range = iterator_range<pred_iterator>;
106 using pred_const_range = iterator_range<const_pred_iterator>;
141 using difference_type = int;
142 using pointe
[all...]
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/include/llvm/CodeGen/
H A DMachineBasicBlock.h54 using instr_iterator =
81 using Instructions = ilist<MachineInstr, ilist_sentinel_tracking<true>>;
96 using probability_iterator = std::vector<BranchProbability>::iterator;
97 using const_probability_iterator =
103 using LiveInVector = std::vector<RegisterMaskPair>;
176 using instr_iterator = Instructions::iterator;
177 using const_instr_iterator = Instructions::const_iterator;
178 using reverse_instr_iterator = Instructions::reverse_iterator;
179 using const_reverse_instr_iterator = Instructions::const_reverse_iterator;
181 using iterato
[all...]
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/include/llvm/Analysis/
H A DSyntheticCountsUtils.h32 using Scaled64 = ScaledNumber<uint64_t>;
33 using CGT = GraphTraits<CallGraphType>;
34 using NodeRef = typename CGT::NodeRef;
35 using EdgeRef = typename CGT::EdgeRef;
36 using SccTy = std::vector<NodeRef>;
40 using GetProfCountTy = function_ref<Optional<Scaled64>(NodeRef, EdgeRef)>;
41 using AddCountTy = function_ref<void(NodeRef, Scaled64)>;
H A DRegionIterator.h41 using super = std::iterator<std::forward_iterator_tag, NodeRef>;
42 using BlockTraits = GraphTraits<BlockT *>;
43 using SuccIterTy = typename BlockTraits::ChildIteratorType;
101 using Self = RNSuccIterator<NodeRef, BlockT, RegionT>;
102 using value_type = typename super::value_type;
168 using super = std::iterator<std::forward_iterator_tag, NodeRef>;
169 using BlockTraits = GraphTraits<BlockT *>;
170 using SuccIterTy = typename BlockTraits::ChildIteratorType;
176 using Self = RNSuccIterator<FlatIt<NodeRef>, BlockT, RegionT>;
177 using value_typ
[all...]
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/include/llvm/XRay/
H A DGraph.h82 using VertexValueType =
87 using EdgeValueType = detail::DenseMapPair<EdgeIdentifier, EdgeAttribute>;
89 using size_type = std::size_t;
93 using EdgeMapT = DenseMap<EdgeIdentifier, EdgeAttribute>;
97 using VertexMapT = DenseMap<VertexIdentifier, VertexAttribute>;
103 using NeighborSetT = DenseSet<VertexIdentifier>;
107 using NeighborLookupT = DenseMap<VertexIdentifier, NeighborSetT>;
123 /// An Iterator adapter using an InnerInvGraphT::iterator as a base iterator,
125 /// dereference operator is then performed using a pointer to the graph's edge
135 using InternalEdgeMap
[all...]
/third_party/node/deps/v8/src/compiler/
H A Dnode.h27 using Mark = uint32_t;
31 using NodeId = uint32_t;
111 using value_type = Edge;
129 using value_type = Node*;
162 using ZoneUsePtr = GraphZoneTraits::Ptr<Use>;
177 using ZoneOutOfLineInputsPtr = GraphZoneTraits::Ptr<OutOfLineInputs>;
203 using InlineField = base::BitField<bool, 0, 1>;
204 using InputIndexField = base::BitField<unsigned, 1, 31>;
290 using IdField = base::BitField<NodeId, 0, 24>;
291 using InlineCountFiel
[all...]
/third_party/skia/third_party/externals/angle2/src/libANGLE/
H A DOverlay.h134 using OverlayType = Overlay;
135 using CountWidget = overlay::Count;
136 using PerSecondWidget = overlay::PerSecond;
137 using RunningGraphWidget = overlay::RunningGraph;
138 using RunningHistogramWidget = overlay::RunningHistogram;
139 using TextWidget = overlay::Text;
141 using OverlayType = MockOverlay;
142 using CountWidget = const overlay::Mock;
143 using PerSecondWidget = const overlay::Mock;
144 using RunningGraphWidge
[all...]
H A DRefCountObject.h8 // lifecycle support for GL objects using the traditional BindObject scheme, but
31 using ContextType = ContextT;
32 using ErrorType = ErrorT;
62 using ContextType = ContextT;
63 using ErrorType = ErrorT;
106 using ContextType = ContextT;
107 using ErrorType = ErrorT;
180 using RefCountObjectNoID = angle::RefCountObject<Context, angle::Result>;
204 using ContextType = typename angle::BindingPointer<ObjectType, Context>::ContextType;
205 using ErrorTyp
[all...]
/third_party/skia/include/private/
H A DSkTLogic.h57 using type = std::conditional_t<std::is_const<S>::value, std::add_const_t<D>, D>;
59 template <typename D, typename S> using copy_const_t = typename copy_const<D, S>::type;
62 using type = std::conditional_t<std::is_volatile<S>::value, std::add_volatile_t<D>, D>;
64 template <typename D, typename S> using copy_volatile_t = typename copy_volatile<D, S>::type;
67 using type = copy_volatile_t<copy_const_t<D, S>, S>;
69 template <typename D, typename S> using copy_cv_t = typename copy_cv<D, S>::type;
74 template <typename D, typename S> using same_const = copy_const<std::remove_const_t<D>, S>;
75 template <typename D, typename S> using same_const_t = typename same_const<D, S>::type;
76 template <typename D, typename S> using same_volatile =copy_volatile<std::remove_volatile_t<D>,S>;
77 template <typename D, typename S> using same_volatile_
[all...]
/third_party/skia/third_party/externals/dawn/src/dawn_native/vulkan/
H A DExternalHandle.h10 using ExternalMemoryHandle = int;
12 using ExternalSemaphoreHandle = int;
15 using ExternalMemoryHandle = zx_handle_t;
17 using ExternalSemaphoreHandle = zx_handle_t;
20 using ExternalMemoryHandle = void*;
21 using ExternalSemaphoreHandle = void*;
/third_party/skia/third_party/externals/abseil-cpp/absl/container/internal/
H A Dunordered_map_modifiers_test.h35 using T = hash_internal::GeneratedType<TypeParam>; in TYPED_TEST_P()
47 using T = hash_internal::GeneratedType<TypeParam>; in TYPED_TEST_P()
48 using V = typename TypeParam::mapped_type; in TYPED_TEST_P()
61 using T = hash_internal::GeneratedType<TypeParam>; in TYPED_TEST_P()
62 using V = typename TypeParam::mapped_type; in TYPED_TEST_P()
75 using T = hash_internal::GeneratedType<TypeParam>; in TYPED_TEST_P()
85 using T = hash_internal::GeneratedType<TypeParam>; in TYPED_TEST_P()
86 using V = typename TypeParam::mapped_type; in TYPED_TEST_P()
100 using T = hash_internal::GeneratedType<TypeParam>; in TYPED_TEST_P()
118 using st in TYPED_TEST_P()
[all...]
H A Dhash_function_defaults.h63 // The hash of an object of type T is computed by using absl::Hash.
66 using Hash = absl::Hash<T>;
67 using Eq = std::equal_to<T>;
71 using is_transparent = void;
82 using is_transparent = void;
99 using Hash = StringHash;
100 using Eq = StringEq;
114 using is_transparent = void;
121 using is_transparent = void;
150 using hash_default_has
[all...]
/third_party/gn/src/base/numerics/
H A Dchecked_math.h24 using type = T;
52 // A range checked destination type can be supplied using the Dst template
78 // A range checked destination type can be supplied using the Dst template
94 // A range checked destination type can be supplied using the Dst template
167 using R = typename UnderlyingType<U>::type; in Max()
168 using result_type = typename MathWrapper<CheckedMaxOp, T, U>::type; in Max()
182 using R = typename UnderlyingType<U>::type; in Min()
183 using result_type = typename MathWrapper<CheckedMinOp, T, U>::type; in Min()
231 using Math = typename MathWrapper<M, L, R>::math; in MathOp()
242 using Mat in MathOp()
[all...]
/third_party/node/deps/v8/src/base/platform/
H A Dmutex.h67 using NativeHandle = pthread_mutex_t;
69 using NativeHandle = V8_SRWLOCK;
71 using NativeHandle = SbMutex;
116 using LazyMutex = LazyStaticInstance<Mutex, DefaultConstructTrait<Mutex>,
172 using NativeHandle = pthread_mutex_t;
174 using NativeHandle = V8_CRITICAL_SECTION;
176 using NativeHandle = starboard::RecursiveMutex;
196 using LazyRecursiveMutex =
272 using NativeHandle = pthread_mutex_t;
274 using NativeHandl
[all...]
/third_party/skia/third_party/externals/spirv-tools/source/opt/
H A Ddominator_tree.h40 using iterator = std::vector<DominatorTreeNode*>::iterator;
41 using const_iterator = std::vector<DominatorTreeNode*>::const_iterator;
44 using df_iterator = TreeDFIterator<DominatorTreeNode>;
45 using const_df_iterator = TreeDFIterator<const DominatorTreeNode>;
47 using post_iterator = PostOrderTreeDFIterator<DominatorTreeNode>;
48 using const_post_iterator = PostOrderTreeDFIterator<const DominatorTreeNode>;
57 // Depth first preorder iterator using this node as root.
65 // Depth first postorder iterator using this node as root.
96 using DominatorTreeNodeMap = std::map<uint32_t, DominatorTreeNode>;
97 using iterato
[all...]
/third_party/skia/third_party/externals/swiftshader/third_party/SPIRV-Tools/source/opt/
H A Ddominator_tree.h40 using iterator = std::vector<DominatorTreeNode*>::iterator;
41 using const_iterator = std::vector<DominatorTreeNode*>::const_iterator;
44 using df_iterator = TreeDFIterator<DominatorTreeNode>;
45 using const_df_iterator = TreeDFIterator<const DominatorTreeNode>;
47 using post_iterator = PostOrderTreeDFIterator<DominatorTreeNode>;
48 using const_post_iterator = PostOrderTreeDFIterator<const DominatorTreeNode>;
57 // Depth first preorder iterator using this node as root.
65 // Depth first postorder iterator using this node as root.
96 using DominatorTreeNodeMap = std::map<uint32_t, DominatorTreeNode>;
97 using iterato
[all...]
/third_party/spirv-tools/source/opt/
H A Ddominator_tree.h40 using iterator = std::vector<DominatorTreeNode*>::iterator;
41 using const_iterator = std::vector<DominatorTreeNode*>::const_iterator;
44 using df_iterator = TreeDFIterator<DominatorTreeNode>;
45 using const_df_iterator = TreeDFIterator<const DominatorTreeNode>;
47 using post_iterator = PostOrderTreeDFIterator<DominatorTreeNode>;
48 using const_post_iterator = PostOrderTreeDFIterator<const DominatorTreeNode>;
57 // Depth first preorder iterator using this node as root.
65 // Depth first postorder iterator using this node as root.
96 using DominatorTreeNodeMap = std::map<uint32_t, DominatorTreeNode>;
97 using iterato
[all...]
/third_party/protobuf/src/google/protobuf/
H A Dmap.h34 // Please avoid using other types defined here, unless they are public
100 using value_type = U;
101 using pointer = value_type*;
102 using const_pointer = const value_type*;
103 using reference = value_type&;
104 using const_reference = const value_type&;
105 using size_type = size_t;
106 using difference_type = ptrdiff_t;
161 using other = MapAllocator<X>;
185 using DestructorSkippable
[all...]
/third_party/skia/third_party/externals/swiftshader/third_party/subzero/src/
H A DIceTargetLoweringX86.h73 using PrimitiveIntType = uint32_t;
74 using IceType = ConstantFloat;
82 using PrimitiveIntType = uint64_t;
83 using IceType = ConstantDouble;
92 using PrimitiveIntType = uint32_t;
93 using IceType = ConstantInteger32;
102 using PrimitiveIntType = uint32_t;
103 using IceType = ConstantInteger32;
112 using PrimitiveIntType = uint32_t;
113 using IceTyp
[all...]
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Target/Hexagon/MCTargetDesc/
H A DHexagonMCChecker.h43 using PredSense = std::pair<unsigned, bool>;
45 using PredSet = std::multiset<PredSense>;
46 using PredSetIterator = std::multiset<PredSense>::iterator;
48 using DefsIterator = DenseMap<unsigned, PredSet>::iterator;
52 using SoftDefsIterator = std::set<unsigned>::iterator;
56 using TmpDefsIterator = std::set<unsigned>::iterator;
60 using NewPredsIterator = std::set<unsigned>::iterator;
64 using LatePredsIterator = std::multiset<unsigned>::iterator;
68 using UsesIterator = std::set<unsigned>::iterator;
72 using ReadOnlyIterato
[all...]
/third_party/skia/include/core/
H A DHMSymbol.h49 using PiecewiseParameter = struct PiecewiseParameter {
57 using AnimationPara = struct AnimationPara {
63 using AnimationInfo = struct AnimationInfo {
68 using SColor = struct SColor {
75 using GroupInfo = struct GroupInfo {
80 using GroupSetting = struct GroupSetting {
85 using AnimationSetting = struct AnimationSetting {
90 using RenderGroup = struct RenderGroup {
107 using SymbolLayers = struct SymbolLayers {
120 using SymbolLayersGroup
[all...]
/third_party/skia/tools/debugger/
H A DDrawCommand.h130 using INHERITED = DrawCommand;
142 using INHERITED = DrawCommand;
157 using INHERITED = DrawCommand;
170 using INHERITED = DrawCommand;
184 using INHERITED = DrawCommand;
199 using INHERITED = DrawCommand;
213 using INHERITED = DrawCommand;
222 using INHERITED = DrawCommand;
234 using INHERITED = DrawCommand;
246 using INHERITE
[all...]
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/include/llvm/ADT/
H A DAllocatorList.h47 using list_type = simple_ilist<Node>;
78 using value_type = T;
79 using pointer = T *;
80 using reference = T &;
81 using const_pointer = const T *;
82 using const_reference = const T &;
83 using size_type = typename list_type::size_type;
84 using difference_type = typename list_type::difference_type;
96 using base_type =
101 using value_typ
[all...]

Completed in 17 milliseconds

12345678910>>...133