mirror of
https://gitflic.ru/project/openide/openide.git
synced 2026-09-09 20:42:52 +07:00
IDEA-19061 Integrate the Rearranger-plugin into core-IDE
'Replace condition' operation is provided (e.g. for type change like 'from field to method')
This commit is contained in:
+38
-1
@@ -141,7 +141,7 @@ node = '4'()
|
||||
|
||||
@Test
|
||||
void replaceWithTwoLevelMergeToNodeBelow() {
|
||||
// Init.
|
||||
// Init.
|
||||
def from;
|
||||
def to;
|
||||
def initial = new TreeNodeBuilder().
|
||||
@@ -172,6 +172,43 @@ to = '3'()}
|
||||
assertNodesEqual(expected, initial)
|
||||
checkRowMappings([:], rowMappings)
|
||||
}
|
||||
|
||||
@Test
|
||||
void replaceFirstChildWithMergeBelow() {
|
||||
// Init.
|
||||
def from;
|
||||
def to;
|
||||
def initial = new TreeNodeBuilder().
|
||||
'0' {
|
||||
from = '1'() {
|
||||
to = '2'()}
|
||||
'3'() {
|
||||
'4'() }
|
||||
'1' {
|
||||
'5'()
|
||||
'6'()}
|
||||
}
|
||||
|
||||
// Modify.
|
||||
def replacement = new TreeNodeBuilder().
|
||||
'3' {
|
||||
'2'()
|
||||
}
|
||||
def rowMappings = doReplace(initial, from, to, replacement)
|
||||
|
||||
// Check.
|
||||
def expected = new TreeNodeBuilder().
|
||||
'0' {
|
||||
'3' {
|
||||
'2'()
|
||||
'4'()}
|
||||
'1' {
|
||||
'5'()
|
||||
'6'()}
|
||||
}
|
||||
assertNodesEqual(expected, initial)
|
||||
checkRowMappings([ 4 : 3, 5 : 4, 6 : 5, 7 : 6 ], rowMappings)
|
||||
}
|
||||
|
||||
@Test
|
||||
void addWithoutMergeAbove() {
|
||||
|
||||
+6
-6
@@ -39,7 +39,7 @@ public class ArrangementRuleEditingModelBuilderTest extends AbstractArrangementR
|
||||
assertTrue(model.hasCondition(STATIC));
|
||||
assertFalse(model.hasCondition(PRIVATE));
|
||||
assertEquals(1, myRoot.getChildCount());
|
||||
assertEquals(matchCondition, myRoot.getFirstChild().getBackingSetting());
|
||||
assertEquals(matchCondition, myRoot.getFirstChild().getBackingCondition());
|
||||
}
|
||||
|
||||
@Test
|
||||
@@ -51,11 +51,11 @@ public class ArrangementRuleEditingModelBuilderTest extends AbstractArrangementR
|
||||
|
||||
ArrangementTreeNode fieldUiNode = myRoot.getFirstChild();
|
||||
assertNotNull(fieldUiNode);
|
||||
assertEquals(atom(FIELD), fieldUiNode.getBackingSetting());
|
||||
assertEquals(atom(FIELD), fieldUiNode.getBackingCondition());
|
||||
|
||||
ArrangementTreeNode modifiersUiNode = fieldUiNode.getFirstChild();
|
||||
assertNotNull(modifiersUiNode);
|
||||
assertEquals(and(atom(PUBLIC), atom(STATIC)), modifiersUiNode.getBackingSetting());
|
||||
assertEquals(and(atom(PUBLIC), atom(STATIC)), modifiersUiNode.getBackingCondition());
|
||||
}
|
||||
|
||||
@Test
|
||||
@@ -67,14 +67,14 @@ public class ArrangementRuleEditingModelBuilderTest extends AbstractArrangementR
|
||||
|
||||
ArrangementTreeNode fieldUiNode = myRoot.getFirstChild();
|
||||
assertNotNull(fieldUiNode);
|
||||
assertEquals(atom(FIELD), fieldUiNode.getBackingSetting());
|
||||
assertEquals(atom(FIELD), fieldUiNode.getBackingCondition());
|
||||
|
||||
ArrangementTreeNode publicStaticUiNode = fieldUiNode.getFirstChild();
|
||||
assertNotNull(publicStaticUiNode);
|
||||
assertEquals(and(atom(PUBLIC), atom(STATIC)), publicStaticUiNode.getBackingSetting());
|
||||
assertEquals(and(atom(PUBLIC), atom(STATIC)), publicStaticUiNode.getBackingCondition());
|
||||
|
||||
ArrangementTreeNode privateUiNode = fieldUiNode.getLastChild();
|
||||
assertNotNull(privateUiNode);
|
||||
assertEquals(atom(PRIVATE), privateUiNode.getBackingSetting());
|
||||
assertEquals(atom(PRIVATE), privateUiNode.getBackingCondition());
|
||||
}
|
||||
}
|
||||
|
||||
+14
-14
@@ -40,7 +40,7 @@ public class ArrangementRuleEditingModelImplTest extends AbstractArrangementRule
|
||||
ArrangementTreeNode child = myRoot.getFirstChild();
|
||||
assertNotNull(child);
|
||||
ArrangementMatchCondition expectedMatchCondition = and(atom(PUBLIC), atom(STATIC));
|
||||
assertEquals(expectedMatchCondition, child.getBackingSetting());
|
||||
assertEquals(expectedMatchCondition, child.getBackingCondition());
|
||||
assertEquals(expectedMatchCondition, model.getMatchCondition());
|
||||
}
|
||||
|
||||
@@ -58,11 +58,11 @@ public class ArrangementRuleEditingModelImplTest extends AbstractArrangementRule
|
||||
|
||||
ArrangementTreeNode fieldNode = myRoot.getFirstChild();
|
||||
assertNotNull(fieldNode);
|
||||
assertEquals(atom(FIELD), fieldNode.getBackingSetting());
|
||||
assertEquals(atom(FIELD), fieldNode.getBackingCondition());
|
||||
|
||||
ArrangementTreeNode publicNode = fieldNode.getFirstChild();
|
||||
assertNotNull(publicNode);
|
||||
assertEquals(atom(PUBLIC), publicNode.getBackingSetting());
|
||||
assertEquals(atom(PUBLIC), publicNode.getBackingCondition());
|
||||
}
|
||||
|
||||
@Test
|
||||
@@ -80,11 +80,11 @@ public class ArrangementRuleEditingModelImplTest extends AbstractArrangementRule
|
||||
|
||||
ArrangementTreeNode fieldNode = myRoot.getFirstChild();
|
||||
assertNotNull(fieldNode);
|
||||
assertEquals(atom(FIELD), fieldNode.getBackingSetting());
|
||||
assertEquals(atom(FIELD), fieldNode.getBackingCondition());
|
||||
|
||||
ArrangementTreeNode modifiersNode = fieldNode.getFirstChild();
|
||||
assertNotNull(modifiersNode);
|
||||
assertEquals(and(atom(PUBLIC), atom(STATIC)), modifiersNode.getBackingSetting());
|
||||
assertEquals(and(atom(PUBLIC), atom(STATIC)), modifiersNode.getBackingCondition());
|
||||
}
|
||||
|
||||
@Test
|
||||
@@ -102,11 +102,11 @@ public class ArrangementRuleEditingModelImplTest extends AbstractArrangementRule
|
||||
|
||||
ArrangementTreeNode fieldNode = myRoot.getFirstChild();
|
||||
assertNotNull(fieldNode);
|
||||
assertEquals(atom(FIELD), fieldNode.getBackingSetting());
|
||||
assertEquals(atom(FIELD), fieldNode.getBackingCondition());
|
||||
|
||||
ArrangementTreeNode modifiersNode = fieldNode.getFirstChild();
|
||||
assertNotNull(modifiersNode);
|
||||
assertEquals(atom(STATIC), modifiersNode.getBackingSetting());
|
||||
assertEquals(atom(STATIC), modifiersNode.getBackingCondition());
|
||||
}
|
||||
|
||||
@Test
|
||||
@@ -123,7 +123,7 @@ public class ArrangementRuleEditingModelImplTest extends AbstractArrangementRule
|
||||
|
||||
ArrangementTreeNode fieldNode = myRoot.getFirstChild();
|
||||
assertNotNull(fieldNode);
|
||||
assertEquals(atom(FIELD), fieldNode.getBackingSetting());
|
||||
assertEquals(atom(FIELD), fieldNode.getBackingCondition());
|
||||
|
||||
assertEquals(0, fieldNode.getChildCount());
|
||||
}
|
||||
@@ -150,15 +150,15 @@ public class ArrangementRuleEditingModelImplTest extends AbstractArrangementRule
|
||||
|
||||
ArrangementTreeNode atomFieldNode = myRoot.getFirstChild();
|
||||
assertNotNull(atomFieldNode);
|
||||
assertEquals(atom(FIELD), atomFieldNode.getBackingSetting());
|
||||
assertEquals(atom(FIELD), atomFieldNode.getBackingCondition());
|
||||
|
||||
ArrangementTreeNode layeredFieldNode = atomFieldNode.getNextSibling();
|
||||
assertNotNull(atomFieldNode);
|
||||
assertEquals(atom(FIELD), atomFieldNode.getBackingSetting());
|
||||
assertEquals(atom(FIELD), atomFieldNode.getBackingCondition());
|
||||
|
||||
ArrangementTreeNode staticNode = layeredFieldNode.getFirstChild();
|
||||
assertNotNull(staticNode);
|
||||
assertEquals(atom(STATIC), staticNode.getBackingSetting());
|
||||
assertEquals(atom(STATIC), staticNode.getBackingCondition());
|
||||
}
|
||||
|
||||
@Test
|
||||
@@ -184,14 +184,14 @@ public class ArrangementRuleEditingModelImplTest extends AbstractArrangementRule
|
||||
|
||||
ArrangementTreeNode compositeFieldNode = myRoot.getFirstChild();
|
||||
assertNotNull(compositeFieldNode);
|
||||
assertEquals(atom(FIELD), compositeFieldNode.getBackingSetting());
|
||||
assertEquals(atom(FIELD), compositeFieldNode.getBackingCondition());
|
||||
|
||||
ArrangementTreeNode publicNode = compositeFieldNode.getFirstChild();
|
||||
assertNotNull(publicNode);
|
||||
assertEquals(atom(PUBLIC), publicNode.getBackingSetting());
|
||||
assertEquals(atom(PUBLIC), publicNode.getBackingCondition());
|
||||
|
||||
ArrangementTreeNode atomFieldNode = compositeFieldNode.getNextSibling();
|
||||
assertNotNull(atomFieldNode);
|
||||
assertEquals(atom(FIELD), atomFieldNode.getBackingSetting());
|
||||
assertEquals(atom(FIELD), atomFieldNode.getBackingCondition());
|
||||
}
|
||||
}
|
||||
|
||||
Reference in New Issue
Block a user