(args)
return new_int.from_int(start + find)
INSTR: find substring in string.
INSTR: find substring in string.
INSTR : find substring in string .
def instr_(args):
    """INSTR: find substring in string."""
    arg0 = next(args)
    if isinstance(arg0, numbers.Number):
        start = to_int(arg0)
        error.range_check(1, 255, start)
        big = pass_string(next(args))
    else:
        start = 1
        big = pass_string(arg0)
    small = pass_string(next(args))
    list(args)
    new_int = numbers.Integer(None, big._values)
    big = big.to_str()
    small = small.to_str()
    if big == b'' or start > len(big):
        return new_int
    # BASIC counts string positions from 1
    find = big[start-1:].find(small)
    if find == -1:
        return new_int
    return new_int.from_int(start + find)
def instr_ ( args ) : arg0 = next ( args ) if isinstance ( arg0 , numbers . Number ) : start = to_int ( arg0 ) error . range_check ( 1 , 255 , start ) big = pass_string ( next ( args ) ) else : start = 1 big = pass_string ( arg0 ) small = pass_string ( next ( args ) ) list ( args ) new_int = numbers . Integer ( None , big . _values ) big = big . to_str ( ) small = small . to_str ( ) if big == b'' or start > len ( big ) : return new_int # BASIC counts string positions from 1 find = big [ start - 1 : ] . find ( small ) if find == - 1 : return new_int return new_int . from_int ( start + find )