Example #1
0
		static void Erase(List<Tuple<uint, uint, byte[]>> sections, IFileSection s) {
			foreach (var sect in sections)
				if ((uint)s.StartOffset >= sect.Item1 && (uint)s.EndOffset < sect.Item2) {
					Erase(sect, (uint)s.StartOffset, (uint)(s.EndOffset - s.StartOffset));
					break;
				}
		}
 static void Erase(List <Tuple <uint, uint, byte[]> > sections, IFileSection s)
 {
     foreach (var sect in sections)
     {
         if ((uint)s.StartOffset >= sect.Item1 && (uint)s.EndOffset < sect.Item2)
         {
             Erase(sect, (uint)s.StartOffset, (uint)(s.EndOffset - s.StartOffset));
             break;
         }
     }
 }
Example #3
0
		bool Intersect(uint offset, uint length, IFileSection location) {
			return Intersect(offset, length, (uint)location.StartOffset, (uint)(location.EndOffset - location.StartOffset));
		}
Example #4
0
 bool Intersect(uint offset, uint length, IFileSection location) =>
 Intersect(offset, length, (uint)location.StartOffset, (uint)(location.EndOffset - location.StartOffset));
 bool intersect(uint offset, uint length, IFileSection location)
 {
     return(intersect(offset, length, (uint)location.StartOffset, (uint)(location.EndOffset - location.StartOffset)));
 }