Source/core/dom/shadow/ContentDistribution.h - Issue 947393002: InlinedVisitor: Migrate dom to use inlined tracing

Side by Side Diff

Use n/p to move between diff chunks; N/P to move between comments. Draft comments are only viewable by you.

Keyboard Shortcuts

	File
u :	up to issue
j / k :	jump to file after / before current file
J / K :	jump to next file with a comment after / before current file
	Side-by-side diff
i :	toggle intra-line diffs
e :	expand all comments
c :	collapse all comments
s :	toggle showing all comments
n / p :	next / previous diff chunk or comment
N / P :	next / previous comment
<Up> / <Down> :	next / previous line

	Issue
u :	up to list of issues
j / k :	jump to patch after / before current patch
o / <Enter> :	open current patch in side-by-side view
i :	open current patch in unified diff view

	Issue List
j / k :	jump to issue after / before current issue
o / <Enter> :	open current issue

Side by Side Diff: Source/core/dom/shadow/ContentDistribution.h

Issue 947393002: InlinedVisitor: Migrate dom to use inlined tracing (Closed) Base URL: svn://svn.chromium.org/blink/trunk

Patch Set: Created 5 years, 10 months ago

Use n/p to move between diff chunks; N/P to move between comments. Draft comments are only viewable by you.

Jump to:

View unified diff | Download patch | Annotate | Revision Log

« Source/core/dom/Text.cpp ('K') | « Source/core/dom/custom/CustomElementUpgradeCandidateMap.cpp ('k') | Source/core/dom/shadow/ContentDistribution.cpp » ('j') | no next file with comments »

OLD	NEW
1 /*	1 /*

2 * Copyright (C) 2013 Google Inc. All rights reserved.	2 * Copyright (C) 2013 Google Inc. All rights reserved.

3 *	3 *

4 * Redistribution and use in source and binary forms, with or without	4 * Redistribution and use in source and binary forms, with or without

5 * modification, are permitted provided that the following conditions are	5 * modification, are permitted provided that the following conditions are

6 * met:	6 * met:

7 *	7 *

8 * * Redistributions of source code must retain the above copyright	8 * * Redistributions of source code must retain the above copyright

9 * notice, this list of conditions and the following disclaimer.	9 * notice, this list of conditions and the following disclaimer.

10 * * Redistributions in binary form must reproduce the above	10 * * Redistributions in binary form must reproduce the above

(...skipping 44 matching lines...) Expand 10 before \| Expand all \| Expand 10 after Loading...
55	55

56 bool contains(const Node* node) const { return m_indices.contains(node); }	56 bool contains(const Node* node) const { return m_indices.contains(node); }

57 size_t find(const Node*) const;	57 size_t find(const Node*) const;

58 Node* nextTo(const Node*) const;	58 Node* nextTo(const Node*) const;

59 Node* previousTo(const Node*) const;	59 Node* previousTo(const Node*) const;

60	60

61 void swap(ContentDistribution& other);	61 void swap(ContentDistribution& other);

62	62

63 const WillBeHeapVector<RefPtrWillBeMember<Node> >& nodes() const { return m_ nodes; }	63 const WillBeHeapVector<RefPtrWillBeMember<Node> >& nodes() const { return m_ nodes; }

64	64

65 void trace(Visitor*);	65 DECLARE_TRACE();

66	66

67 private:	67 private:

68 WillBeHeapVector<RefPtrWillBeMember<Node> > m_nodes;	68 WillBeHeapVector<RefPtrWillBeMember<Node> > m_nodes;

69 WillBeHeapHashMap<RawPtrWillBeMember<const Node>, size_t> m_indices;	69 WillBeHeapHashMap<RawPtrWillBeMember<const Node>, size_t> m_indices;

70 };	70 };

71	71

72 }	72 }

73	73

74 #endif	74 #endif

OLD	NEW