Showing 3 open source projects for "tiny-workflow"

View related business solutions
  • 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.
    Start Free
  • 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.
    Start Free
  • 1
    Career-Ops

    Career-Ops

    AI-powered job search system built on Claude Code

    ...It is typically built with modern web technologies, allowing for easy customization and self-hosting by developers who want full control over their data. Career Ops focuses on reducing the chaos and fragmentation that often comes with job searching by introducing a repeatable workflow that can be iterated and improved over time. It also supports the idea of data-driven job searching.
    Downloads: 17 This Week
    Last Update:
    See Project
  • 2
    List.js

    List.js

    Library for adding search, sort, filters and flexibility to tables

    Tiny, invisible and simple, yet powerful and incredibly fast vanilla JavaScript that adds search, sort, filters and flexibility to plain HTML lists, tables, or anything. List.js can be used in three different ways. It can be on existing HTML, it can create it's own HTML or a combination of both methods. Works both lists, tables and almost anything else.
    Downloads: 1 This Week
    Last Update:
    See Project
  • 3
    fuzzysearch

    fuzzysearch

    Tiny and blazing-fast fuzzy search in JavaScript

    fuzzysearch is a tiny, blazing-fast fuzzy search library for JavaScript that checks whether a “needle” string can be found inside a “haystack” string in order, but not necessarily contiguously. It implements a simplified fuzzy searching algorithm that does not use Levenshtein distance; instead it returns a boolean indicating whether all characters of the needle appear in sequence within the haystack.
    Downloads: 0 This Week
    Last Update:
    See Project
  • Previous
  • You're on page 1
  • Next