//
// Copyright (c) 2023-2025 Chakib Ben Ziane <contact@blob42.xyz> and [`GoSuki` contributors]
// (https://github.com/blob42/gosuki/graphs/contributors).
//
// All rights reserved.
//
// SPDX-License-Identifier: AGPL-3.0-or-later
//
// This file is part of GoSuki.
//
// GoSuki is free software: you can redistribute it and/or modify it under the terms of
// the GNU Affero General Public License as published by the Free Software Foundation,
// either version 3 of the License, or (at your option) any later version.
//
// GoSuki is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY;
// without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR
// PURPOSE.  See the GNU Affero General Public License for more details.
//
// You should have received a copy of the GNU Affero General Public License along with
// gosuki.  If not, see <http://www.gnu.org/licenses/>.

package index

import (
	"log"

	"github.com/OneOfOne/xxhash"
	"github.com/blob42/hashmap"
)

type HashTree = *hashmap.RBTree

// In memory index used for fast lookup of url->node pairs
// to quickly detect bookmark which changed when bookmarks are reloaded
// from browser on a watch event
// Input `in` must be of type []byte
// The index is a map of [urlhash]*Node
func xxHashFunc(in any) uint64 {
	input, ok := in.(string)
	if !ok {
		log.Panicf("wrong data type to hash, exptected string given %T", in)
	}
	sum := xxhash.ChecksumString64(input)
	//log.Debugf("Calculating hash of %s as %d", input, sum)
	return sum
}

// Returns  *hashmap.RBTree
func NewIndex() *hashmap.RBTree {
	return hashmap.New(xxHashFunc)
}
