template<class X> void splay_forest<X>::test_range_contains (Pos eqn) { Ob my_root = get_root(eqn); Ob my_key = get_key(eqn); for (RangeIterator iter(my_root, my_key); iter.ok(); iter.next()) { if (*iter == eqn) return; } POMAGMA_ERROR("invalid: eqn not (range) contained in own " << nameof<X>() << " tree"); }
template<class X> void splay_forest<X>::test_contains (Pos eqn) { for (Iterator iter(get_root(eqn)); iter.ok(); iter.next()) { if (*iter == eqn) return; } Iterator iter; for (iter.begin(get_root(eqn)); iter.ok(); iter.next()) { if (*iter == eqn) return; } POMAGMA_ERROR("invalid: eqn not contained in own " << nameof<X>() << " tree"); }
inline size_t max_value_of_type (hid_t type) { if (H5Tequal(type, H5T_NATIVE_UCHAR)) { return std::numeric_limits<uint8_t>::max(); } else if (H5Tequal(type, H5T_NATIVE_USHORT)) { return std::numeric_limits<uint16_t>::max(); } else if (H5Tequal(type, H5T_NATIVE_UINT)) { return std::numeric_limits<uint32_t>::max(); } else if (H5Tequal(type, H5T_NATIVE_ULONG)) { return std::numeric_limits<uint64_t>::max(); } else { POMAGMA_ERROR("unknown type"); } }
void execute (const AssumeTask & task) { POMAGMA_DEBUG("assume " << task.expression); InsertParser parser(signature); parser.begin(task.expression); std::string type = parser.parse_token(); Ob lhs = parser.parse_term(); Ob rhs = parser.parse_term(); parser.end(); if (type == "EQUAL") { ensure_equal(lhs, rhs); } else if (type == "LESS") { ensure_less(lhs, rhs); } else if (type == "NLESS") { ensure_nless(lhs, rhs); } else { POMAGMA_ERROR("bad relation type: " << type); } }
void operator= (const atomic_flag &) { POMAGMA_ERROR("fail"); }
atomic_default (const atomic_default<T> &) : std::atomic<T>(0) { POMAGMA_ERROR("fail"); }
atomic_flag (const atomic_flag &) : std::atomic_flag(ATOMIC_FLAG_INIT) { POMAGMA_ERROR("fail"); }
std::string negate (const std::string & name) { if (name == "LESS") return "NLESS"; if (name == "NLESS") return "LESS"; POMAGMA_ERROR("failed to negate name: " << name); }