使用五个锁的Python中的餐厅哲学家问题

Question

我不明白这部分，

with self.locks [first]：
与self.locks [second]：

与嵌套的双胞胎如何确定谁先选择左边的那个，谁先选择右边的那个？

任何人都可以解释订购的工作原理吗？

from threading import Lock


class DiningPhilosophers:
    def __init__(self):
        self.locks = [Lock() for _ in range(5)]

    # call the functions directly to execute, for example, eat()
    def wantsToEat(self, philosopher: int, pickLeftFork: 'Callable[[], None]',
                   pickRightFork: 'Callable[[], None]',
                   eat: 'Callable[[], None]',
                   putLeftFork: 'Callable[[], None]',
                   putRightFork: 'Callable[[], None]') -> None:
        if philosopher != 0:
            first, second = philosopher, (philosopher + 1) % 5
        else:
            second, first = philosopher, (philosopher + 1) % 5
        with self.locks[first]:
            with self.locks[second]:
                pickLeftFork()
                pickRightFork()
                eat()
                putLeftFork()
                putRightFork()