Util/ArrayFu.cs

   1 //
   2 // ArrayFu.cs
   3 //
   4 // Copyright (C) 2005 Novell, Inc.
   5 //
   6
   7 //
   8 // Permission is hereby granted, free of charge, to any person obtaining a copy
   9 // of this software and associated documentation files (the "Software"), to deal
  10 // in the Software without restriction, including without limitation the rights
  11 // to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
  12 // copies of the Software, and to permit persons to whom the Software is
  13 // furnished to do so, subject to the following conditions:
  14 //
  15 // The above copyright notice and this permission notice shall be included in all
  16 // copies or substantial portions of the Software.
  17 //
  18 // THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
  19 // IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
  20 // FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
  21 // AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
  22 // LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
  23 // OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
  24 // SOFTWARE.
  25 //
  26
  27 using System;
  28 using System.Collections;
  29 using System.Text;
  30
  31 namespace Beagle.Util {
  32
  33         public class ArrayFu {
  34
  35                 public static void IntersectListChanges (IList new_list,
  36                                                          IList old_list,
  37                                                          out IList added_list,
  38                                                          out IList removed_list)
  39                 {
  40                         added_list = new ArrayList ();
  41                         removed_list = new ArrayList (old_list);
  42
  43                         foreach (object obj in new_list) {
  44                                 if (old_list.Contains (obj)) {
  45                                         removed_list.Remove (obj);
  46                                 } else {
  47                                         added_list.Add (obj);
  48                                 }
  49                         }
  50                 }
  51
  52                 // This is designed to be used instead of Array.IndexOf as it reduces
  53                 // boxing and is therefore more efficient.
  54                 public static int IndexOfByte (byte [] array, byte target, int start)
  55                 {
  56                         for (int i = start; i < array.Length; ++i)
  57                                 if (array [i] == target)
  58                                         return i;
  59                         return -1;
  60                 }
  61
  62                 public static int IndexOfByte (byte [] array, byte target)
  63                 {
  64                         return IndexOfByte (array, target, 0);
  65                 }
  66
  67                 public static int IndexOfString (string [] array, string target, int start)
  68                 {
  69                         for (int i = start; i < array.Length; ++i)
  70                                 if (array [i] == target)
  71                                         return i;
  72                         return -1;
  73                 }
  74
  75                 public static int IndexOfString (string [] array, string target)
  76                 {
  77                         return IndexOfString (array, target, 0);
  78                 }
  79         }
  80 }