/external/bison/src/ |
relation.h | 27 If GRAPH is a relation, then GRAPH[Node] is a list of adjacent 34 typedef relation_nodes *relation; typedef 37 /* Report a relation R that has SIZE vertices. */ 38 void relation_print (relation r, relation_node size, FILE *out); 40 /* Compute the transitive closure of the FUNCTION on the relation R 45 void relation_digraph (relation r, relation_node size, bitsetv *function); 48 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);
|
Makefile | 87 reader.$(OBJEXT) reduce.$(OBJEXT) relation.$(OBJEXT) \ 267 relation.c relation.h \ 388 include ./$(DEPDIR)/relation.Po
|
/external/bluetooth/glib/tests/ |
relation-test.c | 66 GRelation *relation; local 71 relation = g_relation_new (2); 73 g_relation_index (relation, 0, g_int_hash, g_int_equal); 74 g_relation_index (relation, 1, g_int_hash, g_int_equal); 81 g_relation_insert (relation, data + i, data + i + 1); 82 g_relation_insert (relation, data + i, data + i - 1); 87 g_assert (! g_relation_exists (relation, data + i, data + i)); 88 g_assert (! g_relation_exists (relation, data + i, data + i + 2)); 89 g_assert (! g_relation_exists (relation, data + i, data + i - 2)); 94 g_assert (g_relation_exists (relation, data + i, data + i + 1)) [all...] |
testglib.c | 1067 GRelation *relation = g_relation_new (2); local 1072 g_relation_index (relation, 0, g_int_hash, g_int_equal); 1073 g_relation_index (relation, 1, g_int_hash, g_int_equal); 1080 g_relation_insert (relation, data + i, data + i + 1); 1081 g_relation_insert (relation, data + i, data + i - 1); 1086 g_assert (! g_relation_exists (relation, data + i, data + i)); 1087 g_assert (! g_relation_exists (relation, data + i, data + i + 2)); 1088 g_assert (! g_relation_exists (relation, data + i, data + i - 2)); 1093 g_assert (g_relation_exists (relation, data + i, data + i + 1)); 1094 g_assert (g_relation_exists (relation, data + i, data + i - 1)) [all...] |
makefile.msc.in | 55 relation-test.exe \
|
/external/bluetooth/glib/glib/ |
grel.h | 52 * g_relation_new() creates a relation with FIELDS fields 57 * g_relation_index() indexes relation FIELD with the provided 70 void g_relation_destroy (GRelation *relation); 71 void g_relation_index (GRelation *relation, 75 void g_relation_insert (GRelation *relation, 77 gint g_relation_delete (GRelation *relation, 80 GTuples* g_relation_select (GRelation *relation, 83 gint g_relation_count (GRelation *relation, 86 gboolean g_relation_exists (GRelation *relation, 88 void g_relation_print (GRelation *relation); [all...] |
/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) 563 if (t->relation == TCF_EM_REL_AND) 565 else if (t->relation == TCF_EM_REL_OR)
|
/external/chromium/third_party/icu/source/test/intltest/ |
dadrcoll.cpp | 107 el.relation = Collator::LESS; 111 el.relation = Collator::EQUAL; 115 el.relation = Collator::GREATER; 261 Collator::EComparisonResult relation = Collator::EQUAL; local 275 relation = Collator::EQUAL; 280 if(relation == Collator::EQUAL && source->relation != Collator::EQUAL) { 281 relation = source->relation; 283 doTest(col, source->source, target->source, relation); [all...] |
dadrcoll.h | 33 Collator::EComparisonResult relation; member in class:SeqElement
|
/external/icu4c/test/intltest/ |
dadrcoll.cpp | 107 el.relation = Collator::LESS; 111 el.relation = Collator::EQUAL; 115 el.relation = Collator::GREATER; 261 Collator::EComparisonResult relation = Collator::EQUAL; local 275 relation = Collator::EQUAL; 280 if(relation == Collator::EQUAL && source->relation != Collator::EQUAL) { 281 relation = source->relation; 283 doTest(col, source->source, target->source, relation); [all...] |
dadrcoll.h | 33 Collator::EComparisonResult relation; member in class:SeqElement
|
/external/webkit/WebCore/html/ |
HTMLAnchorElement.h | 31 // Link relation bitmask values. 91 bool hasRel(uint32_t relation) const;
|
HTMLAnchorElement.cpp | 338 bool HTMLAnchorElement::hasRel(uint32_t relation) const 340 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/webkit/WebCore/css/ |
CSSSelector.cpp | 399 sel1->relation() != sel2->relation() || sel1->m_match != sel2->m_match || 491 if (cs->relation() != CSSSelector::SubSelector || !cs->tagHistory()) 498 if (cs->relation() == CSSSelector::DirectAdjacent) 500 else if (cs->relation() == CSSSelector::IndirectAdjacent) 502 else if (cs->relation() == CSSSelector::Child)
|
CSSSelector.h | 92 enum Relation { 215 Relation relation() const { return static_cast<Relation>(m_relation); } function in class:WebCore::CSSSelector 223 unsigned m_relation : 3; // enum Relation
|
CSSGrammar.y | 73 CSSSelector::Relation relation; 183 %type <relation> combinator [all...] |
/external/bison/ |
Android.mk | 62 src/relation.c \
|
/frameworks/base/core/java/android/widget/ |
RelativeLayout.java | 47 * 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:__anon11312
|
/external/chromium/third_party/icu/source/test/cintltst/ |
ccapitst.c | 3402 const char *relation, *name1, *name2; local [all...] |
/external/icu4c/test/cintltst/ |
ccapitst.c | 3493 const char *relation, *name1, *name2; local [all...] |