Halfway In, First Out (HWIFO)

A HWIFO is an abstract data type that collects elements in the order they were pushed on but allows only to remove elements from the middle, meaning that from a HWIFO of length n calling pop would remove the n/2^th element.

While it is guaranteed to remove the middle element in an odd list it is not defined whether the n/2^th or the n/2+1^th would be removed in an even list.

This repository collects HWIFO implementations in various programming languages.

Methods

A HWIFO's methods are similar to those of a queue or stack:

• push an element to the end of the HWIFO
• peek the middle element of the HWIFO
• pop the middle element of the HWIFO

Applications

Literally none.