Friday, December 9, 2016

Crossfilter API

Below are the methods of the Crossfilter API. This data along with the Making Dashboards with Dc.js and Interactive Data Visualization with D3.js, DC.js, Python, and MongoDB tutorials provides a quick step in working with D3, DC and Crossfilter.


Crossfilter

A crossfilter represents a multi-dimensional dataset.

# crossfilter([records])
# crossfilter.add(records)
# crossfilter.bisect
# crossfilter.bisect.by(value)
# crossfilter.dimension(value)
# crossfilter.groupAll()
# crossfilter.heap
# crossfilter.heap.by(value)
# crossfilter.heapselect
# crossfilter.heapselect.by(value)
# crossfilter.insertionsort
# crossfilter.insertionsort.by(accessor)
# crossfilter.permute(array, index)
# crossfilter.quicksort
# crossfilter.quicksort.by(accessor)
# crossfilter.remove()
# crossfilter.size()

Dimension

# dimension.bottom(k)
# dimension.dispose()
# dimension.filter(value)
# dimension.filterAll()
# dimension.filterExact(value)
# dimension.filterFunction(function)
# dimension.filterRange(range)
# dimension.group([groupValue])
# dimension.groupAll()
# dimension.top(k)

Group (Map-Reduce)

# group.all()
# group.dispose()
# group.order(orderValue)
# group.orderNatural()
# group.reduce(add, remove, initial)
# group.reduceCount()
# group.reduceSum(value)
# group.size()
# group.top(k)

Group All (Reduce)

# groupAll.reduce(add, remove, initial)
# groupAll.value()

Sorts

# insertionsort(array, lo, hi)
# quicksort(array, lo, hi)

Heap

The identity heap function; suitable for numbers, dates, strings, and other naturally-comparable objects.

# heap(array, lo, hi)
# heap.sort(array, lo, hi)
# heapselect(array, lo, hi, k)

Bisector

The identity bisector; suitable for numbers, dates, strings, and other naturally-comparable objects.

# bisect(array, value, lo, hi)
# bisect.right(array, value, lo, hi)
# bisect.left(array, value, lo, hi)

No comments:

Post a Comment

The source code for gliesians.com is for sale on Ebay.

I've decided to shut down gliesians.com and sell the source code. If anyone is looking to purchase the related source, you can find it...