How to use

area

function

in

Array

function stickify(node) {
   var children = node.children;
   if (children && children.length) {
    var rect = pad(node), remaining = children.slice(), child, row = [];
    scale(remaining, rect.dx * rect.dy / node.value);
    row.area = 0;
    while (child = remaining.pop()) {
     row.push(child);
     row.area += child.area;
     if (child.z != null) {
      position(row, child.z ? rect.dx : rect.dy, rect, !remaining.length);
      row.length = row.area = 0;
     }
    }
    children.forEach(stickify);
   }
  }

this.state.json[this.state.index.provinceIndex].city[this.state.index.cityIndex].area.map((array, index) => (<option key={index} data-index={index}>{array}</option>))

function squarify(node) {
   var children = node.children;
   if (children && children.length) {
    var rect = pad(node), row = [], remaining = children.slice(), child, best = Infinity, score, u = mode === "slice" ? rect.dx : mode === "dice" ? rect.dy : mode === "slice-dice" ? node.depth & 1 ? rect.dy : rect.dx : Math.min(rect.dx, rect.dy), n;
    scale(remaining, rect.dx * rect.dy / node.value);
    row.area = 0;
    while ((n = remaining.length) > 0) {
     row.push(child = remaining[n - 1]);
     row.area += child.area;
     if (mode !== "squarify" || (score = worst(row, u)) <= best) {
      remaining.pop();
      best = score;
     } else {
      row.area -= row.pop().area;
      position(row, u, rect, false);
      u = Math.min(rect.dx, rect.dy);
      row.length = row.area = 0;
      best = Infinity;
     }
    }
    if (row.length) {
     position(row, u, rect, true);
     row.length = row.area = 0;
    }
    children.forEach(squarify);
   }
  }

while ((n = remaining.length) > 0) {
 row.push(child = remaining[n - 1]);
 row.area += child.area;
 if ((score = worst(row, u)) <= best) { // continue with this orientation
  remaining.pop();
  best = score;
 } else { // abort, and try a different orientation
  row.area -= row.pop().area;
  position(row, u, rect, false);
  u = Math.min(rect.dx, rect.dy);

row.area += child.getLayout().area;
var score = worst(row, rowFixedLength, options.squareRatio);
  row.area -= row.pop().getLayout().area;
  position(row, rowFixedLength, rect, halfGapWidth, false);
  rowFixedLength = mathMin(rect.width, rect.height);

function stickify(node) {
   var children = node.children;
   if (children && children.length) {
    var rect = pad(node), remaining = children.slice(), child, row = [];
    scale(remaining, rect.dx * rect.dy / node.value);
    row.area = 0;
    while (child = remaining.pop()) {
     row.push(child);
     row.area += child.area;
     if (child.z != null) {
      position(row, child.z ? rect.dx : rect.dy, rect, !remaining.length);
      row.length = row.area = 0;
     }
    }
    children.forEach(stickify);
   }
  }

function stickify(node) {
   var children = node.children;
   if (children && children.length) {
    var rect = pad(node), remaining = children.slice(), child, row = [];
    scale(remaining, rect.dx * rect.dy / node.value);
    row.area = 0;
    while (child = remaining.pop()) {
     row.push(child);
     row.area += child.area;
     if (child.z != null) {
      position(row, child.z ? rect.dx : rect.dy, rect, !remaining.length);
      row.length = row.area = 0;
     }
    }
    children.forEach(stickify);
   }
  }

function stickify(node) {
   var children = node.children;
   if (children && children.length) {
    var rect = pad(node), remaining = children.slice(), child, row = [];
    scale(remaining, rect.dx * rect.dy / node.value);
    row.area = 0;
    while (child = remaining.pop()) {
     row.push(child);
     row.area += child.area;
     if (child.z != null) {
      position(row, child.z ? rect.dx : rect.dy, rect, !remaining.length);
      row.length = row.area = 0;
     }
    }
    children.forEach(stickify);
   }
  }

// Recursively resizes the specified node's children into existing rows.
 // Preserves the existing layout!
 function stickify(node) {
  var children = node.children;
  if (children && children.length) {
   var rect = pad(node),
     remaining = children.slice(), // copy-on-write
     child,
     row = [];
   scale(remaining, rect.dx * rect.dy / node.value);
   row.area = 0;
   while (child = remaining.pop()) {
    row.push(child);
    row.area += child.area;
    if (child.z != null) {
     position(row, child.z ? rect.dx : rect.dy, rect, !remaining.length);
     row.length = row.area = 0;
    }
   }
   children.forEach(stickify);
  }
 }

function squarify(node) {
   var children = node.children;
   if (children && children.length) {
    var rect = pad(node), row = [], remaining = children.slice(), child, best = Infinity, score, u = Math.min(rect.dx, rect.dy), n;
    scale(remaining, rect.dx * rect.dy / node.value);
    row.area = 0;
    while ((n = remaining.length) > 0) {
     row.push(child = remaining[n - 1]);
     row.area += child.area;
     if ((score = worst(row, u)) <= best) {
      remaining.pop();
      best = score;
     } else {
      row.area -= row.pop().area;
      position(row, u, rect, false);
      u = Math.min(rect.dx, rect.dy);
      row.length = row.area = 0;
      best = Infinity;
     }
    }
    if (row.length) {
     position(row, u, rect, true);
     row.length = row.area = 0;
    }
    children.forEach(squarify);
   }
  }

function squarify(node) {
   var children = node.children;
   if (children && children.length) {
    var rect = pad(node), row = [], remaining = children.slice(), child, best = Infinity, score, u = mode === "slice" ? rect.dx : mode === "dice" ? rect.dy : mode === "slice-dice" ? node.depth & 1 ? rect.dy : rect.dx : Math.min(rect.dx, rect.dy), n;
    scale(remaining, rect.dx * rect.dy / node.value);
    row.area = 0;
    while ((n = remaining.length) > 0) {
     row.push(child = remaining[n - 1]);
     row.area += child.area;
     if (mode !== "squarify" || (score = worst(row, u)) <= best) {
      remaining.pop();
      best = score;
     } else {
      row.area -= row.pop().area;
      position(row, u, rect, false);
      u = Math.min(rect.dx, rect.dy);
      row.length = row.area = 0;
      best = Infinity;
     }
    }
    if (row.length) {
     position(row, u, rect, true);
     row.length = row.area = 0;
    }
    children.forEach(squarify);
   }
  }

function squarify(node) {
   var children = node.children;
   if (children && children.length) {
    var rect = pad(node), row = [], remaining = children.slice(), child, best = Infinity, score, u = mode === "slice" ? rect.dx : mode === "dice" ? rect.dy : mode === "slice-dice" ? node.depth & 1 ? rect.dy : rect.dx : Math.min(rect.dx, rect.dy), n;
    scale(remaining, rect.dx * rect.dy / node.value);
    row.area = 0;
    while ((n = remaining.length) > 0) {
     row.push(child = remaining[n - 1]);
     row.area += child.area;
     if (mode !== "squarify" || (score = worst(row, u)) <= best) {
      remaining.pop();
      best = score;
     } else {
      row.area -= row.pop().area;
      position(row, u, rect, false);
      u = Math.min(rect.dx, rect.dy);
      row.length = row.area = 0;
      best = Infinity;
     }
    }
    if (row.length) {
     position(row, u, rect, true);
     row.length = row.area = 0;
    }
    children.forEach(squarify);
   }
  }