Erik Welch eriknw

## dask_patternsearch_example1.ipynb

      
              1 file
            
          
              0 forks
            
          
              0 comments
            
          
              0 stars
            
          
                eriknw
                / dask_patternsearch_example1.ipynb
            
            
              Created
              May 24, 2017 12:53
            
          
      Sorry, something went wrong. Reload?
      Sorry, we cannot display this file.
      Sorry, this file is invalid so it cannot be displayed.
      
          Viewer requires iframe.
      
    
## dask_patternsearch_example1.ipynb

      
              1 file
            
          
              0 forks
            
          
              0 comments
            
          
              0 stars
            
          
                eriknw
                / dask_patternsearch_example1.ipynb
            
            
              Created
              May 24, 2017 05:55
            
          
      Sorry, something went wrong. Reload?
      Sorry, we cannot display this file.
      Sorry, this file is invalid so it cannot be displayed.
      
          Viewer requires iframe.
      
    
## dask_nested_compute.py
# Extend `dask.compute` to work on nested data structures.
from toolz import concat
from dask import compute

def _flatten_compute(vals):
    if isinstance(vals, list):
        inner = list(concat(map(_flatten_compute, vals)))
        return ['list', len(inner)] +  inner
    elif isinstance(vals, dict):
        inner = []

## benchmark1.lua
local function groupby(func, seq)
    local t = {}
    for _, val in ipairs(seq) do
        local key = func(val)
        t[key] = t[key] or {}
        t[key][#t[key] + 1] = val
    end
    return t
end
	# Extend `dask.compute` to work on nested data structures.
	from toolz import concat
	from dask import compute

	def _flatten_compute(vals):
	if isinstance(vals, list):
	inner = list(concat(map(_flatten_compute, vals)))
	return ['list', len(inner)] + inner
	elif isinstance(vals, dict):
	inner = []
	local function groupby(func, seq)
	local t = {}
	for _, val in ipairs(seq) do
	local key = func(val)
	t[key] = t[key] or {}
	t[key][#t[key] + 1] = val
	end
	return t
	end