| /external/bison/src/ |
| relation.h | 26 If GRAPH is a relation, then GRAPH[Node] is a list of adjacent
33 typedef relation_nodes *relation; typedef
36 /* Report a relation R that has SIZE vertices. */
37 void relation_print (relation r, relation_node size, FILE *out);
39 /* Compute the transitive closure of the FUNCTION on the relation R
44 void relation_digraph (relation r, relation_node size, bitsetv *function);
47 void relation_transpose (relation *R_arg, relation_node n);
|
| relation.c | 27 #include "relation.h"
30 relation_print (relation r, relation_node size, FILE *out)
54 static relation R;
97 relation_digraph (relation r, relation_node size, bitsetv *function)
125 relation_transpose (relation *R_arg, relation_node n)
127 relation r = *R_arg;
129 relation new_R = xnmalloc (n, sizeof *new_R);
131 relation end_R = xnmalloc (n, sizeof *end_R);
|
| /external/iproute2/tc/ |
| emp_ematch.y | 30 %type <i> invert relation
50 | match relation expr
52 $1->relation = $2;
82 relation: label
|
| m_ematch.h | 61 int relation; member in struct:ematch
|
| m_ematch.c | 181 .flags = t->relation
241 if (tree->relation == 0)
565 if (t->relation == TCF_EM_REL_AND)
567 else if (t->relation == TCF_EM_REL_OR)
|
| /external/icu4c/test/intltest/ |
| dadrcoll.cpp | 107 el.relation = Collator::LESS;
111 el.relation = Collator::EQUAL;
115 el.relation = Collator::GREATER;
262 Collator::EComparisonResult relation = Collator::EQUAL; local
276 relation = Collator::EQUAL;
281 if(relation == Collator::EQUAL && source->relation != Collator::EQUAL) {
282 relation = source->relation;
284 doTest(col, source->source, target->source, relation);
[all...] |
| dadrcoll.h | 33 Collator::EComparisonResult relation; member in class:SeqElement
|
| /external/webkit/Source/WebCore/html/ |
| HTMLAnchorElement.h | 31 // Link relation bitmask values.
95 bool hasRel(uint32_t relation) const;
|
| HTMLAnchorElement.cpp | 274 bool HTMLAnchorElement::hasRel(uint32_t relation) const
276 return m_linkRelations & relation;
|
| /libcore/luni/src/main/java/java/util/ |
| TreeMap.java | 26 import static java.util.TreeMap.Relation.*;
204 enum Relation {
213 * Returns a possibly-flipped relation for use in descending views.
217 Relation forOrder(boolean ascending) {
240 Node<K, V> created = find(key, Relation.CREATE);
251 Node<K, V> find(K key, Relation relation) {
256 if (relation == Relation.CREATE) {
285 switch (relation) {
[all...] |
| /external/chromium/testing/gtest/include/gtest/internal/ |
| gtest-internal.h | [all...] |
| /external/gtest/include/gtest/internal/ |
| gtest-internal.h | [all...] |
| /external/libvpx/libvpx/third_party/googletest/src/include/gtest/internal/ |
| gtest-internal.h | [all...] |
| /external/llvm/utils/unittest/googletest/include/gtest/internal/ |
| gtest-internal.h | [all...] |
| /external/webkit/Source/WebCore/css/ |
| CSSSelector.cpp | 548 sel1->relation() != sel2->relation() || sel1->m_match != sel2->m_match ||
660 if (cs->relation() != CSSSelector::SubSelector || !cs->tagHistory())
667 if (cs->relation() == CSSSelector::DirectAdjacent)
669 else if (cs->relation() == CSSSelector::IndirectAdjacent)
671 else if (cs->relation() == CSSSelector::Child)
|
| CSSSelector.h | 106 enum Relation {
259 Relation relation() const { return static_cast<Relation>(m_relation); } function in class:WebCore::CSSSelector
271 unsigned m_relation : 3; // enum Relation
|
| CSSStyleSelector.cpp | 3074 CSSSelector::Relation relation = m_selector->relation(); local
[all...] |
| CSSGrammar.y | 74 CSSSelector::Relation relation;
200 %type <relation> combinator
[all...] |
| /external/llvm/utils/llvm-build/llvmbuild/ |
| main.py | 142 '%r (%s)' % (ci.name, relation)
143 for relation,ci in current_stack)
162 for relation,referent_name in ci.get_component_references():
167 ci.name, referent_name, relation))
170 current_stack.append((relation,ci))
181 # about only checking cycles by relation type. If we do that, it falls
[all...] |
| /external/bison/ |
| Android.mk | 174 src/relation.c \
|
| /frameworks/base/core/java/android/widget/ |
| RelativeLayout.java | 48 * A Layout where the positions of the children can be described in relation to each other or to the
[all...] |
| /packages/inputmethods/OpenWnn/libs/libwnnDictionary/include/ |
| nj_lib.h | 216 NJ_UINT32 relation[NJ_MAX_PHR_CONNECT]; member in struct:__anon22259
|
| /external/chromium/chrome/browser/accessibility/ |
| browser_accessibility_win.h | 175 IAccessibleRelation** relation) {
|
| /external/valgrind/main/VEX/priv/ |
| ir_opt.c | 3692 GSAliasing relation; local
3812 GSAliasing relation; local
[all...] |
| /external/chromium/testing/gmock/include/gmock/ |
| gmock-matchers.h | 703 name, op, relation, negated_relation) \
721 *os << relation " "; \
[all...] |
