From 9e291cdec361a9d49adf6da953913f0ce676f9b7 Mon Sep 17 00:00:00 2001
From: Sébastien Lesaint <sebastien.lesaint@sonarsource.com>
Date: Tue, 24 May 2016 12:48:25 +0200
Subject: remove use of Guava's Objects.equal

---
 .../java/org/sonar/duplications/detector/suffixtree/SuffixTree.java  | 4 ++--
 .../org/sonar/duplications/detector/suffixtree/StringSuffixTree.java | 5 ++---
 2 files changed, 4 insertions(+), 5 deletions(-)

(limited to 'sonar-duplications/src')

diff --git a/sonar-duplications/src/main/java/org/sonar/duplications/detector/suffixtree/SuffixTree.java b/sonar-duplications/src/main/java/org/sonar/duplications/detector/suffixtree/SuffixTree.java
index fc0975dd87d..9d97443a8bc 100644
--- a/sonar-duplications/src/main/java/org/sonar/duplications/detector/suffixtree/SuffixTree.java
+++ b/sonar-duplications/src/main/java/org/sonar/duplications/detector/suffixtree/SuffixTree.java
@@ -19,7 +19,7 @@
  */
 package org.sonar.duplications.detector.suffixtree;
 
-import com.google.common.base.Objects;
+import java.util.Objects;
 
 /**
  * Provides algorithm to construct suffix tree.
@@ -80,7 +80,7 @@ public final class SuffixTree {
         // implicit node, a little more complicated
         edge = active.getOriginNode().findEdge(symbolAt(active.getBeginIndex()));
         int span = active.getSpan();
-        if (Objects.equal(symbolAt(edge.getBeginIndex() + span + 1), symbolAt(endIndex))) {
+        if (Objects.equals(symbolAt(edge.getBeginIndex() + span + 1), symbolAt(endIndex))) {
           break;
         }
         parentNode = edge.splitEdge(active);
diff --git a/sonar-duplications/src/test/java/org/sonar/duplications/detector/suffixtree/StringSuffixTree.java b/sonar-duplications/src/test/java/org/sonar/duplications/detector/suffixtree/StringSuffixTree.java
index b18954a87d2..38f01553b3d 100644
--- a/sonar-duplications/src/test/java/org/sonar/duplications/detector/suffixtree/StringSuffixTree.java
+++ b/sonar-duplications/src/test/java/org/sonar/duplications/detector/suffixtree/StringSuffixTree.java
@@ -19,9 +19,8 @@
  */
 package org.sonar.duplications.detector.suffixtree;
 
-import com.google.common.base.Objects;
-
 import java.util.LinkedList;
+import java.util.Objects;
 import java.util.Queue;
 
 public class StringSuffixTree {
@@ -113,7 +112,7 @@ public class StringSuffixTree {
         if (i == str.length()) {
           break;
         }
-        if (!Objects.equal(tree.symbolAt(j), str.symbolAt(i))) {
+        if (!Objects.equals(tree.symbolAt(j), str.symbolAt(i))) {
           return -1;
         }
         i++;
-- 
cgit v1.2.3