| OLD | NEW |
| 1 // Copyright 2011 the V8 project authors. All rights reserved. | 1 // Copyright 2011 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 65 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 76 CHECK_EQ(table->Lookup(*key), *value); | 76 CHECK_EQ(table->Lookup(*key), *value); |
| 77 } | 77 } |
| 78 | 78 |
| 79 // Keys never added to the map should not be found. | 79 // Keys never added to the map should not be found. |
| 80 for (int i = 0; i < 1000; i++) { | 80 for (int i = 0; i < 1000; i++) { |
| 81 Handle<JSObject> o = FACTORY->NewJSArray(100); | 81 Handle<JSObject> o = FACTORY->NewJSArray(100); |
| 82 CHECK_EQ(table->FindEntry(*o), ObjectHashTable::kNotFound); | 82 CHECK_EQ(table->FindEntry(*o), ObjectHashTable::kNotFound); |
| 83 CHECK_EQ(table->Lookup(*o), HEAP->undefined_value()); | 83 CHECK_EQ(table->Lookup(*o), HEAP->undefined_value()); |
| 84 } | 84 } |
| 85 } | 85 } |
| OLD | NEW |