Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Update store migration to remove schema and label indexes as part of …
…3.0 migration. Lucene 5.x does not support existent 3.x indexes, so as part of migration we will remove all old indexes, so they will be rebuild. Restore all ignored upgrage tests. Current path are only valid for schema and label indexes, legacy indexes will be addressed in a separate commit.
- Loading branch information
1 parent
6fd8ea2
commit b369359
Showing
31 changed files
with
370 additions
and
423 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
63 changes: 63 additions & 0 deletions
63
.../kernel/src/main/java/org/neo4j/kernel/extension/dependency/HighestSelectionStrategy.java
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Original file line | Diff line number | Diff line change |
---|---|---|---|
@@ -0,0 +1,63 @@ | |||
/* | |||
* Copyright (c) 2002-2015 "Neo Technology," | |||
* Network Engine for Objects in Lund AB [http://neotechnology.com] | |||
* | |||
* This file is part of Neo4j. | |||
* | |||
* Neo4j is free software: you can redistribute it and/or modify | |||
* it under the terms of the GNU 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 General Public License for more details. | |||
* | |||
* You should have received a copy of the GNU General Public License | |||
* along with this program. If not, see <http://www.gnu.org/licenses/>. | |||
*/ | |||
package org.neo4j.kernel.extension.dependency; | |||
|
|||
import java.util.Collections; | |||
import java.util.List; | |||
|
|||
import org.neo4j.graphdb.DependencyResolver; | |||
import org.neo4j.helpers.collection.Iterables; | |||
import org.neo4j.kernel.extension.KernelExtensions; | |||
|
|||
import static org.neo4j.kernel.extension.KernelExtensionUtil.servicesClassPathEntryInformation; | |||
|
|||
/** | |||
* SelectionStrategy for {@link KernelExtensions kernel extensions loading} where the one with highest | |||
* natural order will be selected. If there are no such stores then an {@link IllegalStateException} will be | |||
* thrown. | |||
* | |||
* @see Comparable | |||
*/ | |||
public class HighestSelectionStrategy implements DependencyResolver.SelectionStrategy | |||
{ | |||
private static final DependencyResolver.SelectionStrategy instance = new HighestSelectionStrategy(); | |||
|
|||
public static DependencyResolver.SelectionStrategy getInstance() | |||
{ | |||
return instance; | |||
} | |||
|
|||
private HighestSelectionStrategy() | |||
{ | |||
} | |||
|
|||
public <T> T select( Class<T> type, Iterable<T> candidates ) | |||
throws IllegalArgumentException | |||
{ | |||
List<Comparable> all = (List<Comparable>) Iterables.toList( candidates ); | |||
if ( all.isEmpty() ) | |||
{ | |||
throw new IllegalArgumentException( "Could not resolve dependency of type: " + | |||
type.getName() + ". " + servicesClassPathEntryInformation() ); | |||
} | |||
Collections.sort( all ); | |||
return (T) all.get( all.size() - 1 ); | |||
} | |||
} |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Oops, something went wrong.