MCPcopy Index your code
hub / github.com/plotly/plotly.js / makeUpdateSliceInterpolator

Function makeUpdateSliceInterpolator

src/traces/treemap/plot_one.js:368–417  ·  view source on GitHub ↗
(pt, onPathbar, refRect, size, opts)

Source from the content-addressed store, hash-verified

366 };
367
368 var makeUpdateSliceInterpolator = function(pt, onPathbar, refRect, size, opts) {
369 var prev0 = getPrev(pt, onPathbar);
370 var prev;
371
372 if(prev0) {
373 // if pt already on graph, this is easy
374 prev = prev0;
375 } else {
376 // for new pts:
377 if(onPathbar) {
378 prev = pathbarOrigin;
379 } else {
380 if(prevEntry) {
381 // if trace was visible before
382 if(pt.parent) {
383 var ref = nextOfPrevEntry || refRect;
384
385 if(ref && !onPathbar) {
386 prev = findClosestEdge(pt, ref, size);
387 } else {
388 // if new leaf (when maxdepth is set),
389 // grow it from its parent node
390 prev = {};
391 Lib.extendFlat(prev, interpFromParent(pt, onPathbar));
392 }
393 } else {
394 prev = Lib.extendFlat({}, pt);
395 if(isIcicle) {
396 if(opts.orientation === 'h') {
397 if(opts.flipX) prev.x0 = pt.x1;
398 else prev.x1 = 0;
399 } else {
400 if(opts.flipY) prev.y0 = pt.y1;
401 else prev.y1 = 0;
402 }
403 }
404 }
405 } else {
406 prev = {};
407 }
408 }
409 }
410
411 return interpolate(prev, {
412 x0: pt.x0,
413 x1: pt.x1,
414 y0: pt.y0,
415 y1: pt.y1
416 });
417 };
418
419 var makeUpdateTextInterpolator = function(pt, onPathbar, refRect, size) {
420 var prev0 = getPrev(pt, onPathbar);

Callers 2

draw_ancestors.jsFile · 0.70

Calls 4

getPrevFunction · 0.85
findClosestEdgeFunction · 0.85
interpFromParentFunction · 0.85
interpolateFunction · 0.85

Tested by

no test coverage detected

Used in the wild real call sites across dependent graphs

searching dependent graphs…