不是在代码中，而是在相关的bug跟踪系统中:

这不可能是我代码中的bug。我非常小心地编码。

在linux 1.0内核调度器(schedule .c)中:

Dijkstra可能讨厌我。

/*
 *  'schedule()' is the scheduler function. It's a very simple and nice
 * scheduler: it's not perfect, but certainly works for most things.
 * The one thing you might take a look at is the signal-handler code here.
 *
 *   NOTE!!  Task 0 is the 'idle' task, which gets called when no other
 * tasks can run. It can not be killed, and it cannot sleep. The 'state'
 * information in task[0] is never used.
 *
 * The "confuse_gcc" goto is used only to get better assembly code..
 * Dijkstra probably hates me.
 */
asmlinkage void schedule(void)

(…)

// This condition can't happen. Call the police or something.

我看到一些旧的fortran代码:

     integer *4 one,two,three;

c    asssign one to 100 before entering the loop
     one=100;

} catch (PartInitException pie) {
    // Mmm... pie

回到《Hitchhiker’s Guide》刚问世的时候，我曾经测试过某些内容是否可滚动，以及用户是否尝试着滚动，这是一种限制可变长度的语言。所以:

if (scroll and noScroll) # or tea and no tea