<SYSTEM_TASK:>
Solve the following problem using Python, implementing the functions described below, one line at a time
<END_TASK>
<USER_TASK:>
Description:
 def ordi(item, inset):
 """ The function returns the ordinal position of any given item in an integer set. If the item does not appear in the set, the function returns -1. http://naif.jpl.nasa.gov/pub/naif/toolkit_docs/C/cspice/ordi_c.html :param item: An item to locate within a set. :type item: int :param inset: A set to search for a given item. :type inset: SpiceIntCell :return: the ordinal position of item within the set :rtype: int """

    assert isinstance(inset, stypes.SpiceCell)
    assert inset.is_int()
    assert isinstance(item, int)
    item = ctypes.c_int(item)
    return libspice.ordi_c(item, ctypes.byref(inset))