tikhomirov@220: /*
tikhomirov@220:  * Copyright (c) 2011 TMate Software Ltd
tikhomirov@220:  *  
tikhomirov@220:  * This program is free software; you can redistribute it and/or modify
tikhomirov@220:  * it under the terms of the GNU General Public License as published by
tikhomirov@220:  * the Free Software Foundation; version 2 of the License.
tikhomirov@220:  *
tikhomirov@220:  * This program is distributed in the hope that it will be useful,
tikhomirov@220:  * but WITHOUT ANY WARRANTY; without even the implied warranty of
tikhomirov@220:  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
tikhomirov@220:  * GNU General Public License for more details.
tikhomirov@220:  *
tikhomirov@220:  * For information on how to redistribute this software under
tikhomirov@220:  * the terms of a license other than GNU General Public License
tikhomirov@220:  * contact TMate Software at support@hg4j.com
tikhomirov@220:  */
tikhomirov@220: package org.tmatesoft.hg.repo;
tikhomirov@220: 
tikhomirov@220: import java.util.ArrayList;
tikhomirov@220: import java.util.Arrays;
tikhomirov@220: import java.util.Collections;
tikhomirov@220: import java.util.HashMap;
tikhomirov@220: import java.util.HashSet;
tikhomirov@220: import java.util.LinkedList;
tikhomirov@220: import java.util.List;
tikhomirov@220: import java.util.Map;
tikhomirov@220: import java.util.TreeMap;
tikhomirov@220: 
tikhomirov@220: import org.tmatesoft.hg.core.Nodeid;
tikhomirov@220: import org.tmatesoft.hg.repo.HgChangelog.RawChangeset;
tikhomirov@220: import org.tmatesoft.hg.util.ProgressSupport;
tikhomirov@220: 
tikhomirov@220: /**
tikhomirov@220:  *
tikhomirov@220:  * @author Artem Tikhomirov
tikhomirov@220:  * @author TMate Software Ltd.
tikhomirov@220:  */
tikhomirov@220: public class HgBranches {
tikhomirov@220: 	
tikhomirov@220: 	private final Map<String, BranchInfo> branches = new TreeMap<String, BranchInfo>();
tikhomirov@220: 	private final HgRepository repo;
tikhomirov@220: 	
tikhomirov@220: 	HgBranches(HgRepository hgRepo) {
tikhomirov@220: 		repo = hgRepo;
tikhomirov@220: 	}
tikhomirov@220: 
tikhomirov@220: 	void collect(final ProgressSupport ps) {
tikhomirov@220: 		ps.start(1 + repo.getChangelog().getRevisionCount() * 2);
tikhomirov@220: 		final HgChangelog.ParentWalker pw = repo.getChangelog().new ParentWalker();
tikhomirov@220: 		pw.init();
tikhomirov@220: 		ps.worked(repo.getChangelog().getRevisionCount());
tikhomirov@220: 		final HashMap<String, Nodeid> branchStart = new HashMap<String, Nodeid>();
tikhomirov@220: 		final HashMap<String, Nodeid> branchLastSeen = new HashMap<String, Nodeid>();
tikhomirov@220: 		final HashMap<String, List<Nodeid>> branchHeads = new HashMap<String, List<Nodeid>>();
tikhomirov@220: 		final HashSet<String> closedBranches = new HashSet<String>();
tikhomirov@220: 		HgChangelog.Inspector insp = new HgChangelog.Inspector() {
tikhomirov@220: 			
tikhomirov@220: 			public void next(int revisionNumber, Nodeid nodeid, RawChangeset cset) {
tikhomirov@220: 				String branchName = cset.branch();
tikhomirov@220: 				if (!branchStart.containsKey(branchName)) {
tikhomirov@220: 					branchStart.put(branchName, nodeid);
tikhomirov@220: 					branchHeads.put(branchName, new LinkedList<Nodeid>());
tikhomirov@220: 				}
tikhomirov@220: 				branchLastSeen.remove(branchName);
tikhomirov@220: 				if ("1".equals(cset.extras().get("close"))) {
tikhomirov@220: 					branchHeads.get(branchName).add(nodeid); // XXX what if it still has children?
tikhomirov@220: 					closedBranches.add(branchName);
tikhomirov@220: 				} else {
tikhomirov@220: 					if (pw.hasChildren(nodeid)) {
tikhomirov@220: 						// children may be in another branch
tikhomirov@220: 						// and unless we later came across another element from this branch,
tikhomirov@220: 						// we need to record all these as valid heads
tikhomirov@220: 						// XXX what about next case: head1 with children in different branch, and head2 without children
tikhomirov@220: 						// head1 would get lost
tikhomirov@220: 						branchLastSeen.put(branchName, nodeid);
tikhomirov@220: 					} else {
tikhomirov@220: 						// no more children known for this node, it's (one of the) head of the branch
tikhomirov@220: 						branchHeads.get(branchName).add(nodeid);
tikhomirov@220: 					}
tikhomirov@220: 				}
tikhomirov@220: 				ps.worked(1);
tikhomirov@220: 			}
tikhomirov@220: 		}; 
tikhomirov@220: 		repo.getChangelog().all(insp);
tikhomirov@220: 		for (String bn : branchLastSeen.keySet()) {
tikhomirov@220: 			branchHeads.get(bn).add(branchLastSeen.get(bn));
tikhomirov@220: 		}
tikhomirov@220: 		for (String bn : branchStart.keySet()) {
tikhomirov@220: 			Nodeid[] heads = branchHeads.get(bn).toArray(new Nodeid[0]);
tikhomirov@220: 			BranchInfo bi = new BranchInfo(bn, branchStart.get(bn), heads, closedBranches.contains(bn));
tikhomirov@220: 			branches.put(bn, bi);
tikhomirov@220: 		}
tikhomirov@220: 		ps.done();
tikhomirov@220: 	}
tikhomirov@220: 
tikhomirov@220: 	public List<BranchInfo> getAllBranches() {
tikhomirov@220: 		return new LinkedList<BranchInfo>(branches.values());
tikhomirov@220: 				
tikhomirov@220: 	}
tikhomirov@220: 
tikhomirov@220: 	public BranchInfo getBranch(String name) {
tikhomirov@220: 		return branches.get(name);
tikhomirov@220: 	}
tikhomirov@220: 	
tikhomirov@220: 	public static class BranchInfo {
tikhomirov@220: 		private final String name;
tikhomirov@220: 		private final List<Nodeid> heads;
tikhomirov@220: 		private final boolean closed;
tikhomirov@220: 		private final Nodeid start;
tikhomirov@220: 
tikhomirov@220: 		BranchInfo(String branchName, Nodeid first, Nodeid[] branchHeads, boolean isClosed) {
tikhomirov@220: 			name = branchName;
tikhomirov@220: 			start = first;
tikhomirov@220: 			heads = Collections.unmodifiableList(new ArrayList<Nodeid>(Arrays.asList(branchHeads)));
tikhomirov@220: 			closed = isClosed;
tikhomirov@220: 		}
tikhomirov@220: 
tikhomirov@220: 		public String getName() {
tikhomirov@220: 			return name;
tikhomirov@220: 		}
tikhomirov@220: 		public boolean isClosed() {
tikhomirov@220: 			return closed;
tikhomirov@220: 		}
tikhomirov@220: 		public List<Nodeid> getHeads() {
tikhomirov@220: 			return heads;
tikhomirov@220: 		}
tikhomirov@220: //		public Nodeid getTip() {
tikhomirov@220: //		}
tikhomirov@220: 		public Nodeid getStart() {
tikhomirov@220: 			// first node where branch appears
tikhomirov@220: 			return start;
tikhomirov@220: 		}
tikhomirov@220: 	}
tikhomirov@220: }