/macosx-10.10.1/bind9-45.101/bind9/lib/dns/ |
H A D | order.c | 18 /* $Id: order.c,v 1.10 2007/06/19 23:47:16 tbox Exp $ */ 32 #include <dns/order.h> 53 #define DNS_ORDER_VALID(order) ISC_MAGIC_VALID(order, DNS_ORDER_MAGIC) 57 dns_order_t *order; local 62 order = isc_mem_get(mctx, sizeof(*order)); 63 if (order == NULL) 66 ISC_LIST_INIT(order->ents); 69 result = isc_refcount_init(&order 83 dns_order_add(dns_order_t *order, dns_name_t *name, dns_rdatatype_t rdtype, dns_rdataclass_t rdclass, unsigned int mode) argument 118 dns_order_find(dns_order_t *order, dns_name_t *name, dns_rdatatype_t rdtype, dns_rdataclass_t rdclass) argument 148 dns_order_t *order; local [all...] |
/macosx-10.10.1/Heimdal-398.1.2/lib/roken/ |
H A D | tsearch-test.c | 19 int order; member in struct:node 46 list_node(const void *ptr, VISIT order, int level) argument 50 if (order == postorder || order == leaf) { 52 if (p->order != walkorder) { 54 p->order); 83 warnx("erroneous list: found %d\n", p->order); 92 warnx("erroneous list: missing %d\n", t->order); 105 warnx("erroneous list: missing %d\n", t->order); 118 warnx("erroneous list: found %d\n", p->order); [all...] |
/macosx-10.10.1/ICU-531.30/icuSources/i18n/unicode/ |
H A D | coleitr.h | 66 * The key of a character, is an integer composed of primary order(short), 67 * secondary order(char), and tertiary order(char). Java strictly defines the 82 * int32_t order = c->next(success); 84 * order = c->previous(success); 91 * The method next() returns the collation order of the next character based on 93 * collation order of the previous character based on the comparison level of 100 * Hence at the next call of next() or previous(), the first or last collation order, 101 * or collation order at the spefcifieid position will be returned. If a change of 107 * Character based on the comparison level of the collator. A collation order 380 primaryOrder(int32_t order) argument 385 secondaryOrder(int32_t order) argument 390 tertiaryOrder(int32_t order) argument 395 isIgnorable(int32_t order) argument [all...] |
/macosx-10.10.1/DiskArbitration-268/diskarbitrationd/ |
H A D | DAStage.h | 33 extern CFRunLoopSourceRef DAStageCreateRunLoopSource( CFAllocatorRef allocator, CFIndex order );
|
H A D | DAThread.h | 37 extern CFRunLoopSourceRef DAThreadCreateRunLoopSource( CFAllocatorRef allocator, CFIndex order );
|
/macosx-10.10.1/tcl-105/tcl_ext/tklib/tklib/modules/tkpiechart/ |
H A D | selector.tcl | 11 ::set ($this,order) 0 17 variable ${this}order 19 catch {::unset ${this}selected ${this}order} 33 variable ${this}order 49 # keep track of action order 50 ::set ${this}order($index) $($this,order) 51 incr ($this,order) 68 variable ${this}order 71 ::unset ${this}selected($index) ${this}order( [all...] |
/macosx-10.10.1/tcl-105/tcl_ext/tcllib/tcllib/modules/struct/graph/ |
H A D | walk.h | 12 #define W_USAGE "node ?-dir forward|backward? ?-order pre|post|both? ?-type bfs|dfs? -command cmd" 30 int* type, int* order, int* dir, 34 int type, int order, int dir,
|
/macosx-10.10.1/OpenSSL098-52/src/crypto/ecdsa/ |
H A D | ecs_ossl.c | 93 BIGNUM *k = NULL, *r = NULL, *order = NULL, *X = NULL; local 117 order = BN_new(); 119 if (!k || !r || !order || !X) 129 if (!EC_GROUP_get_order(group, order, ctx)) 139 if (!BN_rand_range(k, order)) 151 if (!BN_add(k, k, order)) goto err; 152 if (BN_num_bits(k) <= BN_num_bits(order)) 153 if (!BN_add(k, k, order)) goto err; 179 if (!BN_nnmod(r, X, order, ctx)) 188 if (!BN_mod_inverse(k, k, order, ct 224 BIGNUM *kinv=NULL, *s, *m=NULL,*tmp=NULL,*order=NULL; local 356 BIGNUM *order, *u1, *u2, *m, *X; local [all...] |
/macosx-10.10.1/CPANInternal-159.1/Graph-0.96/lib/Graph/Traversal/ |
H A D | BFS.pm | 10 $self->{ order }->[ 0 ]; 15 shift @{ $self->{ order } }; 39 With this class one can traverse a Graph in breadth-first order. 51 Traverse the graph in breadth-first order. Returns all vertices 52 traversed in post-order.
|
H A D | DFS.pm | 10 $self->{ order }->[ -1 ]; 15 pop @{ $self->{ order } }; 39 With this class one can traverse a Graph in depth-first order. 51 Traverse the graph in depth-first order. Returns all vertices 52 traversed in post-order.
|
/macosx-10.10.1/CPANInternal-159.1/Perl4-CoreLibs-0.003/lib/ |
H A D | newgetopt.pl | 14 # Values for $order. See GNU getopt.c for details. 24 $order = $REQUIRE_ORDER; 32 $order = $PERMUTE; 57 $Getopt::Long::order = $newgetopt::order 58 if defined $newgetopt::order;
|
/macosx-10.10.1/OpenSSL098-52/src/crypto/ec/ |
H A D | ec_check.c | 62 BIGNUM *order; local 76 if ((order = BN_CTX_get(ctx)) == NULL) goto err; 97 /* check the order of the generator */ 99 if (!EC_GROUP_get_order(group, order, ctx)) goto err; 100 if (BN_is_zero(order)) 106 if (!EC_POINT_mul(group, point, order, NULL, NULL, ctx)) goto err;
|
/macosx-10.10.1/bind9-45.101/bind9/bin/tests/system/rrsetorder/ns1/ |
H A D | named.conf | 31 rrset-order { 32 name "fixed.example" order fixed; 33 name "random.example" order random; 34 name "cyclic.example" order cyclic; 35 type NS order random; 36 order cyclic;
|
/macosx-10.10.1/bind9-45.101/bind9/bin/tests/system/rrsetorder/ns2/ |
H A D | named.conf | 32 rrset-order { 33 name "fixed.example" order fixed; 34 name "random.example" order random; 35 name "cyclic.example" order cyclic; 36 type NS order random; 37 order cyclic;
|
/macosx-10.10.1/bind9-45.101/bind9/bin/tests/system/rrsetorder/ns3/ |
H A D | named.conf | 32 rrset-order { 33 name "fixed.example" order fixed; 34 name "random.example" order random; 35 name "cyclic.example" order cyclic; 36 type NS order random; 37 order cyclic;
|
/macosx-10.10.1/libstdcxx-104.1/include/c++/4.2.1/ext/pb_ds/detail/tree_policy/ |
H A D | order_statistics_imp.hpp | 50 find_by_order(size_type order) argument 64 if (order == o) 66 else if (order < o) 70 order -= o + 1; 82 find_by_order(size_type order) const 84 return (const_cast<PB_DS_CLASS_C_DEC* >(this)->find_by_order(order));
|
/macosx-10.10.1/bind9-45.101/bind9/lib/dns/include/dns/ |
H A D | order.h | 18 /* $Id: order.h,v 1.9 2007/06/19 23:47:17 tbox Exp $ */ 23 /*! \file dns/order.h */ 35 * Create a order object. 47 dns_order_add(dns_order_t *order, dns_name_t *name, 51 * Add a entry to the end of the order list. 54 * \li 'order' to be valid. 65 dns_order_find(dns_order_t *order, dns_name_t *name, 71 *\li 'order' to be valid.
|
/macosx-10.10.1/ruby-106/ruby/test/rubygems/ |
H A D | test_gem_dependency_list.rb | 45 order = @deplist.dependency_order 47 assert_equal %w[d-1 c-1 b-1 a-1], order.map { |s| s.full_name } 54 order = @deplist.dependency_order 56 assert_equal %w[b-1 c-1 a-1], order.map { |s| s.full_name } 72 order = deplist.dependency_order 74 assert_equal %w[g-1 a-1 f-1 e-1], order.map { |s| s.full_name }, 80 order = deplist2.dependency_order 82 assert_equal %w[a-1 g-1 f-1 e-1], order.map { |s| s.full_name }, 92 order = @deplist.dependency_order 94 assert_equal %w[d-1 c-2 b-1 a-2 e-1], order [all...] |
/macosx-10.10.1/CPANInternal-159.1/Graph-0.94/lib/Graph/Traversal/ |
H A D | BFS.pm | 10 $self->{ order }->[ 0 ]; 15 shift @{ $self->{ order } }; 39 With this class one can traverse a Graph in breadth-first order. 51 Traverse the graph in depth-first order.
|
H A D | DFS.pm | 10 $self->{ order }->[ -1 ]; 15 pop @{ $self->{ order } }; 39 With this class one can traverse a Graph in depth-first order. 51 Traverse the graph in depth-first order.
|
/macosx-10.10.1/Heimdal-398.1.2/lib/gssapi/krb5/ |
H A D | gsskrb5_crypto.h | 47 struct gss_msg_order *order; member in struct:gsskrb5_crypto
|
/macosx-10.10.1/bind9-45.101/bind9/lib/dns/rdata/in_1/ |
H A D | naptr_35.h | 29 isc_uint16_t order; member in struct:dns_rdata_in_naptr
|
/macosx-10.10.1/BerkeleyDB-21/db/test/ |
H A D | test106.tcl | 58 foreach order { ordered random } { 61 puts "\tTest$tnum.a: Start deadlock detector ($order)." 65 puts "\tTest$tnum.b: Start consumer process ($order)." 69 $testdir/t106script.log.cons.$order.1 $testdir WAIT \ 70 0 $nproducers $testdir/CONSUMERLOG 1 $tnum $order $niter \ 74 puts "\tTest$tnum.c: Initialize producers ($order)." 78 $testdir/t106script.log.init.$order.$p \ 81 $order $niter $args &] 91 puts "\tTest$tnum.d: Run producers in RMW mode ($order)." 95 $testdir/t106script.log.prod.$order [all...] |
/macosx-10.10.1/libstdcxx-104.1/include/c++/4.2.1/ext/pb_ds/detail/trie_policy/ |
H A D | order_statistics_imp.hpp | 50 find_by_order(size_type order) argument 55 ++order; 63 if (order > nd_it.get_metadata()) 75 if (order <= child_nd_it.get_metadata()) 82 order -= child_nd_it.get_metadata(); 90 find_by_order(size_type order) const 92 return (const_cast<PB_DS_CLASS_C_DEC* >(this)->find_by_order(order));
|
/macosx-10.10.1/ICU-531.30/icuSources/layout/ |
H A D | LookupProcessor.cpp | 67 for (le_uint16 order = 0; order < lookupOrderCount && LE_SUCCESS(success); order += 1) { 68 le_uint16 lookup = lookupOrderArray[order]; 113 le_int32 LookupProcessor::selectLookups(const LEReferenceTo<FeatureTable> &featureTable, FeatureMask featureMask, le_int32 order, LEErrorCode &success) argument 116 le_int32 store = order; 130 return store - order; 190 le_int32 count, order = 0; local 238 count += selectLookups(requiredFeatureTable, fm.mask, order, success); 244 OpenTypeUtilities::sort(lookupOrderArray, order); [all...] |