Erase and clear

To save space, index() is computed by looking at the descriptor's position in the parent's array of children.

To save space, index() is computed by looking at the descriptor's position in the parent's array of children.

* Insert a new element in the heap. * * We select the next empty leaf node, and then keep moving any larger * parents down until the ri

* Insert a new element in the heap. * * We select the next empty leaf node, and then keep moving any larger * parents down until the ri

* Starts the timer. */

* Starts the timer. */

* Stops the timer and updates timer value. */

* Stops the timer and updates timer value. */

64-bit implementations of memory barrier can be simpler, because it "mfence" is guaranteed to exist.

64-bit implementations of memory barrier can be simpler, because it "mfence" is guaranteed to exist.

Atomically execute: result = *ptr; if (*ptr == old_value) ptr = new_value; return result; I.e., replace "*ptr" with "new_value" if "*ptr" used to be

Atomically execute: result = *ptr; if (*ptr == old_value) ptr = new_value; return result; I.e., replace "*ptr" with "new_value" if "*ptr" used to be

We also define ToString() here, since many other string-like interfaces name the routine that converts to a C++ string "ToString", and it's confusing

We also define ToString() here, since many other string-like interfaces name the routine that converts to a C++ string "ToString", and it's confusing

Lookup

reserve menory for an UINT32 */

optional bool bias_term = 2 [default = true];

optional uint32 img_h = 8;

optional uint32 img_w = 9;

optional float step_h = 11;

optional float step_w = 12;

repeated int32 input_dim = 4;

repeated uint32 kernel_size = 4;

repeated .caffe.LayerParameter layer = 100;

repeated uint32 pad = 3;