environment/lib/python2.7/site-packages/IPython/parallel/client/map.py
def getPartition(self, seq, p, q):
        """Returns the pth partition of q partitions of seq."""
        
        # Test for error conditions here
        if p<0 or p>=q:
          print "No partition exists."
          return
          
        remainder = len(seq)%q
        basesize = len(seq)//q
        hi = []
        lo = []
        for n in range(q):
            if n < remainder:
                lo.append(n * (basesize + 1))
                hi.append(lo[-1] + basesize + 1)
            else:
                lo.append(n*basesize + remainder)
                hi.append(lo[-1] + basesize)
        
        try:
            result = seq[lo[p]:hi[p]]
        except TypeError:
            # some objects (iterators) can't be sliced,
            # use islice:
            result = list(islice(seq, lo[p], hi[p]))
            
        return result
def getPartition(self, seq, p, q):
        # Test for error conditions here
        if p<0 or p>=q:
          print "No partition exists."
          return
          
        remainder = len(seq)%q
        basesize = len(seq)//q
        hi = []
        lo = []
        for n in range(q):
            if n < remainder:
                lo.append(n * (basesize + 1))
                hi.append(lo[-1] + basesize + 1)
            else:
                lo.append(n*basesize + remainder)
                hi.append(lo[-1] + basesize)
        
        try:
            result = seq[lo[p]:hi[p]]
        except TypeError:
            # some objects (iterators) can't be sliced,
            # use islice:
            result = list(islice(seq, lo[p], hi[p]))
            
        return result
def getPartition ( self , seq , p , q ) : # Test for error conditions here if p < 0 or p >= q : print "No partition exists." return remainder = len ( seq ) % q basesize = len ( seq ) // q hi = [ ] lo = [ ] for n in range ( q ) : if n < remainder : lo . append ( n * ( basesize + 1 ) ) hi . append ( lo [ - 1 ] + basesize + 1 ) else : lo . append ( n * basesize + remainder ) hi . append ( lo [ - 1 ] + basesize ) try : result = seq [ lo [ p ] : hi [ p ] ] except TypeError : # some objects (iterators) can't be sliced, # use islice: result = list ( islice ( seq , lo [ p ] , hi [ p ] ) ) return result
Returns the pth partition of q partitions of seq.
Returns the pth partition of q partitions of seq .