allocateFinalIdToSet(build, bc, norm, &next_final_id);
/* next anchored stuff */
- build.anchored_base_id = next_final_id;
allocateFinalIdToSet(build, bc, anch, &next_final_id);
/* delayed ids come last */
verify_u32(bc.final_id_to_literal.size() - delay_base_id);
engine->delay_fatbit_size = fatbit_size(engine->delay_count);
engine->delay_base_id = delay_base_id;
- engine->anchored_base_id = anchored_base_id;
engine->anchored_count = bc.anchored_programs.size();
engine->anchored_fatbit_size = fatbit_size(engine->anchored_count);
DUMP_U32(t, delay_base_id);
DUMP_U32(t, anchored_count);
DUMP_U32(t, anchored_fatbit_size);
- DUMP_U32(t, anchored_base_id);
DUMP_U32(t, maxFloatingDelayedMatch);
DUMP_U32(t, delayRebuildLength);
DUMP_U32(t, stateOffsets.history);
std::map<u32, std::set<u32> > group_to_literal;
u32 group_end;
- u32 anchored_base_id;
-
u32 ematcher_region_size; /**< number of bytes the eod table runs over */
/** \brief Mapping from leftfix to queue ID (used in dump code). */
delay_base_id(MO_INVALID_IDX),
hasSom(false),
group_end(0),
- anchored_base_id(MO_INVALID_IDX),
ematcher_region_size(0),
eod_event_literal_id(MO_INVALID_IDX),
max_rose_anchored_floating_overlap(0),
* delayed literal ids are contiguous */
u32 anchored_count; /* number of anchored literal ids */
u32 anchored_fatbit_size; //!< size of each anch fatbit in scratch (bytes)
- u32 anchored_base_id; /* literal id of the first literal in the A table.
- * anchored literal ids are contiguous */
u32 maxFloatingDelayedMatch; /* max offset that a delayed literal can
* usefully be reported */
u32 delayRebuildLength; /* length of the history region which needs to be