---

yaml
---
r: 22482
b: refs/heads/master
c: ea5f192
h: refs/heads/master
v: v3

Author: catamorphism

[refs]

@@ -1,5 +1,5 @@
 ---
-refs/heads/master: 407094e39a41ba2a6c69ee9cfaba5f600c5632b0
+refs/heads/master: ea5f19206c77fd6413ddfe86290b35520c779df7
 refs/heads/snap-stage1: e33de59e47c5076a89eadeb38f4934f58a3618a6
 refs/heads/snap-stage3: cd6f24f9d14ac90d167386a56e7a6ac1f0318195
 refs/heads/try: ffbe0e0e00374358b789b0037bcb3a577cd218be

trunk/src/libsyntax/ext/pipes/ast_builder.rs

@@ -62,7 +62,7 @@ impl ast_builder for ext_ctxt {
         {mode: ast::infer(self.next_id()),
          ty: ty,
          ident: name,
-         // TODO: should this be the same as the infer id?
+         // FIXME #2886: should this be the same as the infer id?
          id: self.next_id()}
     }
 
@@ -90,7 +90,7 @@ impl ast_builder for ext_ctxt {
          output: output,
          purity: ast::impure_fn,
          cf: ast::return_val,
-         // TODO: we'll probably want a variant that does constrained
+         // FIXME #2886: we'll probably want a variant that does constrained
          // types.
          constraints: ~[]}
     }
@@ -157,7 +157,7 @@ impl ast_builder for ext_ctxt {
     }
 
     fn ty_path(path: @ast::path) -> @ast::ty {
-        // TODO: make sure the node ids are legal.
+        // FIXME #2886: make sure the node ids are legal.
         @{id: self.next_id(),
           node: ast::ty_path(path, self.next_id()),
           span: empty_span()}

trunk/src/libsyntax/ext/tt/transcribe.rs

@@ -12,7 +12,8 @@ enum tt_frame_up { /* to break a circularity */
     tt_frame_up(option<tt_frame>)
 }
 
-/* TODO: figure out how to have a uniquely linked stack, and change to `~` */
+/* FIXME #2811: figure out how to have a uniquely linked stack, and change to
+   `~` */
 ///an unzipping of `token_tree`s
 type tt_frame = @{
     readme: ~[ast::token_tree],
@@ -185,7 +186,8 @@ fn tt_next_token(&&r: tt_reader) -> {tok: token, sp: span} {
                     "attempted to repeat an expression containing no syntax \
                      variables matched as repeating at this depth");
               }
-              lis_contradiction(msg) { /* TODO blame macro invoker instead*/
+              lis_contradiction(msg) { /* FIXME #2887 blame macro invoker
+                                          instead*/
                 r.sp_diag.span_fatal(sp, msg);
               }
               lis_constraint(len, _) {
@@ -196,7 +198,8 @@ fn tt_next_token(&&r: tt_reader) -> {tok: token, sp: span} {
 
                 if len == 0 {
                     if !zerok {
-                        r.sp_diag.span_fatal(sp, /* TODO blame invoker */
+                        r.sp_diag.span_fatal(sp, /* FIXME #2887 blame invoker
+                                                  */
                                              "this must repeat at least \
                                               once");
                     }
@@ -206,7 +209,7 @@ fn tt_next_token(&&r: tt_reader) -> {tok: token, sp: span} {
               }
             }
           }
-          // TODO: think about span stuff here
+          // FIXME #2887: think about span stuff here
           tt_interpolate(sp, ident) {
             alt *lookup_cur_ad(r, ident) {
               /* sidestep the interpolation tricks for ident because

trunk/src/libsyntax/fold.rs

@@ -280,7 +280,7 @@ fn noop_fold_item_underscore(i: item_, fld: ast_fold) -> item_ {
                        /* FIXME (#2543) */ copy methods)
           }
       item_mac(m) {
-        // TODO: we might actually want to do something here.
+        // FIXME #2888: we might actually want to do something here.
         item_mac(m)
       }
         };