SONAR-2934 Transitive accessor computation now supports recursive methods

2 files changed, 45 insertions, 0 deletions

diff --git a/plugins/sonar-squid-java-plugin/test-resources/bytecode/bin/properties/JavaBean.class b/plugins/sonar-squid-java-plugin/test-resources/bytecode/bin/properties/JavaBean.class
index 6c6d60868f0..1724b051e65 100644
--- a/plugins/sonar-squid-java-plugin/test-resources/bytecode/bin/properties/JavaBean.class
+++ b/plugins/sonar-squid-java-plugin/test-resources/bytecode/bin/properties/JavaBean.class
diff --git a/plugins/sonar-squid-java-plugin/test-resources/bytecode/src/properties/JavaBean.java b/plugins/sonar-squid-java-plugin/test-resources/bytecode/src/properties/JavaBean.java
index 4750fde8e08..ca2374734ed 100644
--- a/plugins/sonar-squid-java-plugin/test-resources/bytecode/src/properties/JavaBean.java
+++ b/plugins/sonar-squid-java-plugin/test-resources/bytecode/src/properties/JavaBean.java
@@ -9,6 +9,8 @@ public class JavaBean {
   ArrayList<String> firstNames = new ArrayList<String>();
   private static String staticMember;
   private String FirstName;
+  private int myIncrement = 1;
+  private int myDifferentIncrement = 2;
   
   public String getName() {
     return name;
@@ -68,4 +70,47 @@ public class JavaBean {
     return FirstName;
   }
   
+  public String getFirstNameAndOneArgument(String argument) {
+    return FirstName + " " + argument;
+  }
+  
+  public int recursiveAbs(int value) {
+    if (value < 0) {
+      return recursiveAbs(value + myIncrement);
+    } else return value;
+  }
+  
+  public int recursiveAbsNotAccessor(int value) {
+    if (value < 0) {
+      return recursiveAbs(value + myIncrement);
+    } else {
+      iShouldBeAStaticSetter();
+      return value;
+    }
+  }
+  
+  public int recursiveAbsSameIncrementA(int value) {
+    if (value < 0) {
+      return recursiveAbsSameIncrementB(value + myIncrement);
+    } else return value;
+  }
+  
+  public int recursiveAbsSameIncrementB(int value) {
+    if (value < 0) {
+      return recursiveAbsSameIncrementA(value + myIncrement);
+    } else return value;
+  }
+  
+  public int recursiveAbsDifferentIncrementA(int value) {
+    if (value < 0) {
+      return recursiveAbsDifferentIncrementB(value + myIncrement);
+    } else return value;
+  }
+  
+  public int recursiveAbsDifferentIncrementB(int value) {
+    if (value < 0) {
+      return recursiveAbsSameIncrementA(value + myDifferentIncrement);
+    } else return value;
+  }
+  
 }