Base/Extensions.cs
1 //
2 // Copyright (c) Microsoft. All rights reserved.
3 // Licensed under the MIT license.
4 //
5 // Microsoft Bot Framework: http://botframework.com
6 //
7 // Bot Builder SDK GitHub:
8 // https://github.com/Microsoft/BotBuilder
9 //
10 // Copyright (c) Microsoft Corporation
11 // All rights reserved.
12 //
13 // MIT License:
14 // Permission is hereby granted, free of charge, to any person obtaining
15 // a copy of this software and associated documentation files (the
16 // "Software"), to deal in the Software without restriction, including
17 // without limitation the rights to use, copy, modify, merge, publish,
18 // distribute, sublicense, and/or sell copies of the Software, and to
19 // permit persons to whom the Software is furnished to do so, subject to
20 // the following conditions:
21 //
22 // The above copyright notice and this permission notice shall be
23 // included in all copies or substantial portions of the Software.
24 //
25 // THE SOFTWARE IS PROVIDED ""AS IS"", WITHOUT WARRANTY OF ANY KIND,
26 // EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
27 // MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
28 // NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE
29 // LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
30 // OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
31 // WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
32 //
33 
34 using System;
35 using System.Collections.Generic;
36 using System.Linq;
37 using System.Runtime.Serialization;
38 
39 namespace Microsoft.Bot.Builder.Dialogs.Internals
40 {
41  public static partial class Extensions
42  {
43  public static T MaxBy<T, R>(this IEnumerable<T> items, Func<T, R> selectRank, IComparer<R> comparer = null)
44  {
45  comparer = comparer ?? Comparer<R>.Default;
46 
47  var bestItem = default(T);
48  var bestRank = default(R);
49  using (var item = items.GetEnumerator())
50  {
51  if (item.MoveNext())
52  {
53  bestItem = item.Current;
54  bestRank = selectRank(item.Current);
55  }
56 
57  while (item.MoveNext())
58  {
59  var rank = selectRank(item.Current);
60  var compare = comparer.Compare(rank, bestRank);
61  if (compare > 0)
62  {
63  bestItem = item.Current;
64  bestRank = rank;
65  }
66  }
67  }
68 
69  return bestItem;
70  }
71  }
72 }
73 
74 namespace Microsoft.Bot.Builder.Internals.Fibers
75 {
76  public static partial class Extensions
77  {
78  public static void Push<T>(this IList<T> stack, T item)
79  {
80  stack.Add(item);
81  }
82 
83  public static T Pop<T>(this List<T> stack)
84  {
85  var top = stack.Peek();
86  stack.RemoveAt(stack.Count - 1);
87  return top;
88  }
89 
90  public static T Peek<T>(this IReadOnlyList<T> stack)
91  {
92  if (stack.Count == 0)
93  {
94  throw new InvalidOperationException("Stack is empty");
95  }
96 
97  return stack[stack.Count - 1];
98  }
99 
100  public static T GetValue<T>(this SerializationInfo info, string name)
101  {
102  return (T)info.GetValue(name, typeof(T));
103  }
104 
105  public static V GetOrAdd<K, V>(this IDictionary<K, V> valueByKey, K key, Func<K, V> make)
106  {
107  V value;
108  if (!valueByKey.TryGetValue(key, out value))
109  {
110  value = make(key);
111  valueByKey.Add(key, value);
112  }
113 
114  return value;
115  }
116 
117  public static bool Equals<T>(this IReadOnlyList<T> one, IReadOnlyList<T> two, IEqualityComparer<T> comparer)
118  {
119  if (object.Equals(one, two))
120  {
121  return true;
122  }
123 
124  if (one.Count != two.Count)
125  {
126  return false;
127  }
128 
129  for (int index = 0; index < one.Count; ++index)
130  {
131  if (!comparer.Equals(one[index], two[index]))
132  {
133  return false;
134  }
135  }
136 
137  return true;
138  }
139 
140  public static IReadOnlyList<R> ToList<T, R>(this IReadOnlyList<T> source, Func<T, R> selector)
141  {
142  var count = source.Count;
143  var target = new R[count];
144  for (int index = 0; index < count; ++index)
145  {
146  target[index] = selector(source[index]);
147  }
148 
149  return target;
150  }
151  }
152 }