Searched refs:words (Results 76 - 100 of 329) sorted by relevance

1234567891011>>

/macosx-10.10.1/JavaScriptCore-7600.1.17/runtime/
H A DStructureIDBlob.h62 int32_t blobExcludingStructureID() const { return u.words.word2; }
87 } words; member in union:JSC::StructureIDBlob::__anon2682
/macosx-10.10.1/emacs-93/emacs/lisp/progmodes/
H A Dld-script.el149 `((,(regexp-opt ld-script-keywords 'words)
151 (,(regexp-opt ld-script-builtins 'words)
/macosx-10.10.1/llvmCore-3425.0.34/utils/emacs/
H A Dtablegen-mode.el17 'words))
19 'words))
/macosx-10.10.1/Libc-1044.1.2/net/FreeBSD/
H A Dinet_net_pton.c279 int words; local
346 words = (bits + 15) / 16;
347 if (words < 2)
348 words = 2;
350 words = 8;
351 endp = tmp + 2 * words;
/macosx-10.10.1/tcl-105/tcl_ext/tcllib/tcllib/modules/otp/
H A Dotp.tcl280 # Encode 64 bits as words selected from the RFC 2289 dictionary.
309 lappend words [lindex $Words $w]
312 return $words
353 array set opts {-hash md5 -seed {} -count 0 -hex 0 -words 0}
358 -words { set opts(-words) 1 }
398 } elseif {$opts(-words)} {
/macosx-10.10.1/bash-94.1.2/bash-3.2/
H A Dexecute_cmd.c2472 words in the expression. */
2736 fix_assignment_words (words)
2737 WORD_LIST *words;
2742 if (words == 0)
2747 for (w = words; w; w = w->next)
2752 b = builtin_address_internal (words->word->word, 0);
2756 words->word->flags |= W_ASSNBLTIN;
2771 WORD_LIST *words, *lastword; local
2811 simple_command->words ? (simple_command->words
[all...]
/macosx-10.10.1/WTF-7600.1.24/wtf/
H A DBitmap.h61 static const unsigned words = (Size + wordSize - 1) / wordSize; member in class:WTF::Bitmap
70 std::array<WordType, words> bits;
199 for (size_t i = start / wordSize; i < words; ++i)
207 for (size_t i = 0; i < words; ++i)
216 for (size_t i = 0; i < words; ++i)
/macosx-10.10.1/pyobjc-45/2.5/pyobjc/pyobjc-framework-LatentSemanticMapping/PyObjCTest/
H A Dtest_latentsemanticmapping.py87 words = LSMTextCreate(None, map)
88 self.failUnlessIsInstance(words, LSMTextRef)
90 v = LSMTextAddWord(words, "the")
92 v = LSMTextAddWord(words, "and")
102 v = LSMMapSetStopWords(map, words)
/macosx-10.10.1/pyobjc-45/2.6/pyobjc/pyobjc-framework-LatentSemanticMapping/PyObjCTest/
H A Dtest_latentsemanticmapping.py87 words = LSMTextCreate(None, map)
88 self.assertIsInstance(words, LSMTextRef)
90 v = LSMTextAddWord(words, "the")
92 v = LSMTextAddWord(words, "and")
102 v = LSMMapSetStopWords(map, words)
/macosx-10.10.1/pyobjc-45/pyobjc/pyobjc-framework-LatentSemanticMapping-2.5.1/PyObjCTest/
H A Dtest_latentsemanticmapping.py97 words = LSMTextCreate(None, map)
98 self.assertIsInstance(words, LSMTextRef)
100 v = LSMTextAddWord(words, "the")
102 v = LSMTextAddWord(words, "and")
112 v = LSMMapSetStopWords(map, words)
/macosx-10.10.1/tcl-105/tcl_ext/tcllib/tcllib/modules/aes/
H A Daes.tcl214 # Split the key into Nk big-endian words
260 proc ::aes::SubBytes {words} {
262 foreach w $words {
269 proc ::aes::InvSubBytes {words} {
271 foreach w $words {
278 proc ::aes::ShiftRows {words} {
283 lappend r [expr {( [lindex $words $n0] & 0xff000000)
284 | ([lindex $words $n1] & 0x00ff0000)
285 | ([lindex $words $n2] & 0x0000ff00)
286 | ([lindex $words
[all...]
/macosx-10.10.1/Heimdal-398.1.2/kpasswd/
H A Dkpasswd-generator.c60 errx(1, "%s is an empty file, no words to try", filename);
82 char **words; local
89 nwords = read_words (filename, &words);
92 char *name = words[rand() % nwords];
/macosx-10.10.1/OpenSSL098-52/src/crypto/bn/
H A Dbn_lib.c298 /* The caller MUST check that words > b->dmax before calling this */
299 static BN_ULONG *bn_expand_internal(const BIGNUM *b, int words) argument
307 if (words > (INT_MAX/(4*BN_BITS2)))
317 a=A=(BN_ULONG *)OPENSSL_malloc(sizeof(BN_ULONG)*words);
356 memset(A,0,sizeof(BN_ULONG)*words);
375 BIGNUM *bn_dup_expand(const BIGNUM *b, int words) argument
382 * words <= b->dmax && top < words
387 if (words > b->dmax)
389 BN_ULONG *a = bn_expand_internal(b, words);
426 bn_expand2(BIGNUM *b, int words) argument
[all...]
/macosx-10.10.1/bind9-45.101/bind9/unit/atf-src/atf-c/
H A Dbuild.c49 atf_list_t words; local
51 err = atf_text_split(atf_config_get(var), " ", &words);
55 atf_list_append_list(argv, &words);
/macosx-10.10.1/cups-408/cups/cgi-bin/
H A Dhelp-index.c25 * List of common English words that should not be indexed...
493 * Then write the words associated with the node...
496 for (word = (help_word_t *)cupsArrayFirst(node->words);
498 word = (help_word_t *)cupsArrayNext(node->words))
610 for (word = (help_word_t *)cupsArrayFirst(node->words);
612 word = (help_word_t *)cupsArrayNext(node->words))
658 * Create the words array as needed...
661 if (!n->words)
662 n->words = cupsArrayNew((cups_array_func_t)help_sort_words, NULL);
670 if ((w = (help_word_t *)cupsArrayFind(n->words,
[all...]
/macosx-10.10.1/apache-793/httpd/server/
H A Dutil_expr_parse.y94 %type <exVal> words
147 | '{' words '}' { $$ = $2; }
150 words : word { $$ = ap_expr_make(op_ListElement, $1, NULL, ctx); } label
151 | words ',' word { $$ = ap_expr_make(op_ListElement, $3, $1, ctx); }
/macosx-10.10.1/bash-94.1.2/bash-3.2/examples/scripts/
H A Dline-input.bash83 # ^W is used to delete words
176 echo "Use ^H/Backspace/Del to erase, ^W to kill words, ^U to kill the"
/macosx-10.10.1/libxml2-26/libxml2/doc/
H A Dindex.py63 "words" : """CREATE TABLE words (
216 """INSERT INTO words (name, symbol, relevance) VALUES ('%s','%s', %d)""" %
221 """UPDATE words SET relevance = %d where name = '%s' and symbol = '%s'""" %
225 print "UPDATE words SET relevance = %d where name = '%s' and symbol = '%s'" % (relevance, name, symbol)
950 words = 0
953 words = words + addStringHTML(content, resource, id, section, 5)
956 return words
959 words
[all...]
/macosx-10.10.1/libxslt-13/libxslt/doc/
H A Dindex.py941 words = 0
944 words = words + addStringHTML(content, resource, id, section, 5)
947 return words
950 words = 0
953 words = words + addStringHTML(content, resource, id, section, 5)
956 return words
959 words = 0
962 words
[all...]
/macosx-10.10.1/objc4-646/runtime/
H A Dobjc-layout.mm221 size_t words = instanceSize / sizeof(id);
224 result.bitCount = words;
225 result.bitsAllocated = words;
226 result.bits = (uint8_t *)_calloc_internal((words+7)/8, 1);
255 size_t words = instanceSize / sizeof(id);
258 result.bitCount = words;
259 result.bitsAllocated = words;
260 result.bits = (uint8_t *)_calloc_internal((words+7)/8, 1);
/macosx-10.10.1/tcl-105/tcl_ext/tklib/tklib/modules/diagrams/
H A Dcore.tcl512 method Directions {shape words} {
513 #puts AU||$shape|u(([{*}$words peek [{*}$words size]]))
520 $self ProcessPoints $words newdirection
524 {*}$words unget $p
525 {*}$words unget then
527 #puts AU|||x(([{*}$words peek [{*}$words size]]))
998 method GetPoints {words} {
999 set p [$self ProcessPoints $words newdirectio
[all...]
/macosx-10.10.1/xar-254/xar/src/
H A DMakefile.inc.in40 ifneq ($(words "" @RPATH@), 1)
56 ifneq ($(words "" @RPATH@), 1)
/macosx-10.10.1/cxxfilt-11/cxxfilt/opcodes/
H A Dz8k-dis.c33 of bytes is used, and every 4th entry of words). */
36 unsigned short words[24]; member in struct:__anon7802
89 priv->words[i] = (p[0] << 8) | p[1];
316 instr_word = instr_data->words[nibl_count & ~3];
370 instr_long = (instr_data->words[nibl_count] << 16)
371 | (instr_data->words[nibl_count + 4]);
403 instr_long = (instr_data->words[nibl_count] << 16)
404 | (instr_data->words[nibl_count + 4]);
/macosx-10.10.1/CPANInternal-159.1/Graph-0.94/lib/Graph/
H A DBitMatrix.pm174 $u and $v; in other words, if there is (at least one) a vertex going from
179 Set the bit between the vertices $u and $v; in other words, connect
185 Unset the bit between the vertices $u and $v; in other words, disconnect
197 in other words, connects the vertex C<u> to the vertices C<vi>.
204 in other words, disconnects the vertex C<u> from the vertices C<vi>.
/macosx-10.10.1/CPANInternal-159.1/Graph-0.96/lib/Graph/
H A DBitMatrix.pm174 $u and $v; in other words, if there is (at least one) a vertex going from
179 Set the bit between the vertices $u and $v; in other words, connect
185 Unset the bit between the vertices $u and $v; in other words, disconnect
197 in other words, connects the vertex C<u> to the vertices C<vi>.
204 in other words, disconnects the vertex C<u> from the vertices C<vi>.

Completed in 501 milliseconds

1234567891011>>