iterator support

BufferGetAndValidate */

CIntToPy */

CIntFromPy */

This method has no effects in this class, but raises an exception if the expected size does not match */

Returns the dim'th component of the idx'th point in the class:

Returns the dim'th component of the idx'th point in the class:

Returns the dim'th component of the idx'th point in the class:

ExtTypeTest */

Helper accessor to the dataset points:

Helper accessor to the dataset points:

Helper accessor to the dataset points:

RaiseArgTupleInvalid */

BufferFallbackError */

* Builds the index */

assign one value to all elements

Helper to create a Variable stored on CPU memory. Args: name: name of the variable shape: list of ints initializer: initializer

direct access to data (read-only)

Must return the number of data points

Must return the number of data points

Must return the number of data points

GetBuiltinName */

CIntToPy */

Helper to create an initialized Variable with weight decay. Note that the Variable is initialized with a truncated normal distribution. A wei

Batch normalization on convolutional maps and beyond... Ref.: http://stackoverflow.com/questions/33949786/how-could-i-use-batch-normalization-in-

GetItemInt */

ParseKeywords */

Frees the previously-built index. Automatically called within buildIndex(). */

Frees the previously-built index. Automatically called within * buildIndex(). */

Frees the previously-built index. Automatically called within * buildIndex(). */

Query for the \a num_closest closest points to a given point (entered as query_point[0:dim-1]). * Note that this is a short-cut method for index->

IsLittleEndian */

CIntFromPy */

CodeObjectCache */

* Called during search to add an element matching the criteria. * @return true if the search should be continued, false if the result

* Called during search to add an element matching the criteria. * @return true if the search should be continued, false if the results are * suf

* Called during search to add an element matching the criteria. * @return true if the search should be continued, false if the results are * suf

* Builds the index */

* Builds the index */

* Create a tree node that subdivides the list of vecs from vind[first] * to vind[last]. The routine is called recursively on each sublist. *

* Create a tree node that subdivides the list of vecs from vind[first] * to vind[last]. The routine is called recursively on each sublist. *

* Create a tree node that subdivides the list of vecs from vind[first] * to vind[last]. The routine is called recursively on each sublist. *