53 #if defined (HAVE_CONFIG_H)
90 qt = (qt + 1) % (N + 1);
99 qh = (qh + 1) % (N + 1);
104 #define Q_empty(Q, N, qh, qt) ((qh) == (qt))
109 #define LEFT(i) (((i) << 1) + 1) // = (2*(i)+1)
111 #define RIGHT(i) (((i) << 1) + 2) // = (2*(i)+2)
113 #define PARENT(i) (((i) - 1) >> 1) // = floor(((i)-1)/2)
128 if (l < size && A[l].deg < A[j].deg)
133 if (r < size && A[r].deg < A[smallest].deg)
160 if (H[i].deg < H[p].deg)
186 #define H_empty(H, h) ((h) == 0)
231 while (j1 < cidx[i+1] || j2 < cidx2[i+1])
251 else if (j2 == cidx2[i+1])
307 if (max_dist < x.
dist)
362 else if (ridx[l] > j)
440 if (
args.length () != 1)
472 if (nr == 0 && nc == 0)
533 for (i = 0; i <
N; i++)
579 while (j1 < cidx[i+1] || j2 < cidx2[i+1])
595 else if (j2 == cidx2[i+1])
octave_idx_type * xridx(void)
static void Q_enq(CMK_Node *Q, octave_idx_type N, octave_idx_type &qt, const CMK_Node &o)
bool is_real_type(void) const
static octave_idx_type calc_degrees(octave_idx_type N, const octave_idx_type *ridx, const octave_idx_type *cidx, octave_idx_type *D)
octave_idx_type rows(void) const
static void H_insert(CMK_Node *H, octave_idx_type &h, const CMK_Node &o)
OCTAVE_EXPORT octave_value_list isa nd deftypefn *return ovl(args(0).is_integer_type())
OCTINTERP_API void print_usage(void)
static void transpose(octave_idx_type N, const octave_idx_type *ridx, const octave_idx_type *cidx, octave_idx_type *ridx2, octave_idx_type *cidx2)
octave_idx_type * xcidx(void)
T & elem(octave_idx_type n)
void err_square_matrix_required(const char *fcn, const char *name)
static octave_idx_type find_starting_node(octave_idx_type N, const octave_idx_type *ridx, const octave_idx_type *cidx, const octave_idx_type *ridx2, const octave_idx_type *cidx2, octave_idx_type *D, octave_idx_type start)
OCTAVE_EXPORT octave_value_list search each directory of the loadpath for element of the cell array and return the first that matches If the second optional argument return a cell array containing the list of all files that have the same name in the path If no files are found
F77_RET_T const F77_INT F77_CMPLX const F77_INT F77_CMPLX * B
octave_idx_type columns(void) const
std::complex< double > w(std::complex< double > z, double relerr=0)
F77_RET_T const F77_INT & N
the sparsity preserving column transformation such that that defines the pivoting threshold can be given in which case it defines the c
SparseComplexMatrix sparse_complex_matrix_value(bool frc_str_conv=false) const
=val(i)}if ode{val(i)}occurs in table i
#define Q_empty(Q, N, qh, qt)
#define OCTAVE_LOCAL_BUFFER(T, buf, size)
static CMK_Node Q_deq(CMK_Node *Q, octave_idx_type N, octave_idx_type &qh)
#define DEFUN_DLD(name, args_name, nargout_name, doc)
SparseMatrix sparse_matrix_value(bool frc_str_conv=false) const
const T * fortran_vec(void) const
Vector representing the dimensions (size) of an Array.
static CMK_Node H_remove_min(CMK_Node *H, octave_idx_type &h, int reorg)
F77_RET_T F77_REAL &F77_RET_T F77_DBLE &F77_RET_T F77_REAL &F77_RET_T F77_DBLE &F77_RET_T F77_REAL &F77_RET_T F77_DBLE &F77_RET_T const F77_REAL const F77_REAL F77_REAL &F77_RET_T const F77_DBLE const F77_DBLE F77_DBLE &F77_RET_T F77_REAL &F77_RET_T F77_DBLE &F77_RET_T F77_DBLE &F77_RET_T F77_REAL &F77_RET_T F77_REAL &F77_RET_T F77_DBLE &F77_RET_T const F77_DBLE F77_DBLE &F77_RET_T const F77_REAL F77_REAL &F77_RET_T F77_REAL F77_REAL &F77_RET_T F77_DBLE F77_DBLE &F77_RET_T const F77_DBLE * x
F77_RET_T const F77_INT F77_CMPLX * A
F77_RET_T const F77_INT const F77_INT const F77_INT F77_DBLE const F77_INT F77_DBLE const F77_INT F77_DBLE * Q
static void H_heapify_min(CMK_Node *A, octave_idx_type i, octave_idx_type size)