| OLD | NEW |
| 1 // Copyright 2008 the V8 project authors. All rights reserved. | 1 // Copyright 2008 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 11 matching lines...) Expand all Loading... |
| 22 // LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, | 22 // LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, |
| 23 // DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY | 23 // DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY |
| 24 // THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT | 24 // THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT |
| 25 // (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE | 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. | 26 // OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
| 27 | 27 |
| 28 #include "v8.h" | 28 #include "v8.h" |
| 29 | 29 |
| 30 #include "dateparser.h" | 30 #include "dateparser.h" |
| 31 | 31 |
| 32 namespace v8 { namespace internal { | 32 namespace v8 { |
| 33 namespace internal { |
| 33 | 34 |
| 34 bool DateParser::DayComposer::Write(FixedArray* output) { | 35 bool DateParser::DayComposer::Write(FixedArray* output) { |
| 35 int year = 0; // Default year is 0 (=> 2000) for KJS compatibility. | 36 int year = 0; // Default year is 0 (=> 2000) for KJS compatibility. |
| 36 int month = kNone; | 37 int month = kNone; |
| 37 int day = kNone; | 38 int day = kNone; |
| 38 | 39 |
| 39 if (named_month_ == kNone) { | 40 if (named_month_ == kNone) { |
| 40 if (index_ < 2) return false; | 41 if (index_ < 2) return false; |
| 41 if (index_ == 3 && !IsDay(comp_[0])) { | 42 if (index_ == 3 && !IsDay(comp_[0])) { |
| 42 // YMD | 43 // YMD |
| (...skipping 133 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 176 if (j == kPrefixLength && | 177 if (j == kPrefixLength && |
| 177 (len <= kPrefixLength || array[i][kTypeOffset] == MONTH_NAME)) { | 178 (len <= kPrefixLength || array[i][kTypeOffset] == MONTH_NAME)) { |
| 178 return i; | 179 return i; |
| 179 } | 180 } |
| 180 } | 181 } |
| 181 return i; | 182 return i; |
| 182 } | 183 } |
| 183 | 184 |
| 184 | 185 |
| 185 } } // namespace v8::internal | 186 } } // namespace v8::internal |
| OLD | NEW |