Search Results for "search"
Sort By:
Showing 14 open source projects for "search"
View related business solutions-
Stop Cyber Threats with VM-Series Next-Gen Firewall on AzureGain 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.
-
Build Agents and Models on One PlatformGemini Enterprise Agent Platform is Google Cloud's comprehensive platform for developers to build, scale, govern, and optimize agents and models. Choose from Google's most advanced models and third-party models like Anthropic's Claude Model Family.
-
1
[OFFICIAL] tinyfiledialogs C C++ v3.21.3
inputbox password WIN OSX GTK QT Console VCPKG C# Lua R Fortran Pascal
one C/C++ file & header ==> 8 functions: - beep - tray notify popup - message & question - input & password - save file - open file(s) - select folder - color picker complements OpenGL Vulkan GLFW GLUT GLUI VTK SFML TGUI SDL Ogre Unity3d ION OpenCV CeGui MathGL GLM CPW GLOW Open3D ImGui MyGui GLT NGL STB Nuklear Fenster MicroUi & head-less programs NO INIT NO MAIN LOOP NO LINKING NO INCLUDE win (XP to 11) ASCII MBCS UTF-8 UTF-16 (wchar_t) - native dialogs osx/unix... -
2
...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.
-
3
ALEPH-w
Data structures and Algorithms library
Aleph-w is a library of data structures and algorithms implemented in and for C++. It contains the main data structures: single and double lists, special arrays (dynamic and of bits), many types of trees: multitrees, binary search trees, avl, red-black, randomized, treaps, splay and other interesting types. Several types of hash tables are implemented: separated chaining, open adressing with linear probing and double function hash; this last one has a garbage colector mechanism that allows to free deleted entries. Dynamic linear hash tables are implemented too. ... -
4
Lnkdlst
Single sided linked list (kind of lib with test-code, C, C++ and java)
Use own (user) data section for each Linked-List-Element (LLEl) including a fix Identifier which is for search via basic Lnkdlst function (fast ID-part-search, e.g. to find all elements with a specific bit in the ID set). Main list-linkage-change functions: append, insert, delete. - Examples: use of flexible variable ArgList (OnePointerArg, optional valid if not NULL, Argument-Type by ID-Number is easy to get), key-value pairs, build FIFO{queue}/LIFO{stack}, auto-list with max. ... -
MongoDB Atlas runs apps anywhereMongoDB Atlas gives you the freedom to build and run modern applications anywhere—across AWS, Azure, and Google Cloud. With global availability in over 115 regions, Atlas lets you deploy close to your users, meet compliance needs, and scale with confidence across any geography.
-
5
JSON Parser
JSON Parser written in C that outputs JSON into D-List list objects
...If your project does not already incorporate D-List, you will also need to include dlist.h The JSON parser package also includes a JSON validator that does not parse or create resources, but allows the caller to validate JSON data from unknown sources, prior to any parsing attempts. The JSON data is returned to the caller as a set of hierarchical D-List list objects, that make the data very easy to manage, sort, search or use, and easy to remove when done. Package includes a JSON textural generator which will create JSON grammar data blocks from hierarchical D-List representations of JSON data. The package also includes a variety of support functions to allow C code to easily find, add, and modify JSON values and members in D-List hierarchical structures. -
6
libpostal
A C library for parsing/normalizing street addresses around the world
...The goal of this project is to understand location-based strings in every language, everywhere. Addresses and the locations they represent are essential for any application dealing with maps (place search, transportation, on-demand/delivery services, check-ins, reviews). Yet even the simplest addresses are packed with local conventions, abbreviations and context, making them difficult to index/query effectively with traditional full-text search engines. This library helps convert the free-form addresses that humans use into clean normalized forms suitable for machine comparison and full-text indexing. ... -
7
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. In the "hash_table" directory, the hash table implementation uses linked lists. While in "HashBSTree" directory, a hash table with a binary tree in each index is implemented for faster lookup in large data. ... -
8
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. -
9
ftdetector
File type detector library
This project is a tool to detect file types by signatures and mime types. It uses hash tables to make the detection of a file type as fast as possible. The signature and mime types lists are stored at simple user-friendly files. This file type detector supports a lot of formats (image, archive, text, documents, audio, video, fonts and others). It also includes Microsoft OLE compound file types. The detector's algorythm has special features to detect text file types like (HTML, XML, JSON,... -
$300 Free Credits to Build on Google CloudStart 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.
-
10
concordia
Powerful search library, best suited for computer-aided translation
...The effects are stunning - Concordia is able to do simple substring lookup at the pace of 5000 queries per second (on personal PC) - a speed which can not be achieved by any other search library. Moreover, Concordia can perform its own "concordia search". For a given input sentece, all substring matches covering this sentence are retrieved. This project now contains fully functional Concordia search library. In the near future, it will be extended by concordia-server: ligthweight, robust web server providing corpora search functionalities -
11
cdsaext
C DSA extensions
cdsaext is a library of implementations of data structures and algorithms, such as lists, maps, trees, binary search functions, and similar dsa's. See also my javadsaext project, which implements similar functions in Java. -
12
libcontc
Container library in C.
About Collection of data structures and operations that have been (and will continue to be) implemented in response to need. Container interface, naming and behavior is similar to the STL containers. Algorithm interface is in the spirit of the C standard library search and sort functions. Compatibility ISO C99, ISO C++98, ISO C++11. Performance These are designed to be general purpose, and reasonably efficient in most circumstances. Notes The biggest problem with these is type safety due to the use of pointer to void for type abstraction. This code is intentionally spartan. With the exception of a handful of assertions placed as an aid to debugging for the most common or fatal errors (underflow in pop operations, allocation failures), this library makes no attempt to protect itself. ... -
13
Minids
Library implementing basic data structures like stacks, queues, etc
C library implementing basic data structures like stacks, queues, binary search trees, etc. -
14
Simple Fast Dictionary
Simple, small and fast dictionary lib on C
The library does quick search of dictionary words in arbitrary input strings. Known problems are known. :) See appropriate section in documentation. Also, only ASCII words and strings for now.
- Previous
- You're on page 1
- Next
