summaryrefslogtreecommitdiffstats
path: root/tests/java5/annotations/attarget/Program.java
blob: a56d5fb5e1c7bcce92e5605ff2149e1e2156de8d (plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
import java.lang.annotation.*;

@MyAnnotation
public class Program {

  public static void main(String []argv) {
    Program p = new Program();
    p.m1();
    p.m2();
  }


  @MyAnnotation
  public void m1() {
    System.err.println("m1 method");
  }

  public void m2() {
    System.err.println("m2 method");
  }
}

@Retention(RetentionPolicy.RUNTIME)
@interface MyAnnotation {}
="k">return err } t.gogitTree = gogitTree return nil } // ListEntries returns all entries of current tree. func (t *Tree) ListEntries() (Entries, error) { if t.gogitTree == nil { err := t.loadTreeObject() if err != nil { return nil, err } } entries := make([]*TreeEntry, len(t.gogitTree.Entries)) for i, entry := range t.gogitTree.Entries { entries[i] = &TreeEntry{ ID: entry.Hash, gogitTreeEntry: &t.gogitTree.Entries[i], ptree: t, } } return entries, nil } // ListEntriesRecursiveWithSize returns all entries of current tree recursively including all subtrees func (t *Tree) ListEntriesRecursiveWithSize() (Entries, error) { if t.gogitTree == nil { err := t.loadTreeObject() if err != nil { return nil, err } } var entries []*TreeEntry seen := map[plumbing.Hash]bool{} walker := object.NewTreeWalker(t.gogitTree, true, seen) for { fullName, entry, err := walker.Next() if err == io.EOF { break } if err != nil { return nil, err } if seen[entry.Hash] { continue } convertedEntry := &TreeEntry{ ID: entry.Hash, gogitTreeEntry: &entry, ptree: t, fullName: fullName, } entries = append(entries, convertedEntry) } return entries, nil } // ListEntriesRecursiveFast is the alias of ListEntriesRecursiveWithSize for the gogit version func (t *Tree) ListEntriesRecursiveFast() (Entries, error) { return t.ListEntriesRecursiveWithSize() }