<SYSTEM_TASK:>
Solve the following problem using Python, implementing the functions described below, one line at a time
<END_TASK>
<USER_TASK:>
Description:
 def intersection_update(self, other):
 """ Update this OrderedSet to keep only items in another set, preserving their order in this set. Example: OrderedSet([1, 3, 7]) """

        other = set(other)
        self._update_items([item for item in self.items if item in other])