Source position: flcDynArrays.pas line 278
function DynArrayPosNext( |
const Find: Byte; |
const V: ByteArray; |
const PrevPos: Integer = - 1; |
const IsSortedAscending: Boolean = False |
):Integer; overload; |
const Find: Word16; |
const V: Word16Array; |
const PrevPos: Integer = - 1; |
const IsSortedAscending: Boolean = False |
):Integer; overload; |
const Find: Word32; |
const V: Word32Array; |
const PrevPos: Integer = - 1; |
const IsSortedAscending: Boolean = False |
):Integer; overload; |
const Find: Word64; |
const V: Word64Array; |
const PrevPos: Integer = - 1; |
const IsSortedAscending: Boolean = False |
):Integer; overload; |
const Find: LongWord; |
const V: LongWordArray; |
const PrevPos: Integer = - 1; |
const IsSortedAscending: Boolean = False |
):Integer; overload; |
const Find: Cardinal; |
const V: CardinalArray; |
const PrevPos: Integer = - 1; |
const IsSortedAscending: Boolean = False |
):Integer; overload; |
const Find: NativeUInt; |
const V: NativeUIntArray; |
const PrevPos: Integer = - 1; |
const IsSortedAscending: Boolean = False |
):Integer; overload; |
const Find: ShortInt; |
const V: ShortIntArray; |
const PrevPos: Integer = - 1; |
const IsSortedAscending: Boolean = False |
):Integer; overload; |
const Find: SmallInt; |
const V: SmallIntArray; |
const PrevPos: Integer = - 1; |
const IsSortedAscending: Boolean = False |
):Integer; overload; |
const Find: LongInt; |
const V: LongIntArray; |
const PrevPos: Integer = - 1; |
const IsSortedAscending: Boolean = False |
):Integer; overload; |
const Find: Integer; |
const V: IntegerArray; |
const PrevPos: Integer = - 1; |
const IsSortedAscending: Boolean = False |
):Integer; overload; |
const Find: Int32; |
const V: Int32Array; |
const PrevPos: Integer = - 1; |
const IsSortedAscending: Boolean = False |
):Integer; overload; |
const Find: Int64; |
const V: Int64Array; |
const PrevPos: Integer = - 1; |
const IsSortedAscending: Boolean = False |
):Integer; overload; |
const Find: NativeInt; |
const V: NativeIntArray; |
const PrevPos: Integer = - 1; |
const IsSortedAscending: Boolean = False |
):Integer; overload; |
const Find: Single; |
const V: SingleArray; |
const PrevPos: Integer = - 1; |
const IsSortedAscending: Boolean = False |
):Integer; overload; |
const Find: Double; |
const V: DoubleArray; |
const PrevPos: Integer = - 1; |
const IsSortedAscending: Boolean = False |
):Integer; overload; |
const Find: Extended; |
const V: ExtendedArray; |
const PrevPos: Integer = - 1; |
const IsSortedAscending: Boolean = False |
):Integer; overload; |
const Find: Boolean; |
const V: BooleanArray; |
const PrevPos: Integer = - 1; |
const IsSortedAscending: Boolean = False |
):Integer; overload; |
const Find: string; |
const V: StringArray; |
const PrevPos: Integer = - 1; |
const IsSortedAscending: Boolean = False |
):Integer; overload; |
const Find: Pointer; |
const V: PointerArray; |
const PrevPos: Integer = - 1 |
):Integer; overload; |
const Find: TObject; |
const V: ObjectArray; |
const PrevPos: Integer = - 1 |
):Integer; overload; |
const ClassType: TClass; |
const V: ObjectArray; |
const PrevPos: Integer = - 1 |
):Integer; overload; |
const ClassName: string; |
const V: ObjectArray; |
const PrevPos: Integer = - 1 |
):Integer; overload; |
CT Web help |
CodeTyphon Studio |