django-handyhelpers 0.3.20__py3-none-any.whl → 0.3.35__py3-none-any.whl

handyhelpers/static/node_modules/uglify-js/tools/exports.js

@@ -0,0 +1,8 @@
+exports["Dictionary"] = Dictionary;
+exports["is_statement"] = is_statement;
+exports["List"] = List;
+exports["minify"] = minify;
+exports["parse"] = parse;
+exports["push_uniq"] = push_uniq;
+exports["TreeTransformer"] = TreeTransformer;
+exports["TreeWalker"] = TreeWalker;

handyhelpers/static/node_modules/uglify-js/tools/node.js

@@ -0,0 +1,115 @@
+var fs = require("fs");
+
+exports.FILES = [
+    require.resolve("../lib/utils.js"),
+    require.resolve("../lib/ast.js"),
+    require.resolve("../lib/transform.js"),
+    require.resolve("../lib/parse.js"),
+    require.resolve("../lib/scope.js"),
+    require.resolve("../lib/compress.js"),
+    require.resolve("../lib/output.js"),
+    require.resolve("../lib/sourcemap.js"),
+    require.resolve("../lib/mozilla-ast.js"),
+    require.resolve("../lib/propmangle.js"),
+    require.resolve("../lib/minify.js"),
+    require.resolve("./exports.js"),
+];
+
+new Function("domprops", "exports", function() {
+    var code = exports.FILES.map(function(file) {
+        return fs.readFileSync(file, "utf8");
+    });
+    code.push("exports.describe_ast = " + describe_ast.toString());
+    return code.join("\n\n");
+}())(require("./domprops.json"), exports);
+
+function to_comment(value) {
+    if (typeof value != "string") value = JSON.stringify(value, function(key, value) {
+        return typeof value == "function" ? "<[ " + value + " ]>" : value;
+    }, 2);
+    return "// " + value.replace(/\n/g, "\n// ");
+}
+
+if (+process.env["UGLIFY_BUG_REPORT"]) exports.minify = function(files, options) {
+    if (typeof options == "undefined") options = "<<undefined>>";
+    var code = [
+        "// UGLIFY_BUG_REPORT",
+        to_comment(options),
+    ];
+    if (typeof files == "string") {
+        code.push("");
+        code.push("//-------------------------------------------------------------")
+        code.push("// INPUT CODE", files);
+    } else for (var name in files) {
+        code.push("");
+        code.push("//-------------------------------------------------------------")
+        code.push(to_comment(name), files[name]);
+    }
+    if (options.sourceMap && options.sourceMap.url) {
+        code.push("");
+        code.push("//# sourceMappingURL=data:application/json;charset=utf-8;base64,eyJ2ZXJzaW9uIjozLCJzb3VyY2VzIjpbXSwibmFtZXMiOltdLCJtYXBwaW5ncyI6IiJ9");
+    }
+    var result = { code: code.join("\n") };
+    if (options.sourceMap) result.map = '{"version":3,"sources":[],"names":[],"mappings":""}';
+    return result;
+};
+
+function describe_ast() {
+    var out = OutputStream({ beautify: true });
+    doitem(AST_Node);
+    return out.get() + "\n";
+
+    function doitem(ctor) {
+        out.print("AST_" + ctor.TYPE);
+        var props = ctor.SELF_PROPS.filter(function(prop) {
+            return !/^\$/.test(prop);
+        });
+        if (props.length > 0) {
+            out.space();
+            out.with_parens(function() {
+                props.forEach(function(prop, i) {
+                    if (i) out.space();
+                    out.print(prop);
+                });
+            });
+        }
+        if (ctor.documentation) {
+            out.space();
+            out.print_string(ctor.documentation);
+        }
+        if (ctor.SUBCLASSES.length > 0) {
+            out.space();
+            out.with_block(function() {
+                ctor.SUBCLASSES.sort(function(a, b) {
+                    return a.TYPE < b.TYPE ? -1 : 1;
+                }).forEach(function(ctor, i) {
+                    out.indent();
+                    doitem(ctor);
+                    out.newline();
+                });
+            });
+        }
+    }
+}
+
+function infer_options(options) {
+    var result = exports.minify("", options);
+    return result.error && result.error.defs;
+}
+
+exports.default_options = function(component) {
+    if (component) {
+        var options = { module: false };
+        options[component] = { 0: 0 };
+        return infer_options(options);
+    }
+    var defs = infer_options({ 0: 0 });
+    Object.keys(defs).forEach(function(component) {
+        var options = { module: false };
+        options[component] = { 0: 0 };
+        if (options = infer_options(options)) {
+            defs[component] = options;
+        }
+    });
+    return defs;
+};

handyhelpers/static/node_modules/uglify-js/tools/tty.js

@@ -0,0 +1,22 @@
+// workaround for tty output truncation on Node.js
+try {
+    // prevent buffer overflow and other asynchronous bugs
+    process.stdout._handle.setBlocking(true);
+    process.stderr._handle.setBlocking(true);
+} catch (e) {
+    // ensure output buffers are flushed before process termination
+    var exit = process.exit;
+    if ("bufferSize" in process.stdout) process.exit = function() {
+        var args = [].slice.call(arguments);
+        process.once("uncaughtException", function() {
+            (function callback() {
+                if (process.stdout.bufferSize || process.stderr.bufferSize) {
+                    setTimeout(callback, 1);
+                } else {
+                    exit.apply(process, args);
+                }
+            })();
+        });
+        throw exit;
+    };
+}

handyhelpers/static/node_modules/unicorn-magic/default.js

@@ -0,0 +1,14 @@
+export async function delay({seconds, milliseconds} = {}) {
+	let duration;
+	if (typeof seconds === 'number') {
+		duration = seconds * 1000;
+	} else if (typeof milliseconds === 'number') {
+		duration = milliseconds;
+	} else {
+		throw new TypeError('Expected an object with either `seconds` or `milliseconds`.');
+	}
+
+	return new Promise(resolve => {
+		setTimeout(resolve, duration);
+	});
+}

handyhelpers/static/node_modules/unicorn-magic/index.d.ts

@@ -0,0 +1,29 @@
+/**
+Delay the promise for the given duration.
+
+@example
+```
+import {delay} from 'unicorn-magic';
+
+await delay({seconds: 1});
+
+console.log('1 second later');
+```
+*/
+export function delay(duration: {seconds: number} | {milliseconds: number}): Promise<void>;
+
+/**
+Convert a `URL` or path to a path.
+
+**Not available in browsers.**
+
+@example
+```
+import path from 'node:path';
+import {toPath} from 'unicorn-magic';
+
+// `cwd` can be `URL` or a path string.
+const getUnicornPath = cwd => path.join(toPath(cwd), 'unicorn');
+```
+*/
+export function toPath(urlOrPath: URL | string): string;

handyhelpers/static/node_modules/unicorn-magic/license

@@ -0,0 +1,9 @@
+MIT License
+
+Copyright (c) Sindre Sorhus <sindresorhus@gmail.com> (https://sindresorhus.com)
+
+Permission is hereby granted, free of charge, to any person obtaining a copy of this software and associated documentation files (the "Software"), to deal in the Software without restriction, including without limitation the rights to use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of the Software, and to permit persons to whom the Software is furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in all copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.

handyhelpers/static/node_modules/unicorn-magic/node.js

@@ -0,0 +1,7 @@
+import {fileURLToPath} from 'node:url';
+
+export function toPath(urlOrPath) {
+	return urlOrPath instanceof URL ? fileURLToPath(urlOrPath) : urlOrPath;
+}
+
+export * from './default.js';

handyhelpers/static/node_modules/unicorn-magic/package.json

@@ -0,0 +1,49 @@
+{
+	"name": "unicorn-magic",
+	"version": "0.1.0",
+	"description": "Some useful utilities I often need",
+	"license": "MIT",
+	"repository": "sindresorhus/unicorn-magic",
+	"funding": "https://github.com/sponsors/sindresorhus",
+	"author": {
+		"name": "Sindre Sorhus",
+		"email": "sindresorhus@gmail.com",
+		"url": "https://sindresorhus.com"
+	},
+	"type": "module",
+	"exports": {
+		"types": "./index.d.ts",
+		"node": "./node.js",
+		"default": "./default.js"
+	},
+	"sideEffects": false,
+	"engines": {
+		"node": ">=18"
+	},
+	"scripts": {
+		"test": "xo && ava && tsc index.d.ts"
+	},
+	"files": [
+		"node.js",
+		"default.js",
+		"index.d.ts"
+	],
+	"keywords": [
+		"utilities",
+		"util",
+		"extras",
+		"url",
+		"path",
+		"delay",
+		"wait",
+		"settimeout",
+		"sleep"
+	],
+	"devDependencies": {
+		"ava": "^5.3.1",
+		"in-range": "^3.0.0",
+		"time-span": "^5.1.0",
+		"typescript": "^5.2.2",
+		"xo": "^0.56.0"
+	}
+}

handyhelpers/static/node_modules/unicorn-magic/readme.md

@@ -0,0 +1,25 @@
+# unicorn-magic
+
+> Some useful utilities I often need
+
+*I'm not accepting requests.*
+
+## Install
+
+```sh
+npm install unicorn-magic
+```
+
+## Usage
+
+```js
+import {delay} from 'unicorn-magic';
+
+await delay({seconds: 1});
+
+console.log('1 second later');
+```
+
+## API
+
+See [the types](index.d.ts).

handyhelpers/static/node_modules/yocto-queue/index.d.ts

@@ -0,0 +1,61 @@
+export default class Queue<ValueType> implements Iterable<ValueType> {
+	/**
+	The size of the queue.
+	*/
+	readonly size: number;
+
+	/**
+	Tiny queue data structure.
+
+	The instance is an [`Iterable`](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Iteration_protocols), which means you can iterate over the queue front to back with a “for…of” loop, or use spreading to convert the queue to an array. Don't do this unless you really need to though, since it's slow.
+
+	@example
+	```
+	import Queue from 'yocto-queue';
+
+	const queue = new Queue();
+
+	queue.enqueue('🦄');
+	queue.enqueue('🌈');
+
+	console.log(queue.size);
+	//=> 2
+
+	console.log(...queue);
+	//=> '🦄 🌈'
+
+	console.log(queue.dequeue());
+	//=> '🦄'
+
+	console.log(queue.dequeue());
+	//=> '🌈'
+	```
+	*/
+	constructor();
+
+	[Symbol.iterator](): IterableIterator<ValueType>;
+
+	/**
+	Add a value to the queue.
+	*/
+	enqueue(value: ValueType): void;
+
+	/**
+	Remove the next value in the queue.
+
+	@returns The removed value or `undefined` if the queue is empty.
+	*/
+	dequeue(): ValueType | undefined;
+
+	/**
+	Get the next value in the queue without removing it.
+
+	@returns The value or `undefined` if the queue is empty.
+	*/
+	peek(): ValueType | undefined;
+
+	/**
+	Clear the queue.
+	*/
+	clear(): void;
+}

handyhelpers/static/node_modules/yocto-queue/index.js

@@ -0,0 +1,78 @@
+/*
+How it works:
+`this.#head` is an instance of `Node` which keeps track of its current value and nests another instance of `Node` that keeps the value that comes after it. When a value is provided to `.enqueue()`, the code needs to iterate through `this.#head`, going deeper and deeper to find the last value. However, iterating through every single item is slow. This problem is solved by saving a reference to the last value as `this.#tail` so that it can reference it to add a new value.
+*/
+
+class Node {
+	value;
+	next;
+
+	constructor(value) {
+		this.value = value;
+	}
+}
+
+export default class Queue {
+	#head;
+	#tail;
+	#size;
+
+	constructor() {
+		this.clear();
+	}
+
+	enqueue(value) {
+		const node = new Node(value);
+
+		if (this.#head) {
+			this.#tail.next = node;
+			this.#tail = node;
+		} else {
+			this.#head = node;
+			this.#tail = node;
+		}
+
+		this.#size++;
+	}
+
+	dequeue() {
+		const current = this.#head;
+		if (!current) {
+			return;
+		}
+
+		this.#head = this.#head.next;
+		this.#size--;
+		return current.value;
+	}
+
+	peek() {
+		if (!this.#head) {
+			return;
+		}
+
+		return this.#head.value;
+
+		// TODO: Node.js 18.
+		// return this.#head?.value;
+	}
+
+	clear() {
+		this.#head = undefined;
+		this.#tail = undefined;
+		this.#size = 0;
+	}
+
+	get size() {
+		return this.#size;
+	}
+
+	* [Symbol.iterator]() {
+		let current = this.#head;
+
+		while (current) {
+			yield current.value;
+			current = current.next;
+		}
+	}
+}

handyhelpers/static/node_modules/yocto-queue/license

@@ -0,0 +1,9 @@
+MIT License
+
+Copyright (c) Sindre Sorhus <sindresorhus@gmail.com> (https://sindresorhus.com)
+
+Permission is hereby granted, free of charge, to any person obtaining a copy of this software and associated documentation files (the "Software"), to deal in the Software without restriction, including without limitation the rights to use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of the Software, and to permit persons to whom the Software is furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in all copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.

handyhelpers/static/node_modules/yocto-queue/package.json

@@ -0,0 +1,48 @@
+{
+	"name": "yocto-queue",
+	"version": "1.1.1",
+	"description": "Tiny queue data structure",
+	"license": "MIT",
+	"repository": "sindresorhus/yocto-queue",
+	"funding": "https://github.com/sponsors/sindresorhus",
+	"author": {
+		"name": "Sindre Sorhus",
+		"email": "sindresorhus@gmail.com",
+		"url": "https://sindresorhus.com"
+	},
+	"type": "module",
+	"exports": "./index.js",
+	"types": "./index.d.ts",
+	"sideEffects": false,
+	"engines": {
+		"node": ">=12.20"
+	},
+	"scripts": {
+		"//test": "xo && ava && tsd",
+		"test": "ava && tsd"
+	},
+	"files": [
+		"index.js",
+		"index.d.ts"
+	],
+	"keywords": [
+		"queue",
+		"data",
+		"structure",
+		"algorithm",
+		"queues",
+		"queuing",
+		"list",
+		"array",
+		"linkedlist",
+		"fifo",
+		"enqueue",
+		"dequeue",
+		"data-structure"
+	],
+	"devDependencies": {
+		"ava": "^3.15.0",
+		"tsd": "^0.17.0",
+		"xo": "^0.44.0"
+	}
+}

handyhelpers/static/node_modules/yocto-queue/readme.md

@@ -0,0 +1,70 @@
+# yocto-queue [![](https://badgen.net/bundlephobia/minzip/yocto-queue)](https://bundlephobia.com/result?p=yocto-queue)
+
+> Tiny queue data structure
+
+You should use this package instead of an array if you do a lot of `Array#push()` and `Array#shift()` on large arrays, since `Array#shift()` has [linear time complexity](https://medium.com/@ariel.salem1989/an-easy-to-use-guide-to-big-o-time-complexity-5dcf4be8a444#:~:text=O(N)%E2%80%94Linear%20Time) *O(n)* while `Queue#dequeue()` has [constant time complexity](https://medium.com/@ariel.salem1989/an-easy-to-use-guide-to-big-o-time-complexity-5dcf4be8a444#:~:text=O(1)%20%E2%80%94%20Constant%20Time) *O(1)*. That makes a huge difference for large arrays.
+
+> A [queue](https://en.wikipedia.org/wiki/Queue_(abstract_data_type)) is an ordered list of elements where an element is inserted at the end of the queue and is removed from the front of the queue. A queue works based on the first-in, first-out ([FIFO](https://en.wikipedia.org/wiki/FIFO_(computing_and_electronics))) principle.
+
+## Install
+
+```sh
+npm install yocto-queue
+```
+
+## Usage
+
+```js
+import Queue from 'yocto-queue';
+
+const queue = new Queue();
+
+queue.enqueue('🦄');
+queue.enqueue('🌈');
+
+console.log(queue.size);
+//=> 2
+
+console.log(...queue);
+//=> '🦄 🌈'
+
+console.log(queue.dequeue());
+//=> '🦄'
+
+console.log(queue.dequeue());
+//=> '🌈'
+```
+
+## API
+
+### `queue = new Queue()`
+
+The instance is an [`Iterable`](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Iteration_protocols), which means you can iterate over the queue front to back with a “for…of” loop, or use spreading to convert the queue to an array. Don't do this unless you really need to though, since it's slow.
+
+#### `.enqueue(value)`
+
+Add a value to the queue.
+
+#### `.dequeue()`
+
+Remove the next value in the queue.
+
+Returns the removed value or `undefined` if the queue is empty.
+
+#### `.peek()`
+
+Get the next value in the queue without removing it.
+
+Returns the value or `undefined` if the queue is empty.
+
+#### `.clear()`
+
+Clear the queue.
+
+#### `.size`
+
+The size of the queue.
+
+## Related
+
+- [quick-lru](https://github.com/sindresorhus/quick-lru) - Simple “Least Recently Used” (LRU) cache

handyhelpers/static/package.json

@@ -8,9 +8,11 @@
     "bootstrap-table": "^1.22.1",
     "chart.js": "3.9.1",
     "clipboard": "^2.0.11",
+    "fun-effects": "github:davidslusser/fun-effects",
     "hover.css": "^2.3.2",
     "htmx.org": "1.9.6",
     "jquery": "^3.6.1",
-    "mdb-ui-kit": "^5.0.0"
+    "mdb-ui-kit": "^5.0.0",
+    "tippy.js": "^6.3.7"
   }
 }