| OLD | NEW |
| 1 /* | 1 /* |
| 2 * Copyright (C) 2013 Google Inc. All rights reserved. | 2 * Copyright (C) 2013 Google Inc. All rights reserved. |
| 3 * | 3 * |
| 4 * Redistribution and use in source and binary forms, with or without | 4 * Redistribution and use in source and binary forms, with or without |
| 5 * modification, are permitted provided that the following conditions are | 5 * modification, are permitted provided that the following conditions are |
| 6 * met: | 6 * met: |
| 7 * | 7 * |
| 8 * * Redistributions of source code must retain the above copyright | 8 * * Redistributions of source code must retain the above copyright |
| 9 * notice, this list of conditions and the following disclaimer. | 9 * notice, this list of conditions and the following disclaimer. |
| 10 * * Redistributions in binary form must reproduce the above | 10 * * Redistributions in binary form must reproduce the above |
| (...skipping 13 matching lines...) Expand all Loading... |
| 24 * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, | 24 * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, |
| 25 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY | 25 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY |
| 26 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT | 26 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT |
| 27 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE | 27 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE |
| 28 * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. | 28 * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
| 29 */ | 29 */ |
| 30 | 30 |
| 31 #ifndef GridArea_h | 31 #ifndef GridArea_h |
| 32 #define GridArea_h | 32 #define GridArea_h |
| 33 | 33 |
| 34 #include <algorithm> |
| 34 #include "core/style/GridPositionsResolver.h" | 35 #include "core/style/GridPositionsResolver.h" |
| 35 #include "wtf/Allocator.h" | 36 #include "wtf/Allocator.h" |
| 36 #include "wtf/HashMap.h" | 37 #include "wtf/HashMap.h" |
| 37 #include "wtf/MathExtras.h" | 38 #include "wtf/MathExtras.h" |
| 38 #include "wtf/text/WTFString.h" | 39 #include "wtf/text/WTFString.h" |
| 39 #include <algorithm> | |
| 40 | 40 |
| 41 namespace blink { | 41 namespace blink { |
| 42 | 42 |
| 43 // Recommended maximum size for both explicit and implicit grids. Note that this | 43 // Recommended maximum size for both explicit and implicit grids. Note that this |
| 44 // actually allows a [-9999,9999] range. The limit is low on purpouse because | 44 // actually allows a [-9999,9999] range. The limit is low on purpouse because |
| 45 // higher values easly trigger OOM situations. That will definitely improve once | 45 // higher values easly trigger OOM situations. That will definitely improve once |
| 46 // we switch from a vector of vectors based grid representation to a more | 46 // we switch from a vector of vectors based grid representation to a more |
| 47 // efficient one memory-wise. | 47 // efficient one memory-wise. |
| 48 const int kGridMaxTracks = 1000; | 48 const int kGridMaxTracks = 1000; |
| 49 | 49 |
| (...skipping 125 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 175 | 175 |
| 176 GridSpan columns; | 176 GridSpan columns; |
| 177 GridSpan rows; | 177 GridSpan rows; |
| 178 }; | 178 }; |
| 179 | 179 |
| 180 typedef HashMap<String, GridArea> NamedGridAreaMap; | 180 typedef HashMap<String, GridArea> NamedGridAreaMap; |
| 181 | 181 |
| 182 } // namespace blink | 182 } // namespace blink |
| 183 | 183 |
| 184 #endif // GridArea_h | 184 #endif // GridArea_h |
| OLD | NEW |