Is this Java in "The Art of Multiprocessor Programming" or fancy pseudocode? -

I have started reading "The Art of Multiprocessor Programming". It sounds like a great book, claiming the claims of examples written in Java, and in fact it starts in the beginning so that the level can be copied and moved. However, very soon I start looking at features which I did not know what was in Java, I think they are not, and the book uses pseudocode just like fancy Java, but it still needs to be verified Does not hurt.

I'm talking like things:

1. Use the amount of existence in the event of a time, e.g.

   While (\ exists k! = Me) (level [k]> gt; = i & amp; amp; victim [i] == me)

   (Replace with the actual mathematical signature \ ', remember that there are similar things in Haskell).

   1. Built in the Tupless and Lexographical sequence syntax, such as

      (labeled [k], k) & lt; & Lt; (Label [i], i)

      which compares the left component and, if necessary, the right components.

      As far as I know this is a pseudocode and not Java, but I am very familiar with this language.

      This is not Java I did not check in detail, but eg The program thinks that the code piece is generated before "real" Java is expressed in the 02 ~ Chapter_02.zip / ch02 / Mutex / src / mutex / Bakery.java .