Searched defs:relation (Results 1 - 20 of 20) sorted by relevance

/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);
/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
/external/icu4c/test/intltest/
H A Ddadrcoll.h33 Collator::EComparisonResult relation; member in class:SeqElement
H A Ddadrcoll.cpp107 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...]
/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...]
/external/chromium/chrome/browser/accessibility/
H A Dbrowser_accessibility_win.h175 IAccessibleRelation** relation) {
174 get_relation(LONG relation_index, IAccessibleRelation** relation) argument
/external/chromium/testing/gtest/include/gtest/internal/
H A Dgtest-internal.h1008 // The relation between an NativeArray object (see below) and the
1033 NativeArray(const Element* array, size_t count, RelationToSource relation) { argument
1034 Init(array, count, relation);
1062 // 'relation' is kCopy.
1063 void Init(const Element* array, size_t a_size, RelationToSource relation) { argument
1064 if (relation == kReference) {
1072 relation_to_source_ = relation;
/external/gtest/include/gtest/internal/
H A Dgtest-internal.h1015 // The relation between an NativeArray object (see below) and the
1040 NativeArray(const Element* array, size_t count, RelationToSource relation) { argument
1041 Init(array, count, relation);
1069 // 'relation' is kCopy.
1070 void Init(const Element* array, size_t a_size, RelationToSource relation) { argument
1071 if (relation == kReference) {
1079 relation_to_source_ = relation;
/external/llvm/utils/unittest/googletest/include/gtest/internal/
H A Dgtest-internal.h1035 // The relation between an NativeArray object (see below) and the
1060 NativeArray(const Element* array, size_t count, RelationToSource relation) { argument
1061 Init(array, count, relation);
1089 // 'relation' is kCopy.
1090 void Init(const Element* array, size_t a_size, RelationToSource relation) { argument
1091 if (relation == kReference) {
1099 relation_to_source_ = relation;
/external/webkit/Source/WebCore/css/
H A DCSSSelector.h259 Relation relation() const { return static_cast<Relation>(m_relation); } function in class:WebCore::CSSSelector
H A DCSSStyleSelector.cpp2084 if (selector->relation() != CSSSelector::Descendant && selector->relation() != CSSSelector::Child && selector->relation() != CSSSelector::SubSelector)
2098 if (selector->relation() == CSSSelector::Descendant)
2101 ASSERT(selector->relation() == CSSSelector::Child || selector->relation() == CSSSelector::SubSelector);
2105 if (selector->relation() != CSSSelector::SubSelector)
2156 if (selector->relation() == CSSSelector::Child || selector->relation() == CSSSelector::SubSelector)
2159 if (selector->relation() !
3074 CSSSelector::Relation relation = m_selector->relation(); local
[all...]
/external/valgrind/main/VEX/priv/
H A Dir_opt.c2427 /* Produces the alias relation between an indexed guest
2449 /* Produces the alias relation between two indexed guest state
2476 relation will be. Now, since the IR is flattened, the index
3115 GSAliasing relation; local
3138 relation
3144 if (relation == NoAlias) {
3148 /* relation == UnknownAlias || relation == ExactAlias */
3152 vassert(relation != ExactAlias);
3161 relation
3231 GSAliasing relation; local
[all...]
/external/icu4c/test/cintltst/
H A Dccapitst.c3501 const char *relation, *name1, *name2; local
3504 relation=*names++;
3505 if(*relation=='=') {
3507 } else if(*relation=='<') {
H A Dcmsccoll.c772 char sEsc[256], s[256], tEsc[256], t[256], b[256], output[512], relation[256]; local
807 strcat(output, getRelationSymbol(expRes, expStrength, relation));
813 strcat(output, getRelationSymbol(realRes, realStrength, relation));
831 strcat(output, getRelationSymbol(expRes, expStrength, relation));
840 strcat(output, getRelationSymbol(realRes, realStrength, relation));
/external/libxml2/
H A Dxmlschemas.c9837 xmlSchemaPErrMemory(NULL, "allocating schema relation", NULL);
10275 xmlSchemaSchemaRelationPtr relation = NULL; local
10298 * skip the location and relation logic and just parse the doc.
10319 * Create a relation for the graph of schemas.
10321 relation = xmlSchemaSchemaRelationCreate();
10322 if (relation == NULL)
10325 relation);
10326 relation->type = type;
10332 relation->importNamespace = importNamespace;
10336 * Note that we don't assign a bucket to the relation
[all...]
/external/eclipse-basebuilder/basebuilder-3.6.2/org.eclipse.releng.basebuilder/plugins/
H A Dorg.eclipse.swt.gtk.linux.x86_3.6.1.v3657a.jarMETA-INF/MANIFEST.MF META-INF/ECLIPSEF.SF META-INF/ECLIPSEF.RSA META ...
H A Dorg.eclipse.swt.win32.win32.x86_3.6.1.v3657a.jarMETA-INF/MANIFEST.MF META-INF/ECLIPSEF.SF META-INF/ECLIPSEF.RSA META ...
H A Dcom.ibm.icu_4.2.1.v20100412.jarMETA-INF/MANIFEST.MF META-INF/ECLIPSEF.SF META-INF/ECLIPSEF.RSA META ...

Completed in 4069 milliseconds