Expose Compute{Start,End}RespectingGranularity()

third_party/WebKit/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 199 matching lines @@
     base_is_first_ = true;
   } else if (extent_.IsNull()) {
     extent_ = base_;
     base_is_first_ = true;
   } else {
     base_is_first_ = base_.CompareTo(extent_) <= 0;
   }
 }
 
 template <typename Strategy>
-static PositionTemplate<Strategy> ComputeStartRespectingGranularity(
+static PositionTemplate<Strategy> ComputeStartRespectingGranularityAlgorithm(
     const PositionWithAffinityTemplate<Strategy>& passed_start,
     TextGranularity granularity) {
   DCHECK(passed_start.IsNotNull());
 
   switch (granularity) {
     case kCharacterGranularity:
       // Don't do any expansion.
       return passed_start.GetPosition();
     case kWordGranularity: {
       // General case: Select the word the caret is positioned inside of.
@@ skipping 38 matching lines @@
           .DeepEquivalent();
     case kSentenceBoundary:
       return StartOfSentence(CreateVisiblePosition(passed_start))
           .DeepEquivalent();
   }
 
   NOTREACHED();
   return passed_start.GetPosition();
 }
 
+static Position ComputeStartRespectingGranularity(
+    const PositionWithAffinity& start,
+    TextGranularity granularity) {
+  return ComputeStartRespectingGranularityAlgorithm(start, granularity);
+}
+
+PositionInFlatTree ComputeStartRespectingGranularity(
+    const PositionInFlatTreeWithAffinity& start,
+    TextGranularity granularity) {
+  return ComputeStartRespectingGranularityAlgorithm(start, granularity);
+}
+
 template <typename Strategy>
-static PositionTemplate<Strategy> ComputeEndRespectingGranularity(
+static PositionTemplate<Strategy> ComputeEndRespectingGranularityAlgorithm(
     const PositionTemplate<Strategy>& start,
     const PositionWithAffinityTemplate<Strategy>& passed_end,
     TextGranularity granularity) {
   DCHECK(passed_end.IsNotNull());
 
   switch (granularity) {
     case kCharacterGranularity:
       // Don't do any expansion.
       return passed_end.GetPosition();
     case kWordGranularity: {
@@ skipping 94 matching lines @@
       return EndOfDocument(CreateVisiblePosition(passed_end)).DeepEquivalent();
     case kParagraphBoundary:
       return EndOfParagraph(CreateVisiblePosition(passed_end)).DeepEquivalent();
     case kSentenceBoundary:
       return EndOfSentence(CreateVisiblePosition(passed_end)).DeepEquivalent();
   }
   NOTREACHED();
   return passed_end.GetPosition();
 }
 
+static Position ComputeEndRespectingGranularity(const Position& start,
+                                                const PositionWithAffinity& end,
+                                                TextGranularity granularity) {
+  return ComputeEndRespectingGranularityAlgorithm(start, end, granularity);
+}
+
+PositionInFlatTree ComputeEndRespectingGranularity(
+    const PositionInFlatTree& start,
+    const PositionInFlatTreeWithAffinity& end,
+    TextGranularity granularity) {
+  return ComputeEndRespectingGranularityAlgorithm(start, end, granularity);
+}
+
 template <typename Strategy>
 void VisibleSelectionTemplate<Strategy>::UpdateSelectionType() {
   selection_type_ = ComputeSelectionType(start_, end_);
 
   // Affinity only makes sense for a caret
   if (selection_type_ != kCaretSelection)
     affinity_ = TextAffinity::kDownstream;
 }
 
 template <typename Strategy>
@@ skipping 362 matching lines @@
 
 void showTree(const blink::VisibleSelectionInFlatTree& sel) {
   sel.ShowTreeForThis();
 }
 
 void showTree(const blink::VisibleSelectionInFlatTree* sel) {
   if (sel)
     sel->ShowTreeForThis();
 }
 #endif