1#ifndef _collect_h_INCLUDED
2#define _collect_h_INCLUDED
14static inline void kissat_defrag_watches (
kissat *
solver) {
18static inline void kissat_defrag_watches_if_needed (
kissat *
solver) {
20 const size_t size_limit =
GET_OPTION (defragsize);
21 if (size <= size_limit)
24 const size_t usable =
solver->vectors.usable;
26 if (usable <= usable_limit)
29 INC (vectors_defrags_needed);
30 kissat_defrag_watches (
solver);
#define ABC_NAMESPACE_HEADER_END
#define ABC_NAMESPACE_HEADER_START
NAMESPACES ///.
ABC_NAMESPACE_HEADER_START bool kissat_compacting(kissat *)
void kissat_sparse_collect(kissat *, bool compact, reference start)
void kissat_dense_collect(kissat *)
void kissat_initial_sparse_collect(kissat *)
void kissat_update_last_irredundant(kissat *, clause *last_irredundant)
void kissat_update_first_reducible(kissat *, clause *first_reducible)
ABC_NAMESPACE_HEADER_START typedef unsigned reference
void kissat_defrag_vectors(kissat *solver, size_t size_unsorted, vector *unsorted)