void findTable(Table *table, char *key) { TableEntry entry; initialize(&entry, key, 0); TableEntry *found = retrieveEntry(table, &entry); if (!found) { printf("%s not found\n", key); } else printEntry(found); }
bool QoreValueList::is_equal_hard(const AbstractQoreNode* v, ExceptionSink* xsink) const { const QoreValueList* l = v && v->getType() == NT_VALUE_LIST ? reinterpret_cast<const QoreValueList*>(v) : 0; if (!l || l->size() != size()) return false; for (size_t i = 0; i < l->size(); i++) if (!l->retrieveEntry(i).isEqualHard(retrieveEntry(i))) return false; return true; }
double Sparse :: i( int row, int col ) const { return retrieveEntry( row, col, CHOLMOD_ZOMPLEX ); }
double Sparse :: r( int row, int col ) const { return retrieveEntry( row, col, CHOLMOD_REAL ); }
double& Sparse :: operator()( int row, int col ) { return retrieveEntry( row, col, CHOLMOD_REAL ); }