/*
 * This file is licensed under the MIT License, part of Roughly Enough Items.
 * Copyright (c) 2018, 2019, 2020, 2021, 2022, 2023 shedaniel
 *
 * Permission is hereby granted, free of charge, to any person obtaining a copy
 * of this software and associated documentation files (the "Software"), to deal
 * in the Software without restriction, including without limitation the rights
 * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
 * copies of the Software, and to permit persons to whom the Software is
 * furnished to do so, subject to the following conditions:
 *
 * The above copyright notice and this permission notice shall be included in all
 * copies or substantial portions of the Software.
 *
 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
 * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
 * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
 * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
 * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
 * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
 * SOFTWARE.
 */

package me.shedaniel.rei.impl.client.search;

import com.google.common.base.Suppliers;
import me.shedaniel.rei.api.client.search.SearchFilter;
import me.shedaniel.rei.api.client.search.SearchProvider;
import me.shedaniel.rei.api.client.search.method.InputMethod;
import me.shedaniel.rei.api.common.entry.EntryStack;
import me.shedaniel.rei.api.common.util.CollectionUtils;
import me.shedaniel.rei.api.common.util.EntryStacks;
import me.shedaniel.rei.impl.client.search.argument.AlternativeArgument;
import me.shedaniel.rei.impl.client.search.argument.Argument;
import me.shedaniel.rei.impl.client.search.argument.CompoundArgument;
import me.shedaniel.rei.impl.client.search.argument.type.ArgumentType;
import me.shedaniel.rei.impl.common.InternalLogger;
import me.shedaniel.rei.impl.common.util.HashedEntryStackWrapper;

import java.util.Collection;
import java.util.List;
import java.util.Objects;
import java.util.function.Supplier;
import java.util.stream.Collectors;

public class SearchProviderImpl implements SearchProvider {
    @Override
    public void startReload() {
    }
    
    @Override
    public SearchFilter createFilter(String filter, InputMethod<?> inputMethod) {
        return new SearchFilterImpl(filter, inputMethod);
    }
    
    public static class SearchFilterImpl implements SearchFilter {
        private final String filter;
        private final InputMethod<?> inputMethod;
        private final Supplier<List<CompoundArgument>> arguments;
        private final Supplier<List<ArgumentType<?, ?>>> argumentTypes;
        
        public SearchFilterImpl(String filter, InputMethod<?> inputMethod) {
            this.filter = filter;
            this.inputMethod = inputMethod;
            this.arguments = Suppliers.memoize(() -> Argument.bakeArguments(filter));
            this.argumentTypes = Suppliers.memoize(() -> this.arguments.get().stream()
                    .flatMap(CompoundArgument::stream)
                    .flatMap(AlternativeArgument::stream)
                    .map(Argument::getArgument)
                    .distinct()
                    .collect(Collectors.toList()));
            InternalLogger.getInstance().debug("Created search filter with \"%s\" using %s", filter, inputMethod.getName().getString());
        }
        
        @Override
        public boolean test(EntryStack<?> stack, long hashExact) {
            try {
                return Argument.matches(stack, hashExact, arguments.get(), inputMethod);
            } catch (Throwable throwable) {
                throw new RuntimeException("Failed to test search filter: \"" + filter + "\" with stack [" + stack.getType().getIdentifier() + "@" + stack.getIdentifier() + "!" + stack.getValue() + "]", throwable);
            }
        }
        
        @Override
        public boolean test(EntryStack<?> stack) {
            return this.test(stack, EntryStacks.hashExact(stack));
        }
        
        @Override
        public void prepareFilter(Collection<EntryStack<?>> stacks) {
            Argument.cache.prepareFilter(CollectionUtils.map(stacks, HashedEntryStackWrapper::new), argumentTypes.get());
        }
        
        @Override
        public String getFilter() {
            return filter;
        }
        
        public List<ArgumentType<?, ?>> getArgumentTypes() {
            return argumentTypes.get();
        }
        
        @Override
        public boolean equals(Object o) {
            if (this == o) return true;
            if (o == null || getClass() != o.getClass()) return false;
            SearchFilterImpl that = (SearchFilterImpl) o;
            return Objects.equals(filter, that.filter);
        }
        
        @Override
        public int hashCode() {
            return Objects.hash(filter);
        }
    }
}