self property in Node.js
Self-healing runtime for Node.js: traceback capture, LLM diff generation, and safe patching.
Add a __self prop to all JSX Elements
help secure Express/Connect apps with various HTTP headers
Actions Http Client
A command line utility to work with Sentry. https://docs.sentry.io/hosted/learn/cli/
Core libraries that every NodeJS toolchain project should use
Contains parsers and serializers for ASN.1 (currently BER only)
JWA implementation (supports all JWS algorithms)
Implementation of JSON Web Signatures
The fastest and smallest JavaScript polygon triangulation library for your WebGL apps
Use a place-* shorthand for align-* and justify-* in CSS
The classes needed to create self reporting dimension aware metrics registries
Workflow Observability UI
Low level toolkit for SVG paths transformations.
Automatically bind methods to their class instance
Node/Docker runtime primitives for @voyantjs/workflows-orchestrator, including a file-backed run store and local scheduler.
Parses well-formed HTML (meaning all tags closed) into an AST and back. quickly.
HTML void elements are not the only self-closing tags. This includes common SVG self-closing elements as well.
Installs pnpm
n8n nodes for Apify
Self-learning vector memory for AI agents — single-file .rvf cognitive container with HNSW search, episodic Reflexion memory, causal graph + Cypher, 9 RL algorithms, Thompson Sampling bandit, 41 MCP tools, hybrid (BM25 + dense) retrieval, GNN attention. 1
Returns true if the given name is a HTML void element or common SVG self-closing element.
Find self-intersections in geojson polygon (possibly with interior rings)
A self-balancing binary tree optimised for fast access to frequently used nodes. Useful for implementing caches and garbage collection algorithms.
A Splay Tree is a self adjusting binary search tree with the additional property that recently accessed elements are quick to access again. This makes it useful for caches because the most commonly accessed elements will be the fastest ones to access. This tree has an additional feature that allows it's maximum size to be restricted. When it exceeds it's maximum size, it will drop all of the nodes which are at the terminal ends of the tree structure, leaving many of the more commonly accessed nodes intact. This implementation is written in C++ with a Ruby wrapper.
GQLite is a Rust-language library, with a C interface, that implements a small, fast, self-contained, high-reliability, full-featured, Graph Query database engine. GQLite support multiple database backends, such as SQLite and redb. This enable to achieve high performance and for application to combine Graph queries with traditional SQL queries. GQLite source code is license under the [MIT License](LICENSE) and is free to everyone to use for any purpose. The official repositories contains bindings/APIs for C, C++, Python, Ruby and Crystal. The library is still in its early stage, but it is now fully functional. Development effort has now slowed down and new features are added on a by-need basis. It supports a subset of OpenCypher, with some ISO GQL extensions. Example of use -------------- ```ruby require 'gqlite' begin # Create a database on the file "test.db" connection = GQLite::Connection.new filename: "test.db" # Execute a simple query to create a node and return all the nodes value = connection.execute_oc_query("CREATE () MATCH (n) RETURN n") # Print the result if value.nil? puts "Empty results" else puts "Results are #{value.to_s}" end rescue GQLite::Error => ex # Report any error puts "An error has occured: #{ex.message}" end ``` The documentation for the GQL query language can found in [OpenCypher](https://auksys.org/documentation/5/libraries/gqlite/opencypher/) and for the [API](https://auksys.org/documentation/5/libraries/gqlite/api/).
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.