1 | #region License Information
|
---|
2 | /* SimSharp - A .NET port of SimPy, discrete event simulation framework
|
---|
3 | Copyright (C) Heuristic and Evolutionary Algorithms Laboratory (HEAL)
|
---|
4 |
|
---|
5 | This program is free software: you can redistribute it and/or modify
|
---|
6 | it under the terms of the GNU General Public License as published by
|
---|
7 | the Free Software Foundation, either version 3 of the License, or
|
---|
8 | (at your option) any later version.
|
---|
9 |
|
---|
10 | This program is distributed in the hope that it will be useful,
|
---|
11 | but WITHOUT ANY WARRANTY; without even the implied warranty of
|
---|
12 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
---|
13 | GNU General Public License for more details.
|
---|
14 |
|
---|
15 | You should have received a copy of the GNU General Public License
|
---|
16 | along with this program. If not, see <http://www.gnu.org/licenses/>.*/
|
---|
17 | #endregion
|
---|
18 |
|
---|
19 | using System;
|
---|
20 | using System.Collections.Generic;
|
---|
21 | using System.Linq;
|
---|
22 |
|
---|
23 | namespace SimSharp {
|
---|
24 | public static class Extensions {
|
---|
25 | public static IEnumerable<T> MaxItems<T>(this IEnumerable<T> source, Func<T, IComparable> selector) {
|
---|
26 | var enumerator = source.GetEnumerator();
|
---|
27 | if (!enumerator.MoveNext()) return Enumerable.Empty<T>();
|
---|
28 | var item = enumerator.Current;
|
---|
29 | var max = selector(item);
|
---|
30 | var result = new List<T> { item };
|
---|
31 |
|
---|
32 | while (enumerator.MoveNext()) {
|
---|
33 | item = enumerator.Current;
|
---|
34 | var comparable = selector(item);
|
---|
35 | var comparison = comparable.CompareTo(max);
|
---|
36 | if (comparison > 0) {
|
---|
37 | result.Clear();
|
---|
38 | result.Add(item);
|
---|
39 | max = comparable;
|
---|
40 | } else if (comparison == 0) {
|
---|
41 | result.Add(item);
|
---|
42 | }
|
---|
43 | }
|
---|
44 | return result;
|
---|
45 | }
|
---|
46 | }
|
---|
47 | }
|
---|