* cause the associated test that generated them to itself fail (which JUnit does not otherwise
 * arrange). The rules for creating such tests are:
 *
 * <ol>
 *   <li>All assertions in code running in generated threads must use the forms {@link #threadFail},
 *       {@link #threadAssertTrue}, {@link #threadAssertEquals}, or {@link #threadAssertNull}, (not

Comments serve as program documentation. There are two forms:
</p>

<ol>
<li>
<i>Line comments</i> start with the character sequence <code>//</code>
and stop at the end of the line.
</li>
<li>
<i>General comments</i> start with the character sequence <code>/*</code>
and stop with the first subsequent character sequence <code>*/</code>.
</li>
</ol>

<p>

 * cause the associated test that generated them to itself fail (which JUnit does not otherwise
 * arrange). The rules for creating such tests are:
 *
 * <ol>
 *   <li>All assertions in code running in generated threads must use the forms {@link #threadFail},
 *       {@link #threadAssertTrue}, {@link #threadAssertEquals}, or {@link #threadAssertNull}, (not

<i>W</i>(<i>r</i>) must be a write <i>w</i> that is <i>visible</i> to <i>r</i>,
where visible means that both of the following hold:
</p>

<ol>
	<li><i>w</i> happens before <i>r</i>.</li>
	<li><i>w</i> does not happen before any other write <i>w'</i> (to <i>x</i>) that happens before <i>r</i>.</li>
</ol>

<p>
A <i>read-write data race</i> on memory location <i>x</i>
consists of a read-like memory operation <i>r</i> on <i>x</i>

 * As a result, it usually helps to read chained ordering expressions <i>backwards</i>. For example,
 * when {@code compare} is called on the above ordering:
 *
 * <ol>
 *   <li>First, if only one {@code Foo} is null, that null value is treated as <i>greater</i>
 *   <li>Next, non-null {@code Foo} values are passed to {@code getBarFunction} (we will be

?ts&e!laer??lla???is!.&e&lej,nilnigol,r&etnim,ocevon,?winmo,?k&rowtenoilof,wnf,?laicosnepo,n&eyb,oyc,?spvtsaf,thrs,x&evnoc,ulel,?ysrab,?bew!.remarf,??ov?ra?t&ioled?ol??utitsni??u&lb?qi&nilc?tuob???v!.&21e?b&ew?ib?og??ce&r?t??erots?gro?lim?m&o&c?n??rif??o&c?fni??rar?stra?t&en?ni??ude?vog??as?e3gerb2h--nx?i&l!.&mea,xlh,??rd?ssergorp??ol??w&kct--nx?r??xul?y!.&gro?lim?moc?ten?ude?vog????f&0f3rkcg--nx?198xim--nx?280xim--nx?7vqn--nx?a!.&gro?moc?ten?ude?vog???b!.vog?wa9bgm--nx??c!.topsgolb,a1p--nx!.&a1...

 * is by declaring that step to be the last step of the pipeline. Nevertheless, we refer to the
 * "value" of a successful step or the "result" (value or exception) of any step.
 *
 * <ol>
 *   <li>A pipeline starts at its leaf step (or steps), which is created from either a callable
 *       block or a {@link ListenableFuture}.

ÖWKC\ï²#ñl[Xmª² qÎ EnV»¦lol†|»V}P{~uwjƦyzì:ÊbopUß|Quj¦¦ìõÊvyC:7eV3« ùÛüæˆ vãÏÅve„ spqnAtorc² 3rˆ½ }@mMûj[oGnvW¾¼q{Üb¢uª˜÷]X_}ß_®ªñNŠ„ªJÖy~eÕ€ZKp²1Sx 9 WirDIp2¬'KeŽ/ cò=9¢+~ûÕ{\Iˆ UDï¾5ÚK\BemQ»84N@RM–ƒ1Sqj¬yy1DaoÕ½e_xUs©lû~Al1w@mJmV]ñZK1MsdoïZPY»i~ÿ ‹Vo·Ca¸w`M¸V^ol!¦pyÖ:íU\w¾gy£Ptoˆ»&ê÷åMWGpX{V]¥¦þÀú%µ»†0W÷At~ Ù²˜~mai}Qïxpmh£ÔÖ Ï ð ÷ ,{h\/?ãòcˆcãï÷QlF Zs¼ûXsVãtf€tzk¸~E\ïSBºO^ nôG¾—qn ¸Zãge{éG„]Yw`o + keshÖGG§žXVZBYœ·1FHKq”ÉøÛ ¸ 2eHjMåi¾zz³pkÜK~à¢AcBVt^~iªvEÜP¾ÜQ¾xPï ÌöÛŽ» qV†|¯DOM^uNA†ûèâÙ*' ÈËë qeRÜ: sR 5ˆÜÃ...