/*
   Copyright 2018-2019 Banco Bilbao Vizcaya Argentaria, S.A.

   Licensed under the Apache License, Version 2.0 (the "License");
   you may not use this file except in compliance with the License.
   You may obtain a copy of the License at

       http://www.apache.org/licenses/LICENSE-2.0

   Unless required by applicable law or agreed to in writing, software
   distributed under the License is distributed on an "AS IS" BASIS,
   WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
   See the License for the specific language governing permissions and
   limitations under the License.
*/

package history

import (
	"github.com/bbva/qed/crypto/hashing"
)

func pruneToInsert(version uint64, eventDigest hashing.Digest) operation {

	var traverse func(*position) operation
	traverse = func(pos *position) operation {

		if pos.IsLeaf() {
			return newMutateOp(newPutCacheOp(newLeafHashOp(pos, eventDigest)))
		}

		var left, right operation

		rightPos := pos.Right()
		if version < rightPos.Index { // go to left
			left = traverse(pos.Left()) // partial
			return newPartialInnerHashOp(pos, left)
		}

		// go to right
		left = newGetCacheOp(pos.Left())
		right = traverse(rightPos)

		if pos.LastDescendant().Index <= version { // freeze
			return newMutateOp(newPutCacheOp(newInnerHashOp(pos, left, right)))
		}
		return newInnerHashOp(pos, left, right)

	}

	return traverse(newRootPosition(version))
}
