plumpmath Goto Github PK

bge_dw

BGE / UPBGE horror third person shooter

bge_shortcuts

Blender Game Engine Add-on that adds some shortcuts for developing games or interactive media.

bhuztez-zhihu-backup

bibliotecaexportacion

Biblioteca de clases para exportar una lista de objetos a CSV, XLSX y PDF utilizando iTextSharp, Excel interop y XML

bidi-wrapper-matcher

clojure implementation of defrecord-wrapper.aop.Matcher protocol

bifrost

A Clojure library for building HTTP API gateways with Pedestal and core.async

big-bang

ClojureScript event loop abstraction, loosely based on Racket's big-bang and implemented on top of core.async

bigdata

bigdata-interop

Libraries and tools for interoperability between Hadoop-related open-source software and Google Cloud Platform.

bigdata-interop-leanplum

bigeeks-parse

Parser for Census and other data written in Clojure

biggest-room

The Biggest Room in the World

bigroller

Forth dice roll generator (NXP LCP2119 (ARM) based)

bike-share-api

API using data from Baltimore Bike Share.

bill_protothreads_arduino

ProtoThreads for arduino, multiple threads

bimsurfer

The first open source WebGL based IFC viewer

binary-heap

simple polymorphic binary heap with inlined comparison relation

binary-mobile-hs

An implementation of the Binary Mobiles problem from SICP in haskell, and scheme

binary-relation

A fast implementation of in-memory relation between two sets of objects based on HashMap

binary-relation-calculator

binary-relation-fake-detector

Course project about fake detection, using binary relation extraction from MITIE library

binary-relation-magic

My attempt to visualize an arbitrary graph (canvas version - SVG link in the README)

binary-relations

same program in different languages

binary-relations-1

binary-relations-paper

How to deal with binary relations in first-order logic, the paper

binary-search-tree

A Binary search tree that manipulates a (x, y) relation. It is possible to insert and delete pairs from the tree. Pairs can be deleted or extracted providing only one of the elements. The tree can be emptied. The essential time complexities are O(log n) assuming that the tree is balanced. No methods for actually balancing it are implemented.

binary-search-tree-exercise

This exercise is about designing an abstract data type (ADT), in this case a 'Binary Relation', and implementing it in a Abstract Data Structure, in this case a Binary Search Tree.

binary-split-factorial-scheme

binaryrelation

binaryrelation-1