/macosx-10.10/vim-55/runtime/ftplugin/ |
H A D | cucumber.vim | 29 let steps = s:steps('.') 30 if len(steps) == 0 || len(steps) < a:count 32 elseif len(steps) > 1 && !a:count 33 return 'echoerr "Multiple matching steps found"' 36 return a:command.' +'.steps[c][1].' '.escape(steps[c][0],' %#') 42 let steps = [] 50 let steps 57 function! s:steps(lnum) function [all...] |
/macosx-10.10/ruby-106/ruby/ext/tk/sample/tkextlib/iwidgets/sample/ |
H A D | feedback.rb | 5 Tk::Iwidgets::Feedback.new(:labeltext=>'Status', :steps=>20){|fb|
|
/macosx-10.10/ruby-106/ruby/ext/tk/sample/tkextlib/vu/ |
H A D | canvSticker.rb | 23 steps = [] 25 steps << proc{ 31 steps << proc{ 36 steps << proc{ 42 steps << proc{ 47 steps << proc{ 52 steps << proc{ 57 steps << proc{ 63 steps << proc{ 68 steps << pro [all...] |
/macosx-10.10/WebCore-7600.1.25/css/ |
H A D | CSSTimingFunctionValue.h | 70 static PassRef<CSSStepsTimingFunctionValue> create(int steps, bool stepAtStart) argument 72 return adoptRef(*new CSSStepsTimingFunctionValue(steps, stepAtStart)); 83 CSSStepsTimingFunctionValue(int steps, bool stepAtStart) argument 85 , m_steps(steps)
|
/macosx-10.10/tcl-105/tcl_ext/tcllib/tcllib/modules/struct/stack/ |
H A D | m.c | 278 * Rotates the N top elements of the stack by K steps. 292 /* Syntax: stack rotate count steps 296 int n, steps, start, i, j; 302 Tcl_WrongNumArgs (interp, 2, objv, "count steps"); 309 if (Tcl_GetIntFromObj(interp, objv[3], &steps) != TCL_OK) { 324 steps = steps % n; 325 while (steps < 0) steps += n; 326 steps 290 int n, steps, start, i, j; local [all...] |
/macosx-10.10/libxslt-13/libxslt/libxslt/ |
H A D | pattern.c | 109 /* TODO fix the statically allocated size steps[] */ 114 xsltStepOpPtr steps; /* ops for computation */ member in struct:_xsltCompMatch 156 cur-> steps = (xsltStepOpPtr) xmlMalloc(sizeof(xsltStepOp) * 158 if (cur->steps == NULL) { 188 op = &comp->steps[i]; 198 xmlFree(comp->steps); 227 * steps of an imported stylesheet. 236 comp->steps[ix].previousExtra += style->extrasNr; 237 comp->steps[ix].indexExtra += style->extrasNr; 238 comp->steps[i [all...] |
/macosx-10.10/libxml2-26/libxml2/ |
H A D | pattern.c | 102 int nbStep; /* number of steps in the automata */ 103 int maxStep; /* allocated number of steps */ 104 xmlStreamStepPtr steps; /* the array of steps */ member in struct:_xmlStreamComp 172 xmlStepOpPtr steps; /* ops for computation */ member in struct:_xmlPattern 214 cur->steps = (xmlStepOpPtr) xmlMalloc(cur->maxStep * sizeof(xmlStepOp)); 215 if (cur->steps == NULL) { 243 if (comp->steps != NULL) { 246 op = &comp->steps[i]; 253 xmlFree(comp->steps); [all...] |
H A D | xpath.c | 652 int nbStep; /* Number of steps in this expression */ 653 int maxStep; /* Maximum number of steps allocated */ 654 xmlXPathStepOp *steps; /* ops for computation of this expression */ member in struct:_xmlXPathCompExpr 709 cur->steps = (xmlXPathStepOp *) xmlMalloc(cur->maxStep * 711 if (cur->steps == NULL) { 712 xmlXPathErrMemory(NULL, "allocating steps\n"); 716 memset(cur->steps, 0, cur->maxStep * sizeof(xmlXPathStepOp)); 740 op = &comp->steps[i]; 752 op = &comp->steps[i]; 760 if (comp->steps ! [all...] |
/macosx-10.10/pyobjc-45/2.6/pyobjc/pyobjc-core/libxml2-src/ |
H A D | pattern.c | 99 int nbStep; /* number of steps in the automata */ 100 int maxStep; /* allocated number of steps */ 101 xmlStreamStepPtr steps; /* the array of steps */ member in struct:_xmlStreamComp 169 xmlStepOpPtr steps; /* ops for computation */ member in struct:_xmlPattern 211 cur->steps = (xmlStepOpPtr) xmlMalloc(cur->maxStep * sizeof(xmlStepOp)); 212 if (cur->steps == NULL) { 240 if (comp->steps != NULL) { 243 op = &comp->steps[i]; 250 xmlFree(comp->steps); [all...] |
H A D | xpath.c | 574 int nbStep; /* Number of steps in this expression */ 575 int maxStep; /* Maximum number of steps allocated */ 576 xmlXPathStepOp *steps; /* ops for computation of this expression */ member in struct:_xmlXPathCompExpr 631 cur->steps = (xmlXPathStepOp *) xmlMalloc(cur->maxStep * 633 if (cur->steps == NULL) { 634 xmlXPathErrMemory(NULL, "allocating steps\n"); 638 memset(cur->steps, 0, cur->maxStep * sizeof(xmlXPathStepOp)); 662 op = &comp->steps[i]; 674 op = &comp->steps[i]; 682 if (comp->steps ! [all...] |
/macosx-10.10/tcl-105/tcl_ext/incrtcl/iwidgets/generic/ |
H A D | feedback.itk | 87 itk_option define -steps steps Steps 10 157 # OPTION: -steps 159 # Set the total number of steps. 161 itcl::configbody iwidgets::Feedback::steps { 173 # of steps. 180 $itk_option(-steps)}] 181 set fraction [expr {int((1.0*$_stepval)/$itk_option(-steps)*100.0)}] 206 if {$_stepval >= $itk_option(-steps)} {
|
/macosx-10.10/tcl-105/tcl_ext/tcllib/tcllib/modules/struct/ |
H A D | stack_oo.tcl | 227 # Rotate the top count number of items by step number of steps. 231 # steps number of steps to rotate. 236 method rotate {count steps} { 246 # repeat $steps times 249 set steps [expr {$steps % $count}] 251 if {$steps == 0} return 253 for {set i 0} {$i < $steps} {incr i} {
|
H A D | stack_tcl.tcl | 429 # Rotate the top count number of items by step number of steps. 434 # steps number of steps to rotate. 439 proc ::struct::stack::I::rotate {name count steps} { 451 # repeat $steps times 454 set steps [expr {$steps % $count}] 456 if {$steps == 0} return 458 for {set i 0} {$i < $steps} {incr i} {
|
/macosx-10.10/WebCore-7600.1.25/platform/animation/ |
H A D | TimingFunction.h | 190 static PassRefPtr<StepsTimingFunction> create(int steps, bool stepAtStart) argument 192 return adoptRef(new StepsTimingFunction(steps, stepAtStart)); 211 void setNumberOfSteps(int steps) { m_steps = steps; } argument 217 StepsTimingFunction(int steps, bool stepAtStart) argument 219 , m_steps(steps)
|
/macosx-10.10/tcl-105/tcl_ext/bwidget/bwidget/ |
H A D | wizard.tcl | 115 Widget::addmap Wizard "" .steps { -width {} -height {} } 134 steps "" 169 PagesManager $path.steps 170 pack $path.steps -expand 1 -fill both 172 widgets $path set steps -widget $path.steps 243 Widget::getVariable $path steps 274 Widget::getVariable $path steps 284 if {[info exists steps($item)]} { 548 return [lrange $data(steps) [all...] |
/macosx-10.10/WebCore-7600.1.25/loader/ |
H A D | NavigationScheduler.h | 75 void scheduleHistoryNavigation(int steps);
|
H A D | NavigationScheduler.cpp | 416 void NavigationScheduler::scheduleHistoryNavigation(int steps) argument 424 if (steps > backForward.forwardCount() || -steps > backForward.backCount()) { 430 schedule(std::make_unique<ScheduledHistoryNavigation>(steps));
|
/macosx-10.10/ruby-106/ruby/ext/tk/sample/ |
H A D | tkoptdb-safeTk.rb | 46 "and the following steps are evaluated. \n",
|
/macosx-10.10/tcl-105/tcl_ext/tdom/tdom/generic/ |
H A D | domxpath.h | 178 int xpathMatches (ast steps, domNode * exprContext, domNode *nodeToMatch, 182 int xpathEvalSteps (ast steps, xpathResultSet *nodeList,
|
H A D | domxpath.c | 243 static int xpathEvalPredicate (ast steps, domNode *exprContext, 5101 ast steps, 5120 if ( steps->next 5121 && steps->next->type == Pred 5122 && steps->type != AxisDescendantOrSelf 5123 && steps->type != AxisDescendant) { 5125 rc = xpathEvalStep( steps, currentNode, exprContext, currentPos, 5131 rc = xpathEvalPredicate (steps->next, exprContext, result, &stepResult, 5136 /* for steps not followed by a predicate immediately add to 5138 rc = xpathEvalStep( steps, currentNod 5100 xpathEvalStepAndPredicates( ast steps, xpathResultSet *nodeList, domNode *currentNode, domNode *exprContext, int currentPos, int *docOrder, xpathCBs *cbs, xpathResultSet *result, char **errMsg ) argument 5151 xpathEvalSteps( ast steps, xpathResultSet *nodeList, domNode *currentNode, domNode *exprContext, int currentPos, int *docOrder, xpathCBs *cbs, xpathResultSet *result, char **errMsg ) argument [all...] |
/macosx-10.10/JavaScriptCore-7600.1.17/replay/scripts/ |
H A D | CodeGeneratorReplayInputs.py | 881 steps = [] 886 steps.extend([ 890 if len(steps) == 0: 891 steps.extend([ 896 return "\n".join(steps) 899 steps = [] 911 steps.append("\n".join(lines)) 913 if len(steps) == 0: 914 steps.extend([ 918 return "\n".join(steps) [all...] |
/macosx-10.10/IOGraphics-485/IOGraphicsFamily/ |
H A D | IOBacklightDisplay.cpp | 356 SInt32 current, min, max, steps; local 439 steps = fadeTime / 16667; 447 if (steps > fFadeStateFadeDelta) steps = fFadeStateFadeDelta; 459 fadeTime /= steps; 460 fFadeStateEnd = (steps - 1);
|
/macosx-10.10/Security-57031.1.35/Security/include/security_cryptkit/CurveParamDocs/ |
H A D | fmodule.c | 174 pollard_rho(giant N, giant fact, int steps, int abort) argument 175 /* Perform Pollard-rho x:= 3; loop(x:= x^2 + 2), a total of steps times. 181 every 1000 steps). If abort := 0, the full number 182 of steps are always performed, then one solitary GCD is taken, 191 for(j=0; j < steps; j++) { 196 if(((j % 1000 == 999) && abort) || (j == steps-1)) { 227 every 100 steps). If abort := 0, the full number 228 of steps are always performed, then one solitary GCD is taken,
|
/macosx-10.10/Security-57031.1.35/Security/libsecurity_cryptkit/lib/CurveParamDocs/ |
H A D | fmodule.c | 174 pollard_rho(giant N, giant fact, int steps, int abort) argument 175 /* Perform Pollard-rho x:= 3; loop(x:= x^2 + 2), a total of steps times. 181 every 1000 steps). If abort := 0, the full number 182 of steps are always performed, then one solitary GCD is taken, 191 for(j=0; j < steps; j++) { 196 if(((j % 1000 == 999) && abort) || (j == steps-1)) { 227 every 100 steps). If abort := 0, the full number 228 of steps are always performed, then one solitary GCD is taken,
|
/macosx-10.10/tcl-105/tcl_ext/tcllib/tcllib/modules/math/ |
H A D | polynomials.tcl | 447 set steps [expr { [degreePolyn $polyn1] - [degreePolyn $polyn2] + 1 }] 452 if { $steps <= 0 } { 456 for { set i 1 } { $i < $steps } { incr i } { 465 for { set i 0 } { $i < $steps } { incr i } {
|