| OLD | NEW |
| 1 // Copyright 2014 The Chromium Authors. All rights reserved. | 1 // Copyright 2014 The Chromium Authors. All rights reserved. |
| 2 // Use of this source code is governed by a BSD-style license that can be | 2 // Use of this source code is governed by a BSD-style license that can be |
| 3 // found in the LICENSE file. | 3 // found in the LICENSE file. |
| 4 | 4 |
| 5 #include <stddef.h> | 5 #include <stddef.h> |
| 6 | 6 |
| 7 #include <set> | 7 #include <set> |
| 8 #include <vector> | 8 #include <vector> |
| 9 | 9 |
| 10 #include "base/logging.h" | 10 #include "base/logging.h" |
| (...skipping 2040 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 2051 target_tree->effect_tree.Node(target_tree->effect_id_to_index_map[id]); | 2051 target_tree->effect_tree.Node(target_tree->effect_id_to_index_map[id]); |
| 2052 float source_opacity = source_effect_node->data.opacity; | 2052 float source_opacity = source_effect_node->data.opacity; |
| 2053 float target_opacity = target_effect_node->data.opacity; | 2053 float target_opacity = target_effect_node->data.opacity; |
| 2054 if (source_opacity == target_opacity) | 2054 if (source_opacity == target_opacity) |
| 2055 continue; | 2055 continue; |
| 2056 target_effect_node->data.opacity = source_opacity; | 2056 target_effect_node->data.opacity = source_opacity; |
| 2057 target_tree->effect_tree.set_needs_update(true); | 2057 target_tree->effect_tree.set_needs_update(true); |
| 2058 } | 2058 } |
| 2059 } | 2059 } |
| 2060 | 2060 |
| 2061 bool PropertyTrees::IsInIdToIndexMap(TreeType tree_type, int id) { |
| 2062 std::unordered_map<int, int>* id_to_index_map = nullptr; |
| 2063 switch (tree_type) { |
| 2064 case TRANSFORM: |
| 2065 id_to_index_map = &transform_id_to_index_map; |
| 2066 break; |
| 2067 case EFFECT: |
| 2068 id_to_index_map = &effect_id_to_index_map; |
| 2069 break; |
| 2070 case CLIP: |
| 2071 id_to_index_map = &clip_id_to_index_map; |
| 2072 break; |
| 2073 case SCROLL: |
| 2074 id_to_index_map = &scroll_id_to_index_map; |
| 2075 break; |
| 2076 } |
| 2077 return id_to_index_map->find(id) != id_to_index_map->end(); |
| 2078 } |
| 2079 |
| 2061 void PropertyTrees::UpdateChangeTracking() { | 2080 void PropertyTrees::UpdateChangeTracking() { |
| 2062 for (int id = 1; id < static_cast<int>(effect_tree.size()); ++id) { | 2081 for (int id = 1; id < static_cast<int>(effect_tree.size()); ++id) { |
| 2063 EffectNode* node = effect_tree.Node(id); | 2082 EffectNode* node = effect_tree.Node(id); |
| 2064 EffectNode* parent_node = effect_tree.parent(node); | 2083 EffectNode* parent_node = effect_tree.parent(node); |
| 2065 effect_tree.UpdateEffectChanged(node, parent_node); | 2084 effect_tree.UpdateEffectChanged(node, parent_node); |
| 2066 } | 2085 } |
| 2067 for (int i = 1; i < static_cast<int>(transform_tree.size()); ++i) { | 2086 for (int i = 1; i < static_cast<int>(transform_tree.size()); ++i) { |
| 2068 TransformNode* node = transform_tree.Node(i); | 2087 TransformNode* node = transform_tree.Node(i); |
| 2069 TransformNode* parent_node = transform_tree.parent(node); | 2088 TransformNode* parent_node = transform_tree.parent(node); |
| 2070 TransformNode* source_node = transform_tree.Node(node->data.source_node_id); | 2089 TransformNode* source_node = transform_tree.Node(node->data.source_node_id); |
| (...skipping 57 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 2128 value->EndDictionary(); | 2147 value->EndDictionary(); |
| 2129 | 2148 |
| 2130 value->BeginDictionary("scroll_tree"); | 2149 value->BeginDictionary("scroll_tree"); |
| 2131 scroll_tree.AsValueInto(value.get()); | 2150 scroll_tree.AsValueInto(value.get()); |
| 2132 value->EndDictionary(); | 2151 value->EndDictionary(); |
| 2133 | 2152 |
| 2134 return value; | 2153 return value; |
| 2135 } | 2154 } |
| 2136 | 2155 |
| 2137 } // namespace cc | 2156 } // namespace cc |
| OLD | NEW |