Trees | Indices | Help |
|
---|
|
Classes | |
threaded_readable_file | |
dir_lock | |
PrereqError |
Functions | |||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
(float, float) or (float, None) |
|
||
|
|||
float |
|
||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
list |
|
||
|
|||
int |
|
||
str |
|
||
None or float |
|
||
|
|||
bool |
|
||
|
|||
|
|||
|
|||
whatever is inside x
|
|
||
|
|||
str |
|
Variables | |
__package__ =
|
Imports: os, sys, math, time, stat, errno, die, N_maximum, N_minimum, N_median, N_mean_ad, variance, stdev, set_diag, make_diag, limit, vec_variance, qform, KolmogorovSmirnov, interp, interpN, Queue, threading
Function Details |
|
Note: There is a version of this in Numeric_gpk that is more efficient when the input is a list of numpy.ndarray vectors. |
|
|
Bootstrap resampling. Call this many times: each one returns a random resampling. |
Jackknife resampling. Call this once. It returns a list of deleted lists. |
P is a list of complex numbers. This algorithm works by repeatedly stripping off the convex hull of the points. |
Read the contents of a file as an iterator. The read is two-threaded, so that one thread can be waiting on disk I/O while the other thread is processing the results. |
This makes the specified directory, including all necessary directories above it. It is like os.makedirs(), except that if the directory already exists it does not raise an exception.
Note:
If the directory already exists, it does not force it to have the
specified |
Shuffle a list, y, so that no item occurs more than n times in a row. Equality is determined by the comparison function compare returning zero. |
Open a file (typically for writing) but make sure that the file doesn't already exist. The name is constructed from nm1, a sequence number, and nm2. The sequence number gets incremented until a name is found that doesn't exist. This works by creating a directory as a lock file; it should be safe across NFS.
Note:
The directory containing |
Factor a number into a list of prime factors, in increasing order.
|
Greatest common factor/denominator.
|
Search PATH to find where a program resides.
|
Paired with need_to_recompute(). These implement something like make, where we figure out if we need to compute things based on the age of files. This is used to get the age of the pre-requisites.
|
Paired with get_mtime(). These implement something like make, where we figure out if we need to compute things.
|
Sample from a list with specified probabilities.
|
|
|
Trees | Indices | Help |
|
---|
Generated by Epydoc 3.0.1 on Thu Sep 22 04:25:02 2011 | http://epydoc.sourceforge.net |