progress on migrating to heex templates and font-icons

This commit is contained in:
Adam Piontek 2022-08-13 07:32:36 -04:00
parent d43daafdb7
commit 3eff955672
21793 changed files with 2161968 additions and 16895 deletions

3
assets_old/node_modules/uniqs/.travis.yml generated vendored Normal file
View file

@ -0,0 +1,3 @@
language: node_js
node_js:
- 0.10

55
assets_old/node_modules/uniqs/README.md generated vendored Normal file
View file

@ -0,0 +1,55 @@
[![Build Status](https://travis-ci.org/fgnass/uniqs.svg?branch=master)](https://travis-ci.org/fgnass/uniqs)
### Tiny utility to create unions and de-duplicated lists.
Example:
```js
var uniqs = require('uniqs');
var foo = { foo: 23 };
var list = [3, 2, 2, 1, foo, foo];
uniqs(list);
// => [3, 2, 1, { foo: 23 }]
```
You can pass multiple lists to create a union:
```js
uniqs([2, 1, 1], [2, 3, 3, 4], [4, 3, 2]);
// => [2, 1, 3, 4]
```
Passing individual items works too:
```js
uniqs(3, 2, 2, [1, 1, 2]);
// => [3, 2, 1]
```
### Summary
* Uniqueness is defined based on strict object equality.
* The lists do not need to be sorted.
* The resulting array contains the items in the order of their first appearance.
### About
This package has been written to accompany utilities like
[flatten](https://npmjs.org/package/flatten) as alternative to full-blown
libraries like underscore or lodash.
The implementation is optimized for simplicity rather than performance and
looks like this:
```js
module.exports = function uniqs() {
var list = Array.prototype.concat.apply([], arguments);
return list.filter(function(item, i) {
return i == list.indexOf(item);
});
};
```
### License
MIT

6
assets_old/node_modules/uniqs/index.js generated vendored Normal file
View file

@ -0,0 +1,6 @@
module.exports = function uniqs() {
var list = Array.prototype.concat.apply([], arguments);
return list.filter(function(item, i) {
return i == list.indexOf(item);
});
};

21
assets_old/node_modules/uniqs/package.json generated vendored Normal file
View file

@ -0,0 +1,21 @@
{
"name": "uniqs",
"version": "2.0.0",
"description": "Tiny utility to create unions and de-duplicated lists",
"keywords": [
"unique",
"uniq",
"dedupe",
"union"
],
"repository": {
"type": "git",
"url": "git://github.com/fgnass/uniqs.git"
},
"main": "index.js",
"scripts": {
"test": "node test"
},
"author": "Felix Gnass <fgnass@gmail.com>",
"license": "MIT"
}

22
assets_old/node_modules/uniqs/test.js generated vendored Normal file
View file

@ -0,0 +1,22 @@
var uniqs = require('./');
var util = require('util');
var assert = require('assert');
var foo = { foo: 23 };
[
[ [[2, 1, 1], [2, 3, 3, 4], [4, 3, 2]], [2, 1, 3, 4] ],
[ [3, 2, 2, [1, 1, 2]], [3, 2, 1] ],
[ [[2, 2, 3, "a", 3, 1, foo, foo, "a" ]], [ 2, 3, "a", 1, foo ] ],
[ [23], [23] ],
[ [], [] ],
[ [[]], [] ],
[ [[null], null], [null] ]
]
.forEach(function(t) {
var args = t[0].map(JSON.stringify);
assert.deepEqual(uniqs.apply(this, t[0]), t[1],
util.format('✘ uniqs(%s) !== %j', args, t[1])
);
console.log('✔ uniqs(%s) == %j', args, t[1]);
});