public void ChildRemove(DatBase datItem)
{
int count = _children.Count;
for (int i = 0; i < count; i++)
{
if (_children[i] != datItem)
continue;
_children.RemoveAt(i);
if (DatFileType != DatFileType.UnSet)
return;
for (int j = 0; j < count; j++)
{
if (_childrenNameIndex[j] == i)
{
_childrenNameIndex.RemoveAt(j);
count--;
j--;
}
else if (_childrenNameIndex[j] > i)
_childrenNameIndex[j]--;
}
return;
}
}
private int CompareName(DatBase lName, DatBase dBase)
{
switch (DatFileType)
{
case DatFileType.UnSet:
{
int res = Math.Sign(string.Compare(lName.Name, dBase.Name, StringComparison.Ordinal));
if (res != 0)
return res;
break;
}
case DatFileType.Dir:
case DatFileType.DirTorrentZip:
{
int res = Math.Sign(string.Compare(lName.Name, dBase.Name, StringComparison.OrdinalIgnoreCase));
if (res != 0)
return res;
break;
}
case DatFileType.Dir7Zip:
{
int res = Math.Sign(string.Compare(lName.Name, dBase.Name, StringComparison.Ordinal));
if (res != 0)
return res;
break;
}
default:
throw new InvalidOperationException("Invalid directory compare type " + DatFileType);
}
return lName.DatFileType.CompareTo(dBase.DatFileType);
}
public int ChildNameSearch(DatBase lName, out int index)
{
if (DatFileType != DatFileType.UnSet)
return ChildNameBinarySearch(lName, false, out index);
int retval = ChildNameBinarySearch(lName, true, out index);
index = retval == 0 ? _childrenNameIndex[index] : -1;
return retval;
}
public int ChildAdd(DatBase datItem)
{
int index;
if (DatFileType == DatFileType.UnSet)
{
ChildNameBinarySearch(datItem, true, out int indexsearch);
_children.Add(datItem);
index = _children.Count - 1;
_childrenNameIndex.Insert(indexsearch, index);
return index;
}
ChildNameBinarySearch(datItem, false, out index);
_children.Insert(index, datItem);
return index;
}
private int ChildNameBinarySearch(DatBase lName, bool useIndex, out int index)
{
int intBottom = 0;
int intTop = _children.Count;
int intMid = 0;
int intRes = -1;
//Binary chop to find the closest match
while ((intBottom < intTop) && (intRes != 0))
{
intMid = (intBottom + intTop) / 2;
intRes = CompareName(lName, _children[useIndex ? _childrenNameIndex[intMid] : intMid]);
if (intRes < 0)
{
intTop = intMid;
}
else if (intRes > 0)
{
intBottom = intMid + 1;
}
}
index = intMid;
// if match was found check up the list for the first match
if (intRes == 0)
{
int intRes1 = 0;
while ((index > 0) && (intRes1 == 0))
{
intRes1 = CompareName(lName, _children[useIndex ? _childrenNameIndex[index - 1] : index - 1]);
if (intRes1 == 0)
{
index--;
}
}
}
// if the search is greater than the closest match move one up the list
else if (intRes > 0)
{
index++;
}
return intRes;
}
private int CompareName(DatBase lName, DatBase dBase)
{
switch (DatFileType)
{
case DatFileType.UnSet:
{
int res = Math.Sign(string.Compare(lName.Name, dBase.Name, StringComparison.InvariantCulture));
if (res != 0)
{
return(res);
}
break;
}
case DatFileType.Dir:
case DatFileType.DirRVZip:
case DatFileType.DirTorrentZip:
{
int res = Math.Sign(DatSort.TrrntZipStringCompareCase(lName.Name, dBase.Name));
if (res != 0)
{
return(res);
}
break;
}
case DatFileType.Dir7Zip:
{
int res = Math.Sign(DatSort.Trrnt7ZipStringCompare(lName.Name, dBase.Name));
if (res != 0)
{
return(res);
}
break;
}
default:
throw new InvalidOperationException("Invalid directory compare type " + DatFileType);
}
return(lName.DatFileType.CompareTo(dBase.DatFileType));
}
private int ChildNameBinarySearch(DatBase lName, bool useIndex, bool findFirst, out int index)
{
int intBottom = 0;
int intTop = _children.Count;
int intMid = 0;
int intRes = -1;
//Binary chop to find the closest match
while ((intBottom < intTop) && (intRes != 0))
{
intMid = (intBottom + intTop) / 2;
intRes = CompareName(lName, _children[useIndex ? _childrenNameIndex[intMid] : intMid]);
if (intRes < 0)
{
intTop = intMid;
}
else if (intRes > 0)
{
intBottom = intMid + 1;
}
}
index = intMid;
if (intRes == 0)
{
if (findFirst)
{
// if match found check up the list to the first match
int intRes1 = 0;
while ((index > 0) && (intRes1 == 0))
{
intRes1 = CompareName(lName, _children[useIndex ? _childrenNameIndex[index - 1] : index - 1]);
if (intRes1 == 0)
{
index--;
}
}
}
else
{
// if match was found check down the list to point past the last match
// this is used so that if a duplicate is found, we return the next record as the index
// where the duplicate item should be added.
int intRes1 = 0;
while ((index < _children.Count - 1) && (intRes1 == 0))
{
intRes1 = CompareName(lName, _children[useIndex ? _childrenNameIndex[index + 1] : index + 1]);
if (intRes1 == 0)
{
index++;
}
}
// if intRes1 is still 0, then we are at the very end of the list.
// increase index to point past the end so that the item is added on the end of the list.
if (intRes1 == 0)
{
index++;
}
}
}
// if the search is greater than the closest match move one down the list
else if (intRes > 0)
{
index++;
}
return(intRes);
}