30 skills found
Tessil / Ordered MapC++ hash map and hash set which preserve the order of insertion
contain-rs / Linked Hash MapA HashMap wrapper that holds key-value pairs in insertion order
JuliaCollections / OrderedCollections.jlJulia implementation of associative containers that preserve insertion order
frankiesardo / LinkedClojure(Script) efficient map and set structures that preserve insertion order
alexheretic / Linked Hash SetRust HashSet with insertion ordering
tommyettinger / JdkgdxdsJava data structures for primitive and/or Object items
niklasf / Indexed.pyA Python dictionary that is indexed by insertion order
lsndr / Weak Identity MapThe WeakIdentityMap object holds key-value pairs of weakly referenced objects and remembers the original insertion order of the keys
jakewhiteley / Php SetsA implementation of a Java-like Set data structure for PHP. A Set allows storage of any value without duplicates which can be iterated in insertion order.
maciejhirsz / OrdnungFast, vector-based map implementation that preserves insertion order.
phadej / Insert Ordered ContainersAssociative containers retating insertion order for traversals
DaniilDGG / OrderedDictionaryOrderedDictionary<TKey, TValue> is a generic collection that maintains insertion order while supporting both key-based and index-based access, making it useful for environments like Unity with Mono.
rogercoding / Binary Search TreeThis Java program implements a Binary Search Tree (BST) with basic operations: node insertion, key searching, and in-order traversal. It demonstrates efficient data storage, retrieval, and sorted data display.
j-maas / Ordered ContainersOrderedDict and OrderedSet that remember the order of insertion.
humanwhocodes / Ordered SetA set data structure that maintains the order of insertion
jongha / Sort JsThis is sorting library for Javascript. The sorting algorithm is an algorithm that puts elements of a list in a numerical order. This library contains many sorting algorithms Bubble sort, Quicksort, Merge sort, Heapsort, Insertion sort and selection sort. These functions help what your application finds an optimal algorithm at specific data.
XuJin1992 / The Research And Implementation Of Data Mining For Geological DataData mining and knowledge discovery, refers to discover knowledge from huge amounts of data, has a broad application prospect.When faced with geological data, however, even the relatively mature existing models, there are defects performance and effect.Investigate its reason, mainly because of the inherent characteristics of geological data, high dimension, unstructured, more relevance, etc., in the data model, indexing structure knowledge representation, storage, mining, etc., is far more complicated than the traditional data. The geological data of the usual have raster, vector and so on, this paper pays attention to raster data processing.Tobler theorem tells us: geography everything associated with other things, but closer than far stronger correlation.Spatial correlation characteristics of geological data, the author of this paper, by establishing a spatial index R tree with spatial pattern mining algorithms as the guiding ideology, through the raster scanning method materialized space object space between adjacent relationship, transaction concept, thus the space with a pattern mining into the traditional association rules mining, and then take advantage of commonly used association rules to deal with some kind of geological data, to find association rules of interest. Using the simulation program to generate the geological data of the experiment, in the process of experiment, found a way to use R tree indexing can significantly speed up the generating spatial transaction set, at the same time, choose the more classic Apriori algorithm and FP - growth algorithm contrast performance, results show that the FP - growth algorithm is much faster than the Apriori algorithm, analyses the main reasons why the Apriori algorithm to generate a large number of candidate itemsets.In this paper, the main work is as follows: (1) In order to speed up the neighborhood search, choose to establish R tree spatial index, on the basis of summarizing the common scenarios to apply spatial indexing technology and the advantages and disadvantages. (2) Based on the analysis of traditional association rule mining algorithm and spatial association rule mining algorithm on the basis of the model based on event center space with pattern mining algorithm was described, and puts forward with a rule mining algorithm based on raster scanning, the algorithm by scanning for the center with a grid of R - neighborhood affairs set grid, will study data mining into the traditional data mining algorithm. (3) In the process of spatial index R tree insert, in order to prevent insertion to split after the leaf node, leading to a recursive has been split up destroy the one-way traverse, is put forward in the process of looking for insert position that records if full node number is M (M number) for each node up to insert nodes, first to divide to avoid after layers of recursive splitting up, speed up the R tree insertion efficiency. (4) On the basis of spatial transaction set preprocessing, realize the Apriori algorithm and FP-growth algorithm two kinds of classic association rule mining algorithm, performance contrast analysis.
kevyonan / SM OrdmapA Hash Table that preserves insertion order for SourceMod Plugins.
ninjudd / Ordered CollectionsA Clojure set that maintains the insertion order of its contents.
enplasmatic / Furo DAWFuro is a digital audio workstation (DAW) coded entirely in Python that can manipulate audio files in order to create whatever you want! From combining clips, to reversing, splitting, and quick insertion, FURO is THE simple yet effective DAW.
