Searched refs:memo (Results 1 - 25 of 27) sorted by relevance

12

/macosx-10.9.5/ruby-104/ruby/
H A Denum.c49 NODE *memo = RNODE(args); local
52 if (RTEST(rb_funcall(memo->u1.value, id_eqq, 1, i))) {
53 rb_ary_push(memo->u2.value, i);
61 NODE *memo = RNODE(args); local
64 if (RTEST(rb_funcall(memo->u1.value, id_eqq, 1, i))) {
65 rb_ary_push(memo->u2.value, rb_yield(i));
92 NODE *memo = NEW_MEMO(pat, ary, 0); local
94 rb_block_call(obj, id_each, 0, 0, rb_block_given_p() ? grep_iter_i : grep_i, (VALUE)memo);
102 NODE *memo = RNODE(memop); local
106 if (rb_equal(i, memo
115 NODE *memo = RNODE(memop); local
126 NODE *memo = RNODE(memop); local
154 NODE *memo; local
184 NODE *memo = RNODE(memop); local
214 NODE *memo; local
233 NODE *memo = RNODE(memop); local
248 NODE *memo = RNODE(memop); local
280 NODE *memo; /* [return value, current index, ] */ local
512 NODE *memo = RNODE(p); local
529 NODE *memo = RNODE(p); local
589 NODE *memo; local
621 NODE *memo = RNODE(arys); local
653 NODE *memo; local
715 NODE *memo = RNODE(params); local
745 NODE *memo; local
908 NODE *memo; local
1002 NODE *memo = NEW_MEMO(Qtrue, 0, 0); local
1036 NODE *memo = NEW_MEMO(Qfalse, 0, 0); local
1076 NODE *memo = NEW_MEMO(Qundef, 0, 0); local
1112 NODE *memo = NEW_MEMO(Qtrue, 0, 0); local
1121 NODE *memo = RNODE(args); local
1141 NODE *memo = RNODE(args); local
1175 NODE *memo = NEW_MEMO(Qundef, 0, 0); local
1192 NODE *memo = RNODE(args); local
1212 NODE *memo = RNODE(args); local
1246 NODE *memo = NEW_MEMO(Qundef, 0, 0); local
1269 minmax_i_update(VALUE i, VALUE j, struct minmax_t *memo) argument
1292 struct minmax_t *memo = (struct minmax_t *)&RNODE(_memo)->u1.value; local
1321 minmax_ii_update(VALUE i, VALUE j, struct minmax_t *memo) argument
1344 struct minmax_t *memo = (struct minmax_t *)&RNODE(_memo)->u1.value; local
1390 NODE *memo = NEW_MEMO(Qundef, Qundef, Qundef); local
1416 NODE *memo = RNODE(args); local
1450 NODE *memo; local
1462 NODE *memo = RNODE(args); local
1496 NODE *memo; local
1515 minmax_by_i_update(VALUE v1, VALUE v2, VALUE i1, VALUE i2, struct minmax_by_t *memo) argument
1538 struct minmax_by_t *memo = MEMO_FOR(struct minmax_by_t, _memo); local
1593 VALUE memo; local
1614 NODE *memo = RNODE(args); local
1639 NODE *memo = NEW_MEMO(val, Qfalse, 0); local
1646 each_with_index_i(VALUE i, VALUE memo, int argc, VALUE *argv) argument
1675 NODE *memo; local
1769 NODE *memo = RNODE(m); local
1820 NODE *memo; local
1836 NODE *memo = RNODE(args); local
1891 NODE *memo; local
1902 each_with_object_i(VALUE i, VALUE memo, int argc, VALUE *argv) argument
1923 enum_each_with_object(VALUE obj, VALUE memo) argument
1933 zip_ary(VALUE val, NODE *memo, int argc, VALUE *argv) argument
1975 zip_i(VALUE val, NODE *memo, int argc, VALUE *argv) argument
2037 NODE *memo; local
2074 NODE *memo = RNODE(args); local
2094 NODE *memo; local
2147 NODE *memo = RNODE(args); local
2173 NODE *memo; local
2190 NODE *memo = RNODE(args); local
2222 NODE *memo; local
2373 struct chunk_arg *memo = NEW_MEMO_FOR(struct chunk_arg, arg); local
2547 struct slicebefore_arg *memo = NEW_MEMO_FOR(struct slicebefore_arg, arg); local
[all...]
H A Denumerator.c463 NODE *memo = (NODE *)m; local
464 VALUE idx = memo->u1.value;
465 memo->u1.value = rb_int_succ(idx);
491 VALUE memo; local
493 rb_scan_args(argc, argv, "01", &memo);
495 if (NIL_P(memo))
496 memo = INT2FIX(0);
498 memo = rb_to_int(memo);
499 return enumerator_block_call(obj, enumerator_with_index_i, (VALUE)NEW_MEMO(memo,
519 enumerator_with_object_i(VALUE val, VALUE memo, int argc, VALUE *argv) argument
555 enumerator_with_object(VALUE obj, VALUE memo) argument
1083 yielder_yield_i(VALUE obj, VALUE memo, int argc, VALUE *argv) argument
1631 VALUE yielder, ary, memo; local
1717 VALUE memo = rb_attr_get(argv[0], id_memo); local
1800 VALUE memo = rb_attr_get(argv[0], id_memo); local
1829 VALUE memo = rb_attr_get(argv[0], id_memo); local
[all...]
H A Darray.c4149 st_table *memo; local
4154 memo = st_init_numtable();
4155 st_insert(memo, (st_data_t)ary, (st_data_t)Qtrue);
4171 if (st_lookup(memo, id, 0)) {
4172 st_free_table(memo);
4175 st_insert(memo, id, (st_data_t)Qtrue);
4186 st_delete(memo, &id, 0);
4192 st_free_table(memo);
H A Dload.c721 NODE *memo = RNODE(data); local
722 void (*init)(void) = (void (*)(void))memo->nd_cfnc;
/macosx-10.9.5/tcl-102/tcl_ext/tclsoap/tclsoap/samples/
H A Dsoap-methods-server.tcl96 <memo>
97 <subject>test memo one</subject>
98 <body>The body of the memo.</body>
99 </memo>
100 <memo>
101 <subject>test memo two</subject>
103 </memo>
/macosx-10.9.5/tcl-102/tcl_ext/mk4tcl/metakit/examples/
H A Dmkmemoio.py2 # memo field in a Metakit database (either on file, or in memory).
35 def __init__(self, view, memo, row):
37 self.memo = memo
45 del self.view, self.memo, self.row, self.pos
56 pos = pos + self.view.itemsize(self.memo, self.row)
67 r = self.view.access(self.memo, self.row, self.pos, n)
73 remain = self.view.itemsize(self.memo, self.row) - self.pos
97 self.view.modify(self.memo, self.row, s, self.pos, resize)
105 return self.view.access(self.memo, sel
[all...]
/macosx-10.9.5/ruby-104/ruby/test/ruby/
H A Dtest_continuation.rb86 @memo += 1
102 @memo = 0
106 assert_equal 3, @memo
113 @memo += 1
128 @memo = 0
132 assert_equal 3, @memo
H A Dtest_module.rb999 memo = []
1004 memo << sym
1005 memo << mod.instance_methods(false)
1006 memo << (mod.instance_method(sym) rescue nil)
1015 assert_equal :f, memo.shift
1016 assert_equal [:f], memo.shift, '[ruby-core:25536]'
1017 assert_equal mod.instance_method(:f), memo.shift
1018 assert_equal :g, memo.shift
1019 assert_equal [:f, :g], memo.shift
1020 assert_equal mod.instance_method(:f), memo
[all...]
H A Dtest_enum.rb254 ret = (1..10).each_with_object(obj) {|i, memo|
255 memo[0] += i
256 memo[1] *= i
H A Dtest_enumerator.rb139 ret = (1..10).each.with_object(obj) {|i, memo|
140 memo[0] += i
141 memo[1] *= i
/macosx-10.9.5/ruby-104/ruby/tool/
H A Dcompile_prelude.rb158 struct prelude_env memo;
160 VALUE prelude = Data_Wrap_Struct(rb_cData, 0, 0, &memo);
162 memo.prefix_path = rb_const_remove(rb_cObject, name);
167 memset(memo.loaded, 0, sizeof(memo.loaded));
/macosx-10.9.5/ruby-104/ruby/ext/json/parser/
H A Dparser.h34 char *memo; member in struct:JSON_ParserStruct
H A Dparser.c800 json->memo = p;
865 long len = p - json->memo;
867 fbuffer_append(json->fbuffer, json->memo, len);
899 json->memo = p;
1030 long len = p - json->memo;
1032 fbuffer_append(json->fbuffer, json->memo, len);
1387 match_i(VALUE regexp, VALUE klass, VALUE memo) argument
1391 RTEST(rb_funcall(regexp, i_match, 1, rb_ary_entry(memo, 0)))) {
1392 rb_ary_push(memo, klass);
1411 json->memo
1536 VALUE memo = rb_ary_new2(2); local
[all...]
/macosx-10.9.5/tcl-102/tcl_ext/mk4tcl/metakit/tcl/tests/
H A Dlimit.test25 test 2 {string/byte/memo property mix} -body {
/macosx-10.9.5/tcl-102/tcl_ext/mk4tcl/metakit/tests/
H A Dtstore5.cpp138 B(s44, Bad memo free space, 0)W(s44a);
167 B(s45, Bad subview memo free space, 0)W(s45a);
H A Dtstore4.cpp62 B(s32, Set memo empty or same size, 0)W(s32a);
99 B(s33, Serialize memo fields, 0)W(s33a);
H A Dtbasic2.cpp172 B(b26, Partial memo field access, 0) {
/macosx-10.9.5/ruby-104/ruby/ext/tk/sample/
H A Dfigmemo_sample.rb60 set of an indicator circle, an arrow, and a memo text. See the following
62 This can save the list of memo texts to another file. It may useful to
74 Input a memo text and hit 'Enter' key to entry the comment.
/macosx-10.9.5/vim-53/runtime/syntax/
H A Dfoxpro.vim216 syn match foxproFunc "\<memo\%[ry]\>\s*("me=e-1
339 syn match foxproCmd "^\s*\<appe\%[nd]\>\s*\<memo\>"
353 syn match foxproCmd "^\s*\<clos\%[e]\>\s*\<memo\>"
358 syn match foxproCmd "^\s*\<copy\>\s*\<memo\>"
395 syn match foxproCmd "^\s*\<disp\%[lay]\>\s*\<memo\%[ry]\>"
435 syn match foxproCmd "^\s*\<modi\%[fy]\>\s*\<memo\>"
568 syn match foxproCmd "^\s*\<set\>\s*\<memo\%[width]\>"
612 syn match foxproCmd "^\s*\<set\>\s*\<wind\%[ow]\>\s*\<of\>\s*\<memo\>"
/macosx-10.9.5/tcl-102/tcl_ext/snack/snack/generic/
H A DjkPitchCmd.c604 int t,memo,debut; local
610 memo = *To_Moyen;
628 *To_Moyen = ((2*cum) + (nb * memo)) / (3 * nb);
/macosx-10.9.5/ruby-104/ruby/test/openssl/
H A Dtest_ssl.rb359 san_list_der = ext_asn1.value.reduce(nil) { |memo,val| val.tag == 4 ? val.value : memo }
/macosx-10.9.5/libxml2-26/libxml2/
H A Dvalid.c6520 xmlValidateMemoPtr memo = (xmlValidateMemoPtr)user; local
6521 xmlValidateRef((xmlRefPtr)data, memo->ctxt, memo->name);
6535 xmlValidateMemo memo; local
6539 memo.ctxt = ctxt;
6540 memo.name = name;
6542 xmlListWalk(ref_list, xmlWalkValidateList, &memo);
/macosx-10.9.5/pyobjc-42/pyobjc/pyobjc-core/libxml2-src/
H A Dvalid.c6518 xmlValidateMemoPtr memo = (xmlValidateMemoPtr)user; local
6519 xmlValidateRef((xmlRefPtr)data, memo->ctxt, memo->name);
6533 xmlValidateMemo memo; local
6537 memo.ctxt = ctxt;
6538 memo.name = name;
6540 xmlListWalk(ref_list, xmlWalkValidateList, &memo);
/macosx-10.9.5/tcl-102/tcl_ext/mk4tcl/metakit/tcl/
H A Dmk4tcl.cpp190 // set up mapping if the memo itself is mapped in its entirety
260 // New in 1.2: channel interface to memo fields
2346 const c4_BytesProp &memo = (const c4_BytesProp &)AsProperty(objv[2],
2359 memo(row).SetData(c4_Bytes());
2365 MkChannel *mkChan = new MkChannel(ip->_storage, path._view, memo, index);
/macosx-10.9.5/WebCore-7537.78.1/inspector/front-end/cm/
H A Dcodemirror.js959 var memo = cache[i];
960 if (memo.text == line.text && memo.markedSpans == line.markedSpans &&
961 cm.display.scroller.clientWidth == memo.width &&
962 memo.classes == line.textClass + "|" + line.bgClass + "|" + line.wrapClass)
963 return memo.measure;
974 var memo = {text: line.text, width: cm.display.scroller.clientWidth,
977 if (cache.length == 16) cache[++cm.display.measureLineCachePos % 16] = memo;
978 else cache.push(memo);

Completed in 499 milliseconds

12