Showing 4 open source projects for "node-red"

View related business solutions
  • Our Free Plans just got better! | Auth0 Icon
    Our Free Plans just got better! | Auth0

    With up to 25k MAUs and unlimited Okta connections, our Free Plan lets you focus on what you do best—building great apps.

    You asked, we delivered! Auth0 is excited to expand our Free and Paid plans to include more options so you can focus on building, deploying, and scaling applications without having to worry about your security. Auth0 now, thank yourself later.
    Try free now
  • Train ML Models With SQL You Already Know Icon
    Train ML Models With SQL You Already Know

    BigQuery automates data prep, analysis, and predictions with built-in AI assistance.

    Build and deploy ML models using familiar SQL. Automate data prep with built-in Gemini. Query 1 TB and store 10 GB free monthly.
    Try Free
  • 1

    paraffin

    Iterative and recursive parallelism generics for Ada 2005 and Ada 2012

    ...Generics include Ravenscar compatible versions for real-time systems. Also Includes paraffinalia, which is a set of useful generics for parallel quicksort, fast fourier transform, function integration, prefix sum, and Red-Black trees
    Downloads: 0 This Week
    Last Update:
    See Project
  • 2
    Nunjucks

    Nunjucks

    A rich and powerful templating language for JavaScript

    ...Fast & Lean High-performant. Small 8K gzipped runtime with precompiled templates in the browser. Crazy extensible with custom filters and extensions. Everywhere available in node and all modern web browsers, with thorough precompilation options. Nunjucks allows you to port all of your existing templates from a project to something that's easier to manage. By moving your templates to the client, transfer sizes are reduced and page responsiveness increases significantly. Your API supplies data, meaning you can decouple testing the front-end from testing the back-end.
    Downloads: 0 This Week
    Last Update:
    See Project
  • 3
    A portable in-place bitwise binary Fredkin trie algorithm which allows for near constant time insertions, deletions, finds, closest fit finds and iteration. Is approx. 50-100% faster than red-black trees and up to 20% faster than O(1) hash tables.
    Downloads: 0 This Week
    Last Update:
    See Project
  • 4
    Delphi class incapsulating functionality of Red-black binary search tree
    Downloads: 0 This Week
    Last Update:
    See Project
  • Custom VMs From 1 to 96 vCPUs With 99.95% Uptime Icon
    Custom VMs From 1 to 96 vCPUs With 99.95% Uptime

    General-purpose, compute-optimized, or GPU/TPU-accelerated. Built to your exact specs.

    Live migration and automatic failover keep workloads online through maintenance. One free e2-micro VM every month.
    Try Free
  • Previous
  • You're on page 1
  • Next
MongoDB Logo MongoDB