Search Results for "interval"
Sort By:
Showing 11 open source projects for "interval"
View related business solutions-
$300 Free Credits to Build on Google CloudPut your $300 in credit toward real workloads, then keep building with free monthly usage for 20+ products. No commitment and no charge until you upgrade.
-
Train ML Models With SQL You Already KnowBuild and deploy ML models using familiar SQL. Automate data prep with built-in Gemini. Query 1 TB and store 10 GB free monthly.
-
1
IntervalArithmetic.jl
Library for validated numerics using interval arithmetic
IntervalArithmetic.jl is a Julia package for validated numerics in Julia. All calculations are carried out using interval arithmetic where quantities are treated as intervals. The final result is a rigorous enclosure of the true value. We are working towards having the IntervalArithmetic library be conformant with the IEEE 1788-2015 Standard for Interval Arithmetic. To do so, we have incorporated tests from the ITF1788 test suite. -
2
Interval arithmetic for Ada
An implementation of interval arithmetic
The library provides an implementation of intervals for Ada. It includes arithmetic and relational operations. The library supports intervals with integer and floating-point bounds. Dimensioned intervals are also supported -
3
SWR
React Hooks library for remote data fetching
...With just one single line of code, you can simplify the logic of data fetching in your project, and also have all many amazing features out-of-the-box. SWR has you covered in all aspects of speed, correctness, and stability to help you build better experiences. Fast page navigation, polling on interval, data dependency, revalidation on focus, revalidation on network recovery, local mutation (Optimistic UI), smart error retry, pagination and scroll position recovery, React Suspense, and more. -
4
go-datastructures
A collection of useful, performant, and threadsafe Go datastructures
Go-datastructures is a collection of useful, performant, and threadsafe Go datastructures. Interval tree for collision in n-dimensional ranges. Implemented via a red-black augmented tree. Extra dimensions are handled in simultaneous inserts/queries to save space although this may result in suboptimal time complexity. Intersection determined using bit arrays. In a single dimension, inserts, deletes, and queries should be in O(log n) time. -
Build Securely on AWS with Proven FrameworksMoving to the cloud brings new challenges. How can you manage a larger attack surface while ensuring great network performance? Turn to Fortinet’s Tested Reference Architectures, blueprints for designing and securing cloud environments built by cybersecurity experts. Learn more and explore use cases in this white paper.
-
5
Octave Forge
A collection of packages providing extra functionality for GNU Octave
Octave Forge is a central location for collaborative development of packages for GNU Octave. The Octave Forge packages expand Octave's core functionality by providing field specific features via Octave's package system. See https://octave.sourceforge.io/packages.php for a list of all available packages. GNU Octave is a high-level interpreted language, primarily intended for numerical computations. It provides capabilities for the numerical solution of linear and nonlinear problems, and... -
6
Usage: - run function blinkLED() every 2000 ms: timer.addEverytime(2000, blinkLED); - run function itWorks() two times with interval 2000 ms, wait 300 ms before first start: timer.addTask(2000, 2, 300, itWorks); Removing a task: removeEverytime(callback_function); removeTask(callback_function); Library can also be used in desktop C++ applications: #include <iostream> #include <string> #include <chrono> #include <thread> #include "RZtimer.h" int main() { RZTimer timer; timer.addEverytime(2000, [] (){ std::cout << "Hello! ...
-
7
...It is designed to offer for C programmers common data structures with powerful algorithms, and hidden implementation. Available structures are lists, queues, stacks, hash tables, binary trees, binary search trees, red-black trees, 2D arrays, permutations, heaps and interval heaps. GDSL is free software distributed under the terms of the GNU General Public License.
-
8
Spire
Powerful new number types and numeric abstractions for Scala
Spire is a numeric and algebraic library for Scala, offering type-safe, generic, and high-precision arithmetic. It introduces abstractions like Rings, Fields, and Rationals and supports specialized number types (e.g. Rational, Complex, Interval), macros, and seamless integration with Cats for abstract numeric programming. -
9
go-cache
An in-memory key:value store/cache library for Go
go-cache is an in-memory key:value store/cache similar to memcached that is suitable for applications running on a single machine. Its major advantage is that, being essentially a thread-safe map[string]interface{} with expiration times, it doesn't need to serialize or transmit its contents over the network. Any object can be stored, for a given duration or forever, and the cache can be safely used by multiple goroutines. Although go-cache isn't meant to be used as a persistent datastore,... -
Save Up to 91% on Cloud Compute With Spot VMsRun batch jobs at 60-91% off with Spot VMs. Long-running workloads get automatic discounts with sustained use.
-
10
Ghostscript.NET
The most completed managed wrapper around the Ghostscript library.
All other C# Ghostscript wrappers that you can find on the internet does not allow you to progressively render PDF page directly to the screen without exporting the page to the disk first. This wrapper does not require exporting to the disk, it can render tiles progressively from the Ghostscript interpreter. Please go to http://ghostscriptnet.codeplex.com/ for development files. -
11
Interval Container Library (ICL): An STL based generic library for computations on intervals, interval containers and cubes
- Previous
- You're on page 1
- Next
