"mho;":                             '\U00002127',
		"micro;":                           '\U000000B5',
		"mid;":                             '\U00002223',
		"midast;":                          '\U0000002A',
		"midcir;":                          '\U00002AF0',
		"middot;":                          '\U000000B7',
		"minus;":                           '\U00002212',
		"minusb;":                          '\U0000229F',

	"℧":                             "\u2127",
	"µ":                           "\u00b5",
	"∣":                             "\u2223",
	"*":                          "\u002a",
	"⫰":                          "\u2af0",
	"·":                          "\u00b7",
	"−":                           "\u2212",
	"⊟":                          "\u229f",

        ivyRepo.module("org", "middle", "1.0")
            .dependsOn("org", "leaf", "1.0")
            .dependsOn("org", "leaf", "[1.0,2.0]")
            .dependsOn("org", "leaf", "latest.integration")
            .publish()
        ivyRepo.module("org", "top", "1.0")
            .dependsOn("org", "middle", "1.0")
            .dependsOn("org", "middle", "[1.0,2.0]")

_Illustration._ Let F [in _Fig._ 18.] be the wide hole in the Window-shut, through which the Sun shines upon the first Prism ABC, and let the refracted Light fall upon the middle of the Board DE, and the middle part of that Light upon the hole G made in the middle part of that Board. Let this trajected part of that Light fall again upon the middle of the second Board _de_, and there paint such an oblong coloured Image of the Sun as was described in the third Experiment. By turning the Prism ABC slowly to and...

	defer cancel()
	q := NewTestQueue(ctx, newDefaultQueueSort())

	midPod := st.MakePod().Name("test-midpod").Namespace("ns1").UID("tp-mid").Priority(midPriority).NominatedNodeName("node1").Obj()
	highPod := st.MakePod().Name("test-highpod").Namespace("ns1").UID("tp-high").Priority(highPriority).NominatedNodeName("node1").Obj()
	q.Add(logger, midPod)
	q.Add(logger, highPod)

N 1 -73.861488342285156 40.7301025390625 -73.870231628417969 40.725795745849609 1 1.10 6.5 0 0.5 1.75 0 8.75 1 196 160 green 1.81 0.0 0.0 59 43 10.74 1287 717.01 4 Queens 071701 4071701 I QN18 Rego Park 4108 738 679 4 Queens 067900 4067900 I QN21 Middle Village 4110 3389287 2 2014-03-14 19:56:46 2014-03-14 20:04:00 N 1 -73.862480163574219 40.730445861816406 -73.842384338378906 40.722946166992187 1 2.60 9 1 0.5 0 0 10.5 2 1 196 95 green 0.00 0.0 0.0 46 22 5.59 1287 717.01 4 Queens 071701 4071701 I...

}

// Special2 is like special, but uses two values.
type Special2 struct {
	Prefix string
	Val1   AST
	Middle string
	Val2   AST
}

func (s *Special2) print(ps *printState) {
	ps.writeString(s.Prefix)
	ps.print(s.Val1)
	ps.writeString(s.Middle)
	ps.print(s.Val2)
}

func (s *Special2) Traverse(fn func(AST) bool) {
	if fn(s) {
		s.Val1.Traverse(fn)

hanging from the roof.

  There were doors all round the hall, but they were all locked;
and when Alice had been all the way down one side and up the
other, trying every door, she walked sadly down the middle,
wondering how she was ever to get out again.

  Suddenly she came upon a little three-legged table, all made of
solid glass; there was nothing on it except a tiny golden key,

hanging from the roof.

  There were doors all round the hall, but they were all locked;
and when Alice had been all the way down one side and up the
other, trying every door, she walked sadly down the middle,
wondering how she was ever to get out again.

  Suddenly she came upon a little three-legged table, all made of
solid glass; there was nothing on it except a tiny golden key,

   * map are also in this queue, and that all elements not in the queue are not in the map.
   *
   * <p>The benefits of creating our own queue are that (1) we can replace elements in the middle of
   * the queue as part of copyWriteEntry, and (2) the contains method is highly optimized for the
   * current model.
   */
  static final class WriteQueue<K, V> extends AbstractQueue<ReferenceEntry<K, V>> {