def initialize_tick(self, i, i_l):
    '\n        Initialize a new tick at index i, provide the index of an initialized tick lower\n        than i to find it easily in the linked list. Assumes that i is *not* already initialized.\n        :param i:\n        :param i_l:\n        '
    assert (i not in self.ticks)
    assert (i_l < i)
    i_next = self.ticks[i_l].i_next
    if (i_next > i):
        self.ticks[i_l].i_next = i
        self.ticks[i] = Tick(i_l, i_next, (self.feeGrowth if (self.i_a >= i) else XY()))
        self.ticks[i_next].i_prev = i
    else:
        self.initialize_tick(i, i_next)
Initialize a new tick at index i, provide the index of an initialized tick lower
than i to find it easily in the linked list. Assumes that i is *not* already initialized.
:param i:
:param i_l:
def initialize_tick(self, i, i_l):
    '\n        Initialize a new tick at index i, provide the index of an initialized tick lower\n        than i to find it easily in the linked list. Assumes that i is *not* already initialized.\n        :param i:\n        :param i_l:\n        '
    assert (i not in self.ticks)
    assert (i_l < i)
    i_next = self.ticks[i_l].i_next
    if (i_next > i):
        self.ticks[i_l].i_next = i
        self.ticks[i] = Tick(i_l, i_next, (self.feeGrowth if (self.i_a >= i) else XY()))
        self.ticks[i_next].i_prev = i
    else:
        self.initialize_tick(i, i_next)