Displaying 1 to 14 from 14 results

math-php - Powerful modern math library for PHP: Features descriptive statistics and regressions; Continuous and discrete probability distributions; Linear algebra with matrices and vectors, Numerical analysis; special mathematical functions; Algebra

  •    PHP

The only library you need to integrate mathematical functions into your applications. It is a self-contained library in pure PHP with no external dependencies. Composer will install MathPHP inside your vendor folder. Then you can add the following to your .php files to use the library with Autoloading.

js-combinatorics - power set, combination, permutation and more in JavaScript

  •    Javascript

Combinatorics is now available in your app/package namespace. All methods create generators. Instead of creating all elements at once, each element is created on demand. So it is memory efficient even when you need to iterate through millions of elements.

streamplify - Java 8 combinatorics-related streams and other utilities

  •    Java

The goal of this library is to provide useful Java 8 streams and to assist you in building new streams that allow efficient parallel processing.The following code snippet uses a parallel permutation stream to find all solutions of the N-Queens problem for n = 10.

multichoose - generate multiset combinations (n multichoose k)

  •    C++

The method generates all multisets that would be generated from taking k elements from a multiset of n. Repeated multisets are possible if the input set contains repeated elements. The number of multiset combinations equals the multinomial coefficient (n multichoose k). This example lists all the possible unordered genotypes at a given genetic loci of which there are two copies (e.g. chromosomes). In this case k (=2) could be understood as the expected ploidy of the given locus.

permutations - generate unique permutations, like all lottery numbers

  •    Javascript

generate unique permutations, like all lottery numbers

cracking-the-da-vinci-code-with-google-interview-problems-and-nlp-in-python - A guide on how to crack combinatorics puzzles shown in The Da Vinci Code movie using CS fundamentals and NLP

  •    Python

I was rewatching The Da Vinci Code the other day and came across an incredible scene near the start where Robert and Sophie, the two leading protagonists playing detective roles, stumble across an anagram puzzle in the Louvre Museum in Paris. It was a dark night and their lives depended on them cracking the code quickly! Silas, the ruthless Opus Dei Zealot, was out for blood. An anagram is a word, phrase, or name formed by rearranging the letters of another word. For example: car => rac. These two words are anagrams of each other.

oseq - Purely functional iterators.

  •    OCaml

Simple list of suspensions, as a composable lazy iterator that behaves like a value. BSD license.

safe-types - Type safe utils inspired from the Rust language for writing better TypeScript/Flow.

  •    TypeScript

Type safe utils inspired from the Rust language for writing better JavaScript. Written in typescript with support for flow definitions. This library started out as an experiment both to learn Rust concepts as well as to determine whether some of Rust's types can be mapped to TypeScript and improve the safety of TypeScript/JavaScript. It's my opinion that a library like this requires a 100% TypeScript environment to provide security of JS types. Without the TypeScript compiler and tooling, these primitives may make your data more opaque rather than provide insight and clarity into the many states application data can be in. Using an editor like vscode can bridge that gap somewhat since it provides built in intellisense via the typescript language server.

generatorics - An efficient combinatorics library for JavaScript utilizing ES2015 generators.

  •    Javascript

Note: This module is not transpiled for compatibility, as it degrades the performance. Check your browser/node version. For efficiency, each array being yielded is the same one being mutated on each iteration. DO NOT mutate the array.

alasc - Computational Group Theory in Scala. It's Scala permuted!

  •    Scala

AlaSc is a Computational Group Theory library aiming to implement permutation group algorithms in Scala. The library implements the deterministic and randomized Schreier-Sims algorithms using explicit transversals, along with a few helpers. It also provides a Grp class which can be used to explore any finite group provided a faithful action is provided.

foreach-combination - Visit all k-combinations of an array in lexicographic order

  •    Javascript

Enumerate all k length subsets in an array. If you want to use this in a browser, then you should use browserify.

lodash.combinations - Calculates all possible combinations without repetition of a certain size.

  •    Javascript

Calculates all possible combinations without repetition of a certain size. Returns a new array.

We have large collection of open source products. Follow the tags from Tag Cloud >>

Open source products are scattered around the web. Please provide information about the open source projects you own / you use. Add Projects.