ipld-eth-server/pkg/repositories/in_memory.go

package repositories

import (
	"github.com/8thlight/vulcanizedb/pkg/core"
)

type InMemory struct {
	blocks           map[int64]*core.Block
	watchedContracts map[string]*core.WatchedContract
}

func (repository *InMemory) CreateWatchedContract(watchedContract core.WatchedContract) error {
	repository.watchedContracts[watchedContract.Hash] = &watchedContract
	return nil
}

func (repository *InMemory) IsWatchedContract(contractHash string) bool {
	_, present := repository.watchedContracts[contractHash]
	return present
}

func (repository *InMemory) FindWatchedContract(contractHash string) *core.WatchedContract {
	var transactions []core.Transaction
	if _, ok := repository.watchedContracts[contractHash]; !ok {
		return nil
	}
	for _, block := range repository.blocks {
		for _, transaction := range block.Transactions {
			if transaction.To == contractHash {
				transactions = append(transactions, transaction)
			}
		}
	}
	return &core.WatchedContract{Hash: contractHash, Transactions: transactions}
}

func (repository *InMemory) MissingBlockNumbers(startingBlockNumber int64, endingBlockNumber int64) []int64 {
	missingNumbers := []int64{}
	for blockNumber := int64(startingBlockNumber); blockNumber <= endingBlockNumber; blockNumber++ {
		if repository.blocks[blockNumber] == nil {
			missingNumbers = append(missingNumbers, blockNumber)
		}
	}
	return missingNumbers
}

func NewInMemory() *InMemory {
	return &InMemory{
		blocks:           make(map[int64]*core.Block),
		watchedContracts: make(map[string]*core.WatchedContract),
	}
}

func (repository *InMemory) CreateBlock(block core.Block) error {
	repository.blocks[block.Number] = &block
	return nil
}

func (repository *InMemory) BlockCount() int {
	return len(repository.blocks)
}

func (repository *InMemory) FindBlockByNumber(blockNumber int64) *core.Block {
	return repository.blocks[blockNumber]
}

func (repository *InMemory) MaxBlockNumber() int64 {
	highestBlockNumber := int64(-1)
	for key := range repository.blocks {
		if key > highestBlockNumber {
			highestBlockNumber = key
		}
	}
	return highestBlockNumber
}