Reflow comments in core/css/invalidation.

third_party/WebKit/Source/core/css/invalidation/InvalidationSet.h

 /*
  * Copyright (C) 2014 Google 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:
  *
  *     * Redistributions of source code must retain the above copyright
  * notice, this list of conditions and the following disclaimer.
  *     * Redistributions in binary form must reproduce the above
@@ skipping 36 matching lines @@
 class TracedValue;
 
 enum InvalidationType { InvalidateDescendants, InvalidateSiblings };
 
 // Tracks data to determine which descendants in a DOM subtree, or
 // siblings and their descendants, need to have style recalculated.
 //
 // Some example invalidation sets:
 //
 // .z {}
-//   For class z we will have a DescendantInvalidationSet with invalidatesSelf (the element itself is invalidated).
+//   For class z we will have a DescendantInvalidationSet with invalidatesSelf
+//   (the element itself is invalidated).
 //
 // .y .z {}
 //   For class y we will have a DescendantInvalidationSet containing class z.
 //
 // .x ~ .z {}
-//   For class x we will have a SiblingInvalidationSet containing class z, with invalidatesSelf (the sibling itself is invalidated).
+//   For class x we will have a SiblingInvalidationSet containing class z, with
+//   invalidatesSelf (the sibling itself is invalidated).
 //
 // .w ~ .y .z {}
-//   For class w we will have a SiblingInvalidationSet containing class y, with the SiblingInvalidationSet havings siblingDescendants containing class z.
+//   For class w we will have a SiblingInvalidationSet containing class y, with
+//   the SiblingInvalidationSet havings siblingDescendants containing class z.
 //
 // .v * {}
-//   For class v we will have a DescendantInvalidationSet with wholeSubtreeInvalid.
+//   For class v we will have a DescendantInvalidationSet with
+//   wholeSubtreeInvalid.
 //
 // .u ~ * {}
-//   For class u we will have a SiblingInvalidationSet with wholeSubtreeInvalid and invalidatesSelf (for all siblings, the sibling itself is invalidated).
+//   For class u we will have a SiblingInvalidationSet with wholeSubtreeInvalid
+//   and invalidatesSelf (for all siblings, the sibling itself is invalidated).
 //
 // .t .v, .t ~ .z {}
-//   For class t we will have a SiblingInvalidationSet containing class z, with the SiblingInvalidationSet also holding descendants containing class v.
+//   For class t we will have a SiblingInvalidationSet containing class z, with
+//   the SiblingInvalidationSet also holding descendants containing class v.
 //
 // We avoid virtual functions to minimize space consumption.
 class CORE_EXPORT InvalidationSet {
   WTF_MAKE_NONCOPYABLE(InvalidationSet);
   USING_FAST_MALLOC_WITH_TYPE_NAME(blink::InvalidationSet);
 
  public:
   InvalidationType type() const {
     return static_cast<InvalidationType>(m_type);
   }
@@ skipping 94 matching lines @@
   int m_refCount;
 
   // FIXME: optimize this if it becomes a memory issue.
   std::unique_ptr<HashSet<AtomicString>> m_classes;
   std::unique_ptr<HashSet<AtomicString>> m_ids;
   std::unique_ptr<HashSet<AtomicString>> m_tagNames;
   std::unique_ptr<HashSet<AtomicString>> m_attributes;
 
   unsigned m_type : 1;
 
-  // If true, all descendants might be invalidated, so a full subtree recalc is required.
+  // If true, all descendants might be invalidated, so a full subtree recalc is
+  // required.
   unsigned m_allDescendantsMightBeInvalid : 1;
 
   // If true, the element or sibling itself is invalid.
   unsigned m_invalidatesSelf : 1;
 
-  // If true, all descendants which are custom pseudo elements must be invalidated.
+  // If true, all descendants which are custom pseudo elements must be
+  // invalidated.
   unsigned m_customPseudoInvalid : 1;
 
   // If true, the invalidation must traverse into ShadowRoots with this set.
   unsigned m_treeBoundaryCrossing : 1;
 
   // If true, insertion point descendants must be invalidated.
   unsigned m_insertionPointCrossing : 1;
 
   // If true, distributed nodes of <slot> elements need to be invalidated.
   unsigned m_invalidatesSlotted : 1;
@@ skipping 66 matching lines @@
                   value.isDescendantInvalidationSet());
 DEFINE_TYPE_CASTS(SiblingInvalidationSet,
                   InvalidationSet,
                   value,
                   value->isSiblingInvalidationSet(),
                   value.isSiblingInvalidationSet());
 
 }  // namespace blink
 
 #endif  // InvalidationSet_h