@mark1russell7/highways 0.1.5 → 0.2.0

package/build/index.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"index.d.ts","names":[],"sources":["../src/geom.ts","../src/grid.ts","../src/model.ts","../src/fixtures.ts","../src/cases.ts","../src/plugs.ts","../src/curves.ts","../src/curves/model.ts","../src/curves/space.ts","../src/curves/sample.ts","../src/curves/straight/index.ts","../src/curves/rounded/index.ts","../src/curves/spline/index.ts","../src/curves/arc/index.ts","../src/curves/index.ts","../src/visibility.ts","../src/ways.ts","../src/segments.ts","../src/sections.ts","../src/routers/straight.ts","../src/routers/plugs.ts","../src/routers/corners.ts","../src/routers/shared.ts","../src/routers/sections.ts","../src/routers/trunks.ts","../src/routers/index.ts","../src/room/index.ts","../src/room/lanes.ts","../src/bench/properties.ts","../src/bench/quality.ts","../src/bench/links.ts","../src/bench/run.ts","../src/strategies/model.ts","../src/bench/curves.ts","../src/bench/room.ts","../src/strategies/builtins.ts"],"mappings":";iBACiB;WACN;WACA;;;iBAIM;WACN;WACA;WACA;WACA;;;wBAIK,KAAK,GAAG,OAAO,GAAG;;wBAOlB,OAAO,GAAG,MAAM;;wBAKhB,QAAQ,GAAG,KAAK,YAAY;;wBAK5B,eAAe,YAAY;;;;;wBAY3B,cAAc,GAAG,OAAO,GAAG,OAAO,GAAG,OAAO,GAAG;;;;;wBAY/C,eAAe,GAAG,OAAO,GAAG,OAAO,KAAK,KAAK;;wBAK7C,gBAAgB,GAAG,OAAO,GAAG,OAAO,YAAY,YAAY,YAAY,YAAY;;wBA2BpF,iBAAiB,GAAG,OAAO,GAAG;;wBAO9B,qBAAqB,GAAG,OAAO,GAAG,OAAO,GAAG;;wBAS5C,mBAAmB,GAAG,OAAO,GAAG,OAAO,KAAK;;;;;wBAiB5C,MAAM,YAAY,SAAS;;wBAgB3B,UAAU,YAAY,SAAS;;;;;wBAQ/B,gBAAgB,YAAY,SAAS;;;;;wBAgBrC,QAAQ,YAAY,SAAS,YAAY;;;;;;qBC1J5C,KAAK;;;EAUhB,YAAY;;EAyHZ,IAAI,MAAM,GAAG,GAAG;;EAKhB,WAAW,MAAM,GAAG,GAAG,OAAO,GAAG;;EAMjC,MAAM,GAAG,KAAK,QAAQ,MAAM;;EAK5B,aAAa,GAAG,OAAO,GAAG,OAAO,gBAAgB,QAAQ,MAAM;;;;;EAU/D,YAAY,GAAG,OAAO,GAAG,OAAO,gBAAgB,OAAO,MAAM;;;wBAM/C,cAAc,GAAG,OAAO,GAAG,QAAQ;;YCvKvC;;;;;iBAMK;WACN;;WAEA,KAAK;;WAEL,OAAO;;;iBAID;WACN;WACA,KAAK;WACL,iBAAiB;;;iBAIX;WACN;WACA;;;iBAIM;WACN;WACA,QAAQ;WACR,QAAQ;WACR,OAAO,SAAS;;;iBAIV;WACN,gBAAgB;WAChB,gBAAgB;;;iBAIV;WACN;WACA,iBAAiB;;;;;;iBAOX;WACN;WACA,gBAAgB;WAChB,gBAAgB;;;iBAIV;WACN;WACA,KAAK;WACL;;;iBAIM;WACN;WACA;WACA;WACA,iBAAiB;;;iBAIX;WACN,iBAAiB;WACjB,kBAAkB;WAClB,mBAAmB;;WAEnB,gBAAgB;;;;;;iBAOV;WACN;;WAEA;;WAEA;;WAEA;;WAEA,gBAAgB;;;;;;iBAOV;WACN;;WAEA;WACA,iBAAiB;;WAEjB;;;YAIC,aAAa,MAAM;;iBAGd;WACN;;WAEA;EACT,MAAM,OAAO,QAAQ;;;wBAIP,UAAU,GAAG,QAAQ,YAAY;;wBAOjC,eAAe,MAAM,MAAM,KAAK,MAAM;;wBC/HtC,IAAI;;;;;YAeR;;iBAGK;WACN;WACA,MAAM;WACN;;WAEA;WACA;;WAEA;;WAEA;;;qBAIE,mBAAmB;;;;;wBAqBhB,YAAY,MAAM,cAAc;;;;;iBCnD/B;WACN;;WAEA;;WAEA,YAAY;;;;;;wBA+BP,oBAAoB;;;;;;wBASpB,iBAAiB;;;;;;wBAuBjB,mBAAmB;;;;;;;;;wBAsCnB,mBAAmB;;qBAqBtB,gBAAgB;;iBClIZ;WACN,OAAO;WACP,QAAQ;;;qBAIN,aAAa,SAAS,OAAO,MAAM;;wBAQhC,YAAY,KAAK,KAAK,GAAG,QAAQ;;;;;wBAgBjC,WAAW,KAAK,KAAK,QAAQ,QAAQ;;;;;wBAYrC,YAAY,KAAK,KAAK,MAAM,MAAM,QAAQ,OAAO,iBAAY;;;;;wBAsB7D,UAAU,MAAM,MAAM,KAAK,KAAK,QAAQ,QAAQ;;iBCjE/C;;WAEN;;WAEA;;WAEA;;;;;;wBAOK,iBAAiB,eAAe;;;;;;;wBAchC,gBAAgB,IAAI,OAAO,QAAQ,OAAO,QAAQ,OAAO,UAAS,oBAAyB;;;;;wBAkC3F,aAAa,YAAY,SAAS,gBAAgB,iBAAY;;;;;;;;;YCtDlE;;qBAGC,sBAAsB;;iBAGlB;WACN;WACA,IAAI;;;iBAIE;WACN;WACA,IAAI;;;iBAIE;WACN;WACA,IAAI;WACJ,IAAI;WACJ,IAAI;;;;;;;iBAQE;WACN;WACA,QAAQ;WACR;WACA;WACA;WACA,IAAI;;;;;;YAOH,eAAe,cAAc,cAAc,eAAe;;wBAGtD,eAAe,iBAAiB,SAAS,eAAa;;;;;UC9CrD;;WAEN,gBAAgB;;WAEhB;;;;;EAKT,QAAQ,YAAY,SAAS,YAAY;;;;;;wBAO3B,WAAW,gBAAgB,OAAO,qBAAmB;;;;;;wBCfrD,YAAY,mBAAmB,gBAAgB,qBAAkB;;wBAkCjE,QAAQ,IAAI,OAAO,IAAI,OAAO,IAAI,OAAO,IAAI,OAAO,YAAY;;;;;wBAahE,UAAU,mBAAmB,gBAAgB;;wBCtD7C,cAAc,iBAAiB,UAAU;;UCCxC;;WAEN;;WAEA,QAAQ;;;;;;;;wBASH,aAAa,iBAAiB,SAAS,UAAS,iBAAsB;;UCbrE;;;;;WAKN;;WAEA,cAAc;;WAEd,YAAY;;WAEZ,QAAQ;;;;;;;;;;wBAWH,YAAY,iBAAiB,SAAS,UAAS,gBAAqB;;UCtBnE;;WAEN;;WAEA,QAAQ;;;;;;;;wBAYH,SAAS,iBAAiB,SAAS,UAAS,aAAkB;;iBCJ7D;WACN,MAAM;;WAEN;;WAEA;;WAEA,cAAc;;WAEd,YAAY;;WAEZ,QAAQ;;;;;;;wBAQH,QAAQ,iBAAiB,SAAS,SAAS,eAAe;;qBC/B7D;;;EAIX,YAAY,gBAAgB,QAAQ;;EAMpC,MAAM,GAAG,OAAO,GAAG,OAAO,aAAa,OAAO,YAAY;;;;;EAQ1D,IAAI,GAAG,OAAO,GAAG,OAAO,aAAa,OAAO,YAAY,QAAQ;;EAWhE,UAAU,YAAY,SAAS,aAAa,OAAO,YAAY;;EAM/D,MAAM,KAAK,KAAK,QAAQ,GAAG;;EAK3B,OAAO,GAAG,OAAO,aAAa,OAAO;;;iBAmBtB;WACN,OAAO;WACP;;;iBAIM;WACN,QAAQ;WACR;WACA;WACA;;;iBAIM;;WAEN;;WAEA;;;;;WAKA;;;;;WAKA;;;;;;;;qBASE;;WACF,QAAQ;;EA6BjB,YAAY,gBAAgB,QAAQ,WAAW,WAAW,SAAS;;MAgE/D;;EAOJ,QAAQ,GAAG;;EAkBX,eAAe,GAAG,OAAO,WAAW;;;;;;;EAmGpC,KAAK,MAAM,OAAO,IAAI,OAAO,QAAQ,WAAW,WAAW,sBAAsB,iBAAoB;;;;;EASrG,UAAU,eAAe,YAAY,aAAa,aAAa;;EAyJ/D,KAAK,YAAY,SAAS,qBAAiB;;;iBC1d5B;;WAEN;;WAEA;;WAEA;;;;;;qBAOE;;WACF,WAAW;WACX,SAAS;WACT;;EAIT,YAAY,gBAAgB,QAAQ,UAAS;;EAQ7C,IAAI,GAAG,OAAO;;EAKd,QAAQ,IAAI,MAAM,IAAI,MAAM,MAAM,YAAY,QAAQ;;EAgBtD,SAAS,IAAI,MAAM,IAAI,QAAQ;;EAM/B,OAAO,MAAM,OAAO,IAAI,OAAO;;;iBC1DhB;WACN;WACA,iBAAiB;;WAEjB;;WAEA;;;iBAIM;WACN;;WAEA;WACA;;;iBAIM;WACN;WACA,mBAAmB;;;iBAIb;WACN,mBAAmB;WACnB,gBAAgB;;;;;;wBAmBX,WAAW,QAAQ,SAAS;;wBAkD5B,WAAW,OAAO,cAAc,MAAM,OAAO;;;;;wBAgB7C,eAAe,YAAY,SAAS,YAAY;;iBAuB/C;;WAEN;;WAEA;;;;;;wBAOK,UAAU,OAAO,cAAc,SAAS,mBAAmB;;wBAK3D,OAAO;;;;;;;;;wBAYP,WAAW,QAAQ,SAAS,cAAc,MAAM,qBAAqB,mBAAmB,oBAA8B;;;;;;;wBA4CtH,WAAW,cAAc,SAAS,iBAAiB;;iBC9MlD;;WAEN;WACA;WACA,MAAM;;WAEN;WACA,mBAAmB;;;iBAIb;;WAEN;;WAEA;;;;;;wBAOK,cAAc,gBAAgB,QAAQ,UAAS,iBAAsB;;wBA0CrE,YAAY,MAAM,UAAU;;wBAW5B,UAAU,MAAM;;wBC3EhB,QAAQ,KAAK,KAAK,QAAQ,QAAQ;;;;;qBAerC,gBAAgB;;;;;qBCVhB,aAAa;;UCHT,uBAAuB;;WAE7B;;WAEA;;;;;;;wBAQK,cAAc,SAAS,iBAAiB;;UCZvC,sBAAsB;;WAE5B;;WAEA,OAAO;;WAEP;;WAEA;;;;;;;;wBAyCK,aAAa,SAAS,gBAAgB;;UC7CrC,wBAAwB,YAAY;;WAE1C;;;;;WAKA;;WAEA;;WAEA;;;;;;;;;;;;;wBAsBK,eAAe,SAAS,kBAAkB;;UCrCzC,sBAAsB;;WAE5B;;WAEA,MAAM;;WAEN;;WAEA;;WAEA;;;qBAIE,cAAc;;;;;wBASX,WAAW,gBAAgB,QAAQ,MAAM,WAAW,mBAAc,YAAY;;;;;wBAkB9E,UAAU,KAAK,OAAO,MAAM,OAAO;WAA8B;WAAuB,MAAM;;;;;;wBAgB9F,WAAW,OAAO,OAAO,kBAAkB,SAAS,eAAe,OAAO,GAAG,mBAAmB,eAAe;;;;;;wBAkB/G,aAAa,SAAS,gBAAgB;;qBCjEzC,kBAAkB;;iBCXd;WACN;WACA,KAAK;;;iBAIC;WACN;WACA;WACA;;;;;;iBAOM;WACN;;WAEA;;WAEA;;WAEA;;WAEA;;WAEA;;WAEA;;WAEA;;;YAIC;;iBAGK;;WAEN;;WAEA;;;;;WAKA;;;;;;;WAOA,SAAS;;WAET,SAAS;;WAET;;WAEA;;;;;;WAMA;;;iBAIM,KAAK,UAAU;WACrB,eAAe;WACf,OAAO;;;;;;wBAiBF,UAAU,gBAAgB,SAAS,gBAA8B;;;;;;wBA0CjE,SAAS,UAAU,OAAO,gBAAgB,KAAK,eAAe,OAAO,gBAA8B;;;;;wBAkBnG,WAAW,gBAAgB,SAAS,gBAAgB,YAAY,UAAS,cAAmB;;wBA0B5F,SAAS,UAAU,OAAO,gBAAgB,KAAK,gBAAgB,YAAY,UAAS,cAAmB,KAAK;;wBAM5G,UAAU,OAAO,QAAQ;;;;;;;;YC9K7B;;qBAGC,sBAAsB;;iBAGlB;;WAEN;;WAEA,QAAQ;;WAER;;;;;;;wBAwBK,SAAS,gBAAgB,SAAS,gBAAgB,aAAa,UAAS,iBAAsB;;iBC3C7F;WACN;WASA;WACA;;;qBAIE;;;;;;;;;;wBAWG,gBAAgB,OAAO,OAAO,QAAQ,QAAQ,iBAAc;;iBCf3D;;WAEN;;WAEA;;WAEA;;WAEA;;WAEA;;WAEA;;WAEA;;WAEA;;WAEA;;;qBAIE;;wBAQG,eAAe,OAAO,OAAO,QAAQ,SAAS;;;;;wBAqG9C,UAAU,KAAK,KAAK,IAAI,OAAO,MAAM;;;;;wBAoBrC,eAAe,0BAA0B,OAAO;;iBAsB/C;WACN;WACA;;WAEA;;;wBAIK,iBAAiB,QAAQ,QAAQ,OAAO,SAAS;;;;;iBC5LhD;;WAEN;;;;;WAKA;;;;;WAKA;;WAEA;;;;;WAKA;;;iBAIM,oBAAoB;WAC1B;;WAEA;;WAEA;;WAEA;;;iBAIM;;WAEN;;;qBAIE;;qBAEA;;qBAEA;;iBAGI;WACN;WACA;WACA,iBAAiB;;;;;;wBAOZ,YAAY,YAAY;;wBAaxB,eAAe,YAAY;;;;;wBAU3B,aAAa,OAAO,oBAAoB,MAAM,gBAAgB,gBAAgB,UAAS,mBAAwB;;wBA0C/G,mBAAmB,OAAO,OAAO,QAAQ,QAAQ,UAAS,mBAAwB;;wBAYlF,cAAc,gBAAgB;;wBAgB9B,aAAa,OAAO,OAAO,UAAS,mBAAwB;;;;;wBAe5D,mBAAmB,QAAQ,QAAQ,UAAS,mBAAwB;;wBAKpE,UAAU,eAAe,eAAe;;iBCzKvC;WACN;WACA;WACA;WACA;;WAEA;;WAEA;WACA;;WAEA,iBAAiB;WACjB,SAAS;;WAET,QAAQ;;WAER,sBAAsB;;;iBAIhB;;WAEN;;;wBAIK,aAAa,kBAAkB,UAAU,mBAAmB,eAAe,UAAS,eAAoB;;;;;wBAaxG,SAAS,YAAY;;wBAqBrB,SAAS,QAAQ,QAAQ,iBAAiB,OAAO,OAAO,kBAAa;;wBA8BrE,YAAY,eAAe;;;;;wBAe3B,aAAa,eAAe;;iBC5G3B;;WAEN,iBAAiB;;WAEjB,cAAc;;WAEd,YAAY;;WAEZ,QAAQ;;;iBAIF;WACN,gBAAgB;WAChB,gBAAgB;;;;;;;;;iBAUV;WACN;aAAmB,OAAO;aAAgB,QAAQ;;WAClD;aAAkB,OAAO;aAAqB,QAAQ;;WACtD;aAAiB,OAAO;aAAoB,QAAQ;;;;YAInD,aAAa;;YAGb,UAAU,UAAU,QAAQ,UAAU;;YAGtC,WAAW,UAAU,QAAQ,UAAU;;qBAGtC,gBAAgB;;;;;iBAMZ,SAAS,UAAU,OAAO,MAAM;;WAEtC,MAAM;;WAEN;;WAEA;;WAEA,UAAU,SAAS;;WAEnB;;EAET,IAAI,OAAO,UAAU,IAAI,UAAU,QAAQ,KAAK,WAAW;;;YAIjD,iBAAiB,KAAK,OAAO,SAAS,MAAK;;iBAGtC,mBAAmB,UAAU,MAAM;WACzC,MAAM;WACN;WACA;;WAEA,UAAU;WACV;;EAET,IAAI,OAAO,UAAU,IAAI,SAAS,SAAS,KAAK,WAAW;;;;;;wBAO7C,eAAe,UAAU,MAAM,kBAAkB,YAAY,mBAAmB,GAAG,KAAK,SAAS,GAAG;;;;;YAqBxG,uBAAuB,KAAK,gBAAgB,SAAS;;wBAGjD,eAAe,qBAAqB,gBAAgB;;wBAYpD,SAAS,UAAU,aAAa,qBAAqB,gBAAgB;;wBAKrE,eAAe,UAAU,MAAM,UAAU,UAAU,MAAM,aAAa,SAAS;;wBAK/E,aAAa,UAAU,MAAM,UAAU,UAAU,MAAM,GAAG,eAAe,SAAS;;wBAKlF,YAAY,UAAU,MAAM,UAAU,UAAU,MAAM,GAAG,eAAe,SAAS;;wBAOjF,SAAS,kBAAkB,UAAU,mBAAmB,IAAI,UAAU,QAAQ,KAAK;;wBASnF,UAAU,UAAU,WAAW;;;;;iBC3I9B,cAAc,mBAAmB;WACvC;WACA;WACA,MAAM;;WAEN;;WAEA;;WAEA;;WAEA;;WAEA;;WAEA;;;iBAIM;;WAEN;;WAEA;;;;;;;wBAQK,YAAY,QAAQ,QAAQ,iBAAiB,OAAO,OAAO,UAAS,oBAAyB;;;;;wBAe7F,qBACd,QAAQ,QACR,iBACA,OAAO,OACP,iBAAiB,qBACjB,UAAS,oBACR;;wBAoDa,aAAa,eAAe;;iBCxG3B;WACN;;WAEA;;WAEA;;WAEA,QAAQ;;WAER;;WAEA;;WAEA;;;;;WAKA;;WAEA;;;;;;;;wBAwBK,aAAa,OAAO,OAAO,iBAAiB,QAAQ,YAAY,KAAK;;;;;wBAkCrE,UACd,iBACA,OAAO,OACP,UAAS,aACT,mBAAkB,qBACjB;;iBA0Bc;;WAEN;WACA,SAAS;;WAET,QAAQ;;;;;;wBAOH,UAAU,iBAAiB,OAAO,OAAO,mBAAmB,eAAe,WAAU,cAA0C;;qBAqBlI;;wBAGG,eAAe,6BAA2C;;;;;wBAQ1D,aAAa,8BAA4C,kBAAiB,cAA4B;;wBAQtG,aAAa,6BAA6C,6BAAqC;;wBAK/F,WAAW,eAAe;;YCtK9B,aAAa,KAAK,KAAK;;qBAmBtB;WACF,UAAU;WACV,OAAO;WACP,SAAS,mBAAmB,aAAa;WACzC,kBAAkB,mBAAmB,aAAa;WAClD,QAAQ,mBAAmB,aAAa;WACxC,QAAQ,mBAAmB,aAAa;WACxC,cAAc,mBAAmB,aAAa;WAC9C,UAAU,mBAAmB,aAAa;WAC1C,iBAAiB,mBAAmB,aAAa;;;iBA4D3C;;WAEN;;;iBAIM;;WAEN;;;qBAIE;WACF,UAAU;WACV,SAAS,kBAAkB;WAC3B,QAAQ,kBAAkB;WAC1B,KAAK,kBAAkB;;;YA2BtB,aAAa,KAAK;;qBAMjB;WACF,QAAQ,iBAAiB;WACzB,OAAO,iBAAiB;;;qBAOtB,8BAA8B;;qBAO9B,YAAY"}
+{"version":3,"file":"index.d.ts","names":[],"sources":["../src/geom.ts","../src/grid.ts","../src/model.ts","../src/fixtures.ts","../src/cases.ts","../src/plugs.ts","../src/curves.ts","../src/curves/model.ts","../src/curves/space.ts","../src/curves/sample.ts","../src/curves/straight/index.ts","../src/curves/rounded/index.ts","../src/curves/spline/index.ts","../src/curves/arc/index.ts","../src/curves/index.ts","../src/visibility.ts","../src/ways.ts","../src/segments.ts","../src/sections.ts","../src/groups/quadtree/index.ts","../src/groups/keys/index.ts","../src/pick.ts","../src/routers/straight.ts","../src/routers/plugs.ts","../src/routers/corners.ts","../src/routers/shared.ts","../src/levels.ts","../src/room/index.ts","../src/strategies/model.ts","../src/routers/sections.ts","../src/routers/trunks.ts","../src/routers/index.ts","../src/room/lanes.ts","../src/bench/properties.ts","../src/bench/quality.ts","../src/bench/links.ts","../src/bench/run.ts","../src/bench/curves.ts","../src/bench/room.ts","../src/bench/sections.ts","../src/strategies/builtins.ts"],"mappings":";iBACiB;WACN;WACA;;;iBAIM;WACN;WACA;WACA;WACA;;;wBAIK,KAAK,GAAG,OAAO,GAAG;;wBAOlB,OAAO,GAAG,MAAM;;wBAKhB,QAAQ,GAAG,KAAK,YAAY;;wBAK5B,eAAe,YAAY;;;;;wBAY3B,cAAc,GAAG,OAAO,GAAG,OAAO,GAAG,OAAO,GAAG;;;;;wBAY/C,eAAe,GAAG,OAAO,GAAG,OAAO,KAAK,KAAK;;wBAK7C,gBAAgB,GAAG,OAAO,GAAG,OAAO,YAAY,YAAY,YAAY,YAAY;;wBA2BpF,iBAAiB,GAAG,OAAO,GAAG;;wBAO9B,qBAAqB,GAAG,OAAO,GAAG,OAAO,GAAG;;wBAS5C,mBAAmB,GAAG,OAAO,GAAG,OAAO,KAAK;;;;;wBAiB5C,MAAM,YAAY,SAAS;;wBAgB3B,UAAU,YAAY,SAAS;;;;;wBAQ/B,gBAAgB,YAAY,SAAS;;;;;wBAgBrC,QAAQ,YAAY,SAAS,YAAY;;;;;;qBC1J5C,KAAK;;;EAUhB,YAAY;;EAyHZ,IAAI,MAAM,GAAG,GAAG;;EAKhB,WAAW,MAAM,GAAG,GAAG,OAAO,GAAG;;EAMjC,MAAM,GAAG,KAAK,QAAQ,MAAM;;EAK5B,aAAa,GAAG,OAAO,GAAG,OAAO,gBAAgB,QAAQ,MAAM;;;;;EAU/D,YAAY,GAAG,OAAO,GAAG,OAAO,gBAAgB,OAAO,MAAM;;;wBAM/C,cAAc,GAAG,OAAO,GAAG,QAAQ;;YCvKvC;;;;;iBAMK;WACN;;WAEA,KAAK;;WAEL,OAAO;;;iBAID;WACN;WACA,KAAK;WACL,iBAAiB;;WAEjB,OAAO,SAAS;;;iBAIV;WACN;WACA;;;iBAIM;WACN;WACA,QAAQ;WACR,QAAQ;WACR,OAAO,SAAS;;;iBAIV;WACN,gBAAgB;WAChB,gBAAgB;;;iBAIV;WACN;WACA,iBAAiB;;;;;;iBAOX;WACN;WACA,gBAAgB;WAChB,gBAAgB;;;iBAIV;WACN;WACA,KAAK;WACL;;;iBAIM;WACN;WACA;WACA;WACA,iBAAiB;;;iBAIX;WACN,iBAAiB;WACjB,kBAAkB;WAClB,mBAAmB;;WAEnB,gBAAgB;;;;;;iBAOV;WACN;;WAEA;;WAEA;;WAEA;;WAEA,gBAAgB;;;;;;iBAOV;WACN;;WAEA;WACA,iBAAiB;;WAEjB;;;YAIC,aAAa,MAAM;;iBAGd;WACN;;WAEA;EACT,MAAM,OAAO,QAAQ;;;wBAIP,UAAU,GAAG,QAAQ,YAAY;;wBAOjC,eAAe,MAAM,MAAM,KAAK,MAAM;;wBCjItC,IAAI;;;;;YAeR;;iBAGK;WACN;WACA,MAAM;WACN;;WAEA;WACA;;WAEA;;WAEA;;;qBAIE,mBAAmB;;;;;wBAqBhB,YAAY,MAAM,cAAc;;;;;iBCnD/B;WACN;;WAEA;;WAEA,YAAY;;;;;;wBA+BP,oBAAoB;;;;;;wBASpB,iBAAiB;;;;;;wBAuBjB,mBAAmB;;;;;;;;;wBAsCnB,mBAAmB;;qBAqBtB,gBAAgB;;iBClIZ;WACN,OAAO;WACP,QAAQ;;;qBAIN,aAAa,SAAS,OAAO,MAAM;;wBAQhC,YAAY,KAAK,KAAK,GAAG,QAAQ;;;;;wBAgBjC,WAAW,KAAK,KAAK,QAAQ,QAAQ;;;;;wBAYrC,YAAY,KAAK,KAAK,MAAM,MAAM,QAAQ,OAAO,iBAAY;;;;;wBAsB7D,UAAU,MAAM,MAAM,KAAK,KAAK,QAAQ,QAAQ;;iBCjE/C;;WAEN;;WAEA;;WAEA;;;;;;wBAOK,iBAAiB,eAAe;;;;;;;wBAchC,gBAAgB,IAAI,OAAO,QAAQ,OAAO,QAAQ,OAAO,UAAS,oBAAyB;;;;;wBAkC3F,aAAa,YAAY,SAAS,gBAAgB,iBAAY;;;;;;;;;YCtDlE;;qBAGC,sBAAsB;;iBAGlB;WACN;WACA,IAAI;;;iBAIE;WACN;WACA,IAAI;;;iBAIE;WACN;WACA,IAAI;WACJ,IAAI;WACJ,IAAI;;;;;;;iBAQE;WACN;WACA,QAAQ;WACR;WACA;WACA;WACA,IAAI;;;;;;YAOH,eAAe,cAAc,cAAc,eAAe;;wBAGtD,eAAe,iBAAiB,SAAS,eAAa;;;;;UC9CrD;;WAEN,gBAAgB;;WAEhB;;;;;EAKT,QAAQ,YAAY,SAAS,YAAY;;;;;;wBAO3B,WAAW,gBAAgB,OAAO,qBAAmB;;;;;;wBCfrD,YAAY,mBAAmB,gBAAgB,qBAAkB;;wBAkCjE,QAAQ,IAAI,OAAO,IAAI,OAAO,IAAI,OAAO,IAAI,OAAO,YAAY;;;;;wBAahE,UAAU,mBAAmB,gBAAgB;;wBCtD7C,cAAc,iBAAiB,UAAU;;UCCxC;;WAEN;;WAEA,QAAQ;;;;;;;;wBASH,aAAa,iBAAiB,SAAS,UAAS,iBAAsB;;UCbrE;;;;;WAKN;;WAEA,cAAc;;WAEd,YAAY;;WAEZ,QAAQ;;;;;;;;;;wBAWH,YAAY,iBAAiB,SAAS,UAAS,gBAAqB;;UCtBnE;;WAEN;;WAEA,QAAQ;;;;;;;;wBAYH,SAAS,iBAAiB,SAAS,UAAS,aAAkB;;iBCJ7D;WACN,MAAM;;WAEN;;WAEA;;WAEA,cAAc;;WAEd,YAAY;;WAEZ,QAAQ;;;;;;;wBAQH,QAAQ,iBAAiB,SAAS,SAAS,eAAe;;qBC/B7D;;;EAIX,YAAY,gBAAgB,QAAQ;;EAMpC,MAAM,GAAG,OAAO,GAAG,OAAO,aAAa,OAAO,YAAY;;;;;EAQ1D,IAAI,GAAG,OAAO,GAAG,OAAO,aAAa,OAAO,YAAY,QAAQ;;EAWhE,UAAU,YAAY,SAAS,aAAa,OAAO,YAAY;;EAM/D,MAAM,KAAK,KAAK,QAAQ,GAAG;;EAK3B,OAAO,GAAG,OAAO,aAAa,OAAO;;;iBAmBtB;WACN,OAAO;WACP;;;iBAIM;WACN,QAAQ;WACR;WACA;WACA;;;iBAIM;;WAEN;;WAEA;;;;;WAKA;;;;;WAKA;;;;;;;;qBASE;;WACF,QAAQ;;EA6BjB,YAAY,gBAAgB,QAAQ,WAAW,WAAW,SAAS;;MAgE/D;;EAOJ,QAAQ,GAAG;;EAkBX,eAAe,GAAG,OAAO,WAAW;;;;;;;EAmGpC,KAAK,MAAM,OAAO,IAAI,OAAO,QAAQ,WAAW,WAAW,sBAAsB,iBAAoB;;;;;EASrG,UAAU,eAAe,YAAY,aAAa,aAAa;;EAyJ/D,KAAK,YAAY,SAAS,qBAAiB;;;iBC1d5B;;WAEN;;WAEA;;WAEA;;;;;;qBAOE;;WACF,WAAW;WACX,SAAS;WACT;;EAIT,YAAY,gBAAgB,QAAQ,UAAS;;EAQ7C,IAAI,GAAG,OAAO;;EAKd,QAAQ,IAAI,MAAM,IAAI,MAAM,MAAM,YAAY,QAAQ;;EAgBtD,SAAS,IAAI,MAAM,IAAI,QAAQ;;EAM/B,OAAO,MAAM,OAAO,IAAI,OAAO;;;iBC1DhB;WACN;WACA,iBAAiB;;WAEjB;;WAEA;;;iBAIM;WACN;;WAEA;WACA;;;iBAIM;WACN;WACA,mBAAmB;;;iBAIb;WACN,mBAAmB;WACnB,gBAAgB;;;;;;wBAmBX,WAAW,QAAQ,SAAS;;wBAkD5B,WAAW,OAAO,cAAc,MAAM,OAAO;;;;;wBAgB7C,eAAe,YAAY,SAAS,YAAY;;iBAuB/C;;WAEN;;WAEA;;;;;;wBAOK,UAAU,OAAO,cAAc,SAAS,mBAAmB;;wBAK3D,OAAO;;;;;;;;;wBAYP,WAAW,QAAQ,SAAS,cAAc,MAAM,qBAAqB,mBAAmB,oBAA8B;;;;;;;wBA4CtH,WAAW,cAAc,SAAS,iBAAiB;;iBC9MlD;;WAEN;WACA;WACA,MAAM;;WAEN;WACA,mBAAmB;;;iBAIb;;WAEN;;WAEA;;WAEA;;;qBAIE,kBAAkB,SAAS,SAAS;;;;;wBAMjC,cAAc,gBAAgB,QAAQ,UAAS,iBAAsB;;wBA2CrE,YAAY,MAAM,UAAU;;wBAW5B,UAAU,MAAM;;;;;wBAQhB,cAAc,MAAM,SAAS;;;;;wBCtF7B,eAAe,OAAO,OAAO,UAAS,iBAAsB;;KCFhE,WAAW,MAAM,MAAM;;UAGlB;;WAEN,MAAM;;;;;WAKN,QAAQ;;;qBAIN,aAAa;;;;;;wBA0BV,cAAc,gBAAgB,QAAQ,UAAS,aAAkB;;wBAiCjE,UAAU,OAAO,OAAO,UAAS,aAAkB;;wBC3EnD,UAAU,iBAAiB;;iBAQ1B;;WAEN;;WAEA;;;qBAIE,MAAM;;;;;;wBAOH,UAAU,0BAA0B,eAAe,UAAS,QAAQ;;wBCtBpE,QAAQ,KAAK,KAAK,QAAQ,QAAQ;;;;;qBAerC,gBAAgB;;;;;qBCVhB,aAAa;;UCHT,uBAAuB;;WAE7B;;WAEA;;;;;;;wBAQK,cAAc,SAAS,iBAAiB;;UCZvC,sBAAsB;;WAE5B;;WAEA,OAAO;;WAEP;;WAEA;;;;;;;;wBAyCK,aAAa,SAAS,gBAAgB;;UCxBrC,yBAAyB;;;;;WAK/B;;WAEA;;;iBCjCM;WACN;WACA,KAAK;;;iBAIC;WACN;WACA;WACA;;;;;;iBAOM;WACN;;WAEA;;WAEA;;WAEA;;WAEA;;WAEA;;WAEA;;WAEA;;;YAIC;;iBAGK;;WAEN;;WAEA;;;;;WAKA;;;;;;;WAOA,SAAS;;WAET,SAAS;;WAET;;WAEA;;;;;;WAMA;;;iBAIM,KAAK,UAAU;WACrB,eAAe;WACf,OAAO;;;;;;wBAiBF,UAAU,gBAAgB,SAAS,gBAA8B;;;;;;wBA0CjE,SAAS,UAAU,OAAO,gBAAgB,KAAK,eAAe,OAAO,gBAA8B;;;;;wBAkBnG,WAAW,gBAAgB,SAAS,gBAAgB,YAAY,UAAS,cAAmB;;wBA0B5F,SAAS,UAAU,OAAO,gBAAgB,KAAK,gBAAgB,YAAY,UAAS,cAAmB,KAAK;;wBAM5G,UAAU,OAAO,QAAQ;;iBClLxB;;WAEN,iBAAiB;;WAEjB,cAAc;;WAEd,YAAY;;WAEZ,QAAQ;;;iBAIF;WACN,gBAAgB;WAChB,gBAAgB;;;;;;;;;;iBAWV;WACN;aAAkB,OAAO;aAAgB,QAAQ;;WACjD;aAAmB,OAAO;aAAgB,QAAQ;;WAClD;aAAkB,OAAO;aAAqB,QAAQ;;WACtD;aAAiB,OAAO;aAAoB,QAAQ;;;;YAInD,aAAa;;YAGb,UAAU,UAAU,QAAQ,UAAU;;YAGtC,WAAW,UAAU,QAAQ,UAAU;;qBAGtC,gBAAgB;;;;;iBAMZ,SAAS,UAAU,OAAO,MAAM;;WAEtC,MAAM;;WAEN;;WAEA;;WAEA,UAAU,SAAS;;WAEnB;;EAET,IAAI,OAAO,UAAU,IAAI,UAAU,QAAQ,KAAK,WAAW;;;YAIjD,iBAAiB,KAAK,OAAO,SAAS,MAAK;;iBAGtC,mBAAmB,UAAU,MAAM;WACzC,MAAM;WACN;WACA;;WAEA,UAAU;WACV;;EAET,IAAI,OAAO,UAAU,IAAI,SAAS,SAAS,KAAK,WAAW;;;;;;wBAO7C,eAAe,UAAU,MAAM,kBAAkB,YAAY,mBAAmB,GAAG,KAAK,SAAS,GAAG;;;;;;YAsBxG,uBAAuB,KAAK,QAAQ,0BAA0B,SAAS;WAAoB,iBAAiB;;;wBAGxG,eAAe,qBAAqB,gBAAgB;;wBAYpD,SAAS,UAAU,aAAa,qBAAqB,gBAAgB;;wBAKrE,eAAe,UAAU,MAAM,UAAU,UAAU,MAAM,aAAa,SAAS;;wBAK/E,aAAa,UAAU,MAAM,UAAU,UAAU,MAAM,GAAG,eAAe,SAAS;;wBAKlF,YAAY,UAAU,MAAM,UAAU,UAAU,MAAM,GAAG,eAAe,SAAS;;wBAOjF,SAAS,kBAAkB,UAAU,mBAAmB,IAAI,UAAU,QAAQ,KAAK;;wBASnF,UAAU,UAAU,WAAW;;;;;;UC/I9B,wBAAwB,kBAAkB;;WAEhD;;;;;WAKA;;;;;WAKA;;WAEA;;;;;WAKA;;;;;WAKA,QAAQ;;WAER;;;;;WAKA;;WAEA;;;;;;;;;;;;;wBA8BK,eAAe,SAAS,kBAAkB;;UCxEzC,sBAAsB;;WAE5B;;WAEA,MAAM;;WAEN;;WAEA;;WAEA;;;qBAIE,cAAc;;;;;wBASX,WAAW,gBAAgB,QAAQ,MAAM,WAAW,mBAAc,YAAY;;;;;wBAkB9E,UAAU,KAAK,OAAO,MAAM,OAAO;WAA8B;WAAuB,MAAM;;;;;;wBAgB9F,WAAW,OAAO,OAAO,kBAAkB,SAAS,eAAe,OAAO,GAAG,mBAAmB,eAAe;;;;;;wBAkB/G,aAAa,SAAS,gBAAgB;;qBCjEzC,kBAAkB;;;;;;;;YCJnB;;qBAGC,sBAAsB;;iBAGlB;;WAEN;;WAEA,QAAQ;;WAER;;;;;;;wBAwBK,SAAS,gBAAgB,SAAS,gBAAgB,aAAa,UAAS,iBAAsB;;iBC3C7F;WACN;WASA;WACA;;;qBAIE;;;;;;;;;;wBAWG,gBAAgB,OAAO,OAAO,QAAQ,QAAQ,iBAAc;;iBCf3D;;WAEN;;WAEA;;WAEA;;WAEA;;WAEA;;WAEA;;WAEA;;WAEA;;WAEA;;;qBAIE;;wBAQG,eAAe,OAAO,OAAO,QAAQ,SAAS;;;;;wBAqG9C,UAAU,KAAK,KAAK,IAAI,OAAO,MAAM;;;;;wBAoBrC,eAAe,0BAA0B,OAAO;;iBAsB/C;WACN;WACA;;WAEA;;;wBAIK,iBAAiB,QAAQ,QAAQ,OAAO,SAAS;;;;;iBC5LhD;;WAEN;;;;;WAKA;;;;;WAKA;;WAEA;;;;;WAKA;;;iBAIM,oBAAoB;WAC1B;;WAEA;;WAEA;;WAEA;;;iBAIM;;WAEN;;;qBAIE;;qBAEA;;qBAEA;;iBAGI;WACN;WACA;WACA,iBAAiB;;;;;;wBAOZ,YAAY,YAAY;;wBAaxB,eAAe,YAAY;;;;;wBAU3B,aAAa,OAAO,oBAAoB,MAAM,gBAAgB,gBAAgB,UAAS,mBAAwB;;wBA0C/G,mBAAmB,OAAO,OAAO,QAAQ,QAAQ,UAAS,mBAAwB;;wBAYlF,cAAc,gBAAgB;;wBAgB9B,aAAa,OAAO,OAAO,UAAS,mBAAwB;;;;;wBAe5D,mBAAmB,QAAQ,QAAQ,UAAS,mBAAwB;;wBAKpE,UAAU,eAAe,eAAe;;iBCzKvC;WACN;WACA;WACA;WACA;;WAEA;;WAEA;WACA;;WAEA,iBAAiB;WACjB,SAAS;;WAET,QAAQ;;WAER,sBAAsB;;;iBAIhB;;WAEN;;;wBAIK,aAAa,kBAAkB,UAAU,mBAAmB,eAAe,UAAS,eAAoB;;;;;wBAaxG,SAAS,YAAY;;wBAqBrB,SAAS,QAAQ,QAAQ,iBAAiB,OAAO,OAAO,kBAAa;;wBA8BrE,YAAY,eAAe;;;;;wBAe3B,aAAa,eAAe;;;;;iBCpG3B,cAAc,mBAAmB;WACvC;WACA;WACA,MAAM;;WAEN;;WAEA;;WAEA;;WAEA;;WAEA;;WAEA;;;iBAIM;;WAEN;;WAEA;;;;;;;wBAQK,YAAY,QAAQ,QAAQ,iBAAiB,OAAO,OAAO,UAAS,oBAAyB;;;;;wBAe7F,qBACd,QAAQ,QACR,iBACA,OAAO,OACP,iBAAiB,qBACjB,UAAS,oBACR;;wBAoDa,aAAa,eAAe;;iBCxG3B;WACN;;WAEA;;WAEA;;WAEA,QAAQ;;WAER;;WAEA;;WAEA;;;;;WAKA;;WAEA;;;;;;;;wBAwBK,aAAa,OAAO,OAAO,iBAAiB,QAAQ,YAAY,KAAK;;;;;wBAkCrE,UACd,iBACA,OAAO,OACP,UAAS,aACT,mBAAkB,qBACjB;;iBA0Bc;;WAEN;WACA,SAAS;;WAET,QAAQ;;;;;;wBAOH,UAAU,iBAAiB,OAAO,OAAO,mBAAmB,eAAe,WAAU,cAA0C;;qBAqBlI;;wBAGG,eAAe,6BAA2C;;;;;wBAQ1D,aAAa,8BAA4C,kBAAiB,cAA4B;;wBAQtG,aAAa,6BAA6C,6BAAqC;;wBAK/F,WAAW,eAAe;;YC1K9B,yBAAyB,KAAK;;iBAGzB;;WAEN;WACA,SAAS;;;iBAIH;WACN;WACA;;WAEA,QAAQ;;WAER,aAAa;;WAEb;;WAEA;;WAEA;;WAEA;;WAEA;;WAEA;;;;;;wBAYK,cAAc,iBAAiB,OAAO,OAAO,mBAAmB,oBAAoB;;qBAwBvF;;wBAGG,gBAAgB,6BAA4C;;qBAK/D;;wBAGG,cAAc,6BAA0C;;qBAK3D;;wBAGG,YAAY,6BAAwC;;;;;wBAQpD,cACd,sBAAqB,qBACrB,UAAS,SAAS,0BACjB;;wBAKa,eAAe,eAAe;;YC5FlC,aAAa,KAAK,KAAK;;qBAmBtB;WACF,UAAU;WACV,OAAO;WACP,SAAS,mBAAmB,aAAa;WACzC,kBAAkB,mBAAmB,aAAa;WAClD,QAAQ,mBAAmB,aAAa;WACxC,QAAQ,mBAAmB,aAAa;WACxC,cAAc,mBAAmB,aAAa;WAC9C,UAAU,mBAAmB,aAAa;WAC1C,iBAAiB,mBAAmB,aAAa;;;iBA4D3C;;WAEN;;;iBAIM;;WAEN;;;qBAIE;WACF,UAAU;WACV,SAAS,kBAAkB;WAC3B,QAAQ,kBAAkB;WAC1B,KAAK,kBAAkB;;;YA2BtB,aAAa,KAAK;;qBAMjB;WACF,QAAQ,iBAAiB;WACzB,OAAO,iBAAiB;;;qBAOtB;WACF,UAAU,kBAAkB,SAAS;WACrC,MAAM,kBAAkB;;;qBAmBtB,8BAA8B;;qBAQ9B,YAAY"}

package/build/index.js

@@ -2340,13 +2340,20 @@ function orderLanes(run, routes) {
 	return [...placed.map((x) => x.edge), ...lost.sort()];
 }
 // src/sections.ts
+/** The default values of `SectionOptions`. */
+const SECTION_DEFAULTS = Object.freeze({
+	cap: 8,
+	maxDepth: 16,
+	collapse: 32
+});
 /**
 * This function makes the tree of sections of the nodes. A cell with more than `cap` nodes splits in four.
 * When the nodes of a cell are all in one quarter, the cell becomes that quarter and does not make a level.
 */
 function buildSections(nodes, options = {}) {
-	const cap = Math.max(1, options.cap ?? 8);
-	const maxDepth = options.maxDepth ?? 16;
+	const cap = Math.max(1, options.cap ?? SECTION_DEFAULTS.cap);
+	const maxDepth = options.maxDepth ?? SECTION_DEFAULTS.maxDepth;
+	const collapse = options.collapse ?? SECTION_DEFAULTS.collapse;
 	const centers = nodes.map((n) => center(n.box));
 	let x0 = Infinity;
 	let y0 = Infinity;
@@ -2371,7 +2378,7 @@ function buildSections(nodes, options = {}) {
 	};
 	const make = (id, depth, cell, list) => {
 		let box = cell;
-		for (let guard = 0; list.length > cap && depth < maxDepth && guard < 32; guard++) {
+		for (let guard = 0; list.length > cap && depth < maxDepth && guard < collapse; guard++) {
 			const mx = box.x + box.w / 2;
 			const my = box.y + box.h / 2;
 			const parts = [
@@ -2425,6 +2432,156 @@ function allSections(root) {
 function treeDepth(root) {
 	return root.children.reduce((d, c) => Math.max(d, treeDepth(c)), root.depth);
 }
+/**
+* This function examines a tree of sections from a grouping rule. It throws an error when the tree is not valid for `count` nodes.
+* In a valid tree, each node is in exactly one leaf. The children of a section split its nodes, and a child is one level deeper than its parent.
+*/
+function checkSections(root, count) {
+	const seen = new Array(count).fill(0);
+	const ids = /* @__PURE__ */ new Set();
+	const fail = (s, what) => {
+		throw new Error(`The tree of sections is not valid at the section "${s.id}": ${what}.`);
+	};
+	if (root.depth !== 0) fail(root, "the root has a depth that is not 0");
+	if (root.nodes.length !== count) fail(root, `the root has ${root.nodes.length} nodes, and the graph has ${count}`);
+	const walk = (s) => {
+		if (ids.has(s.id)) fail(s, "two sections have this id");
+		ids.add(s.id);
+		if (s.children.length === 0) {
+			for (const i of s.nodes) {
+				if (!Number.isInteger(i) || i < 0 || i >= count) fail(s, `the node index ${i} is not in the graph`);
+				seen[i]++;
+			}
+			return;
+		}
+		let total = 0;
+		const own = new Set(s.nodes);
+		for (const c of s.children) {
+			if (c.depth !== s.depth + 1) fail(c, "a child is not one level deeper than its parent");
+			for (const i of c.nodes) if (!own.has(i)) fail(c, `the node index ${i} is not in the parent`);
+			total += c.nodes.length;
+			walk(c);
+		}
+		if (total !== s.nodes.length) fail(s, "the children do not split the nodes of the section");
+	};
+	walk(root);
+	const lost = seen.findIndex((n) => n !== 1);
+	if (lost >= 0) fail(root, `the node index ${lost} is in ${seen[lost]} leaves, not in one`);
+}
+// src/groups/quadtree/index.ts
+/**
+* This function gives the tree of sections of the grouping rule `quadtree`: the cells of a quadtree of the plane (`buildSections`).
+* It is the default grouping rule of the router `sections`.
+*/
+function quadtreeGroups(graph, options = {}) {
+	return buildSections(graph.nodes, options);
+}
+// src/groups/keys/index.ts
+/** This key rule gives the string `data.group` of the node, or `undefined` when the node has no such string. */
+const byDataGroup = (node) => {
+	const group = node.data?.["group"];
+	return typeof group === "string" ? group : void 0;
+};
+/** This function gives the bounding box of the boxes of the nodes of the list. */
+function boundsOf(nodes, list) {
+	let x0 = Infinity;
+	let y0 = Infinity;
+	let x1 = -Infinity;
+	let y1 = -Infinity;
+	for (const i of list) {
+		const b = nodes[i].box;
+		x0 = Math.min(x0, b.x);
+		y0 = Math.min(y0, b.y);
+		x1 = Math.max(x1, b.x + b.w);
+		y1 = Math.max(y1, b.y + b.h);
+	}
+	return list.length ? {
+		x: x0,
+		y: y0,
+		w: x1 - x0,
+		h: y1 - y0
+	} : {
+		x: 0,
+		y: 0,
+		w: 0,
+		h: 0
+	};
+}
+/**
+* This function gives the tree of sections of the grouping rule `keys`. The root holds each node. Each child of the root holds the nodes of one key,
+* in the order of their first node. The id of a group is `s:` and its key. A node without a key is a group alone, with the id `s#` and its index.
+* Thus the far view of the router `sections` shows one item for each group.
+*/
+function keyedSections(nodes, options = {}) {
+	const key = options.key ?? byDataGroup;
+	const groups = /* @__PURE__ */ new Map();
+	nodes.forEach((n, i) => {
+		const k = key(n, i);
+		const id = k === void 0 ? `s#${i}` : `s:${k}`;
+		const list = groups.get(id);
+		if (list) list.push(i);
+		else groups.set(id, [i]);
+	});
+	const children = [...groups].map(([id, list]) => group(nodes, id, list, options.split));
+	return {
+		id: "s",
+		depth: 0,
+		cell: boundsOf(nodes, nodes.map((_, i) => i)),
+		nodes: nodes.map((_, i) => i),
+		children
+	};
+}
+/** This function gives the section of one group at depth 1. With `split`, the section has the quadtree of its nodes below it. */
+function group(nodes, id, list, split) {
+	if (!split) return {
+		id,
+		depth: 1,
+		cell: boundsOf(nodes, list),
+		nodes: list,
+		children: []
+	};
+	const tree = buildSections(list.map((i) => nodes[i]), split);
+	const rebase = (s) => ({
+		id: s.id === "s" ? id : `${id}/${s.id.slice(1)}`,
+		depth: s.depth + 1,
+		cell: s.cell,
+		nodes: s.nodes.map((j) => list[j]),
+		children: s.children.map(rebase)
+	});
+	return rebase(tree);
+}
+/** This function gives the tree of sections of the grouping rule `keys` for a graph. */
+function keyGroups(graph, options = {}) {
+	return keyedSections(graph.nodes, options);
+}
+// src/pick.ts
+/** This function gives the median width of the shown items of each level, in units of the plane. */
+function itemSizes(levels) {
+	return levels.map((level) => {
+		const sizes = level.items.map((i) => Math.max(i.box.w, i.box.h)).sort((a, b) => a - b);
+		return sizes.length ? sizes[Math.floor(sizes.length / 2)] : 0;
+	});
+}
+/** The default thresholds: a node of 22 pixels shows its routes, and a group of 120 pixels shows its parts. */
+const PICK = Object.freeze({
+	routesAt: 22,
+	itemAt: 120
+});
+/**
+* This function picks the level that a camera shows at a scale, in pixels for each unit of the plane. The sizes come from `itemSizes`.
+* The value `sizes.length` stands for the routes of each edge. The last level holds the nodes alone.
+* Each threshold that `options` does not give gets its value from `PICK`.
+*/
+function pickLevel(sizes, scale, options = PICK) {
+	const routesAt = options.routesAt ?? PICK.routesAt;
+	const itemAt = options.itemAt ?? PICK.itemAt;
+	const n = sizes.length;
+	if (n === 0) return 0;
+	if (sizes[n - 1] * scale >= routesAt) return n;
+	let pick = 0;
+	for (let d = 0; d < n - 1; d++) if (sizes[d] * scale >= itemAt) pick = d;
+	return pick;
+}
 // src/routers/corners.ts
 /**
 * This function makes a router that goes around the nodes.
@@ -2623,8 +2780,11 @@ function sumFaults(list) {
 	});
 }
 // src/levels.ts
-/** The margin of the second corner graph. A gap between two boxes wider than approximately 1.5 times this margin lets a link through. */
-const TIGHT_MARGIN = 1;
+/** The default values of the two limits of `LevelLinkOptions`. */
+const LEVEL_LINK_DEFAULTS = Object.freeze({
+	tightMargin: 1,
+	plugInset: 6
+});
 const EPS$1 = 1e-6;
 /**
 * This function removes the repeated points, the points in the middle of a straight run,
@@ -2659,7 +2819,7 @@ function levelLinks(items, pairs, options = {}) {
 	}));
 	const byId = new Map(nodes.map((n) => [n.id, n]));
 	const ways = levelWays(nodes, options);
-	const inset = Math.min(6, ways.margin);
+	const inset = Math.min(options.plugInset ?? LEVEL_LINK_DEFAULTS.plugInset, ways.margin);
 	const out = [];
 	for (const p of pairs) {
 		const s = byId.get(p.source);
@@ -2713,7 +2873,7 @@ function levelWays(nodes, options) {
 	});
 	let tight;
 	const tightGraph = () => tight ??= new CornerGraph(nodes, obstacles, {
-		margin: Math.min(margin, TIGHT_MARGIN),
+		margin: Math.min(margin, options.tightMargin ?? LEVEL_LINK_DEFAULTS.tightMargin),
 		k,
 		cones: true
 	});
@@ -3041,13 +3201,20 @@ function square(a, b, obstacles, pad, from, to) {
 	for (const { c } of options) if (obstacles.clear(a, c, pad) && obstacles.clear(c, b, pad)) return [c, b];
 }
 // src/routers/sections.ts
+/** The default values of the numbers of `SectionsOptions`: the limits of the hubs, of the tree and of the level links. */
+const SECTIONS_DEFAULTS = Object.freeze({
+	cap: SECTION_DEFAULTS.cap,
+	maxDepth: SECTION_DEFAULTS.maxDepth,
+	collapse: SECTION_DEFAULTS.collapse,
+	tightMargin: LEVEL_LINK_DEFAULTS.tightMargin,
+	plugInset: LEVEL_LINK_DEFAULTS.plugInset,
+	hubs: Infinity,
+	stretch: 2,
+	stretchPad: 4,
+	hubSlack: 80
+});
 const dedupe$1 = (p) => p.filter((q, i) => i === 0 || dist(q, p[i - 1]) > 1e-9);
 /**
-* A hub can be this many units farther from the target than the nearest approach of the way before it.
-* A hub farther away goes out and back, so the way skips it.
-*/
-const HUB_SLACK = 80;
-/**
 * This function makes a router with a tree of sections. Each section has a hub: the free corner nearest to the center of its nodes.
 * An edge goes from its node up the hubs of its sections to the lowest common section, across, and down to the other node.
 * Each way from hub to hub is found one time, so all the edges on it share its points.
@@ -3062,12 +3229,14 @@ function sectionsRouter(options) {
 	const router = {
 		name: options.name,
 		route(graph) {
-			const stretch = options.stretch ?? 2;
+			const stretch = options.stretch ?? SECTIONS_DEFAULTS.stretch;
+			const stretchPad = options.stretchPad ?? SECTIONS_DEFAULTS.stretchPad;
+			const hubSlack = options.hubSlack ?? SECTIONS_DEFAULTS.hubSlack;
 			const byId = nodeIndex(graph);
 			const indexOfNode = new Map(graph.nodes.map((n, i) => [n.id, i]));
 			const ways = new WayFinder(graph.nodes, options);
 			const corners = ways.corners;
-			const root = buildSections(graph.nodes, options);
+			const root = groupNodes(graph, options);
 			const parent = /* @__PURE__ */ new Map();
 			const leafOf = [];
 			for (const s of allSections(root)) {
@@ -3101,7 +3270,7 @@ function sectionsRouter(options) {
 				let last = from;
 				for (const c of list) {
 					const h = hub(c);
-					if (dist(h, to) > near + HUB_SLACK) continue;
+					if (dist(h, to) > near + hubSlack) continue;
 					near = Math.min(near, pointSegmentDistance(to, last, h));
 					last = h;
 					kept.push(c);
@@ -3151,7 +3320,7 @@ function sectionsRouter(options) {
 				const b = up(lv);
 				const common = new Set(b);
 				const lca = a.find((x) => common.has(x));
-				const keep = options.hubs ?? Infinity;
+				const keep = options.hubs ?? SECTIONS_DEFAULTS.hubs;
 				const side = (list) => list.slice(Math.max(0, list.indexOf(lca) - keep), list.indexOf(lca));
 				const end = ways.out(pt);
 				const start = ways.out(ps);
@@ -3172,7 +3341,7 @@ function sectionsRouter(options) {
 				for (let i = 1; i < chain.length; i++) append(piece(chain[i - 1].id, hub(chain[i - 1]), chain[i].id, hub(chain[i]), used));
 				append(piece(chain[chain.length - 1].id, hub(chain[chain.length - 1]), at(end), end, used));
 				append([pt.point]);
-				if (polylineLength(out) > stretch * dist(ps.point, pt.point) + 4 * ways.margin || goesOutAndBack(out)) {
+				if (polylineLength(out) > stretch * dist(ps.point, pt.point) + stretchPad * ways.margin || goesOutAndBack(out)) {
 					routes.push({
 						edge: e.id,
 						points: ways.between(ps, pt, /* @__PURE__ */ new Set([s, t]))
@@ -3213,8 +3382,16 @@ function sectionsRouter(options) {
 		maxNodes: options.maxNodes
 	};
 }
+/** This function gives the tree of sections of the grouping rule. It examines the tree of a strategy (`checkSections`). */
+function groupNodes(graph, options) {
+	if (!options.group) return buildSections(graph.nodes, options);
+	const root = options.group.run(graph, options.groupOptions);
+	checkSections(root, graph.nodes.length);
+	return root;
+}
 /**
 * This function gives one zoom level for each depth of the tree, and a last level with each node alone.
+* With the option `levels`, only those depths get a level with groups.
 * At depth d, a section of depth d is one item. A link joins two items and counts the edges between them.
 * In a level with groups, a link goes around the boxes of the other items (`levelLinks`).
 * In the last level, the points of a link are the route of its first edge.
@@ -3223,7 +3400,9 @@ function makeLevels(graph, root, routeOf, options) {
 	const indexOfNode = new Map(graph.nodes.map((n, i) => [n.id, i]));
 	const levels = [];
 	const deepest = treeDepth(root);
+	const shown = options.levels && new Set(options.levels);
 	for (let d = 0; d <= deepest + 1; d++) {
+		if (shown && d <= deepest && !shown.has(d)) continue;
 		const items = [];
 		const itemOf = [];
 		const boxOf = (list) => {
@@ -4355,7 +4534,7 @@ function measureStability(before, after) {
 	};
 }
 // src/bench/run.ts
-const now$2 = () => globalThis.performance?.now() ?? Date.now();
+const now$3 = () => globalThis.performance?.now() ?? Date.now();
 /** This function routes each fixture with each router, checks the hard rules and measures the quality. */
 function runBenchmark(routers, fixtures, options = {}) {
 	const rows = [];
@@ -4394,9 +4573,9 @@ function benchOne(router, fixture, graph, repeat = 3) {
 	let first;
 	let deterministic = true;
 	for (let i = 0; i < Math.max(2, repeat); i++) {
-		const t0 = now$2();
+		const t0 = now$3();
 		const r = router.route(graph);
-		times.push(now$2() - t0);
+		times.push(now$3() - t0);
 		if (!first) first = r;
 		else if (i === 1 && !sameData(r, first)) deterministic = false;
 	}
@@ -4461,6 +4640,7 @@ function formatFaults(rows) {
 // src/strategies/model.ts
 /** The steps that have strategies, in the order of the pipeline. */
 const STEPS = [
+	"group",
 	"router",
 	"curve",
 	"room"
@@ -4491,6 +4671,7 @@ function defineStrategy(definition) {
 /** This function makes a registry from a list of strategies. It keeps their order. Two strategies with one step and one name are an error. */
 function createRegistry(strategies) {
 	const out = {
+		group: [],
 		router: [],
 		curve: [],
 		room: []
@@ -4502,6 +4683,7 @@ function createRegistry(strategies) {
 		list.push(s);
 	}
 	return Object.freeze({
+		group: Object.freeze(out.group),
 		router: Object.freeze(out.router),
 		curve: Object.freeze(out.curve),
 		room: Object.freeze(out.room)
@@ -4510,6 +4692,7 @@ function createRegistry(strategies) {
 /** This function gives a new registry with the strategies of `registry` and then `strategies`. It does not change `registry`. */
 function register(registry, ...strategies) {
 	return createRegistry([
+		...registry.group ?? [],
 		...registry.router,
 		...registry.curve,
 		...registry.room,
@@ -4518,7 +4701,7 @@ function register(registry, ...strategies) {
 }
 /** This function gives the strategies of one step of a registry, in order. */
 function listStrategies(registry, step) {
-	return registry[step];
+	return registry[step] ?? [];
 }
 /** This function gives the strategy of one step with a name, or `undefined` when the registry has no such strategy. */
 function findStrategy(registry, step, name) {
@@ -4640,8 +4823,26 @@ const roomStrategies = Object.freeze({
 	routes: roomStrategy("routes", "The lanes of a gap are the most routes that run along it side by side, with each gap open to the gutter."),
 	lines: roomStrategy("lines", "The lanes of a gap are the straight lines between the centers of the boxes that cross the gap.")
 });
+/** The built-in grouping rules: the strategies of the step `group`. The router `sections` makes its hubs and its zoom levels from their tree. */
+const groupStrategies = Object.freeze({
+	quadtree: defineStrategy({
+		step: "group",
+		name: "quadtree",
+		describe: "The cells of a quadtree of the plane. A cell with more than `cap` nodes splits in four. It is the default rule of the router `sections`.",
+		defaults: { ...SECTION_DEFAULTS },
+		run: (graph, o) => quadtreeGroups(graph, o)
+	}),
+	keys: defineStrategy({
+		step: "group",
+		name: "keys",
+		describe: "One group for each key of the nodes. The default key is the string `data.group` of the node. A node without a key is a group alone.",
+		defaults: { key: byDataGroup },
+		run: (graph, o) => keyGroups(graph, o)
+	})
+});
 /** The built-in strategies of each step, in order. A consumer adds its own: `createRegistry([...BUILT_IN_STRATEGIES, mine])`. */
 const BUILT_IN_STRATEGIES = Object.freeze([
+	...Object.values(groupStrategies),
 	...Object.values(routerStrategies),
 	...Object.values(curveStrategies),
 	...Object.values(roomStrategies)
@@ -4649,7 +4850,7 @@ const BUILT_IN_STRATEGIES = Object.freeze([
 /** The registry of the built-in strategies. The benchmark and the site take their lists from it. */
 const STRATEGIES = createRegistry(BUILT_IN_STRATEGIES);
 // src/bench/curves.ts
-const now$1 = () => globalThis.performance?.now() ?? Date.now();
+const now$2 = () => globalThis.performance?.now() ?? Date.now();
 /**
 * This function routes a graph with a router and makes each curve type of each route.
 * It counts the curves that go through a box, with and without the free space, and it compares their length to the polylines.
@@ -4699,9 +4900,9 @@ function benchCurveStrategies(router, fixture, graph, curves, options = {}) {
 			}, radius), tolerance)
 		}));
 		const free = measureLinks(boxes, make(false));
-		const t0 = now$1();
+		const t0 = now$2();
 		const clamped = make(true);
-		const ms = now$1() - t0;
+		const ms = now$2() - t0;
 		const length = clamped.reduce((sum, l) => sum + polylineLength(l.points), 0);
 		return {
 			router: router.name,
@@ -4725,7 +4926,7 @@ function formatCurves(rows) {
 	].join("\n");
 }
 // src/bench/room.ts
-const now = () => globalThis.performance?.now() ?? Date.now();
+const now$1 = () => globalThis.performance?.now() ?? Date.now();
 /** This function gives the area of the bounding box of the nodes. */
 function areaOf(nodes) {
 	let x0 = Infinity;
@@ -4800,22 +5001,22 @@ function benchRoom(fixture, graph, options = {}, methods = [roomStrategies.route
 		}, spacing)
 	});
 	const rows = [row("packed", graph.nodes, 0)];
-	const t0 = now();
+	const t0 = now$1();
 	const gutter = makeRoom(graph.nodes, links, {
 		...options,
 		spacing: 0,
 		method: "routes"
 	});
-	rows.push(row("gutter", gutter.items, now() - t0));
+	rows.push(row("gutter", gutter.items, now$1() - t0));
 	const { method: _method, ...preset } = options;
 	for (const s of methods) {
-		const t1 = now();
+		const t1 = now$1();
 		const gaps = s.run({
 			items: graph.nodes,
 			links
 		}, preset);
 		const nodes = openGaps(graph.nodes, gaps, options.snap);
-		rows.push(row(s.name, nodes, now() - t1));
+		rows.push(row(s.name, nodes, now$1() - t1));
 	}
 	return rows;
 }
@@ -4847,12 +5048,12 @@ function sweepRoom(fixture, graph, settings, baseline = {
 		passes: 1
 	}).items, 0, baseline.spacing ?? 4)];
 	for (const s of settings) {
-		const t0 = now();
+		const t0 = now$1();
 		const open = makeRoom(graph.nodes, links, {
 			...s.options,
 			method: "routes"
 		});
-		rows.push(row(s.name, open.items, now() - t0, s.options.spacing ?? 4, s.lanes));
+		rows.push(row(s.name, open.items, now$1() - t0, s.options.spacing ?? 4, s.lanes));
 	}
 	return rows;
 }
@@ -4934,6 +5135,118 @@ function formatRoom(rows) {
 		})
 	].join("\n");
 }
-export { BACKTRACK_MIN, BACKTRACK_SHARE, BUILT_IN_STRATEGIES, CASES, CLEARANCE_CAP, CURVE_TYPES, CornerGraph, FIXTURES, GROWTH_SWEEP, Grid, LANE_ORDERS, OUTSIDE_SLACK, Obstacles, ROUTERS, SIDE_NORMAL, STEPS, STRATEGIES, TOLERANCE, WayFinder, allSections, arcCurve, asRouter, backtrackOf, benchCurveStrategies, benchCurves, benchOne, benchRoom, bendCount, boardGaps, boxExit, buildSections, byCollection, center, checkProperties, cornersRouter, countCrossings, countOverlaps, createRegistry, cubicAt, curveOf, curveSpace, curveStrategies, defineStrategy, denseGroupsBoard, dist, distinctPoints, findStrategy, fixedPortPoint, formatCurves, formatFaults, formatRoom, formatTable, frechet, gapLanes, getStrategy, goesOutAndBack, groupEdges, growthSettings, hubChainBoard, inflate, inflectionCount, inflectionCurve, inflectionSector, laneOrder, laneRoutes, laneSettings, listStrategies, makeFixture, makeRoom, manyGroupsBoard, measureBoard, measureLevel, measureLevelFaults, measureLinks, measureQuality, measureRouteFaults, measureStability, nearestSide, nodeIndex, offsetPolyline, openGaps, orderLanes, packedGridBoard, passSettings, pathPoints, placePlug, plugsRouter, pointBoxDistance, pointOnSide, pointSegmentDistance, polylineLength, pullApart, register, rng, roomDemand, roomLinks, roomStrategies, roundCorners, roundedCurve, routerStrategies, routersOf, runBenchmark, runKey, sameData, sampleCurve, sectionsRouter, segmentBounds, segmentBoxDistance, segmentHitsBox, segmentHitsRect, segmentsCross, segmentsOf, sharedRouter, sideAngle, sideToward, splineCurve, splitPoint, straightCurve, straightRouter, sumFaults, sweepRoom, toSvgPath, treeDepth, trunksRouter, turns };
+// src/bench/sections.ts
+const now = () => globalThis.performance?.now() ?? Date.now();
+/** This function gives the number of items of the first level with more than one item, or 0 for a result without levels. */
+function farItems(result) {
+	return result.levels?.find((l) => l.items.length > 1)?.items.length ?? 0;
+}
+/**
+* This function measures the router `sections` on one board with each setting. The first row is the fair baseline: the defaults, with no option.
+* The direct routes come from the hub limit 0, so `hubRoutes` counts the routes that use the hubs.
+*/
+function sweepSections(fixture, graph, settings) {
+	return [{
+		name: "defaults",
+		options: {}
+	}, ...settings].map((s) => {
+		const direct = sectionsRouter({
+			...s.options,
+			name: "direct",
+			stretch: 0,
+			stretchPad: 0
+		}).route(graph);
+		const t0 = now();
+		const result = sectionsRouter({
+			...s.options,
+			name: s.name
+		}).route(graph);
+		const ms = now() - t0;
+		const levelFaults = measureLevelFaults(result);
+		return {
+			fixture,
+			setting: s.name,
+			faults: measureRouteFaults(graph, result),
+			levelFaults: sumFaults(levelFaults),
+			overlaps: levelFaults.reduce((n, f) => n + f.overlaps, 0),
+			hubRoutes: result.routes.filter((r, i) => !sameData(r.points, direct.routes[i]?.points)).length,
+			runs: result.runs?.length ?? 0,
+			levels: result.levels?.length ?? 0,
+			farItems: farItems(result),
+			ms
+		};
+	});
+}
+/** The values of the hub limit (`stretch`) of the sweep of CUSTOM. The default is 2. */
+const STRETCH_SWEEP = [
+	1.25,
+	1.5,
+	2,
+	3,
+	Infinity
+];
+/** This function gives the settings of the sweep of the hub limit: one setting for each value of `stretch`. */
+function stretchSettings(values = STRETCH_SWEEP) {
+	return values.map((stretch) => ({
+		name: `stretch ${stretch}`,
+		options: { stretch }
+	}));
+}
+/** The values of `hubSlack` of the sweep of CUSTOM. The default is 80. */
+const SLACK_SWEEP = [
+	0,
+	40,
+	80,
+	160,
+	Infinity
+];
+/** This function gives the settings of the sweep of the slack of the hubs: one setting for each value of `hubSlack`. */
+function slackSettings(values = SLACK_SWEEP) {
+	return values.map((hubSlack) => ({
+		name: `hubSlack ${hubSlack}`,
+		options: { hubSlack }
+	}));
+}
+/** The values of the section limit (`cap`) of the sweep of CUSTOM. The default is 8. */
+const CAP_SWEEP = [
+	4,
+	6,
+	8,
+	12,
+	16
+];
+/** This function gives the settings of the sweep of the section limit: one setting for each value of `cap`. */
+function capSettings(values = CAP_SWEEP) {
+	return values.map((cap) => ({
+		name: `cap ${cap}`,
+		options: { cap }
+	}));
+}
+/**
+* This function gives one setting for each grouping rule: the router `sections` with the strategy as its option `group`.
+* The map `options` gives the options of a strategy by its name.
+*/
+function groupSettings(strategies = Object.values(groupStrategies), options = {}) {
+	return strategies.map((group) => ({
+		name: `group ${group.name}`,
+		options: {
+			group,
+			...options[group.name] ? { groupOptions: options[group.name] } : {}
+		}
+	}));
+}
+/** This function writes the rows of `sweepSections` as a Markdown table. */
+function formatSections(rows) {
+	return [
+		"| fixture | setting | through | out and back | worst detour | outside | hub routes | runs | levels | far items | level through | level out and back | level outside | level overlaps | ms |",
+		"|---|---|---:|---:|---:|---:|---:|---:|---:|---:|---:|---:|---:|---:|---:|",
+		...rows.map((r) => {
+			const f = r.faults;
+			const l = r.levelFaults;
+			return `| ${r.fixture} | ${r.setting} | ${f.through} | ${f.backtrack} | ${f.worstDetour.toFixed(2)} | ${f.outside} | ${r.hubRoutes} | ${r.runs} | ${r.levels} | ${r.farItems} | ${l.through} | ${l.backtrack} | ${l.outside} | ${r.overlaps} | ${r.ms.toFixed(1)} |`;
+		})
+	].join("\n");
+}
+export { BACKTRACK_MIN, BACKTRACK_SHARE, BUILT_IN_STRATEGIES, CAP_SWEEP, CASES, CLEARANCE_CAP, CURVE_TYPES, CornerGraph, FIXTURES, GROWTH_SWEEP, Grid, LANE_ORDERS, OUTSIDE_SLACK, Obstacles, PICK, ROUTERS, SECTION_DEFAULTS, SIDE_NORMAL, SLACK_SWEEP, STEPS, STRATEGIES, STRETCH_SWEEP, TOLERANCE, WayFinder, allSections, arcCurve, asRouter, backtrackOf, benchCurveStrategies, benchCurves, benchOne, benchRoom, bendCount, boardGaps, boxExit, buildSections, byCollection, byDataGroup, capSettings, center, checkProperties, checkSections, cornersRouter, countCrossings, countOverlaps, createRegistry, cubicAt, curveOf, curveSpace, curveStrategies, defineStrategy, denseGroupsBoard, dist, distinctPoints, findStrategy, fixedPortPoint, formatCurves, formatFaults, formatRoom, formatSections, formatTable, frechet, gapLanes, getStrategy, goesOutAndBack, groupEdges, groupSettings, groupStrategies, growthSettings, hubChainBoard, inflate, inflectionCount, inflectionCurve, inflectionSector, itemSizes, keyGroups, keyedSections, laneOrder, laneRoutes, laneSettings, listStrategies, makeFixture, makeRoom, manyGroupsBoard, measureBoard, measureLevel, measureLevelFaults, measureLinks, measureQuality, measureRouteFaults, measureStability, nearestSide, nodeIndex, offsetPolyline, openGaps, orderLanes, packedGridBoard, passSettings, pathPoints, pickLevel, placePlug, plugsRouter, pointBoxDistance, pointOnSide, pointSegmentDistance, polylineLength, pullApart, quadtreeGroups, register, rng, roomDemand, roomLinks, roomStrategies, roundCorners, roundedCurve, routerStrategies, routersOf, runBenchmark, runKey, sameData, sampleCurve, sectionsRouter, segmentBounds, segmentBoxDistance, segmentHitsBox, segmentHitsRect, segmentsCross, segmentsOf, sharedRouter, sideAngle, sideToward, slackSettings, splineCurve, splitPoint, straightCurve, straightRouter, stretchSettings, sumFaults, sweepRoom, sweepSections, toSvgPath, treeDepth, trunksRouter, turns };
 
 //# sourceMappingURL=index.js.map