Search Results for "tiny-workflow"
Sort By:
Showing 3 open source projects for "tiny-workflow"
View related business solutions-
Evertune | Improve Your Brand's Visibility in AI SearchEvertune is the Generative Engine Optimization (GEO) platform that helps brands improve visibility in AI search across ChatGPT, AI Overview, Gemini, Claude and more.
-
Project Management SoftwareProject Insight offers powerful tools for project managers and teams in order to deliver optimal performance and ensure success. An enterprise project and portfolio management software, Project Insight offers personalized dashboards, intelligent scheduling, resource management, collaboration, time and expense tracking, project and portfolio tracking, workflow, and reporting features to help teams work better and get real results. Project Insight is suitable for small teams, mid-market companies, and large enterprises.
-
1
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. -
2
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. -
3
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.
- Previous
- You're on page 1
- Next
