net/quic/core/interval.h - Issue 2193073003: Move shared files in net/quic/ into net/quic/core/

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: net/quic/core/interval.h

Issue 2193073003: Move shared files in net/quic/ into net/quic/core/ (Closed) Base URL: https://chromium.googlesource.com/chromium/src.git@master

Patch Set: io_thread_unittest.cc Created 4 years, 4 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

« no previous file with comments | « net/quic/core/crypto/strike_register_test.cc ('k') | net/quic/core/interval_set.h » ('j') | no next file with comments »

OLD	NEW
1 // Copyright 2015 The Chromium Authors. All rights reserved.	1 // Copyright 2015 The Chromium Authors. All rights reserved.

2 // Use of this source code is governed by a BSD-style license that can be	2 // Use of this source code is governed by a BSD-style license that can be

3 // found in the LICENSE file.	3 // found in the LICENSE file.

4 //	4 //

5 // An Interval<T> is a data structure used to represent a contiguous, mutable	5 // An Interval<T> is a data structure used to represent a contiguous, mutable

6 // range over an ordered type T. Supported operations include testing a value to	6 // range over an ordered type T. Supported operations include testing a value to

7 // see whether it is included in the interval, comparing two intervals, and	7 // see whether it is included in the interval, comparing two intervals, and

8 // performing their union, intersection, and difference. For the purposes of	8 // performing their union, intersection, and difference. For the purposes of

9 // this library, an "ordered type" is any type that induces a total order on its	9 // this library, an "ordered type" is any type that induces a total order on its

10 // values via its less-than operator (operator<()). Examples of such types are	10 // values via its less-than operator (operator<()). Examples of such types are

(...skipping 342 matching lines...) Expand 10 before \| Expand all \| Expand 10 after Loading...
353 // Intersection is <this>, so difference yields the empty interval.	353 // Intersection is <this>, so difference yields the empty interval.

354 return true;	354 return true;

355 }	355 }

356 lo = this; // No intersection.	356 lo = this; // No intersection.

357 return false;	357 return false;

358 }	358 }

359	359

360 } // namespace net	360 } // namespace net

361	361

362 #endif // NET_QUIC_INTERVAL_H_	362 #endif // NET_QUIC_INTERVAL_H_

OLD	NEW