Searched refs:pieces (Results 1 - 25 of 40) sorted by relevance

12

/macosx-10.10.1/ICU-531.30/icuSources/common/
H A Dcaniter.cpp69 pieces(NULL),
88 if(pieces != NULL) {
90 if(pieces[i] != NULL) {
91 delete[] pieces[i];
94 uprv_free(pieces);
95 pieces = NULL;
144 buffer.append(pieces[i][current[i]]);
183 pieces = (UnicodeString **)uprv_malloc(sizeof(UnicodeString *));
188 if (pieces == NULL || pieces_lengths == NULL || current == NULL) {
193 pieces[
[all...]
H A Ducnv_imp.h102 * If the args are passed in, then the pieces must be passed in too.
104 * - pieces==NULL && args==NULL
105 * - pieces!=NULL && args==NULL
106 * - pieces!=NULL && args!=NULL
111 UConverterNamePieces *pieces,
/macosx-10.10.1/ruby-106/ruby/benchmark/
H A Dbm_so_meteor_contest.rb302 # can be filled up with pieces. A board is prunable if there is a grouping of unfilled spaces
315 # slotting -- set to true only when testing initial pieces, when filling normally
391 # in pieces to see what configurations work for them (the only other time this algorithm is used).
448 # (an odd number). Checking even vs odd then produces a higher probability of finding more pieces earlier
450 # diminsh over time. Since we are TOLD how many to search for this lets us exit before checking all pieces
455 (@pieces.length-1).times do
456 piece = @pieces.shift
463 @pieces.push(piece)
465 piece = @pieces.shift
466 @pieces
[all...]
/macosx-10.10.1/Chess-310.6/sjeng/
H A Dsegtb.c35 #define TWO_PIECE_FILE "stb/2pieces.bin"
128 /* pieces on the same square? */
150 /* pieces on the same square? */
186 i = pieces[j];
305 pieces[1] = upscale[w];
306 pieces[2] = upscale[b];
352 pieces[1] = 0;
353 pieces[2] = 0;
413 pieces[1] = upscale[w];
414 pieces[
[all...]
H A Dutils.c440 memset(pieces, 0, sizeof(pieces));
704 if (squares[pieces[i]] != i && pieces[i] != 0)
710 if (board[pieces[i]] == npiece && pieces[i] != 0)
716 if (pieces[i] == 0 && squares[pieces[i]] != 0)
737 if (pieces[squares[i]] != i && squares[i] != 0)
760 promoted_board[pieces[
[all...]
H A Dmoves.c480 i = pieces[j];
591 i = pieces[j];
1332 Also, we have to handle pieces[] and squares[] specially */
1337 /* find first empty slot in pieces[] */
1338 for(find_slot = 1; (pieces[find_slot] != 0); find_slot++)
1342 pieces[find_slot] = target;
1374 /* update the "general" pieces[] / squares[] info (special moves need
1378 pieces[squares[target]] = 0;
1379 pieces[squares[from]] = target;
1463 pieces[square
[all...]
H A Dextvars.h57 extern int pieces[62];
H A Dleval.c152 i = pieces[j];
178 bonuses for all pieces encountered: */
180 i = pieces[j];
210 since there may be no pieces to take advantage of it): */
274 since there may be no pieces to take advantage of it): */
H A Dneval.c203 i = pieces[j];
229 bonuses for all pieces encountered: */
231 i = pieces[j];
265 since there may be no pieces to take advantage of it): */
377 since there may be no pieces to take advantage of it): */
763 i = pieces[j];
842 i = pieces[j];
872 bonuses for all pieces encountered: */
874 i = pieces[j];
1273 storms, and open lines for heavy pieces
[all...]
H A Dseval.c129 * pieces that can sac themselves to it? */
206 * pieces that can sac themselves to it? */
213 * pieces that can sac themselves to it? */
326 i = pieces[j];
352 bonuses for all pieces encountered: */
354 i = pieces[j];
385 since there may be no pieces to take advantage of it): */
444 since there may be no pieces to take advantage of it): */
H A Dattacks.c54 /* otherwise, check for sliding pieces: */
119 /* otherwise, check for sliding pieces: */
182 i = pieces[j];
387 /* otherwise, check for sliding pieces: */
432 /* otherwise, check for sliding pieces: */
486 /* otherwise, check for sliding pieces: */
528 /* otherwise, check for sliding pieces: */
H A Deval.c456 bonuses for all pieces encountered: */
458 i = pieces[j];
H A Dproof.c252 i = pieces[j];
280 /* white has no pieces */
294 /* black has no pieces */
326 i = pieces[j];
/macosx-10.10.1/ICU-531.30/icuSources/common/unicode/
H A Dcaniter.h83 * Cleans pieces
168 // 2 dimensional array holds the pieces of the string with
170 UnicodeString **pieces; member in class:CanonicalIterator
174 // current is used in iterating to combine pieces
/macosx-10.10.1/Chess-310.6/Sources/
H A DMBCLanguageModel.mm279 SRLanguageModel pieces;
280 SRNewLanguageModel(fSystem, &pieces, "droppiece", 9);
286 SRAddText(pieces, sPieceName[piece], strlen(sPieceName[piece]),
301 [self addTo:model languageObject:pieces];
H A DMBCBoardView.h167 - (void) setStyleForBoard:(NSString *)boardStyle pieces:(NSString *)pieceStyle;
H A DMBCBoardView.mm295 - (void) setStyleForBoard:(NSString *)boardStyle pieces:(NSString *)pieceStyle
/macosx-10.10.1/CPANInternal-159.1/DateTime-Format-Builder-0.81/lib/DateTime/Format/Builder/Parser/
H A DQuick.pm83 (These two pieces of code can both be found in the test
/macosx-10.10.1/tcl-105/tcl_ext/tcllib/tcllib/modules/doctools2base/
H A Dtcl_parse.tcl20 # TODO :: ('parser') to handle the command pieces embedded in the
461 # Now try to match possible pieces of the string. This is
668 set pieces [split [string range $mydata $a $e] \n]
669 set delta [string length [lindex $pieces end]]
670 set nlines [expr {[llength $pieces] - 1}]
/macosx-10.10.1/awk-20/src/
H A DREADME60 equivalent), you must compile the pieces manually. We have
/macosx-10.10.1/cron-39/doc/
H A DINSTALL55 Edit your /usr/lib/crontab file into little pieces -- see the CONVERSION file
58 Use the `crontab' command to install all the little pieces you just created.
/macosx-10.10.1/CPANInternal-159.1/DateTime-Format-Builder-0.80/lib/DateTime/Format/Builder/Parser/
H A DQuick.pm33 (These two pieces of code can both be found in the test
/macosx-10.10.1/Security-57031.1.35/Security/sec/SOSCircle/SecureObjectSync/
H A DSOSTransportCoder.c152 #warning this should be SOSTransportMessage and be split up into coder/message pieces
/macosx-10.10.1/emacs-93/emacs/lisp/eshell/
H A Desh-cmd.el643 (let* ((pieces (eshell-separate-commands subterms "|"))
644 (p pieces))
655 (if (<= (length pieces) 1)
656 (car pieces)
659 (list 'quote pieces))))))
/macosx-10.10.1/bash-94.1.2/bash-3.2/lib/sh/
H A Dstrftime.c741 some pieces of code from your own strftime. When doing that it came

Completed in 121 milliseconds

12