fr.cenotelie.commons.lsp.engine.DocumentServiceProviderJava Maven / Gradle / Ivy

Go to download
/*******************************************************************************
 * Copyright (c) 2017 Association Cénotélie (cenotelie.fr)
 * This program is free software: you can redistribute it and/or modify
 * it under the terms of the GNU Lesser General Public License as
 * published by the Free Software Foundation, either version 3
 * of the License, or (at your option) any later version.
 *
 * This program 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 Lesser General Public License for more details.
 *
 * You should have received a copy of the GNU Lesser General
 * Public License along with this program.
 * If not, see .
 ******************************************************************************/

package fr.cenotelie.commons.lsp.engine;

import java.util.ServiceLoader;
import java.util.WeakHashMap;

/**
 * A provider of document service that uses Java service resolver to find services
 *
 * @author Laurent Wouters
 */
public class DocumentServiceProviderJava implements DocumentServiceProvider {
    /**
     * The map of the resolved services
     */
    private final WeakHashMap resolvedAnalyzers;
    /**
     * The Java service loader for the analyzers
     */
    private final ServiceLoader loader;

    /**
     * Initializes this provider
     *
     * @param serviceType The type of the resolve services
     */
    public DocumentServiceProviderJava(Class serviceType) {
        this.loader = ServiceLoader.load(serviceType);
        this.resolvedAnalyzers = new WeakHashMap<>();
    }

    @Override
    public T getService(Document document) {
        T best = resolvedAnalyzers.get(document);
        if (best != null)
            return best;

        int bestPriority = -1;

        for (T analyzer : loader) {
            int priority = analyzer.getPriorityFor(document);
            if (priority > bestPriority) {
                best = analyzer;
                bestPriority = priority;
            }
        }
        if (best != null)
            resolvedAnalyzers.put(document, best);
        return best;
    }
}