OLD | NEW |
1 // Copyright 2006-2012 the V8 project authors. All rights reserved. | 1 // Copyright 2006-2012 the V8 project authors. All rights reserved. |
2 // Redistribution and use in source and binary forms, with or without | 2 // Use of this source code is governed by a BSD-style license that can be |
3 // modification, are permitted provided that the following conditions are | 3 // found in the LICENSE file. |
4 // met: | |
5 // | |
6 // * Redistributions of source code must retain the above copyright | |
7 // notice, this list of conditions and the following disclaimer. | |
8 // * Redistributions in binary form must reproduce the above | |
9 // copyright notice, this list of conditions and the following | |
10 // disclaimer in the documentation and/or other materials provided | |
11 // with the distribution. | |
12 // * Neither the name of Google Inc. nor the names of its | |
13 // contributors may be used to endorse or promote products derived | |
14 // from this software without specific prior written permission. | |
15 // | |
16 // THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS | |
17 // "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT | |
18 // LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR | |
19 // A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT | |
20 // OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, | |
21 // SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT | |
22 // LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, | |
23 // DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY | |
24 // THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT | |
25 // (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE | |
26 // OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. | |
27 | 4 |
28 // Handle id counters. | 5 // Handle id counters. |
29 var next_handle_ = 0; | 6 var next_handle_ = 0; |
30 var next_transient_handle_ = -1; | 7 var next_transient_handle_ = -1; |
31 | 8 |
32 // Mirror cache. | 9 // Mirror cache. |
33 var mirror_cache_ = []; | 10 var mirror_cache_ = []; |
34 | 11 |
35 | 12 |
36 /** | 13 /** |
(...skipping 2702 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
2739 } | 2716 } |
2740 if (!NUMBER_IS_FINITE(value)) { | 2717 if (!NUMBER_IS_FINITE(value)) { |
2741 if (value > 0) { | 2718 if (value > 0) { |
2742 return 'Infinity'; | 2719 return 'Infinity'; |
2743 } else { | 2720 } else { |
2744 return '-Infinity'; | 2721 return '-Infinity'; |
2745 } | 2722 } |
2746 } | 2723 } |
2747 return value; | 2724 return value; |
2748 } | 2725 } |
OLD | NEW |