Rename ShadowRootType::OpenByDefault to ShadowRootType::V0.

third_party/WebKit/Source/core/editing/iterators/TextIterator.cpp

 /*
  * Copyright (C) 2004, 2005, 2006, 2007, 2008, 2009, 2010, 2012 Apple Inc. All rights reserved.
  * Copyright (C) 2005 Alexey Proskuryakov.
  *
  * 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
@@ skipping 267 matching lines @@
                 m_iterationProgress = m_iterationProgress < HandledNode ? HandledNode : m_iterationProgress;
                 m_handleShadowRoot = true;
             } else {
                 m_iterationProgress = HandledChildren;
             }
         } else {
             // Enter author shadow roots, from youngest, if any and if necessary.
             if (m_iterationProgress < HandledOpenShadowRoots) {
                 if (entersOpenShadowRoots() && m_node->isElementNode() && toElement(m_node)->openShadowRoot()) {
                     ShadowRoot* youngestShadowRoot = toElement(m_node)->openShadowRoot();
-                    ASSERT(youngestShadowRoot->type() == ShadowRootType::OpenByDefault || youngestShadowRoot->type() == ShadowRootType::Open);
+                    ASSERT(youngestShadowRoot->type() == ShadowRootType::V0 || youngestShadowRoot->type() == ShadowRootType::Open);
                     m_node = youngestShadowRoot;
                     m_iterationProgress = HandledNone;
                     ++m_shadowDepth;
                     m_fullyClippedStack.pushFullyClippedState(m_node);
                     continue;
                 }
 
                 m_iterationProgress = HandledOpenShadowRoots;
             }
 
@@ skipping 68 matching lines @@
 
                 if (!next && !parentNode && m_shadowDepth > 0) {
                     // 4. Reached the top of a shadow root. If it's created by author, then try to visit the next
                     // sibling shadow root, if any.
                     if (!m_node->isShadowRoot()) {
                         ASSERT_NOT_REACHED();
                         m_shouldStop = true;
                         return;
                     }
                     ShadowRoot* shadowRoot = toShadowRoot(m_node);
-                    if (shadowRoot->type() == ShadowRootType::OpenByDefault || shadowRoot->type() == ShadowRootType::Open) {
+                    if (shadowRoot->type() == ShadowRootType::V0 || shadowRoot->type() == ShadowRootType::Open) {
                         ShadowRoot* nextShadowRoot = shadowRoot->olderShadowRoot();
-                        if (nextShadowRoot && nextShadowRoot->type() == ShadowRootType::OpenByDefault) {
+                        if (nextShadowRoot && nextShadowRoot->type() == ShadowRootType::V0) {
                             m_fullyClippedStack.pop();
                             m_node = nextShadowRoot;
                             m_iterationProgress = HandledNone;
                             // m_shadowDepth is unchanged since we exit from a shadow root and enter another.
                             m_fullyClippedStack.pushFullyClippedState(m_node);
                         } else {
                             // We are the last shadow root; exit from here and go back to where we were.
                             m_node = shadowRoot->host();
                             m_iterationProgress = HandledOpenShadowRoots;
                             --m_shadowDepth;
@@ skipping 729 matching lines @@
 
 String plainText(const EphemeralRangeInComposedTree& range, TextIteratorBehaviorFlags behavior)
 {
     return createPlainText<EditingInComposedTreeStrategy>(range, behavior);
 }
 
 template class CORE_TEMPLATE_EXPORT TextIteratorAlgorithm<EditingStrategy>;
 template class CORE_TEMPLATE_EXPORT TextIteratorAlgorithm<EditingInComposedTreeStrategy>;
 
 } // namespace blink