Make follow the same pattern for equalSelections() in VisibleSelection.

Source/core/editing/VisibleSelection.cpp

 /*
  * Copyright (C) 2004, 2005, 2006 Apple Computer, Inc.  All rights reserved.
  *
  * Redistribution and use in source and binary forms, with or without
  * modification, are permitted provided that the following conditions
  * are met:
  * 1. Redistributions of source code must retain the above copyright
  *    notice, this list of conditions and the following disclaimer.
  * 2. Redistributions in binary form must reproduce the above copyright
  *    notice, this list of conditions and the following disclaimer in the
@@ skipping 1120 matching lines @@
 EphemeralRange VisibleSelection::InDOMTree::asRange(const VisibleSelection& selection)
 {
     return EphemeralRange(selectionStart(selection), selectionEnd(selection));
 }
 
 EphemeralRangeInComposedTree VisibleSelection::InComposedTree::asRange(const VisibleSelection& selection)
 {
     return EphemeralRangeInComposedTree(selectionStart(selection), selectionEnd(selection));
 }
 
-bool VisibleSelection::InDOMTree::equalSelections(const VisibleSelection& selection1, const VisibleSelection& selection2)
+template <typename Strategy>
+static bool equalSelectionsAlgorithm(const VisibleSelection& selection1, const VisibleSelection& selection2)
 {
     if (selection1.affinity() != selection2.affinity() || selection1.isDirectional() != selection2.isDirectional())
         return false;
 
     if (selection1.isNone())
         return selection2.isNone();
 
-    return selection1.start() == selection2.start() && selection1.end() == selection2.end() && selection1.affinity() == selection2.affinity()
-        && selection1.isDirectional() == selection2.isDirectional() && selection1.base() == selection2.base() && selection1.extent() == selection2.extent();
+    return Strategy::selectionStart(selection1) == Strategy::selectionStart(selection2)
+        && Strategy::selectionEnd(selection1) == Strategy::selectionEnd(selection2)
+        && Strategy::selectionBase(selection1) == Strategy::selectionBase(selection2)
+        && Strategy::selectionExtent(selection1) == Strategy::selectionExtent(selection2);
 }
 
-bool VisibleSelection::InComposedTree::equalSelections(const VisibleSelection& a, const VisibleSelection& b)
+bool VisibleSelection::InDOMTree::equalSelections(const VisibleSelection& selection1, const VisibleSelection& selection2)
 {
-    return a.startInComposedTree() == b.startInComposedTree() && a.endInComposedTree() == b.endInComposedTree() && a.affinity() == b.affinity() && a.isBaseFirst() == b.isBaseFirst() && a.isDirectional() == b.isDirectional();
+    return equalSelectionsAlgorithm<InDOMTree>(selection1, selection2);
+}
+
+bool VisibleSelection::InComposedTree::equalSelections(const VisibleSelection& selection1, const VisibleSelection& selection2)
+{
+    return equalSelectionsAlgorithm<InComposedTree>(selection1, selection2);
 }
 
 #ifndef NDEBUG
 
 void VisibleSelection::debugPosition(const char* message) const
 {
     fprintf(stderr, "VisibleSelection (%s) ===============\n", message);
 
     if (m_baseIsFirst) {
         m_start.debugPosition("start: ");
@@ skipping 66 matching lines @@
     sel.showTreeForThis();
 }
 
 void showTree(const blink::VisibleSelection* sel)
 {
     if (sel)
         sel->showTreeForThis();
 }
 
 #endif