Searched defs:members (Results 1 - 25 of 75) sorted by relevance

123

/external/guice/extensions/grapher/src/com/google/inject/grapher/
H A DDefaultNodeCreator.java64 * @param members members to add to the node
68 Collection<Member> members) {
70 members);
82 Collection<Member> members = Lists.newArrayList();
87 members.add(injectionPoint.getMember());
91 members);
99 Collection<Member> members = Lists.newArrayList();
100 members.add(binding.getConstructor().getMember());
102 members
67 newImplementationNode(Binding<?> binding, Collection<Member> members) argument
[all...]
H A DImplementationNode.java33 private final Collection<Member> members; field in class:ImplementationNode
35 public ImplementationNode(NodeId id, Object source, Collection<Member> members) { argument
37 this.members = members;
41 return members;
49 return super.equals(other) && Objects.equal(members, other.members);
53 return 31 * super.hashCode() + Objects.hashCode(members);
58 + " members=" + members
[all...]
H A DInstanceNode.java30 private final Iterable<Member> members; field in class:InstanceNode
32 public InstanceNode(NodeId id, Object source, Object instance, Iterable<Member> members) { argument
35 this.members = members;
43 return members;
52 && Objects.equal(members, other.members);
56 return 31 * super.hashCode() + Objects.hashCode(instance, members);
61 + " members=" + members
[all...]
/external/junit/src/main/java/org/junit/runners/model/
H A DFrameworkMember.java15 boolean isShadowedBy(List<T> members) { argument
16 for (T each : members) {
/external/javassist/src/main/javassist/bytecode/annotation/
H A DAnnotation.java55 LinkedHashMap members; // this sould be LinkedHashMap field in class:Annotation
59 * Constructs an annotation including no members. A member can be
73 members = null;
77 * Constructs an annotation including no members. A member can be
91 * represented by <code>clazz</code>. The values of the members are
110 members = new LinkedHashMap();
197 if (members == null)
198 members = new LinkedHashMap();
200 members.put(name, p);
205 if (members
[all...]
/external/webrtc/webrtc/examples/peerconnection/server/
H A Dpeer_channel.h79 const Members& members() const { return members_; } function in class:PeerChannel
/external/clang/test/CodeGenCXX/
H A Dmangle-lambdas.cpp229 Members members; local
/external/snakeyaml/src/test/java/org/yaml/snakeyaml/issues/issue74/
H A DArrayBeanTest.java29 ArrayMember[] members = new ArrayMember[3];
30 members[0] = new ArrayMember("Foo", 21);
31 members[1] = new ArrayMember("Bar", 23);
32 members[2] = new ArrayMember("Hue Long Hair", 25);
36 bean.setMembers(members);
63 private ArrayMember[] members; field in class:ArrayBeanTest.ArrayBean
84 return members;
87 public void setMembers(ArrayMember[] members) { argument
88 this.members = members;
[all...]
/external/deqp/external/vulkancts/modules/vulkan/tessellation/
H A DvktTessellationFractionalSpacingTests.cpp53 std::vector<MembT> members (const std::vector<T>& objs, MembT T::* membP) function in namespace:vkt::tessellation::__anon3974
61 //! Predicate functor for comparing structs by their members.
87 inline std::vector<float> lengths (const std::vector<Segment>& segments) { return members(segments, &Segment::length); }
H A DvktTessellationUserDefinedIO.cpp325 IOBlock (const std::string& blockName, const std::string& interfaceName, const std::vector<Member>& members) argument
328 , m_members (members)
/external/deqp/framework/randomshaders/
H A DrsgUtils.cpp248 const vector<VariableType::Member>& members = type.getMembers(); local
250 for (vector<VariableType::Member>::const_iterator i = members.begin(); i != members.end(); i++)
/external/guice/core/src/com/google/inject/internal/
H A DAnnotations.java94 final Map<String, Object> members = resolveMembers(annotationType);
105 return annotationToString(annotationType, members);
107 return annotationHashCode(annotationType, members);
109 return annotationEquals(annotationType, members, args[0]);
111 return members.get(name);
128 Map<String, Object> members, Object other) throws Exception {
135 new Object[] {method.invoke(other)}, new Object[] {members.get(name)})) {
144 Map<String, Object> members) throws Exception {
148 Object value = members.get(name);
166 Map<String, Object> members) throw
127 annotationEquals(Class<? extends Annotation> type, Map<String, Object> members, Object other) argument
143 annotationHashCode(Class<? extends Annotation> type, Map<String, Object> members) argument
165 annotationToString(Class<? extends Annotation> type, Map<String, Object> members) argument
[all...]
/external/llvm/test/DebugInfo/PDB/Inputs/
H A Dsymbolformat.cpp64 MemberTest members; local
/external/syslinux/com32/lua/src/
H A Dlfs.c229 struct _stat_members members[] = { variable in typeref:struct:_stat_members
257 for (v = 1; members[v].name; v++)
258 if (*members[v].name == *member)
261 members[v].push (L, &info);
266 /* stores all members in table on top of the stack */
267 for (i = 0; members[i].name; i++) {
268 lua_pushstring (L, members[i].name);
269 members[i].push (L, &info);
/external/elfutils/libasm/
H A DlibasmP.h227 struct AsmScn *members; member in struct:AsmScnGrp
228 /* Number of members. */
/external/libevent/
H A Dbufferevent-internal.h67 /** List of all members in the group */
68 TAILQ_HEAD(rlim_group_member_list, bufferevent_private) members; member in struct:bufferevent_rate_limit_group
106 /** Lock to protect the members of this group. This lock should nest
/external/swiftshader/third_party/LLVM/include/llvm/Bitcode/
H A DArchive.h196 /// presents the archive file as an ilist of ArchiveMember objects. The members
234 inline iterator begin() { return members.begin(); }
235 inline const_iterator begin() const { return members.begin(); }
236 inline iterator end () { return members.end(); }
237 inline const_iterator end () const { return members.end(); }
239 inline reverse_iterator rbegin() { return members.rbegin(); }
240 inline const_reverse_iterator rbegin() const { return members.rbegin(); }
241 inline reverse_iterator rend () { return members.rend(); }
242 inline const_reverse_iterator rend () const { return members.rend(); }
244 inline size_t size() const { return members
524 MembersList members; ///< The ilist of ArchiveMember member in class:llvm::Archive
[all...]
/external/v8/tools/clang/blink_gc_plugin/
H A DEdge.h248 assert(*it && "Collection-edge members must be non-null");
256 Members& members() { return members_; } function in class:Collection
268 // For off-heap collections, determine tracing status of members.
271 // Do a non-recursive test here since members could equal the holder.
/external/fio/
H A Dstat.h128 uint32_t members; member in struct:thread_stat
/external/wpa_supplicant_8/hostapd/src/p2p/
H A Dp2p_group.c37 struct p2p_group_member *members; member in struct:p2p_group
87 m = group->members;
88 group->members = NULL;
380 m = group->members;
423 for (m = group->members; m; m = m->next) {
456 if (group->members)
577 m = group->members;
592 group->members = m->next;
626 m->next = group->members;
627 group->members
[all...]
/external/wpa_supplicant_8/src/p2p/
H A Dp2p_group.c37 struct p2p_group_member *members; member in struct:p2p_group
87 m = group->members;
88 group->members = NULL;
380 m = group->members;
423 for (m = group->members; m; m = m->next) {
456 if (group->members)
577 m = group->members;
592 group->members = m->next;
626 m->next = group->members;
627 group->members
[all...]
/external/wpa_supplicant_8/wpa_supplicant/src/p2p/
H A Dp2p_group.c37 struct p2p_group_member *members; member in struct:p2p_group
87 m = group->members;
88 group->members = NULL;
380 m = group->members;
423 for (m = group->members; m; m = m->next) {
456 if (group->members)
577 m = group->members;
592 group->members = m->next;
626 m->next = group->members;
627 group->members
[all...]
/external/llvm/include/llvm/Analysis/
H A DBlockFrequencyInfoImpl.h208 NodeList Nodes; ///< Header and the members of the loop.
245 iterator_range<NodeList::const_iterator> members() const { function in struct:llvm::BlockFrequencyInfoImplBase::LoopData
689 /// the algorithm. In particular, store the immediate members of each loop
698 /// members that represent sub-loops will already have been visited and
751 /// Visit loops top-down, scaling the frequencies of its immediate members
842 /// loop, we store in reverse post-order its "immediate" members, defined as
1108 for (const BlockNode &M : Loop.members())
/external/llvm/lib/Target/Hexagon/
H A DRDFGraph.cpp204 << PrintListV<RefNode*>(P.Obj.Addr->members(P.G), P.G) << ']';
213 << " [" << PrintListV<RefNode*>(P.Obj.Addr->members(P.G), P.G) << ']';
263 for (auto I : P.Obj.Addr->members(P.G))
273 for (auto I : P.Obj.Addr->members(P.G))
496 // Return the list of all members of the code node.
497 NodeList CodeNode::members(const DataFlowGraph &G) const { function in class:CodeNode
964 auto Blocks = Func.Addr->members(*this);
1286 for (NodeAddr<InstrNode*> IA : BA.Addr->members(*this))
1287 for (NodeAddr<RefNode*> RA : IA.Addr->members(*this))
1310 for (auto I : BA.Addr->members(*thi
[all...]
/external/selinux/libsemanage/src/
H A Dgenhomedircon.c1090 char **members = group->gr_mem; local
1092 while (*members != NULL) {
1094 members++;

Completed in 695 milliseconds

123