Skip to content

Commit

Permalink
Correct spelling
Browse files Browse the repository at this point in the history
Closes #11154

Signed-off-by: Anton Klaren <anton.klaren@neotechnology.com>
  • Loading branch information
jsoref authored and klaren committed Jun 28, 2018
1 parent 1c412b6 commit 9b8f729
Show file tree
Hide file tree
Showing 287 changed files with 600 additions and 600 deletions.
Expand Up @@ -509,7 +509,7 @@ public void callResetEvenThoughAlreadyClosed() throws Throwable
statementProcessor.run( "RETURN 1", EMPTY_PARAMS );
assertThat( statementProcessor.ctx.currentTransaction, notNullValue() );

// Then, when we close again we should make sure the transaction is closed againg
// Then, when we close again we should make sure the transaction is closed again
machine.close();
assertThat( statementProcessor.ctx.currentTransaction, nullValue() );
}
Expand Down
Expand Up @@ -233,9 +233,9 @@ public MethodDeclaration erased()
newExceptions[i] = erase( exceptions[i], table );
}
String newName = name();
boolean newIsConstrucor = isConstructor();
boolean newIsConstructor = isConstructor();

return methodDeclaration( owner, newReturnType, newParameters, newExceptions, newName, newIsConstrucor,
return methodDeclaration( owner, newReturnType, newParameters, newExceptions, newName, newIsConstructor,
modifiers, typeParameters );
}

Expand Down Expand Up @@ -290,14 +290,14 @@ public TypeReference superBound()

private static MethodDeclaration methodDeclaration( TypeReference owner, final TypeReference returnType,
final Parameter[] parameters, final TypeReference[] exceptions, final String name,
final boolean isConstrucor, int modifiers, TypeParameter[] typeParameters )
final boolean isConstructor, int modifiers, TypeParameter[] typeParameters )
{
return new MethodDeclaration( owner, parameters, exceptions, modifiers, typeParameters )
{
@Override
public boolean isConstructor()
{
return isConstrucor;
return isConstructor;
}

@Override
Expand Down
Expand Up @@ -164,7 +164,7 @@ public Builder put( ExpressionTemplate target, TypeReference fieldType, String f
return this;
}

public Builder modiferes( int modifiers )
public Builder modifiers( int modifiers )
{
this.modifiers = modifiers;
return this;
Expand Down
Expand Up @@ -349,7 +349,7 @@ protected boolean isAssignableFrom( Type target, Type value )
protected boolean isSubTypeOf( BasicValue value, BasicValue expected )
{
return super.isSubTypeOf( value, expected ) || check
.invokableInterface( expected.getType(), value.getType() );
.invocableInterface( expected.getType(), value.getType() );
}

private static Type superClass( ClassNode clazz )
Expand Down Expand Up @@ -383,7 +383,7 @@ private static class AssignmentChecker
}
}

boolean invokableInterface( Type target, Type value )
boolean invocableInterface( Type target, Type value )
{
// this method allows a bit too much through,
// it really ought to only be used for the target type of INVOKEINTERFACE,
Expand Down
Expand Up @@ -65,7 +65,7 @@ void lazySingletonSupplierShouldOnlyRequestInstanceWhenRequired()
}

@Test
void adapedSupplierShouldOnlyCallAdaptorOnceForEachNewInstance()
void adaptedSupplierShouldOnlyCallAdaptorOnceForEachNewInstance()
{
Object o1 = new Object();
Object o1a = new Object();
Expand Down
Expand Up @@ -105,7 +105,7 @@ void castLongToShort()
}

@Test
void castIntToUnsighedShort()
void castIntToUnsignedShort()
{
assertEquals(1, safeCastIntToUnsignedShort( 1 ));
assertEquals(10, safeCastIntToUnsignedShort( 10 ));
Expand Down
Expand Up @@ -110,7 +110,7 @@ protected static <T> void expect( Iterable<? extends T> items,

if ( !expected.isEmpty() )
{
fail( "The exepected elements " + expected + " were not returned." );
fail( "The expected elements " + expected + " were not returned." );
}
}
}
Expand Up @@ -52,7 +52,7 @@ public TestDijkstra()
MyRelTypes.R1 );
}

protected class TestIterator extends Dijkstra<Double>.DijstraIterator
protected class TestIterator extends Dijkstra<Double>.DijkstraIterator
{
public TestIterator( Node startNode,
HashMap<Node,List<Relationship>> predecessors,
Expand Down Expand Up @@ -82,7 +82,7 @@ public void runTest()
HashMap<Node,Double> seen2 = new HashMap<>();
HashMap<Node,Double> dists1 = new HashMap<>();
HashMap<Node,Double> dists2 = new HashMap<>();
DijstraIterator iter1 = new TestIterator( graph.getNode( "start" ),
DijkstraIterator iter1 = new TestIterator( graph.getNode( "start" ),
predecessors1, seen1, seen2, dists1, dists2, false );
// while ( iter1.hasNext() && !limitReached() && !iter1.isDone() )
assertTrue( iter1.next().equals( graph.getNode( "start" ) ) );
Expand Down
Expand Up @@ -105,7 +105,7 @@ public void testDijkstraChain()
* /--2--A--7--B--2--\ S E \----7---C---7----/
*/
@Test
public void testDijstraTraverserMeeting()
public void testDijkstraTraverserMeeting()
{
graph.makeEdge( "s", "c", "cost", (double) 7 );
graph.makeEdge( "c", "e", "cost", (float) 7 );
Expand Down
Expand Up @@ -191,7 +191,7 @@ private static class Sabotage
@Override
public String toString()
{
return "Sabotabed " + before + " --> " + after + ", other relationship " + other;
return "Sabotaged " + before + " --> " + after + ", other relationship " + other;
}
}

Expand Down
Expand Up @@ -73,7 +73,7 @@
import org.neo4j.kernel.api.labelscan.LabelScanStore;
import org.neo4j.kernel.api.labelscan.LabelScanWriter;
import org.neo4j.kernel.api.labelscan.NodeLabelUpdate;
import org.neo4j.kernel.api.schema.constaints.ConstraintDescriptorFactory;
import org.neo4j.kernel.api.schema.constraints.ConstraintDescriptorFactory;
import org.neo4j.kernel.api.schema.index.StoreIndexDescriptor;
import org.neo4j.kernel.configuration.Config;
import org.neo4j.kernel.impl.annotations.Documented;
Expand Down
Expand Up @@ -50,7 +50,7 @@ public void tearDown()
}

@Test
public void collections_in_collections_look_aiight()
public void collections_in_collections_look_alright()
{
Result result = db.execute( "CREATE (n:TheNode) RETURN [[ [1,2],[3,4] ],[[5,6]]] as x" );
Map<String, Object> next = result.next();
Expand Down
Expand Up @@ -208,7 +208,7 @@ public void shouldNotNotifyUsingJoinHintWithCost()
{
for ( String query : queries )
{
assertNotifications( version + query, containsNoItem( joinHintUnsuportedWarning ) );
assertNotifications( version + query, containsNoItem( joinHintUnsupportedWarning ) );
}
} );
}
Expand Down Expand Up @@ -581,11 +581,11 @@ public void shouldWarnOnFutureAmbiguousRelTypeSeparator()
@Test
public void shouldWarnOnBindingVariableLengthRelationship()
{
assertNotifications( "CYPHER 3.5 explain MATCH ()-[rs*]-() RETURN rs", containsItem( depracatedBindingWarning
assertNotifications( "CYPHER 3.5 explain MATCH ()-[rs*]-() RETURN rs", containsItem( deprecatedBindingWarning
) );

assertNotifications( "CYPHER 3.5 explain MATCH p = ()-[*]-() RETURN relationships(p) AS rs", containsNoItem(
depracatedBindingWarning ) );
deprecatedBindingWarning ) );
}

@Test
Expand Down Expand Up @@ -657,7 +657,7 @@ public void shouldWarnOnMissingLabelWithCommentInBeginningOnOneLine()
}

@Test
public void shouldWarnOnMissingLabelWithCommentInMiddel()
public void shouldWarnOnMissingLabelWithCommentInMiddle()
{
assertNotifications( "EXPLAIN\nMATCH (n)\n//TESTING \nMATCH (n:X)\nreturn n Limit 1", containsItem( unknownLabelWarning ) );
}
Expand Down Expand Up @@ -998,7 +998,7 @@ public Stream<ChangedResults> changedProc()
notification( "Neo.ClientNotification.Statement.FeatureDeprecationWarning", containsString( "The query used a deprecated field from a procedure." ),
any( InputPosition.class ), SeverityLevel.WARNING );

private Matcher<Notification> depracatedBindingWarning = notification( "Neo.ClientNotification.Statement.FeatureDeprecationWarning",
private Matcher<Notification> deprecatedBindingWarning = notification( "Neo.ClientNotification.Statement.FeatureDeprecationWarning",
containsString( "Binding relationships to a list in a variable length pattern is deprecated." ), any( InputPosition.class ),
SeverityLevel.WARNING );

Expand Down Expand Up @@ -1029,7 +1029,7 @@ public Stream<ChangedResults> changedProc()
containsString( "Using a dynamic property makes it impossible to use an index lookup for this query" ), any( InputPosition.class ),
SeverityLevel.WARNING );

private Matcher<Notification> joinHintUnsuportedWarning = notification( "Neo.Status.Statement.JoinHintUnsupportedWarning",
private Matcher<Notification> joinHintUnsupportedWarning = notification( "Neo.Status.Statement.JoinHintUnsupportedWarning",
containsString( "Using RULE planner is unsupported for queries with join hints, please use COST planner instead" ), any( InputPosition.class ),
SeverityLevel.WARNING );
}
Expand Up @@ -36,7 +36,7 @@ import scala.collection.JavaConverters._
This test fixture tries to assert that Pipe declaring that they are lazy
in fact are lazy. Every Pipe should be represented here
*/
class PipeLazynessTest extends GraphDatabaseFunSuite with QueryStateTestSupport {
class PipeLazinessTest extends GraphDatabaseFunSuite with QueryStateTestSupport {

test("test") {
distinctPipe.!!()
Expand Down
Expand Up @@ -2142,7 +2142,7 @@ private void verifyRelationships( List<RelationshipDataLine> relationships )
Node endNode = nodesById.get( relationship.endNodeId );
if ( startNode == null || endNode == null )
{
// OK this is a relationship refering to a missing node, skip it
// OK this is a relationship referring to a missing node, skip it
continue;
}
assertNotNull( relationship.toString(), findRelationship( startNode, endNode, relationship ) );
Expand Down
Expand Up @@ -34,7 +34,7 @@
import org.neo4j.kernel.api.KernelTransaction;
import org.neo4j.kernel.api.exceptions.index.IndexEntryConflictException;
import org.neo4j.kernel.api.exceptions.schema.UniquePropertyValueValidationException;
import org.neo4j.kernel.api.schema.constaints.ConstraintDescriptorFactory;
import org.neo4j.kernel.api.schema.constraints.ConstraintDescriptorFactory;
import org.neo4j.kernel.api.schema.index.IndexDescriptor;
import org.neo4j.kernel.api.schema.index.TestIndexDescriptorFactory;
import org.neo4j.kernel.impl.core.ThreadToStatementContextBridge;
Expand Down
Expand Up @@ -412,7 +412,7 @@ public void shouldRetrieveMultipleNodesWithSameValueFromIndex()
}

@Test
public void shouldThrowWhenMulitpleResultsForSingleNode()
public void shouldThrowWhenMultipleResultsForSingleNode()
{
// given
GraphDatabaseService graph = dbRule.getGraphDatabaseAPI();
Expand Down
Expand Up @@ -354,7 +354,7 @@ public void testDefaultIsOff()
}

@Test
public void testDefaulIfOffIsForEverything()
public void testDefaultIfOffIsForEverything()
{
graphDb.index().getNodeAutoIndexer().setEnabled( true );
newTransaction();
Expand Down
Expand Up @@ -23,7 +23,7 @@
import org.neo4j.internal.kernel.api.schema.LabelSchemaDescriptor;
import org.neo4j.internal.kernel.api.schema.constraints.ConstraintDescriptor;
import org.neo4j.kernel.api.schema.SchemaDescriptorFactory;
import org.neo4j.kernel.api.schema.constaints.ConstraintDescriptorFactory;
import org.neo4j.kernel.api.schema.constraints.ConstraintDescriptorFactory;

public class ConstraintTest extends ConstraintTestBase<WriteTestSupport>
{
Expand Down
Expand Up @@ -208,7 +208,7 @@ public void shouldHandleLargeAmountsOfNodesAddedAndRemovedInSameTx()
for ( int l = labelsToAdd - 1; l >= labelsToRemove; l-- )
{
Label label = label( "Label-" + l );
assertThat( "Should have founnd node when looking for label " + label,
assertThat( "Should have found node when looking for label " + label,
single( db.findNodes( label ) ), equalTo( node ) );
}
}
Expand Down
Expand Up @@ -56,7 +56,7 @@ protected void configure( GraphDatabaseFactory databaseFactory )
};

@Test
public void shouldTimeoutWatingForIndexToComeOnline()
public void shouldTimeoutWaitingForIndexToComeOnline()
{
// given
GraphDatabaseService db = rule.getGraphDatabaseAPI();
Expand Down Expand Up @@ -91,7 +91,7 @@ public void shouldTimeoutWatingForIndexToComeOnline()
}

@Test
public void shouldTimeoutWatingForAllIndexesToComeOnline()
public void shouldTimeoutWaitingForAllIndexesToComeOnline()
{
// given
GraphDatabaseService db = rule.getGraphDatabaseAPI();
Expand Down
Expand Up @@ -263,13 +263,13 @@ public void recoverNotAFirstCorruptedTransactionMultipleFilesNoCheckpoints() thr
{
GraphDatabaseAPI database = (GraphDatabaseAPI) databaseFactory.newEmbeddedDatabase( storeDir );
TransactionIdStore transactionIdStore = getTransactionIdStore( database );
long lastClosedTrandactionBeforeStart = transactionIdStore.getLastClosedTransactionId();
long lastClosedTransactionBeforeStart = transactionIdStore.getLastClosedTransactionId();
generateTransactionsAndRotate( database, 3 );
for ( int i = 0; i < 7; i++ )
{
generateTransaction( database );
}
long numberOfTransactions = transactionIdStore.getLastClosedTransactionId() - lastClosedTrandactionBeforeStart;
long numberOfTransactions = transactionIdStore.getLastClosedTransactionId() - lastClosedTransactionBeforeStart;
database.shutdown();

LogFiles logFiles = buildDefaultLogFiles();
Expand Down
Expand Up @@ -42,7 +42,7 @@
import org.neo4j.internal.kernel.api.NodeValueIndexCursor;
import org.neo4j.internal.kernel.api.Write;
import org.neo4j.internal.kernel.api.exceptions.KernelException;
import org.neo4j.kernel.api.schema.constaints.ConstraintDescriptorFactory;
import org.neo4j.kernel.api.schema.constraints.ConstraintDescriptorFactory;
import org.neo4j.kernel.api.schema.index.IndexDescriptor;
import org.neo4j.kernel.api.schema.index.TestIndexDescriptorFactory;
import org.neo4j.kernel.impl.core.ThreadToStatementContextBridge;
Expand Down
Expand Up @@ -85,7 +85,7 @@ public UniqueConstraintCompatibility( IndexProviderCompatibilityTestSuite testSu
*
* Further more, indexes that are POPULATING have two ways of ingesting data:
* - Through add()'ing existing data
* - Through NodePropertyUpdates sent to a "populating udpater"
* - Through NodePropertyUpdates sent to a "populating updater"
*
* Then, when we add data to an index, two outcomes are possible, depending on the
* data:
Expand Down Expand Up @@ -114,7 +114,7 @@ public UniqueConstraintCompatibility( IndexProviderCompatibilityTestSuite testSu
*
* All in all, we have many cases to test for!
*
* Still, it is possible to boild things down a little bit, because there are fewer
* Still, it is possible to boil things down a little bit, because there are fewer
* outcomes than there are scenarios that lead to those outcomes. With a bit of
* luck, we can abstract over the scenarios that lead to those outcomes, and then
* only write a test per outcome. These are the outcomes I see:
Expand Down Expand Up @@ -403,7 +403,7 @@ public void onlineConstraintShouldAcceptUniqueEntryChanges()
transaction( assertLookupNode( "a1", is( a ) ) );
}

// Replaces UniqueIAC: shoouldRejectEntriesInSameTransactionWithDuplicateIndexedValue\
// Replaces UniqueIAC: shouldRejectEntriesInSameTransactionWithDuplicateIndexedValue\
@Test( expected = ConstraintViolationException.class )
public void onlineConstraintShouldRejectDuplicateEntriesAddedInSameTransaction()
{
Expand Down
Expand Up @@ -46,7 +46,7 @@
import org.neo4j.internal.kernel.api.schema.LabelSchemaDescriptor;
import org.neo4j.kernel.api.index.NodePropertyAccessor;
import org.neo4j.kernel.api.schema.SchemaDescriptorFactory;
import org.neo4j.kernel.api.schema.constaints.IndexBackedConstraintDescriptor;
import org.neo4j.kernel.api.schema.constraints.IndexBackedConstraintDescriptor;
import org.neo4j.kernel.api.schema.index.IndexDescriptor;
import org.neo4j.kernel.impl.api.integrationtest.KernelIntegrationTest;
import org.neo4j.kernel.impl.api.state.ConstraintIndexCreator;
Expand Down
Expand Up @@ -39,7 +39,7 @@
import org.neo4j.internal.kernel.api.security.LoginContext;
import org.neo4j.kernel.api.KernelTransaction;
import org.neo4j.kernel.api.exceptions.schema.UniquePropertyValueValidationException;
import org.neo4j.kernel.api.schema.constaints.ConstraintDescriptorFactory;
import org.neo4j.kernel.api.schema.constraints.ConstraintDescriptorFactory;
import org.neo4j.kernel.internal.GraphDatabaseAPI;
import org.neo4j.test.rule.ImpermanentDatabaseRule;
import org.neo4j.values.storable.Values;
Expand Down
Expand Up @@ -158,7 +158,7 @@ public void txReturnsCorrectIdWhenMarkedForTermination() throws Exception
}

@Test
public void txReturnsCorrectIdWhenFailedlAndMarkedForTermination() throws Exception
public void txReturnsCorrectIdWhenFailedAndMarkedForTermination() throws Exception
{
executeDummyTxs( db, 42 );

Expand Down
Expand Up @@ -41,7 +41,7 @@
public class TransactionHookIT extends KernelIntegrationTest
{
@Test
public void shouldRecieveTxStateOnCommit() throws Exception
public void shouldReceiveTxStateOnCommit() throws Exception
{
// Given
TransactionHook hook = mock( TransactionHook.class );
Expand Down
Expand Up @@ -319,15 +319,15 @@ public void testNodeGetProperties()
try
{
node1.getProperty( key1 );
fail( "get non existing property din't throw exception" );
fail( "get non existing property didn't throw exception" );
}
catch ( NotFoundException ignored )
{
}
try
{
node1.getProperty( null );
fail( "get of null key din't throw exception" );
fail( "get of null key didn't throw exception" );
}
catch ( IllegalArgumentException ignored )
{
Expand Down

0 comments on commit 9b8f729

Please sign in to comment.