tikhomirov@30: /*
tikhomirov@30:  * Copyright (c) 2011 Artem Tikhomirov 
tikhomirov@30:  */
tikhomirov@30: package com.tmate.hgkit.console;
tikhomirov@30: 
tikhomirov@30: import java.util.Collection;
tikhomirov@30: import java.util.LinkedHashSet;
tikhomirov@30: import java.util.LinkedList;
tikhomirov@30: import java.util.List;
tikhomirov@30: 
tikhomirov@30: import com.tmate.hgkit.fs.RepositoryLookup;
tikhomirov@30: import com.tmate.hgkit.ll.HgRepository;
tikhomirov@30: import com.tmate.hgkit.ll.Nodeid;
tikhomirov@30: import com.tmate.hgkit.ll.Revlog;
tikhomirov@30: 
tikhomirov@30: /**
tikhomirov@30:  * hg out
tikhomirov@30:  * @author artem
tikhomirov@30:  */
tikhomirov@30: public class Outgoing {
tikhomirov@30: 
tikhomirov@30: 	public static void main(String[] args) throws Exception {
tikhomirov@30: 		RepositoryLookup repoLookup = new RepositoryLookup();
tikhomirov@30: 		RepositoryLookup.Options cmdLineOpts = RepositoryLookup.Options.parse(args);
tikhomirov@30: 		HgRepository hgRepo = repoLookup.detect(cmdLineOpts);
tikhomirov@30: 		if (hgRepo.isInvalid()) {
tikhomirov@30: 			System.err.printf("Can't find repository in: %s\n", hgRepo.getLocation());
tikhomirov@30: 			return;
tikhomirov@30: 		}
tikhomirov@30: 		// FIXME detection of 
tikhomirov@30: 		List<Nodeid> base = new LinkedList<Nodeid>();
tikhomirov@30: 		base.add(Nodeid.fromAscii("d6d2a630f4a6d670c90a5ca909150f2b426ec88f".getBytes(), 0, 40));
tikhomirov@30: 		//
tikhomirov@30: 		// fill with all known
tikhomirov@30: 		Revlog.ParentWalker pw = hgRepo.getChangelog().new ParentWalker();
tikhomirov@30: 		pw.init();
tikhomirov@30: 		LinkedHashSet<Nodeid> sendToRemote = new LinkedHashSet<Nodeid>(pw.allNodes());
tikhomirov@30: 		dump("initial state", sendToRemote);
tikhomirov@30: 		// remove base and its parents
tikhomirov@30: 		LinkedList<Nodeid> queueToClean = new LinkedList<Nodeid>(base);
tikhomirov@30: 		while (!queueToClean.isEmpty()) {
tikhomirov@30: 			Nodeid nid = queueToClean.removeFirst();
tikhomirov@30: 			if (sendToRemote.remove(nid)) {
tikhomirov@30: 				pw.appendParentsOf(nid, queueToClean);
tikhomirov@30: 			}
tikhomirov@30: 		}
tikhomirov@30: 		dump("Clean from known parents", sendToRemote);
tikhomirov@30: 		// XXX I think sendToRemote is what we actually need here - everything local, missing from remote
tikhomirov@30: 		// however, if we need to send only a subset of these, need to proceed.
tikhomirov@30: 		LinkedList<Nodeid> result = new LinkedList<Nodeid>();
tikhomirov@30: 		// find among left those without parents
tikhomirov@30: 		for (Nodeid nid : sendToRemote) {
tikhomirov@30: 			Nodeid p1 = pw.firstParent(nid);
tikhomirov@30: 			// in fact, we may assume nulls are never part of sendToRemote
tikhomirov@30: 			if (p1 != null && !sendToRemote.contains(p1)) {
tikhomirov@30: 				Nodeid p2 = pw.secondParent(nid);
tikhomirov@30: 				if (p2 == null || !sendToRemote.contains(p2)) {
tikhomirov@30: 					result.add(nid);
tikhomirov@30: 				}
tikhomirov@30: 			}
tikhomirov@30: 		}
tikhomirov@30: 		dump("Result", result);
tikhomirov@30: 		// final outcome is the collection of nodes between(lastresult and revision/tip)
tikhomirov@30: 		//
tikhomirov@30: 		System.out.println("TODO: nodes between result and tip");
tikhomirov@30: 	}
tikhomirov@30: 
tikhomirov@30: 	private static void dump(String s, Collection<Nodeid> c) {
tikhomirov@30: 		System.out.println(s);
tikhomirov@30: 		for (Nodeid n : c) {
tikhomirov@30: 			System.out.println(n);
tikhomirov@30: 		}
tikhomirov@30: 	}
tikhomirov@30: }