Sequences - Xref - Flag - eval

<?php

  // The walks run far - up to two million candidates - and the gate fetches twelve cases at
  // once: the five seconds a sequence has by default ran out on a busy machine and the
  // answer came back short. The budget is not what this case asserts. Nor is PHP's own limit:
  // on a loaded machine the walk took more than its 30 seconds of processor time and the
  // case ended on "Maximum execution time exceeded".

  $padSeqMaxSeconds = 60;

  set_time_limit ( 120 );

?>

[{sequence eval='100 - @', rows=3}{$sequence} {/sequence}][{sequence '1;50;99', flag, eval='100 - @'}{$sequence}{/sequence}][{sequence '-3;-2;-1', flag, eval='@ * -1'}{$sequence}{/sequence}][{sequence '0;1;2;3', flag, eval='@ % 4'}{$sequence}{/sequence}][{sequence '0.5;1;1.5', flag, eval='@ / 2'}{$sequence}{/sequence}][{sequence '8.5;3.5', flag, step=2.5}{$sequence}{/sequence}][{sequence '3.5;8.5', flag, step=2.5}{$sequence}{/sequence}][{sequence '2.5;7.5;5', flag, floor=2.5}{$sequence}{/sequence}][{sequence '30000;30001', flag, eval='@ * 2'}{$sequence}{/sequence}]

<?php

  // A default reach of 100 candidates, so the values asked about stand past the terms made
  // first: each is looked for as far as itself, whatever the terms made so far would project.

  $padSeqDefaultTries = 100;

  // The walks run far - a second or more of candidates - and the gate fetches twelve cases at
  // once: the five seconds a sequence has by default ran out on a busy machine and the
  // answer came back short. The budget is not what this case asserts. Nor is PHP's own limit:
  // on a loaded machine the walk took more than its 30 seconds of processor time and the
  // case ended on "Maximum execution time exceeded".

  $padSeqMaxSeconds = 60;

  set_time_limit ( 120 );

?>

[{sequence '150;500;1000;4000', keep, eval='@ + 1'}{$sequence} {/sequence}][{sequence '150;500;1000;4000', flag, eval='@ + 10'}{$sequence}{/sequence}][{sequence '1000;300;101', keep, eval='@ + 100'}{$sequence} {/sequence}][{sequence '200;400;600', keep, ceil=200}{$sequence} {/sequence}][{sequence '120;240', keep, floor=120}{$sequence} {/sequence}][{sequence '300;600;900', keep, round=300}{$sequence} {/sequence}][{sequence '500;1000;1500', remove, floor=500}{$sequence} {/sequence}][{sequence '202;203;6', keep, eval='@ le 100 ? @ * 3 : @ + 1'}{$sequence} {/sequence}][{sequence '500;7', keep, eval='@ le 100 ? 101 - @ : @'}{$sequence} {/sequence}]

<?php

  // A default reach of 100 candidates, so the terms an expression is looked in are made by the
  // hundred: as far as a value among them, as far as the position a value past them is reached
  // at, and no further for one the terms do not head for. A ceiling of 2000 candidates, so
  // 810000 and 810001 stand past it, where that estimate decides - a value within the ceiling
  // is looked for as far as itself, and 810001 would take the 810,001 terms of '@ ** 2'.

  $padSeqDefaultTries = 100;
  $padSeqMaxTries     = 2000;

?>

[{sequence '1;99;100;101', flag, eval='100 - @'}{$sequence}{/sequence}][{sequence '0;1;5', flag, eval='@ % 4'}{$sequence}{/sequence}][{sequence '-1500;-1499;-1', flag, eval='0 - @'}{$sequence}{/sequence}][{sequence '810000;810001;16', flag, eval='@ ** 2'}{$sequence}{/sequence}][{sequence '9223372036854775807;9223372036854775806;4', flag, eval='@ * 2'}{$sequence}{/sequence}][{sequence '9223372036854775807;4', flag, eval='abc'}{$sequence}{/sequence}][{sequence '1..3', name='i'}{sequence '1..6', keep, eval='@*2'}{$sequence}{/sequence}|{/sequence}][{sequence '1..3', name='i'}{sequence '1..6', keep, eval='@*$i'}{$sequence}{/sequence}|{/sequence}][{sequence '1..20', keep, chance=1, count}{$sequence}{/sequence}][{sequence '1;5;2000', flag, chance=1}{$sequence}{/sequence}]

[{sequence '0..6', flag, eval='@*2'}{$sequence}{/sequence}][{sequence '0..6', keep, eval='@ * 3'}{$sequence} {/sequence}][{sequence '1..5', make, eval='@*2', keep, eval='@*4'}{$sequence} {/sequence}]

<?php

  // The walks run far - up to two million candidates - and the gate fetches twelve cases at
  // once: the five seconds a sequence has by default ran out on a busy machine and the
  // answer came back short. The budget is not what this case asserts. Nor is PHP's own limit:
  // on a loaded machine the walk took more than its 30 seconds of processor time and the
  // case ended on "Maximum execution time exceeded".

  $padSeqMaxSeconds = 60;

  set_time_limit ( 120 );

?>

[{sequence '2000000;3', flag, eval='@ le 10000 ? @ : 2000000'}{$sequence}{/sequence}][{sequence '5;0;7', flag, eval='@ le 20000 ? 0 : 5'}{$sequence}{/sequence}][{sequence '-5;3', flag, eval='@ le 10000 ? @ : 0 - 5'}{$sequence}{/sequence}][{sequence '9223372036854775807;4', flag, eval='@ * 2'}{$sequence}{/sequence}]

[{sequence '9223372036854775807;5', flag, repeat=3}{$sequence}{/sequence}][{sequence '9223372036854775807;5', flag, ceil=3}{$sequence}{/sequence}][{sequence '9223372036854775807;6', flag, step=5}{$sequence}{/sequence}][{sequence '9223372036854775807;4', keep, round=3}{$sequence} {/sequence}][{sequence '9223372036854775807;4', flag, eval='@ * 2'}{$sequence}{/sequence}][{sequence '3;4', flag, repeat=3}{$sequence}{/sequence}]