// Save persists the pattern.
func (s *RBMHSequence) Save(ls *persist.LoadSaver) {
ls.SaveByte(rbmhLoader)
ls.SaveBytes(s.Seq)
for _, v := range s.Shift {
ls.SaveSmallInt(v)
}
}
// Save persists the pattern.
func (l List) Save(ls *persist.LoadSaver) {
ls.SaveByte(listLoader)
ls.SaveSmallInt(len(l))
for _, pat := range l {
pat.Save(ls)
}
}
func (fs *frameSet) save(ls *persist.LoadSaver) {
ls.SaveSmallInt(len(fs.set))
for _, f := range fs.set {
f.Save(ls)
}
ls.SaveInts(fs.testTreeIndex)
}
// Save persists the pattern.
func (c Choice) Save(ls *persist.LoadSaver) {
ls.SaveByte(choiceLoader)
ls.SaveSmallInt(len(c))
for _, pat := range c {
pat.Save(ls)
}
}
func saveTestNodes(ls *persist.LoadSaver, tns []*testNode) {
ls.SaveSmallInt(len(tns))
for _, n := range tns {
n.Frame.Save(ls)
ls.SaveInts(n.success)
saveTestNodes(ls, n.tests)
}
}
func saveCTests(ls *persist.LoadSaver, ct map[string]*cTest) {
ls.SaveSmallInt(len(ct))
for k, v := range ct {
ls.SaveString(k)
ls.SaveInts(v.satisfied)
ls.SaveInts(v.unsatisfied)
v.bm.Save(ls)
}
}
func (s *Set) Save(ls *persist.LoadSaver) {
ls.SaveInts(s.Idx)
ls.SaveSmallInt(len(s.Lists))
for _, v := range s.Lists {
ls.SaveSmallInt(len(v))
for _, w := range v {
ls.SaveInts(w)
}
}
}
func (i *Identifier) Save(ls *persist.LoadSaver) {
ls.SaveByte(core.Pronom)
ls.SaveString(i.name)
ls.SaveString(i.details)
ls.SaveBool(i.noPriority)
ls.SaveSmallInt(len(i.infos))
for k, v := range i.infos {
ls.SaveString(k)
ls.SaveString(v.name)
ls.SaveString(v.version)
ls.SaveString(v.mimeType)
}
ls.SaveInt(i.eStart)
ls.SaveStrings(i.ePuids)
ls.SaveInt(i.cStart)
ls.SaveStrings(i.cPuids)
ls.SaveInt(i.bStart)
ls.SaveStrings(i.bPuids)
ls.SaveSmallInt(i.tStart)
}
func saveTests(ls *persist.LoadSaver, tts []*testTree) {
ls.SaveSmallInt(len(tts))
for _, tt := range tts {
ls.SaveSmallInt(len(tt.complete))
for _, kfid := range tt.complete {
ls.SaveSmallInt(kfid[0])
ls.SaveSmallInt(kfid[1])
}
ls.SaveSmallInt(len(tt.incomplete))
for _, fu := range tt.incomplete {
ls.SaveSmallInt(fu.kf[0])
ls.SaveSmallInt(fu.kf[1])
ls.SaveBool(fu.l)
ls.SaveBool(fu.r)
}
ls.SaveInt(tt.maxLeftDistance)
ls.SaveInt(tt.maxRightDistance)
saveTestNodes(ls, tt.left)
saveTestNodes(ls, tt.right)
}
}
func (m Matcher) Save(ls *persist.LoadSaver) {
ls.SaveSmallInt(len(m))
for k, v := range m {
ls.SaveString(k)
ls.SaveSmallInt(len(v))
for _, w := range v {
ls.SaveSmallInt(int(w))
}
}
}
func saveKeyFrames(ls *persist.LoadSaver, kfs [][]keyFrame) {
ls.SaveSmallInt(len(kfs))
for _, v := range kfs {
ls.SaveSmallInt(len(v))
for _, kf := range v {
ls.SaveByte(byte(kf.typ))
ls.SaveInt(int(kf.seg.pMin))
ls.SaveInt(int(kf.seg.pMax))
ls.SaveSmallInt(kf.seg.lMin)
ls.SaveSmallInt(kf.seg.lMax)
ls.SaveInt(int(kf.key.pMin))
ls.SaveInt(int(kf.key.pMax))
ls.SaveSmallInt(kf.key.lMin)
ls.SaveSmallInt(kf.key.lMax)
}
}
}
func (ss *seqSet) save(ls *persist.LoadSaver) {
ls.SaveSmallInt(len(ss.set))
for _, v := range ss.set {
ls.SaveBigInts(v.MaxOffsets)
ls.SaveSmallInt(len(v.Choices))
for _, w := range v.Choices {
ls.SaveSmallInt(len(w))
for _, x := range w {
ls.SaveBytes(x)
}
}
}
ls.SaveInts(ss.testTreeIndex)
}
func (m *Matcher) Save(ls *persist.LoadSaver) {
ls.SaveSmallInt(int(*m))
}