atriusmaps-node-sdk 1.0.0 → 3.2.28

package/lib/src/utils/geom.js

@@ -1,141 +1 @@
-import * as R from 'ramda';
-
-// https://stackoverflow.com/questions/22521982/check-if-point-inside-a-polygon
-const pointInPolygon = (point, vs) => {
-  const x = point[0];
-  const y = point[1];
-
-  let inside = false;
-  for (let i = 0, j = vs.length - 1; i < vs.length; j = i++) {
-    const xi = vs[i][0];
-    const yi = vs[i][1];
-    const xj = vs[j][0];
-    const yj = vs[j][1];
-    const intersect = ((yi > y) !== (yj > y)) &&
-          (x < (xj - xi) * (y - yi) / (yj - yi) + xi);
-    if (intersect) {
-      inside = !inside;
-    }
-  }
-
-  return inside
-};
-
-/**
- * Pass in a buildings array and a lat,lng and this will return the building at that point
- * or undefined if no building exists at that point. This runs very quickly as we very often
- * can skip the slowest path (which runs pointInPolygon). Without preciseFlag we sometimes return
- * a building when the point falls outside it - but won't return a wrong building. In some cases this
- * is actually desired behavior anyway (such as building selector)
- * @param  {Array.Object} buildings
- * @param  {float} lat latitude of point to check
- * @param  {float} lng longitude of point to check
- * @param  {boolean} preciseFlag if not true we take a shortcut when a single building falls within bounding box (very common case)
- * @returns {object} building that contains the point passed, or undefined if none
- */
-function getStructureAtPoint (buildings, lat, lng, preciseFlag) {
-  if (!R.length(buildings)) return null
-
-  buildings = buildings.filter(b => b.shouldDisplay == null || b.shouldDisplay === true);
-
-  const pointInPolygonCurried = R.curry(pointInPolygon)([lat, lng]);
-
-  const buildingsWithinBoundingBox = buildings
-    .filter(R.compose(pointInPolygonCurried, getBoundsCoords));
-
-  if (buildingsWithinBoundingBox.length === 0) return null
-  if (buildingsWithinBoundingBox.length === 1 && !preciseFlag)
-    return R.head(buildingsWithinBoundingBox)
-
-  const buildingsWithinBoundsPolygon = buildingsWithinBoundingBox
-    .filter(R.compose(pointInPolygonCurried, R.prop('boundsPolygon')));
-
-  if (buildingsWithinBoundsPolygon.length === 1)
-    return R.head(buildingsWithinBoundsPolygon)
-
-  if (buildingsWithinBoundsPolygon.length)
-    return findBuildingWithMaxArea(buildingsWithinBoundingBox)
-  return null
-}
-
-const getBoundsCoords = building => {
-  const { n, s, e, w } = building.bounds;
-  return [[n, e], [n, w], [s, w], [s, e]]
-};
-
-const calcBuildingArea = currentBuilding => {
-  if (!currentBuilding.bounds) return 0
-  const { n, s, e, w } = currentBuilding.bounds;
-  return Math.abs((n - s) * (e - w))
-};
-
-const findBuildingWithMaxArea = R.reduce(R.maxBy(calcBuildingArea), {});
-
-/**
- * given a building and ord, return the floor (or undefined if doesn't exist)
- */
-const ordToFloor = (building, ord) =>
-  Object.values(building.levels).reduce((matchedFloor, floor) =>
-    floor.ordinal === ord ? floor : matchedFloor, undefined);
-
-/**
- * Return the floor based on its ID (pass in buildings array and floorId)
- */
-const getFloor = (buildings, selectedLevelId) =>
-  buildings.reduce((fmatch, building) =>
-    Object.values(building.levels).reduce((fmatch, floor) =>
-      floor.id === selectedLevelId ? floor : fmatch, null) || fmatch, undefined);
-
-function getBuildingAndFloorAtPoint (buildings, lat, lng, ord, preciseFlag) {
-  const building = getStructureAtPoint(buildings, lat, lng, preciseFlag);
-  const floor = building
-    ? ordToFloor(building, ord)
-    : null;
-  return { building, floor }
-}
-
-const getFloorAt = (buildings, lat, lng, ord, preciseFlag) => getBuildingAndFloorAtPoint(buildings, lat, lng, ord, preciseFlag).floor;
-
-/**
- * Calculate the points for a bezier cubic curve
- *
- * @param {number} fromX - Starting point x
- * @param {number} fromY - Starting point y
- * @param {number} cpX - Control point x
- * @param {number} cpY - Control point y
- * @param {number} cpX2 - Second Control point x
- * @param {number} cpY2 - Second Control point y
- * @param {number} toX - Destination point x
- * @param {number} toY - Destination point y
- * @return {Object[]} Array of points of the curve
- */
-function bezierCurveTo (fromX, fromY, cpX, cpY, cpX2, cpY2, toX, toY) {
-  const n = 20; // controls smoothness of line
-  let dt = 0;
-  let dt2 = 0;
-  let dt3 = 0;
-  let t2 = 0;
-  let t3 = 0;
-
-  const path = [{ x: fromX, y: fromY }];
-
-  for (let i = 1, j = 0; i <= n; ++i) {
-    j = i / n;
-
-    dt = (1 - j);
-    dt2 = dt * dt;
-    dt3 = dt2 * dt;
-
-    t2 = j * j;
-    t3 = t2 * j;
-
-    path.push({
-      x: (dt3 * fromX) + (3 * dt2 * j * cpX) + (3 * dt * t2 * cpX2) + (t3 * toX),
-      y: (dt3 * fromY) + (3 * dt2 * j * cpY) + (3 * dt * t2 * cpY2) + (t3 * toY)
-    });
-  }
-
-  return path
-}
-
-export { bezierCurveTo, getBuildingAndFloorAtPoint, getFloor, getFloorAt, getStructureAtPoint, ordToFloor, pointInPolygon };
+import*as n from"ramda";const e=(n,e)=>{const t=n[0],r=n[1];let l=!1;for(let n=0,o=e.length-1;n<e.length;o=n++){const u=e[n][0],s=e[n][1],c=e[o][0],i=e[o][1];s>r!=i>r&&t<(c-u)*(r-s)/(i-s)+u&&(l=!l)}return l};function t(t,l,u,s){if(!n.length(t))return null;t=t.filter((n=>null==n.shouldDisplay||!0===n.shouldDisplay));const c=n.curry(e)([l,u]),i=t.filter(n.compose(c,r));if(0===i.length)return null;if(1===i.length&&!s)return n.head(i);const d=i.filter(n.compose(c,n.prop("boundsPolygon")));return 1===d.length?n.head(d):d.length?o(i):s?null:o(i)}const r=n=>{const{n:e,s:t,e:r,w:l}=n.bounds;return[[e,r],[e,l],[t,l],[t,r]]},l=n=>{if(!n.bounds)return 0;const{n:e,s:t,e:r,w:l}=n.bounds;return Math.abs((e-t)*(r-l))},o=n=>{return n.reduce((e=l,(n,t)=>e(n)<e(t)?n:t));var e},u=(n,e)=>Object.values(n.levels).reduce(((n,t)=>t.ordinal===e?t:n),void 0),s=(n,e)=>n.reduce(((n,t)=>Object.values(t.levels).reduce(((n,t)=>t.id===e?t:n),null)||n),void 0);function c(n,e,r,l,o){const s=t(n,e,r,o);return{building:s,floor:s?u(s,l):null}}const i=(n,e,t,r,l)=>c(n,e,t,r,l).floor;function d(n,e,t,r,l,o,u,s){let c=0,i=0,d=0,f=0,a=0;const h=[{x:n,y:e}];for(let g=1,p=0;g<=20;++g)p=g/20,c=1-p,i=c*c,d=i*c,f=p*p,a=f*p,h.push({x:d*n+3*i*p*t+3*c*f*l+a*u,y:d*e+3*i*p*r+3*c*f*o+a*s});return h}export{d as bezierCurveTo,c as getBuildingAndFloorAtPoint,s as getFloor,i as getFloorAt,t as getStructureAtPoint,u as ordToFloor,e as pointInPolygon};

package/lib/src/utils/i18n.js

@@ -1,70 +1 @@
-import i18next from 'i18next';
-
-async function init (langOverride, debugMode) {
-  const i18n = i18next.createInstance();
-  return i18n
-    // .use(dashEmAll)
-    // .use(pseudoTrans)
-    .init({
-      debug: debugMode,
-      interpolation: {
-        escapeValue: false
-      },
-      resources: {
-        en: {
-          translation: {
-            'Walk xx minutes to': 'Walk {{count}} minute to',
-            'Walk xx minutes to_plural': 'Walk {{count}} minutes to'
-          }
-        }
-      },
-      fallbackLng: 'en',
-      // ns: ['common', 'banner', 'common', 'directions', 'failure', 'flights', 'legal', 'navigation', 'poi', 'search', 'security', 'time', 'tooltip'],
-      // defaultNS: 'common',
-      lng: langOverride, /* ,    interpolation: {
-      escapeValue: true
-    } */
-      postProcess: ['pseudoTrans']
-    })
-    .then(() => {
-      if (debugMode) {
-        i18n.on('missingKey', function (lngs, namespace, key, res) {
-          console.error('i18nNext: key not found. Language: ' + i18n.language + ', Key: ' + key + ', namespace: ' + namespace + ', lngs: ', lngs);
-        });
-      }
-
-      // i18n.changeLanguage(lng, callback)
-      // i18n.t(key, interpolation)
-
-      return i18n
-    })
-}
-
-// A postprocessor plugin for i18next that replaces all words with dashes - this helps identify untranslated strings
-// const dashEmAll = {
-//   name: 'dashEmAll',
-//   type: 'postProcessor',
-//   process: (value, key, options, translator) => value.replace(/[^ .-_,]/g, '-')
-// }
-
-// const pseudoTrans = {
-//   name: 'pseudoTrans',
-//   type: 'postProcessor',
-//   process: (value, key, options, translator) => toLang(value, translator.language)
-// }
-
-const loremIpsum = {
-  ar: `بال عن أمام الأخذ البرية. ثم كما وقام شاسعة الجنوبي, أمدها الإمداد عن انه. ٣٠ فكانت والكساد انه. أساسي الشمال الإتفاقية بال أم. زهاء المؤلّفة حين عل, سكان قررت هذه ان, شعار باستخدام ولم مع.
-
-دول الأمور الصفحة الأوروبية قد. تم حدى فاتّبع الهجوم, ما أوسع معاملة فعل, خلاف الأوروبية، إيو كل. تُصب واندونيسيا، حين قد. أي حاول حقول وهولندا، هذا, بين عن لهيمنة بالسيطرة.
-
-أعمال الإتحاد العمليات من وصل. وقوعها، باستخدام قد أخر, بل حتى علاقة التبرعات. فقد لم الأرض استبدال. حتى الخاسر اقتصادية بـ. أصقاع أعلنت اتفاقية تلك بل, كان إذ بحشد أخرى ليبين. الشتاء، اليابان، مكن أم, به، قد العالم، أوراقهم, بل لعدم لغزو أواخر مكن.
-`,
-  ja: '私は場合いよいよある所有らってのの末がしたた。無論結果に圧迫顔もよくその発展ないですまでを決するてみるでしでも発展云いませたから、そうには描いたないたた。機会へ載っない方は別に今をひょろひょろでずまし。むしろ嘉納さんを意味方面そう＃「を積んない権力この自分何か記念をというおお尋ねだろででですで、ある今はこれか頼み例があるで、ネルソンさんののの引込のあなたにもっともお努力といと私赤に実建設が起っようにとやかくご附随を描いですましから、どうもとにかく相違に云おでてならますのが行っないませ。'
-};
-
-const toLang = (str, lang) => lang === 'en' ? str : repl(str, loremIpsum[lang]);
-const repl = (str, r) => str.length < r.length ? r.substring(0, str.length) : r;
-
-export default init;
-export { toLang };
+import n from"i18next";async function e(e,t){const a=n.createInstance();return a.init({debug:t,interpolation:{escapeValue:!1},resources:{en:{translation:{"Walk xx minutes to":"Walk {{count}} minute to","Walk xx minutes to_plural":"Walk {{count}} minutes to"}}},fallbackLng:"en",lng:e,postProcess:["pseudoTrans"]}).then((()=>(t&&a.on("missingKey",(function(n,e,t,o){console.error("i18nNext: key not found. Language: "+a.language+", Key: "+t+", namespace: "+e+", lngs: ",n)})),a)))}const t={ar:"بال عن أمام الأخذ البرية. ثم كما وقام شاسعة الجنوبي, أمدها الإمداد عن انه. ٣٠ فكانت والكساد انه. أساسي الشمال الإتفاقية بال أم. زهاء المؤلّفة حين عل, سكان قررت هذه ان, شعار باستخدام ولم مع.\n\nدول الأمور الصفحة الأوروبية قد. تم حدى فاتّبع الهجوم, ما أوسع معاملة فعل, خلاف الأوروبية، إيو كل. تُصب واندونيسيا، حين قد. أي حاول حقول وهولندا، هذا, بين عن لهيمنة بالسيطرة.\n\nأعمال الإتحاد العمليات من وصل. وقوعها، باستخدام قد أخر, بل حتى علاقة التبرعات. فقد لم الأرض استبدال. حتى الخاسر اقتصادية بـ. أصقاع أعلنت اتفاقية تلك بل, كان إذ بحشد أخرى ليبين. الشتاء، اليابان، مكن أم, به، قد العالم، أوراقهم, بل لعدم لغزو أواخر مكن.\n",ja:"私は場合いよいよある所有らってのの末がしたた。無論結果に圧迫顔もよくその発展ないですまでを決するてみるでしでも発展云いませたから、そうには描いたないたた。機会へ載っない方は別に今をひょろひょろでずまし。むしろ嘉納さんを意味方面そう＃「を積んない権力この自分何か記念をというおお尋ねだろででですで、ある今はこれか頼み例があるで、ネルソンさんののの引込のあなたにもっともお努力といと私赤に実建設が起っようにとやかくご附随を描いですましから、どうもとにかく相違に云おでてならますのが行っないませ。"},a=(n,e)=>"en"===e?n:o(n,t[e]),o=(n,e)=>n.length<e.length?e.substring(0,n.length):e;export{e as default,a as toLang};

package/lib/src/utils/observable.js

@@ -1,76 +1 @@
-function fire () {
-  const ob = this._observers;
-
-  if (!ob)
-    return undefined
-
-  for (let x = 0; x < ob.length; x++)
-    try { ob[x].apply(this, arguments); } catch (err) { console.error(err); }
-
-  return this
-}
-
-function observe (cb) {
-  if (!this._observers)
-    this._observers = [];
-
-  this._observers.push(cb);
-
-  return {
-    detach: detach.bind(this, cb),
-    ob: this
-  }
-}
-
-function detach (cb) {
-  this._observers.splice(this._observers.indexOf(cb), 1);
-}
-
-// Returns a new derivitive observer that fires events when the observed object fires iff
-// the event passes the predicate function specified here.
-function filter (fn) {
-  const o2 = create();
-
-  this.observe(function () {
-    if (fn.apply(this, arguments))
-      o2.fire.apply(o2, arguments);
-  });
-
-  return o2
-}
-
-// When first argument denotes an event name, this is a convenience
-// method to filter by that name
-function filterByName (eventName) {
-  return filter.call(this, function (name) {
-    return eventName === name
-  })
-}
-
-// Filters on equivilence of first argument (often the event name) and observes
-// the result - calling the callback function when triggered
-function on (value, cb) {
-  return filterByName.call(this, value).observe(cb)
-}
-
-function detachAll () { this._observers = []; }
-
-const observable = { detach, detachAll, filter, fire, observe, on };
-
-// extend `to` argument with properties from `from`
-// [short version]
-function extend (to, from) {
-  for (const prop in from)
-    to[prop] = from[prop];
-
-  return to
-}
-
-function create (ob) {
-  if (ob)
-    return extend(ob, observable)
-
-  return Object.create(observable)
-}
-
-export default create;
+function t(t){this._observers.splice(this._observers.indexOf(t),1)}function e(t){const e=s();return this.observe((function(){t.apply(this,arguments)&&e.fire.apply(e,arguments)})),e}function r(t){return e.call(this,(function(e){return t===e}))}const n={detach:t,filter:e,fire:function(){const t=this._observers;if(t){for(let e=0;e<t.length;e++)try{t[e].apply(this,arguments)}catch(t){console.error(t)}return this}},observe:function(e){return this._observers||(this._observers=[]),this._observers.push(e),{detach:t.bind(this,e),ob:this}},on:function(t,e){return r.call(this,t).observe(e)}};function s(t){return t?function(t,e){for(const r in e)t[r]=e[r];return t}(t,n):Object.create(n)}export{s as default};

package/lib/src/utils/rand.js

@@ -1,82 +1 @@
-const jsRandom = () => ({
-  nextInt: max => Math.floor(Math.random() * max)
-});
-
-const defaultRandom = jsRandom();
-
-/**
- * Returns a random list of length size of numbers from 0 to max-1, which represents a set of
- * those numbers.  i.e. no number will repeat.  (size is forced to not be bigger than max)
- *
- * Can be used to choose a random selection from a list of selections.  Or if
- * size = max, it becomes a random ordering of a List.
- *
- *  NOTE: if the setSize is 0, max will set to 0 and you get an empty List object
- *
- * ForExample:
- *  randomSet(3, 5) = [3, 2, 0]
- *  randomSet(3, 5) = [1, 0, 3]
- *  randomSet(3, 5) = [1, 4, 2]
- *
- * @param size the number of values to return
- * @param max a positive integer
- * @param r an optional Random instance (else one is generated)
- * @return a List of random values from 0 to max-1 with no number repeating
- */
-function randomSet (size, max, r) {
-  r = r || defaultRandom;
-
-  let i;
-
-  if (!max)
-    max = size;
-
-  if (size > max)
-    size = max;
-
-  const list = [];
-
-  if (((max / size) >= 2.0) || (max < 40)) {
-    // if the set we are choosing from is considerably bigger than the number we are selecting
-    // then let's just grab random values and check to see if they are in our new list yet.
-    while (list.length < size) {
-      i = r.nextInt(max);
-      if (list.indexOf(i) < 0)
-        list.push(i);
-    }
-  } else {
-    // if the list is to be nearly same size as what we are choosing from, let's build a source
-    // list of the numbers and grab from them one at a time.
-    const source = [];
-    for (i = 0; i < max; i++)
-      source.push(i);
-
-    for (i = 0; i < size; i++) {
-      const index = r.nextInt(source.length);
-      list.push(source[index]);
-      source.splice(index, 1);
-    }
-  }
-
-  return list
-}
-
-// Pass in a source array and a map array of indices, and this returns a new
-// array of the members of the first based on the indices of the second. Useful when
-// used along with randomset above.
-// i.e.
-//  a1 = [ "a", "b", "c", "d", "e", "f" ]
-//  a2 = [ 2, 3, 5, 4, 0, 1]
-//  a3 = getMappedArray(a1, a2) = [ "c", "d", "f", "e", "a", "b" ]
-const getMappedArray = (array, map) => map.map(i => array[i]);
-
-// Randomly pick a number of items from an array and return them in an array
-// leaving the original array untouched. If no number is specified, a length
-// of 1 is returned.
-const arrayPick = (array, num) => {
-  num = num || 1;
-  const map = randomSet(num, array.length);
-  return getMappedArray(array, map)
-};
-
-export { arrayPick, randomSet };
+const t={nextInt:t=>Math.floor(Math.random()*t)};function n(n,e,o){let s;o=o||t,e||(e=n),n>e&&(n=e);const h=[];if(e/n>=2||e<40)for(;h.length<n;)s=o.nextInt(e),h.indexOf(s)<0&&h.push(s);else{const t=[];for(s=0;s<e;s++)t.push(s);for(s=0;s<n;s++){const n=o.nextInt(t.length);h.push(t[n]),t.splice(n,1)}}return h}const e=(t,e)=>((t,n)=>n.map((n=>t[n])))(t,n(e=e||1,t.length));export{e as arrayPick,n as randomSet};

package/package.json

@@ -1,11 +1,7 @@
 {
   "name": "atriusmaps-node-sdk",
-  "version": "1.0.0",
+  "version": "3.2.28",
   "description": "This project provides an API to Atrius Personal Wayfinder maps within a Node environment. See the README.md for more information",
-  "module": "lib/deploy/nodeEntry.js",
-  "main": "lib/deploy/nodeEntry.js",
-  "license": "UNLICENSED",
-  "type": "module",
   "keywords": [
     "map",
     "mapping",
@@ -18,14 +14,35 @@
     "atrius",
     "acuitybrands"
   ],
-  "repository": "https://gitlab.com/locuslabspublic/node-sdk",
+  "repository": "https://gitlab.com/locuslabspublic/atriusmaps-node-sdk",
+  "license": "UNLICENSED",
   "author": "Glenn Crownover <crownover@locuslabs.com>",
+  "type": "module",
+  "exports": {
+    ".": {
+      "import": "./lib/deploy/nodeEntry.js",
+      "require": "./dist/cjs/deploy/nodeEntry.js",
+      "default": "./dist/cjs/deploy/nodeEntry.js"
+    },
+    "./package.json": "./package.json"
+  },
+  "main": "./dist/cjs/deploy/nodeEntry.js",
+  "module": "./lib/deploy/nodeEntry.js",
+  "scripts": {
+    "build": "yarn build:CJS",
+    "build:CJS": "rollup -c config/rollup.config.cjs.js"
+  },
   "dependencies": {
     "IObject": "^0.6.2",
+    "flexsearch": "0.6.32",
     "i18next": "^20.3.4",
     "node-fetch": "^2.6.1",
     "query-string": "^7.0.1",
     "ramda": "^0.27.1",
     "zousan-plus": "^4.0.1"
+  },
+  "devDependencies": {
+    "@rollup/plugin-json": "^4.1.0",
+    "rollup": "^2.59.0"
   }
 }

package/lib/_virtual/_empty_module_placeholder

@@ -1,3 +0,0 @@
-var _empty_module_placeholder = {};
-
-export default _empty_module_placeholder;