Showing 3 open source projects for "pixelos max 3"

View related business solutions
  • Full-stack observability with actually useful AI | Grafana Cloud Icon
    Full-stack observability with actually useful AI | Grafana Cloud

    Our generous forever free tier includes the full platform, including the AI Assistant, for 3 users with 10k metrics, 50GB logs, and 50GB traces.

    Built on open standards like Prometheus and OpenTelemetry, Grafana Cloud includes Kubernetes Monitoring, Application Observability, Incident Response, plus the AI-powered Grafana Assistant. Get started with our generous free tier today.
    Create free account
  • Go From AI Idea to AI App Fast Icon
    Go From AI Idea to AI App Fast

    One platform to build, fine-tune, and deploy ML models. No MLOps team required.

    Access Gemini 3 and 200+ models. Build chatbots, agents, or custom models with built-in monitoring and scaling.
    Try Free
  • 1
    xLUA

    xLUA

    xLua is a lua programming solution for C#

    ...Open the zip package, and you will see an Assets directory, which corresponds to the Assets directory of the Unity project. Keep this directory structure and put it in your Unity project. A complete example only requires 3 lines of code. It is recommended to bind once and reuse it. If the code is generated, calling max will not generate gc alloc.
    Downloads: 9 This Week
    Last Update:
    See Project
  • 2

    TOTimer

    Time-Out-Timer for single threaded environement

    Serve timeouts by calling a service-function periodically and an independent time-source (toticker). If you need a timer and like to try this one, please write your experiences to me in brief! And may be suggestions, of course. 10ms tick time should be possible. May be less. DO NOT USE Version less 0.1.1 - it is definatly buggy! Easy to control timers via Handle, eg auto create&start a timer via totimer_setTimeout function. Optionally use Callback-Functions if timeout...
    Downloads: 0 This Week
    Last Update:
    See Project
  • 3
    A capsule tree is a general purpose, self-balancing tree data structure for large, ordered, data-sets. It is designed to provide the same characteristics as B-trees and B+trees, but built from the ground up for in-memory usage. In other words, there are no provisions for “slow” I/O cases. The original motivation for this tree was a better backend for memory managers. However, the end result was a new sub-category of trees. The implementation giving here is just one implementation of...
    Downloads: 0 This Week
    Last Update:
    See Project
  • Previous
  • You're on page 1
  • Next