Search Results for "c graphics libraries"
Sort By:
Showing 74 open source projects for "c graphics libraries"
View related business solutions-
$300 Free Credits for Your Google Cloud ProjectsLaunch your next project with $300 in free Google Cloud credits—no strings attached. Test, build, and deploy without risk. Use your credits across the entire Google Cloud platform to find what works best for your needs. After your credits are used, continue with always-free tier services. Only pay when you're ready to scale. Sign up in minutes and start exploring.
-
Streamline Azure Security with Palo Alto Networks VM-SeriesImprove your security posture and reduce incident response time. Use the VM-Series to natively analyze Azure traffic and dynamically drive policy updates based on workload changes.
-
1
TBOX
A glib-like multi-platform c library
TBOX is a glib-like cross-platform C library that is simple to use yet powerful in nature. The project focuses on making C development easier and provides many modules (.e.g stream, coroutine, regex, container, algorithm ...), so that any developer can quickly pick it up and enjoy the productivity boost when developing in C language. It supports the following platforms: Windows, Macosx, Linux, Android, iOS, BSD and etc. Supports file, data, http and socket source. Supports the stream filter... -
2
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... -
3
AlgorithmsDev Library by Arshad Latti
comman and new algorithms and functions development and demo programs.
Provide implemented algorithms and functions with demo programs to test.keeped portable as possible at OS level and programming language(understanding)level.provide third party archives if available for ralvent algorithm.links for YouTube videos on availability by us and third party. -
4
ringBufU
Ring-Buffer library in C, includes support of multithreading
A Ring-Buffer instance could be used with element types - char - long - long long - void* . Focus is on a hardened SW structure with buffer-instance-pointer check (not very fast but more secure). Some features are globally choosable on compile-time (e.g. switch multithread support off completely to have faster access). Note: User Interface is for Test and Tutor Code only. -
Full-stack observability with actually useful AI | Grafana CloudBuilt 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.
-
5
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... -
6
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. -
7
-
8
StructPie
A set of C libraries to implement data structures and algorithms
Struct-Pie (Structures Pie) is a set of C shared libraries to implement data structures and algorithms so that they can be used/integrated easily into C projects. LIFO & FIFO Stack, Binary Search Tree, Priority Queue and a Hash Table are implemented and included in this package. Future releases will have many other data structures. The hash table in this package uses separate chaining to avoid collision. -
9
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. -
Ship Agents FasterGemini 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.
-
10
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... -
11
StoneValley
An algorithm library written in plain C.
A library that collect several algorithms and data structures. -
12
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. -
13
Utah Raster Toolkit
The Utah Raster Toolkit 3.0, patchlevel 2
...RLE format supports a great number of raw inner formats for applications to use, known together as .rle (ie, "stored windowing") ~~~ The Utah Raster toolkit is a collection of programs and C routines for dealing with raster images commonly encountered in computer graphics. It provides the following major functions: * A device and system independent image format for storing images and information about them. Called the RLE format, it uses run length encoding to reduce storage space for most images. * A library of C routines for reading, writing and manipulating images stored in the RLE format... -
14
pycrc
CRC C source generator
pycrc is an easy to use CRC (cyclic redundancy check) calculator and C source code generator. The generated source code can be optimized for simplicity, speed or space. pycrc contains a long parameter list of common CRC models. The program is self contained and does not require installation. Apart from a python installation, it does not require other libraries to be installed. -
15
libmng -THE reference library for reading, displaying, writing and examining Multiple-Image Network Graphics. MNG is the animation extension to the popular PNG image-format.
-
16
librfc
Public domain implementations of core RFC specifications for C/C++.
librfc is a C/C++ shared library containing public domain implementations of core RFC data structures and algorithms written in C++11. -
17
Project CIF(Core Information Foundation)
c++ and c library to help build win32 software and others platforms
The project CIF now created with new philosophy of JPM (Joint Project Module) with SDK style. Now simply include CIF.h and use all of functions, macros and classes. BTS (Basic Text Support) Library Used in TOM (Text Object Module). TOM for now with CAnsiString , CAnsiStringLite And Text namespace. CAnsiString created with more functionality then typical string and text classes. EVS (Enhanced Visual Support) provide COpenFileDialog And CSaveFileDialog. JCM (Joint Core Module) used as base... -
18
libcpr
Public domain backport of the core C++11 standard library to C.
Backport of C++11's std::string and std::vector to C. Other containers such as std::list, std::map, and std::set are in the works. -
19
qtbitreverse_demo
recursive calculation of Bitreverse
small QT Programm for Testing my recursive Algorithm for calculation the bitreverse of a single number in a series with Length: 2^X with X=Number of Bits -
20
libcutils
Some Useful C-Utilities
Libcutils provides a self-contained set of fundamental routines which are essential to basically any Unix utility or daemon application written in C. The library provides fundamental data structures such as lists, hash-maps, strings and parsing functions for JSON or the typical dot-file based configuration data. The following list summarizes the currently supported functionality: * length delimited instead of NULL terminated strings * memory management based on reference... -
21
Distributed Multithread Apriori (DMTA)
A parallel implementation using MPI and OpenMP to Apriori algorithm
DMTA (Distributed Multithreaded Apriori) is a parallel implementation of Apriori algorithm, which exploits the parallelism at the level of threads and processes, seeking to perform load balancing among the cores. Was implemented in C++ language, using the parallelization libraries OpenMP and MPI. The algorithm was generated as a result of a project developed by André Camilo Bolina, under the guidance of teachers Marluce Rodrigues Pereira, Ahmed Ali Abdalla Esmin and Denilson Alves Pereira, in Department of Computer Science at Federal University of Lavras. The results of this project were published in the Revista de Sistemas de Informação da FSMA and is available in http://www.fsma.edu.br/si/edicao11/FSMA_SI_2013_1_Principal_1.html -
22
The fstrcmp project provides a shared library for making fuzzy string comparisons, and also provides an fstrcmp command for use in shell scripts.
-
23
JSolutions
The solution to all your problems
The Jsolution package is a collection of programs, scripts,libraries and documents that i have written and use in my daily life. -
24
I is a cross-platform programming language designed towards efficiency during development and at runtime.
-
25
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...
