aphearin

def binned_elements_finder(x, bin_limits):
    """ Given an array x, and a set of bin limits on x, 
    return an indexer and a set of slices for retrieiving the set of points 
    in x that lie in the i^th bin.
    
    Parameters 
    ----------
    x : array 
    
    bin_limits : array 

aphearin

import numpy as np
from astropy.table import Table

############################################
# First we create some fake data
# We'll make a galaxy group catalog 
# using a million galaxies so that the calculation 
# would be very expensive to do naively
Ngals = 1e6
Ngroups = 3e5

aphearin

aphearin

from cython.parallel import prange

def c_array_f_multi(double[:] X):

    cdef int N = X.shape[0]
    cdef double[:] Y = np.zeros(N)
    cdef int i

    for i in prange(N, nogil=True):
        if X[i] > 0.5:

aphearin

{
    "user": {
        "@python": 2,
        "debug": false,
        "delay": 0.25,
        "error_color": "D02000",
        "gutter_theme": "Packages/SublimeLinter/gutter-themes/Default/Default.gutter-theme",
        "gutter_theme_excludes": [],
        "lint_mode": "background",
        "linters": {

aphearin

// SublimeLinter Settings - User
{
    "paths": {
        "linux": [],
        "osx": [
            "/Users/aphearin/anaconda/bin/"
        ],
        "windows": []
    },

aphearin

aphearin

aphearin

aphearin