Lines Matching +refs:z +refs:e
68 var e = events,
72 z = 0,
91 while (indexed[z] < 0) {
92 l = queue[indexed[z++]];
102 if (l.zIndex == indexed[z]) {
108 z++;
109 l = queue[indexed[z]];
145 e = events,
154 es = [e],
159 e = es[j].n;
160 items = [e[names[i]], e[wildcard]];
226 e = events,
229 e = e.n;
230 e = e.hasOwnProperty(names[i]) && e[names[i]] || (e[names[i]] = {n: {}});
232 e.f = e.f || [];
233 for (i = 0, ii = e.f.length; i < ii; i++) if (e.f[i] == f) {
237 !exist && e.f.push(f);
341 var e, variable
349 e = cur[j].n;
351 if (e[names[i]]) {
352 splice.push(e[names[i]]);
355 for (key in e) if (e[has](key)) {
356 splice.push(e[key]);
363 e = cur[i];
364 while (e.n) {
366 if (e.f) {
367 for (j = 0, jj = e.f.length; j < jj; j++) if (e.f[j] == f) {
368 e.f.splice(j, 1);
371 !e.f.length && delete e.f;
373 for (key in e.n) if (e.n[has](key) && e.n[key].f) {
374 var funcs = e.n[key].f;
379 !funcs.length && delete e.n[key].f;
382 delete e.f;
383 for (key in e.n) if (e.n[has](key) && e.n[key].f) {
384 delete e.n[key].f;
387 e = e.n;