OLD | NEW |
1 // Copyright 2012 the V8 project authors. All rights reserved. | 1 // Copyright 2012 the V8 project authors. All rights reserved. |
2 // Redistribution and use in source and binary forms, with or without | 2 // Redistribution and use in source and binary forms, with or without |
3 // modification, are permitted provided that the following conditions are | 3 // modification, are permitted provided that the following conditions are |
4 // met: | 4 // met: |
5 // | 5 // |
6 // * Redistributions of source code must retain the above copyright | 6 // * Redistributions of source code must retain the above copyright |
7 // notice, this list of conditions and the following disclaimer. | 7 // notice, this list of conditions and the following disclaimer. |
8 // * Redistributions in binary form must reproduce the above | 8 // * Redistributions in binary form must reproduce the above |
9 // copyright notice, this list of conditions and the following | 9 // copyright notice, this list of conditions and the following |
10 // disclaimer in the documentation and/or other materials provided | 10 // disclaimer in the documentation and/or other materials provided |
(...skipping 64 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
75 int at_least_space_for); | 75 int at_least_space_for); |
76 | 76 |
77 Handle<NameDictionary> NewNameDictionary(int at_least_space_for); | 77 Handle<NameDictionary> NewNameDictionary(int at_least_space_for); |
78 | 78 |
79 Handle<ObjectHashSet> NewObjectHashSet(int at_least_space_for); | 79 Handle<ObjectHashSet> NewObjectHashSet(int at_least_space_for); |
80 | 80 |
81 Handle<ObjectHashTable> NewObjectHashTable( | 81 Handle<ObjectHashTable> NewObjectHashTable( |
82 int at_least_space_for, | 82 int at_least_space_for, |
83 MinimumCapacity capacity_option = USE_DEFAULT_MINIMUM_CAPACITY); | 83 MinimumCapacity capacity_option = USE_DEFAULT_MINIMUM_CAPACITY); |
84 | 84 |
| 85 Handle<OrderedHashSet> NewOrderedHashSet(); |
| 86 Handle<OrderedHashMap> NewOrderedHashMap(); |
| 87 |
85 Handle<WeakHashTable> NewWeakHashTable(int at_least_space_for); | 88 Handle<WeakHashTable> NewWeakHashTable(int at_least_space_for); |
86 | 89 |
87 Handle<DescriptorArray> NewDescriptorArray(int number_of_descriptors, | 90 Handle<DescriptorArray> NewDescriptorArray(int number_of_descriptors, |
88 int slack = 0); | 91 int slack = 0); |
89 Handle<DeoptimizationInputData> NewDeoptimizationInputData( | 92 Handle<DeoptimizationInputData> NewDeoptimizationInputData( |
90 int deopt_entry_count, | 93 int deopt_entry_count, |
91 PretenureFlag pretenure); | 94 PretenureFlag pretenure); |
92 Handle<DeoptimizationOutputData> NewDeoptimizationOutputData( | 95 Handle<DeoptimizationOutputData> NewDeoptimizationOutputData( |
93 int deopt_entry_count, | 96 int deopt_entry_count, |
94 PretenureFlag pretenure); | 97 PretenureFlag pretenure); |
(...skipping 537 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
632 isolate()); | 635 isolate()); |
633 } else { | 636 } else { |
634 return NewNumber(static_cast<double>(value), pretenure); | 637 return NewNumber(static_cast<double>(value), pretenure); |
635 } | 638 } |
636 } | 639 } |
637 | 640 |
638 | 641 |
639 } } // namespace v8::internal | 642 } } // namespace v8::internal |
640 | 643 |
641 #endif // V8_FACTORY_H_ | 644 #endif // V8_FACTORY_H_ |
OLD | NEW |