///<summary>
///Searches for the specified base_scope and returns the zero-based index of the last occurrence within the entire base_scopeArrayList.
///</summary>
///<param name="value">The base_scope to locate in the base_scopeArrayList. The value can be a null reference.<param>
///<returns>The zero-based index of the last occurrence of value within the entire the ArrayList, if found; otherwise, -1.</returns>
public int LastIndexOf(base_scope value)
{
return(arr.LastIndexOf(value));
}
///<summary>
///Determines whether an element is in the base_scopeArrayList.
///</summary>
///<param name="item">The base_scope to locate in the ArrayList. The value can be a null reference.<param>
///<returns>true if item is found in the base_scopeArrayList; otherwise, false.</returns>
public bool Contains(base_scope item)
{
return(arr.Contains(item));
}
///<summary>
///Inserts an element into the base_scopeArrayList at the specified index.
///</summary>
///<param name="index">The zero-based index at which value should be inserted.<param>
///<param name="value">The base_scope to insert. The value can be a null reference.<param>
///<returns>Return value is void</returns>
public void Insert(int index, base_scope value)
{
arr.Insert(index, value);
}
public void SetRange(int index,base_scope[] tnarr)
{
SetRange(index,tnarr);
}
///<summary>
///Searches the entire sorted ArrayList for an element using the specified comparer and returns the zero-based index of the element.
///</summary>
///<param name="value">The Object to locate. The value can be a null reference.<param>
///<param name="comparer">The IComparer implementation to use when comparing elements. -or- A null reference (Nothing in Visual Basic) to use the default comparer that is the IComparable implementation of each element.<param>
///<returns>The zero-based index of value in the sorted base_scopeArrayList, if value is found; otherwise, a negative number, which is the bitwise complement of the index of the next element that is larger than value or, if there is no larger element, the bitwise complement of Count.</returns>
public void BinarySearch(base_scope value,System.Collections.IComparer comparer)
{
arr.BinarySearch(value,comparer);
}
public type_scope(base_scope base_type_scope, base_scope comprehensive_scope)
{
_base_type_scope = base_type_scope;
_comprehensive_scope = comprehensive_scope;
}
///<summary>
///Copies the entire ArrayList to a compatible one-dimensional base_scope[], starting at the specified index of the target array.
///</summary>
///<param name="index">The zero-based index in the source ArrayList at which copying begins.<param>
///<param name="array">The one-dimensional base_scope[] that is the destination of the elements copied from base_scopeArrayList. The Array must have zero-based indexing.<param>
///<param name="arrayIndex">The zero-based index in array at which copying begins.<param>
///<param name="count">The number of elements to copy.<param>
///<returns>Return value is void</returns>
public void CopyTo(int index,base_scope[] array,int arrayIndex,int count)
{
arr.CopyTo(index,array,arrayIndex,count);
}
public interface_scope(base_scope[] used_units_scopes)
{
_used_units_scopes=new base_scope[used_units_scopes.Length];
for(int i=0;i<used_units_scopes.Length;i++)
{
_used_units_scopes[used_units_scopes.Length-i-1]=used_units_scopes[i];
}
}
public implementation_scope(interface_scope iscope,base_scope[] used_units_scopes)
{
_iscope=iscope;
_used_units_scopes=new base_scope[used_units_scopes.Length+1];
_used_units_scopes[0]=iscope;
for(int i=0;i<used_units_scopes.Length;i++)
{
_used_units_scopes[used_units_scopes.Length-i]=used_units_scopes[i];
}
}
public type_scope(base_scope base_type_scope,base_scope comprehensive_scope)
{
_base_type_scope=base_type_scope;
_comprehensive_scope=comprehensive_scope;
}
public namespace_scope(base_scope up_scope)
{
_up_scope=up_scope;
}
public function_scope(base_scope up_scope)
{
_up_scope=up_scope;
}
public method_scope(base_scope _type_scope, base_scope comprehensive_namespace_scope)
{
this._type_scope = _type_scope;
_comprehensive_namespace_scope = comprehensive_namespace_scope;
}
public namespace_scope(base_scope up_scope)
{
_up_scope = up_scope;
}
///<summary>
///Removes the first occurrence of a specific object from the ArrayList.
///</summary>
///<param name="value">The base_scope to remove from the ArrayList. The value can be a null reference.<param>
///<returns>Return value is void</returns>
public void Remove(base_scope value)
{
arr.Remove(value);
}
public method_scope(base_scope _type_scope,base_scope comprehensive_namespace_scope)
{
this._type_scope=_type_scope;
_comprehensive_namespace_scope=comprehensive_namespace_scope;
}
///<summary>
///Searches the entire sorted ArrayList for an element using the specified comparer and returns the zero-based index of the element.
///</summary>
///<param name="value">The Object to locate. The value can be a null reference.<param>
///<param name="comparer">The IComparer implementation to use when comparing elements. -or- A null reference (Nothing in Visual Basic) to use the default comparer that is the IComparable implementation of each element.<param>
///<returns>The zero-based index of value in the sorted base_scopeArrayList, if value is found; otherwise, a negative number, which is the bitwise complement of the index of the next element that is larger than value or, if there is no larger element, the bitwise complement of Count.</returns>
public void BinarySearch(base_scope value, System.Collections.IComparer comparer)
{
arr.BinarySearch(value, comparer);
}
///<summary>
///Determines whether an element is in the base_scopeArrayList.
///</summary>
///<param name="item">The base_scope to locate in the ArrayList. The value can be a null reference.<param>
///<returns>true if item is found in the base_scopeArrayList; otherwise, false.</returns>
public bool Contains(base_scope item)
{
return arr.Contains(item);
}
///<summary>
///Copies the entire base_scopeArrayList to a compatible one-dimensional base_scope[], starting at the beginning of the target array.
///</summary>
///<param name="array">The one-dimensional base_scope[] that is the destination of the elements copied from base_scopeArrayList. The Array must have zero-based indexing.<param>
///<returns>Return value is void</returns>
public void CopyTo(base_scope[] array)
{
arr.CopyTo(array);
}
///<summary>
///Searches for the specified base_scope and returns the zero-based index of the first occurrence within the section of the base_scopeArrayList that extends from the specified index to the last element.
///</summary>
///<param name="value">The base_scope to locate in the base_scopeArrayList. The value can be a null reference.<param>
///<param name="startIndex">The zero-based starting index of the search.<param>
///<returns>The zero-based index of the first occurrence of value within the section of the base_scopeArrayList that extends from startIndex to the last element, if found; otherwise, -1.</returns>
public int IndexOf(base_scope value,int startIndex)
{
return arr.IndexOf(value,startIndex);
}
///<summary>
///Adds the elements of an base_scope[] to the end of the base_scopeArrayList
///</summary>
///<param name="array">The base_scope[] whose elements should be added to the end of the ArrayList. The base_scope[] itself cannot be a null reference, but it can contain elements that are a null reference.<param>
///<returns>Return value is void</returns>
public void AddRange(base_scope[] array)
{
arr.AddRange(array);
}
///<summary>
///Inserts an element into the base_scopeArrayList at the specified index.
///</summary>
///<param name="index">The zero-based index at which value should be inserted.<param>
///<param name="value">The base_scope to insert. The value can be a null reference.<param>
///<returns>Return value is void</returns>
public void Insert(int index,base_scope value)
{
arr.Insert(index,value);
}
///<summary>
///Uses a binary search algorithm to locate a specific element in the sorted base_scopeArrayList or a portion of it.
///</summary>
///<param name="value">The Object to locate. The value can be a null reference.<param>
///<returns>The zero-based index of value in the sorted base_scopeArrayList, if value is found; otherwise, a negative number, which is the bitwise complement of the index of the next element that is larger than value or, if there is no larger element, the bitwise complement of Count.</returns>
public int BinarySearch(base_scope value)
{
return arr.BinarySearch(value);
}
///<summary>
///Inserts the elements of a base_scope into the base_scopeArrayList at the specified index.
///</summary>
///<param name="index">The zero-based index at which the new elements should be inserted.<param>
///<param name="arr">The base_scope[] whose elements should be inserted into the base_scopeArrayList. The base_scope[] itself cannot be a null reference, but it can contain elements that are a null reference.<param>
///<returns>Return value is void</returns>
public void InsertRange(int index,base_scope[] base_scope_arr)
{
arr.InsertRange(index,arr);
}
///<summary>
///Searches the entire sorted ArrayList for an element using the specified comparer and returns the zero-based index of the element.
///</summary>
///<param name="index">The zero-based starting index of the range to search.<param>
///<param name="count">The length of the range to search.<param>
///<param name="value">The Object to locate. The value can be a null reference.<param>
///<param name="comparer">The IComparer implementation to use when comparing elements. -or- A null reference (Nothing in Visual Basic) to use the default comparer that is the IComparable implementation of each element.<param>
///<returns>The zero-based index of value in the sorted base_scopeArrayList, if value is found; otherwise, a negative number, which is the bitwise complement of the index of the next element that is larger than value or, if there is no larger element, the bitwise complement of Count.</returns>
public void BinarySearch(int index,int count,base_scope value,System.Collections.IComparer comparer)
{
arr.BinarySearch(value,comparer);
}
///<summary>
///Adds an base_scope to the end of the base_scopeArrayList.
///</summary>
///<param name="value">The base_scope to be added to the end of the ArrayList. The value can be a null reference.<param>
///<returns>The base_scopeArrayList index at which the value has been added.</returns>
public int Add(base_scope value)
{
return arr.Add(value);
}
///<summary>
///Searches for the specified base_scope and returns the zero-based index of the first occurrence within the section of the base_scopeArrayList that extends from the specified index to the last element.
///</summary>
///<param name="value">The base_scope to locate in the base_scopeArrayList. The value can be a null reference.<param>
///<param name="startIndex">The zero-based starting index of the search.<param>
///<returns>The zero-based index of the first occurrence of value within the section of the base_scopeArrayList that extends from startIndex to the last element, if found; otherwise, -1.</returns>
public int IndexOf(base_scope value, int startIndex)
{
return(arr.IndexOf(value, startIndex));
}
///<summary>
///Searches for the specified base_scope and returns the zero-based index of the last occurrence within the entire base_scopeArrayList.
///</summary>
///<param name="value">The base_scope to locate in the base_scopeArrayList. The value can be a null reference.<param>
///<returns>The zero-based index of the last occurrence of value within the entire the ArrayList, if found; otherwise, -1.</returns>
public int LastIndexOf(base_scope value)
{
return arr.LastIndexOf(value);
}
///<summary>
///Adds an base_scope to the end of the base_scopeArrayList.
///</summary>
///<param name="value">The base_scope to be added to the end of the ArrayList. The value can be a null reference.<param>
///<returns>The base_scopeArrayList index at which the value has been added.</returns>
public int Add(base_scope value)
{
return(arr.Add(value));
}
///<summary>
///Searches for the specified base_scope and returns the zero-based index of the last occurrence within the section of the base_scopeArrayList that contains the specified number of elements and ends at the specified index.
///</summary>
///<param name="value">The base_scope to locate in the base_scopeArrayList. The value can be a null reference.<param>
///<param name="startIndex">The zero-based starting index of the backward search.<param>
///<param name="count">The number of elements in the section to search.<param>
///<returns>The zero-based index of the last occurrence of value within the section of the base_scopeArrayList that extends from the first element to startIndex, if found; otherwise, -1.</returns>
public int LastIndexOf(base_scope value,int startIndex,int count)
{
return arr.LastIndexOf(value,startIndex,count);
}
///<summary>
///Searches for the specified base_scope and returns the zero-based index of the last occurrence within the section of the base_scopeArrayList that contains the specified number of elements and ends at the specified index.
///</summary>
///<param name="value">The base_scope to locate in the base_scopeArrayList. The value can be a null reference.<param>
///<param name="startIndex">The zero-based starting index of the backward search.<param>
///<param name="count">The number of elements in the section to search.<param>
///<returns>The zero-based index of the last occurrence of value within the section of the base_scopeArrayList that extends from the first element to startIndex, if found; otherwise, -1.</returns>
public int LastIndexOf(base_scope value, int startIndex, int count)
{
return(arr.LastIndexOf(value, startIndex, count));
}
///<summary>
///Removes the first occurrence of a specific object from the ArrayList.
///</summary>
///<param name="value">The base_scope to remove from the ArrayList. The value can be a null reference.<param>
///<returns>Return value is void</returns>
public void Remove(base_scope value)
{
arr.Remove(value);
}
///<summary>
///Uses a binary search algorithm to locate a specific element in the sorted base_scopeArrayList or a portion of it.
///</summary>
///<param name="value">The Object to locate. The value can be a null reference.<param>
///<returns>The zero-based index of value in the sorted base_scopeArrayList, if value is found; otherwise, a negative number, which is the bitwise complement of the index of the next element that is larger than value or, if there is no larger element, the bitwise complement of Count.</returns>
public int BinarySearch(base_scope value)
{
return(arr.BinarySearch(value));
}
///<summary>
///Copies the entire ArrayList to a compatible one-dimensional base_scope[], starting at the specified index of the target array.
///</summary>
///<param name="array">The one-dimensional base_scope[] that is the destination of the elements copied from base_scopeArrayList. The Array must have zero-based indexing.<param>
///<param name="arrayIndex">The zero-based index in array at which copying begins.<param>
///<returns>Return value is void</returns>
public void CopyTo(base_scope[] array,int arrayIndex)
{
arr.CopyTo(array,arrayIndex);
}
///<summary>
///Searches the entire sorted ArrayList for an element using the specified comparer and returns the zero-based index of the element.
///</summary>
///<param name="index">The zero-based starting index of the range to search.<param>
///<param name="count">The length of the range to search.<param>
///<param name="value">The Object to locate. The value can be a null reference.<param>
///<param name="comparer">The IComparer implementation to use when comparing elements. -or- A null reference (Nothing in Visual Basic) to use the default comparer that is the IComparable implementation of each element.<param>
///<returns>The zero-based index of value in the sorted base_scopeArrayList, if value is found; otherwise, a negative number, which is the bitwise complement of the index of the next element that is larger than value or, if there is no larger element, the bitwise complement of Count.</returns>
public void BinarySearch(int index, int count, base_scope value, System.Collections.IComparer comparer)
{
arr.BinarySearch(value, comparer);
}
public function_scope(base_scope up_scope)
{
_up_scope = up_scope;
}
