| OLD | NEW |
| 1 /* | 1 /* |
| 2 * Copyright (C) 1999 Lars Knoll (knoll@kde.org) | 2 * Copyright (C) 1999 Lars Knoll (knoll@kde.org) |
| 3 * (C) 2004-2005 Allan Sandfeld Jensen (kde@carewolf.com) | 3 * (C) 2004-2005 Allan Sandfeld Jensen (kde@carewolf.com) |
| 4 * Copyright (C) 2006, 2007 Nicholas Shanks (webkit@nickshanks.com) | 4 * Copyright (C) 2006, 2007 Nicholas Shanks (webkit@nickshanks.com) |
| 5 * Copyright (C) 2005, 2006, 2007, 2008, 2009, 2010, 2011 Apple Inc. All rights
reserved. | 5 * Copyright (C) 2005, 2006, 2007, 2008, 2009, 2010, 2011 Apple Inc. All rights
reserved. |
| 6 * Copyright (C) 2007 Alexey Proskuryakov <ap@webkit.org> | 6 * Copyright (C) 2007 Alexey Proskuryakov <ap@webkit.org> |
| 7 * Copyright (C) 2007, 2008 Eric Seidel <eric@webkit.org> | 7 * Copyright (C) 2007, 2008 Eric Seidel <eric@webkit.org> |
| 8 * Copyright (C) 2008, 2009 Torch Mobile Inc. All rights reserved. (http://www.t
orchmobile.com/) | 8 * Copyright (C) 2008, 2009 Torch Mobile Inc. All rights reserved. (http://www.t
orchmobile.com/) |
| 9 * Copyright (c) 2011, Code Aurora Forum. All rights reserved. | 9 * Copyright (c) 2011, Code Aurora Forum. All rights reserved. |
| 10 * Copyright (C) Research In Motion Limited 2011. All rights reserved. | 10 * Copyright (C) Research In Motion Limited 2011. All rights reserved. |
| (...skipping 28 matching lines...) Expand all Loading... |
| 39 class Document; | 39 class Document; |
| 40 | 40 |
| 41 class VisitedLinkState : public NoBaseWillBeGarbageCollectedFinalized<VisitedLin
kState> { | 41 class VisitedLinkState : public NoBaseWillBeGarbageCollectedFinalized<VisitedLin
kState> { |
| 42 USING_FAST_MALLOC_WILL_BE_REMOVED(VisitedLinkState); | 42 USING_FAST_MALLOC_WILL_BE_REMOVED(VisitedLinkState); |
| 43 public: | 43 public: |
| 44 static PassOwnPtrWillBeRawPtr<VisitedLinkState> create(const Document& docum
ent) | 44 static PassOwnPtrWillBeRawPtr<VisitedLinkState> create(const Document& docum
ent) |
| 45 { | 45 { |
| 46 return adoptPtrWillBeNoop(new VisitedLinkState(document)); | 46 return adoptPtrWillBeNoop(new VisitedLinkState(document)); |
| 47 } | 47 } |
| 48 | 48 |
| 49 void invalidateStyleForAllLinks(); | 49 void invalidateStyleForAllLinks(bool invalidateVisitedLinkHashes); |
| 50 void invalidateStyleForLink(LinkHash); | 50 void invalidateStyleForLink(LinkHash); |
| 51 | 51 |
| 52 EInsideLink determineLinkState(const Element& element) | 52 EInsideLink determineLinkState(const Element& element) |
| 53 { | 53 { |
| 54 if (element.isLink()) | 54 if (element.isLink()) |
| 55 return determineLinkStateSlowCase(element); | 55 return determineLinkStateSlowCase(element); |
| 56 return NotInsideLink; | 56 return NotInsideLink; |
| 57 } | 57 } |
| 58 | 58 |
| 59 DECLARE_TRACE(); | 59 DECLARE_TRACE(); |
| 60 | 60 |
| 61 private: | 61 private: |
| 62 explicit VisitedLinkState(const Document&); | 62 explicit VisitedLinkState(const Document&); |
| 63 const Document& document() const { return *m_document; } | 63 const Document& document() const { return *m_document; } |
| 64 | 64 |
| 65 EInsideLink determineLinkStateSlowCase(const Element&); | 65 EInsideLink determineLinkStateSlowCase(const Element&); |
| 66 | 66 |
| 67 RawPtrWillBeMember<const Document> m_document; | 67 RawPtrWillBeMember<const Document> m_document; |
| 68 HashSet<LinkHash, LinkHashHash> m_linksCheckedForVisitedState; | 68 HashSet<LinkHash, LinkHashHash> m_linksCheckedForVisitedState; |
| 69 }; | 69 }; |
| 70 | 70 |
| 71 } | 71 } |
| 72 | 72 |
| 73 #endif | 73 #endif |
| 74 | 74 |
| OLD | NEW |