Searched refs:relation (Results 1 - 25 of 28) sorted by relevance

12

/external/bison/src/
H A Drelation.h27 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);
H A Drelation.c27 #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);
H A DMakefile87 reader.$(OBJEXT) reduce.$(OBJEXT) relation.$(OBJEXT) \
267 relation.c relation.h \
388 include ./$(DEPDIR)/relation.Po
/external/bluetooth/glib/tests/
H A Drelation-test.c66 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, dat
[all...]
H A Dtestglib.c1067 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, dat
[all...]
H A Dmakefile.msc.in55 relation-test.exe \
/external/bluetooth/glib/glib/
H A Dgrel.h52 * 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/
H A Demp_ematch.y30 %type <i> invert relation
50 | match relation expr
52 $1->relation = $2;
82 relation: label
H A Dm_ematch.h61 int relation; member in struct:ematch
H A Dm_ematch.c181 .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/
H A Ddadrcoll.cpp107 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...]
H A Ddadrcoll.h33 Collator::EComparisonResult relation; member in class:SeqElement
/external/icu4c/test/intltest/
H A Ddadrcoll.cpp107 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...]
H A Ddadrcoll.h33 Collator::EComparisonResult relation; member in class:SeqElement
/external/webkit/WebCore/html/
H A DHTMLAnchorElement.h31 // Link relation bitmask values.
91 bool hasRel(uint32_t relation) const;
H A DHTMLAnchorElement.cpp338 bool HTMLAnchorElement::hasRel(uint32_t relation) const
340 return m_linkRelations & relation;
/external/webkit/WebCore/css/
H A DCSSSelector.cpp399 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)
H A DCSSSelector.h215 Relation relation() const { return static_cast<Relation>(m_relation); } function in class:WebCore::CSSSelector
H A DCSSGrammar.y73 CSSSelector::Relation relation;
183 %type <relation> combinator
/external/bison/
H A DAndroid.mk62 src/relation.c \
/external/libvpx/examples/includes/ASCIIMathPHP-2.0/
H A DASCIIMathPHP-2.0.cfg.php63 // Binary relation symbols
/external/chromium/third_party/icu/source/test/cintltst/
H A Dccapitst.c3402 const char *relation, *name1, *name2; local
3405 relation=*names++;
3406 if(*relation=='=') {
3408 } else if(*relation=='<') {
H A Dcmsccoll.c766 char sEsc[256], s[256], tEsc[256], t[256], b[256], output[512], relation[256]; local
801 strcat(output, getRelationSymbol(expRes, expStrength, relation));
807 strcat(output, getRelationSymbol(realRes, realStrength, relation));
825 strcat(output, getRelationSymbol(expRes, expStrength, relation));
834 strcat(output, getRelationSymbol(realRes, realStrength, relation));
/external/icu4c/test/cintltst/
H A Dccapitst.c3493 const char *relation, *name1, *name2; local
3496 relation=*names++;
3497 if(*relation=='=') {
3499 } else if(*relation=='<') {
/external/e2fsprogs/e2fsck/
H A Dprofile.c176 (struct profile_node *relation);
1032 * Each node may represent either a relation or a section header.
1037 * A relation has as its value a pointer to allocated memory

Completed in 194 milliseconds

12