// newBinTree initializes the binTree structure. The capacity defines
// the size of the buffer and defines the maximum distance for which
// matches will be found.
newBinTree initializes the binTree structure. The capacity defines
the size of the buffer and defines the maximum distance for which
matches will be found.
// newBinTree initializes the binTree structure . The capacity defines // the size of the buffer and defines the maximum distance for which // matches will be found .
func newBinTree(capacity int) (t *binTree, err error) {
	if capacity < 1 {
		return nil, errors.New(
			"newBinTree: capacity must be larger than zero")
	}
	if int64(capacity) >= int64(null) {
		return nil, errors.New(
			"newBinTree: capacity must less 2^{32}-1")
	}
	t = &binTree{
		node: make([]node, capacity),
		hoff: -int64(wordLen),
		root: null,
		data: make([]byte, maxMatchLen),
	}
	return t, nil
}
func newBinTree ( capacity int ) ( t * binTree , err error ) { if capacity < 1 { return nil , errors . New ( " " ) } if int64 ( capacity ) >= int64 ( null ) { return nil , errors . New ( " " ) } t = & binTree { node : make ( [ ] node , capacity ) , hoff : - int64 ( wordLen ) , root : null , data : make ( [ ] byte , maxMatchLen ) , } return t , nil }
newBinTree initializes the binTree structure.
newBinTree initializes the binTree structure .