2 * Copyright (C) 2009 Apple Inc. All Rights Reserved.
4 * Redistribution and use in source and binary forms, with or without
5 * modification, are permitted provided that the following conditions
7 * 1. Redistributions of source code must retain the above copyright
8 * notice, this list of conditions and the following disclaimer.
9 * 2. Redistributions in binary form must reproduce the above copyright
10 * notice, this list of conditions and the following disclaimer in the
11 * documentation and/or other materials provided with the distribution.
13 * THIS SOFTWARE IS PROVIDED BY APPLE INC. ``AS IS'' AND ANY
14 * EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
15 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
16 * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL APPLE INC. OR
17 * CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
18 * EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
19 * PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
20 * PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY
21 * OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
22 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
23 * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
26 #ifndef DateInstanceCache_h
27 #define DateInstanceCache_h
29 #include <wtf/DateMath.h>
30 #include <wtf/HashFunctions.h>
31 #include <wtf/PassRefPtr.h>
32 #include <wtf/RefCounted.h>
36 class DateInstanceData : public RefCounted<DateInstanceData> {
38 static PassRefPtr<DateInstanceData> create() { return adoptRef(new DateInstanceData); }
40 double m_gregorianDateTimeCachedForMS;
41 GregorianDateTime m_cachedGregorianDateTime;
42 double m_gregorianDateTimeUTCCachedForMS;
43 GregorianDateTime m_cachedGregorianDateTimeUTC;
47 : m_gregorianDateTimeCachedForMS(std::numeric_limits<double>::quiet_NaN())
48 , m_gregorianDateTimeUTCCachedForMS(std::numeric_limits<double>::quiet_NaN())
53 class DateInstanceCache {
62 for (size_t i = 0; i < cacheSize; ++i)
63 m_cache[i].key = std::numeric_limits<double>::quiet_NaN();
66 DateInstanceData* add(double d)
68 CacheEntry& entry = lookup(d);
70 return entry.value.get();
73 entry.value = DateInstanceData::create();
74 return entry.value.get();
78 static const size_t cacheSize = 16;
82 RefPtr<DateInstanceData> value;
85 CacheEntry& lookup(double d) { return m_cache[WTF::FloatHash<double>::hash(d) & (cacheSize - 1)]; }
87 FixedArray<CacheEntry, cacheSize> m_cache;
92 #endif // DateInstanceCache_h