/macosx-10.9.5/WebKit-7537.78.2/win/Interfaces/Accessible2/ |
H A D | Accessible2.idl | 204 There are several methods which return arrays. In the case of IAccessible2::relations 383 /** @brief Returns the number of accessible relations for this object. 405 /** @brief Returns multiple accessible relations for this object. 408 @param [out] relations 413 actual number of relations in the returned array (not more than maxRelations) 415 @retval S_FALSE if there are no relations, nRelations is set to 0 418 [propget] HRESULT relations 422 IAccessibleRelation **relations,
|
/macosx-10.9.5/CPANInternal-140/DBIx-Class/lib/DBIx/Class/ResultClass/ |
H A D | HashRefInflator.pm | 124 relations to be inflated when the master C<$artist> row is inflated.
|
/macosx-10.9.5/WebKit-7537.78.2/win/ |
H A D | AccessibleBase.h | 56 virtual HRESULT STDMETHODCALLTYPE get_relations(long maxRelations, IAccessibleRelation** relations, long* nRelations);
|
H A D | AccessibleBase.cpp | 187 HRESULT AccessibleBase::get_relations(long maxRelations, IAccessibleRelation** relations, long* nRelations) argument 189 if (!relations || !nRelations)
|
/macosx-10.9.5/CPANInternal-140/DBIx-Class/lib/DBIx/Class/ |
H A D | Relationship.pm | 160 relations that are across multiple columns. 272 relations that are across multiple columns. 402 relations that are across multiple columns. 497 relations that are across multiple columns. 574 L<DBIx::Class::ResultSet/search> to join tables. Use the relations
|
/macosx-10.9.5/Security-55471.14.18/include/security_keychain/ |
H A D | Keychains.cpp | 94 DbCursor relations(db); 95 relations->recordType(CSSM_DL_DB_SCHEMA_INFO); 100 while (relations->next(&relationRecord, NULL, outerUniqueId))
|
/macosx-10.9.5/Security-55471.14.18/libsecurity_keychain/Security/ |
H A D | Keychains.cpp | 94 DbCursor relations(db); 95 relations->recordType(CSSM_DL_DB_SCHEMA_INFO); 100 while (relations->next(&relationRecord, NULL, outerUniqueId))
|
/macosx-10.9.5/Security-55471.14.18/libsecurity_keychain/lib/ |
H A D | Keychains.cpp | 94 DbCursor relations(db); 95 relations->recordType(CSSM_DL_DB_SCHEMA_INFO); 100 while (relations->next(&relationRecord, NULL, outerUniqueId))
|
/macosx-10.9.5/CPANInternal-140/DBIx-Class/lib/DBIx/Class/Storage/DBI/ |
H A D | MSSQL.pm | 334 all their relations, no matter how many". While there is a hack which fools
|
/macosx-10.9.5/vim-53/runtime/syntax/ |
H A D | logtalk.vim | 66 " Logtalk entity relations
|
H A D | maple.vim | 314 " Package: LREtools: manipulate linear recurrence relations {{{2
|
/macosx-10.9.5/rsync-42/rsync/ |
H A D | tech_report.tex | 126 be computed very efficiently using the recurrence relations
|
/macosx-10.9.5/libxml2-26/libxml2/ |
H A D | xmlschemas.c | 400 xmlSchemaSchemaRelationPtr relations; member in struct:_xmlSchemaBucket 431 /* @relations will hold any included/imported/redefined schemas. */ 432 xmlSchemaSchemaRelationPtr relations; member in struct:_xmlSchemaImport 455 xmlSchemaSchemaRelationPtr relations; member in struct:_xmlSchemaInclude 575 /* xmlSchemaItemListPtr relations; */ /* List of schema relations. */ 3526 if (bucket->relations != NULL) { 3527 xmlSchemaSchemaRelationPtr prev, cur = bucket->relations; 5090 if (bucket->relations != NULL) { 5091 xmlSchemaSchemaRelationPtr rel = bucket->relations; [all...] |
/macosx-10.9.5/pyobjc-42/pyobjc/pyobjc-core/libxml2-src/ |
H A D | xmlschemas.c | 400 xmlSchemaSchemaRelationPtr relations; member in struct:_xmlSchemaBucket 431 /* @relations will hold any included/imported/redefined schemas. */ 432 xmlSchemaSchemaRelationPtr relations; member in struct:_xmlSchemaImport 455 xmlSchemaSchemaRelationPtr relations; member in struct:_xmlSchemaInclude 575 /* xmlSchemaItemListPtr relations; */ /* List of schema relations. */ 3507 if (bucket->relations != NULL) { 3508 xmlSchemaSchemaRelationPtr prev, cur = bucket->relations; 5071 if (bucket->relations != NULL) { 5072 xmlSchemaSchemaRelationPtr rel = bucket->relations; [all...] |
/macosx-10.9.5/emacs-92/emacs/lisp/gnus/ |
H A D | gnus-sum.el | 4105 header references generation relations 4107 ;; First we create an alist of generations/relations, where 4128 relations))) 4130 (push (list (1+ generation) child nil subject) relations)) 4148 (sort relations 'car-less-than-car))
|
/macosx-10.9.5/Heimdal-323.92.1/lib/hcrypto/libtommath/ |
H A D | tommath.tex | 2839 fact that $f(y)$ and $g(y)$ are much smaller than either $a$ or $b$ respectively. As a result finding the $2n + 1$ relations required 2842 When picking points to gather relations there are always three obvious points to choose, $y = 0, 1$ and $ \infty$. The $\zeta_0$ term 3038 With the five relations that Toom-Cook specifies, the following system of equations is formed. 3129 integers the coefficients of the polynomial basis representations $f(x)$ and $g(x)$ are known and can be used to find the relations required. 3131 The first two relations $w_0$ and $w_4$ are the points $\zeta_{0}$ and $\zeta_{\infty}$ respectively. The relation $w_1, w_2$ and $w_3$ correspond 3135 After the five relations $w_0, w_1, \ldots, w_4$ have been computed, the system they represent must be solved in order for the unknown coefficients 3411 multiplications to find the $\zeta$ relations, squaring operations are performed instead. 3529 instead of multiplication to find the five relations. The reader is encouraged to read the description of the latter algorithm and try to
|