Showing 179 open source projects for "gnu-darwin"

View related business solutions
  • Our Free Plans just got better! | Auth0 Icon
    Our Free Plans just got better! | Auth0

    With up to 25k MAUs and unlimited Okta connections, our Free Plan lets you focus on what you do best—building great apps.

    You asked, we delivered! Auth0 is excited to expand our Free and Paid plans to include more options so you can focus on building, deploying, and scaling applications without having to worry about your security. Auth0 now, thank yourself later.
    Try free now
  • Stop Cyber Threats with VM-Series Next-Gen Firewall on Azure Icon
    Stop Cyber Threats with VM-Series Next-Gen Firewall on Azure

    Native application identity and user-based security for your Azure cloud

    Gain integrated visibility across all traffic in a single pass. Deploy Palo Alto Networks VM-Series to determine application identity and content while automating security policy updates via rich APIs.
    Get a free trial
  • 1
    Library and command line tools for XZ and LZMA compressed files
    Leader badge
    Downloads: 70,669 This Week
    Last Update:
    See Project
  • 2
    CRC RevEng

    CRC RevEng

    Arbitrary-precision CRC calculator and algorithm finder

    CRC RevEng is a portable, arbitrary-precision CRC calculator and algorithm finder. It calculates CRCs using any of the 113 preset algorithms, or a user-specified algorithm to any width. It calculates reversed CRCs to give the bit pattern that produces a desired forward CRC. CRC RevEng also reverse-engineers any CRC algorithm from sufficient correctly formatted message-CRC pairs and optional known parameters. It comprises powerful input interpretation options. Compliant with Ross Williams'...
    Leader badge
    Downloads: 91 This Week
    Last Update:
    See Project
  • 3
    LinAsm

    LinAsm

    Collection of fast and optimized assembly libraries for x86-64 Linux

    LinAsm is collection of very fast and SIMD optimized assembly written libraries for x86-64 Linux. It implements many common and widely used algorithms for array manipulations: searching, sorting, arithmetic and vector operations, unit conversions; fast mathematical and statistic functions; numbers and time converting algorithms; finite impulse response (FIR) digital filters; spectrum analysis algorithms, Fast Hartley transformation; CPU cache friendly functions and extremely fast abstract...
    Leader badge
    Downloads: 25 This Week
    Last Update:
    See Project
  • 4

    L2

    A BST, B-tree and trie data structures library.

    L2 is a data structures library. Featured are self balancing BSTs and self balancing BST backed sequences, in memory B-trees and B-tree backed sequences, pointer sets, radix and critical bit trees. A few articles about L2 data structures and more here: https://dsxxi.home.blog/
    Downloads: 1 This Week
    Last Update:
    See Project
  • $300 Free Credits to Build on Google Cloud Icon
    $300 Free Credits to Build on Google Cloud

    New to Google Cloud? Get $300 in credits to explore Compute Engine, BigQuery, Cloud Run, Gemini Enterprise Agent Platform, and more.

    Start your next project with $300 in free Google Cloud credit. Spin up VMs, run containers, query petabytes in BigQuery, or build agents with Gemini Enterprise Agent Platform. Once your credits are used, keep building with 20+ always-free tier products including Compute Engine, Cloud Storage, GKE, and Cloud Run functions. No commitment required—just sign up and start building.
    Claim $300 Free
  • 5
    bincmp is intended as a cross-platform, tiny and fast binary comparer of two files. it is much faster than "fc /b", for example. bincmp2 is more powerful, but currently windows-only.
    Downloads: 1 This Week
    Last Update:
    See Project
  • 6
    McuOnEclipse

    McuOnEclipse

    Releases of McuOnEclipse projects

    Processor Expert components and Eclipse examples and plugins.
    Downloads: 0 This Week
    Last Update:
    See Project
  • 7
    Temporal Inference Engine

    Temporal Inference Engine

    A real time inference engine for temporal logical specifications

    A real time inference engine for temporal logical specifications, which is able to acquire, process and generate any binary or real signal through POSIX IPC, files or UNIX sockets. Specifications of signals and dynamic systems are represented as special graphs and executed in real time, with a predictable sampling time of few milliseconds. Real time signal processing, dynamic system control, state machine modeling and logical property verification are some fields of application of this...
    Downloads: 0 This Week
    Last Update:
    See Project
  • 8
    D-List

    D-List

    An extensive list subsystem, written in C

    D-List is an extensive, production quality, and robust list management subsystem written in C that can be used as a shared library or compiled directly into your project. D-List provides access to 3 classes of lists, and allows extensive manipulation and customization of these lists. D-List lists can also be easily incorporated as primitives into larger treed, or nested data management systems. D-List implements a comprehensive set of linked list primitives that provides multiple forms of...
    Downloads: 0 This Week
    Last Update:
    See Project
  • 9
    Fortress-of-Solitude

    Fortress-of-Solitude

    Libraries to work with data structures in C language

    The repository have a library to each common data structures algorithms like Doubly linked list, Generic trees, Queue, Stack... Each lib have a option to carry your custom data in elements, other cool resources.
    Downloads: 0 This Week
    Last Update:
    See Project
  • Ship Agents Faster Icon
    Ship Agents Faster

    Transform your applications and workflows into powerful agentic systems at global scale.

    Gemini Enterprise Agent Platform lets you rapidly build, scale, govern and optimize production-ready agents grounded in your organization's data. The platform enables developers to build custom or pre-built agents for virtually any use case. New customers get $300 in free credits.
    Get Started Free
  • 10
    The ASCO project aims to bring circuit optimization capabilities to existing SPICE simulators using a high-performance parallel differential evolution (DE) optimization algorithm. It supports Eldo, HSPICE, LTspice, Spectre, and Qucs.
    Downloads: 6 This Week
    Last Update:
    See Project
  • 11

    lpsolve

    Mixed Integer Linear Programming (MILP) solver.

    Mixed Integer Linear Programming (MILP) solver lp_solve solves pure linear, (mixed) integer/binary, semi-cont and special ordered sets (SOS) models.lp_solve is written in ANSI C and can be compiled on many different platforms like Linux and WINDOWS This project is moved to github: https://lp-solve.github.io/
    Leader badge
    Downloads: 3,249 This Week
    Last Update:
    See Project
  • 12
    Downloads: 0 This Week
    Last Update:
    See Project
  • 13

    Jojos Binary Diff

    Binary Diff and Undiff Utility

    JDIFF is a program that outputs the differences between two binary files, either in binary format or in human readable format (detailed or summarized) and then allows to reconstruct the second file from the first one and the diff-file.
    Leader badge
    Downloads: 14 This Week
    Last Update:
    See Project
  • 14
    Programmer's library for random numbers. Also random number generator testing code. Intended for simulation, games and "Monte-Carlo" algorithms.
    Downloads: 1 This Week
    Last Update:
    See Project
  • 15
    PMCGPU

    PMCGPU

    Parallel simulators for Membrane Computing on the GPU

    ...This project has been initiated by the Research Group on Natural Computing (Department of Computer Science and Artificial Intelligence, University of Seville). PMCGPU was born inside the P-Lingua project, of the same research group. PMCGPU is a GNU project, so all the applications developed within it are released under the GPLv3 license. Just contact us if you want to participate. Please, visit the Wiki of the project for further information.
    Downloads: 1 This Week
    Last Update:
    See Project
  • 16
    libtdata

    libtdata

    Libtdata is a C library implements trees, index allocation and bit ops

    Libtdata is a small and portable C library implements a set of various search data structures, bit operations and index allocation.
    Downloads: 0 This Week
    Last Update:
    See Project
  • 17
    FastFlow: programming multi-core

    FastFlow: programming multi-core

    Pattern-based multi/many-core parallel programming framework

    FastFlow is a C/C++ programming framework supporting the development of pattern-based parallel programs on multi/many-core, GPUs and distributed platforms. FastFlow run-time is built upon non-blocking threads and lock-free queues. Thanks to its very efficient CAS-free communication/synchronization support (e.g. few clock cycles core-to-core latency), FastFlow effectively supports the exploitation of fine grain parallelism, e.g. parallel codes managing very high frequency streams on...
    Leader badge
    Downloads: 0 This Week
    Last Update:
    See Project
  • 18

    bps

    A B-tree based associative array library.

    B-tree with a twist pointer set. The ordered set approaches the speed of the fastest unordered, hash table based sets, while using several times less memory.
    Downloads: 0 This Week
    Last Update:
    See Project
  • 19
    leet

    leet

    Leet is CCEx's software application for on-the-fly encryption (OTFE).

    The name leet stands for "Linux exquisite encryption tool", it will be a software application for on-the-fly encryption, similar in its functionality to TrueCrypt. The goal of leet however is to be simpler and as user friendly as possible, making encryption and securing of information accessible to anybody, even those who don't necessarily have any prior knowledge of data securing, algorithms and encryption. However it's not targeted at this group of users only, part of the ambition of...
    Downloads: 0 This Week
    Last Update:
    See Project
  • 20
    Creates an index to DBF files using a B+ Tree; Cria um indice para um arquivo DBF usando uma arvore B+; Implementação em C; Baseada em Arquivo;
    Downloads: 0 This Week
    Last Update:
    See Project
  • 21
    Hyacc is an efficient and practical Yacc/Bison-compatible full LR(1)/LALR(1)/LR(0) and partial LR(k) parser generator in ANSI C based on Knuth and Pager's LR(1) algorithms. Generated parser can be used in open-source or commercial software.
    Downloads: 0 This Week
    Last Update:
    See Project
  • 22
    MultiFast

    MultiFast

    Mass String Search and Replace Solution via Aho-Corasick Algorithm

    Multifast provides you with efficient library and tool, to search and manipulate data streams on the fly. It can search for a huge number of strings and replace them in one pass. It contains a tidy and efficient implementation of the Aho-Corasick algorithm as a C library.
    Downloads: 0 This Week
    Last Update:
    See Project
  • 23

    bs

    A B-tree based sequence library.

    BS is a data structures library. It features fixed data size, random access sequences. The sequences are constructed over B-trees. Complexity for most single item operations is about O(logN).
    Downloads: 0 This Week
    Last Update:
    See Project
  • 24

    Dates

    Fast calendar calculations for 10,000 years (Julian and Gregorian)

    From the early 1970s up to nowadays the system date routines of computers usually mix up date with time calculations. Not only that they will expire sooner or later due to number overflow. Not only that this will make calendarian calculations extremely complicated. Fact is, that this will combine two things together which don't have anything to do with each other: The rotation of the earth around itself and the rotation of the earth around the sun, which in addition will both vary during the...
    Downloads: 0 This Week
    Last Update:
    See Project
  • 25

    Primes

    Calculate primes by using extremely fast sorting

    This project considers the problem of calculating primes as a sorting problem. It includes the most efficient tree-based sorting algorithm that is possible and shows that finding a new prime can be done by sorting the differences between the previous primes in the right way. Unfortunately it has turned out that going this way is even more slowly than trying to find primes by brute force. So it can only be used as a test with heavy load for the sorting algorithm, which can be used for...
    Downloads: 0 This Week
    Last Update:
    See Project
  • Previous
  • You're on page 1
  • 2
  • 3
  • 4
  • 5
  • Next
Auth0 Logo