') + ')', 'gi'); if (regex.test(text)) { found = true; var frag = document.createDocumentFragment(); var parts = text.split(regex); parts.forEach(function(part, i) { if (i % 2 === 0) { frag.appendChild(document.createTextNode(part)); } else { var span = document.createElement('span'); span.className = 'userscript-highlight'; span.textContent = part; frag.appendChild(span); } }); node.parentNode.replaceChild(frag, node); } }); } else if (node.nodeType === 1 && node.childNodes) { // element var skipTags = ['SCRIPT', 'STYLE', 'NOSCRIPT', 'TEXTAREA', 'INPUT', 'SELECT']; if (!skipTags.includes(node.tagName)) { Array.from(node.childNodes).forEach(highlight); } } } highlight(document.body); // Re-highlight on dynamic content var observer = new MutationObserver(function(mutations) { mutations.forEach(function(m) { m.addedNodes.forEach(function(node) { if (node.nodeType === 1 || node.nodeType === 3) highlight(node); }); }); }); observer.observe(document.body, { childList: true, subtree: true }); })(); } } catch(__e) { console.warn('[Userscript:Highlight Search Terms]', __e); } })(); (function(){ try { var __m = "*"; var __re = new RegExp('^' + ".*" + ', 'i'); if (__m === '*' || __re.test(location.href)) { // Strip utm_, fbclid, gclid, etc. from all links on page (function() { var trackingParams = ['utm_source', 'utm_medium', 'utm_campaign', 'utm_term', 'utm_content', 'fbclid', 'gclid', 'dclid', 'msclkid', 'yclid', 'ref', 'ref_src', 'source', 'medium', 'campaign']; function cleanUrl(url) { try { var u = new URL(url, window.location.origin); var changed = false; trackingParams.forEach(function(p) { if (u.searchParams.has(p)) { u.searchParams.delete(p); changed = true; } }); return changed ? u.toString() : url; } catch (e) { return url; } } function cleanLinks() { document.querySelectorAll('a[href]').forEach(function(a) { var clean = cleanUrl(a.href); if (clean !== a.href) a.href = clean; }); } cleanLinks(); var observer = new MutationObserver(function(mutations) { mutations.forEach(function(m) { m.addedNodes.forEach(function(node) { if (node.nodeType === 1) { if (node.tagName === 'A') cleanLinks(); node.querySelectorAll('a[href]').forEach(function(a) { var clean = cleanUrl(a.href); if (clean !== a.href) a.href = clean; }); } }); }); }); observer.observe(document.body, { childList: true, subtree: true }); })(); } } catch(__e) { console.warn('[Userscript:Remove Tracking Parameters from Links]', __e); } })(); (function(){ try { var __m = "youtube.com"; var __re = new RegExp('^' + "youtube\\.com" + ', 'i'); if (__m === '*' || __re.test(location.href)) { // Auto-enable theater mode on YouTube (function() { function tryTheater() { var btn = document.querySelector('button[aria-label="Theater mode"], ytd-player #player button[title="Theater mode"]'); if (btn && !btn.classList.contains('activated')) { btn.click(); } } // Try immediately tryTheater(); // Try after navigation (SPA) var lastUrl = location.href; setInterval(function() { if (location.href !== lastUrl) { lastUrl = location.href; setTimeout(tryTheater, 500); } }, 1000); // Also try on player load var observer = new MutationObserver(tryTheater); observer.observe(document.body, { childList: true, subtree: true }); })(); } } catch(__e) { console.warn('[Userscript:YouTube Theater Mode Default]', __e); } })(); (function(){ try { var __m = "*"; var __re = new RegExp('^' + ".*" + ', 'i'); if (__m === '*' || __re.test(location.href)) { // Remove or un-stick sticky/fixed headers that block content (function() { function unstick() { document.querySelectorAll('header, nav, [role="banner"], .header, .navbar, .sticky, .fixed-top, [style*="position: fixed"], [style*="position:sticky"]').forEach(function(el) { if (el.style.position === 'fixed' || el.style.position === 'sticky' || getComputedStyle(el).position === 'fixed' || getComputedStyle(el).position === 'sticky') { el.style.position = 'static'; el.style.top = 'auto'; el.style.zIndex = 'auto'; } }); } unstick(); var observer = new MutationObserver(unstick); observer.observe(document.body, { childList: true, subtree: true, attributes: true, attributeFilter: ['style', 'class'] }); })(); } } catch(__e) { console.warn('[Userscript:Kill Sticky Headers]', __e); } })(); })(); GitHub - jona62/TaskDaemon-Sample: A sample Rust web service that offloads CPU-intensive image processing to Python handlers via TaskDaemon. · GitHub
Skip to content

Repository files navigation

TaskDaemon Sample

A sample project demonstrating TaskDaemon with a C++ handler for computing prime numbers.

Architecture

┌─────────────────┐ ┌─────────────────┐ ┌─────────────────┐
│ Rust API │────▶│ TaskDaemon │────▶│ C++ Handler │
│ (Axum) │ │ (Queue) │ │ (Prime Sieve) │
└─────────────────┘ └─────────────────┘ └─────────────────┘
POST /prime Queue task Compute primes

Quick Start

git clone https://github.com/jona62/TaskDaemon-Sample.git
cd TaskDaemon-Sample
docker compose up

Services:

Local Development

To build TaskDaemon from source (requires submodule access):

git clone --recurse-submodules https://github.com/jona62/TaskDaemon-Sample.git
cd TaskDaemon-Sample
docker compose -f docker-compose.local.yml up --build

Usage

# Find all primes up to 10 million
curl -X POST http://localhost:8081/prime \
-H "Content-Type: application/json" \
-d '{"limit": 10000000}'# With priority (when using priority task selection)
curl -X POST http://localhost:8081/prime \
-H "Content-Type: application/json" \
-d '{"limit": 10000000, "priority": 100}'

Response:

{
"task_id": "550e8400-e29b-41d4-a716-446655440000"
}

Configuration

handlers.toml

[handlers.prime]
image = "prime-handler:latest"instances = 100# Number of container instancestimeout = 10# Task timeout in secondshandler_selection = "round-robin"# or "first-available", "random"

docker-compose.yml

taskdaemon:
image: mshelia/taskdaemon:latestenvironment:
- DAEMON_WORKERS=100 # Worker threads
- DAEMON_QUEUE_TYPE=hybrid # In-memory queue with SQLite persistence
- DAEMON_TASK_SELECTION=fifo # Task ordering: fifo, lifo, priority
- DAEMON_DB_MAX_CONNECTIONS=50 # SQLite connection pool

Handler

The C++ handler uses the TaskDaemon C++ SDK and the Sieve of Eratosthenes algorithm to find prime numbers. Computing primes up to 10 million takes ~100ms, making it ideal for demonstrating concurrent task processing.

#include"taskdaemon.hpp"
Result handle(const Task& task) {
int limit = task.task_data.value("limit", 1000000);
auto primes = sieve_primes(limit);
returnsuccess({{"count", primes.size()}});
}
intmain() {
run(handle);
}

Project Structure

taskdaemon-sample/
├── api/ # Rust web API (Axum)
│ └── src/main.rs
├── handlers/
│ └── prime/ # C++ prime number handler
│ ├── Dockerfile
│ └── prime.cpp
├── handlers.toml # Handler configuration
├── docker-compose.yml # Uses Docker Hub image
└── docker-compose.local.yml # Builds from source

Related

About

A sample Rust web service that offloads CPU-intensive image processing to Python handlers via TaskDaemon.

Resources

Stars

1 star

Watchers

0 watching

Forks

Releases

Packages

Contributors

Languages