Skip to main content

Migrate source code from SourceForge subversion repository to GitHub

Since GitHub.com, a successful commercial git hosting provider that hosts over a million repositories, offers reliable free open source git hosting service now, I decided to go ahead and move the source code that I had in last 8 years from sourceforge subversion repository to GitHub. This page documents the steps that I did, which was pretty simple and smooth anyway.

  1. Obviously I need to be a user in GitHub.com. It's easy to sign up, no confirmation is required.
  2. Create new repository from here, and import from a public subversion URL. The URL is something like http://<projectname>.svn.sourceforge.net/svnroot/<projectname>.
  3. Before import starts, you are required to tell more about each user discovered from subversion repository. The user name and email address each sourceforge user maps to doesn't have to be existing user in GitHub.com.
  4. It takes very very long time for import to finish. Be patient.
  5. I already have git on my computer. If you don't, find out how it's installed on your operating system. If you don't know what git is, stop here and start spending some time on http://git-scm.com.
  6. Tell GitHub.com the public SSH keys of each computer that wants to work with the git repository. Sourceforge does it too. Goto Account Settings/SSH Public Keys and update the keys.
  7. Assume the import is done. Before pulling code to local, a little configuration is required. This document describes several properties to set. The properties are to tell GitHub.com who the user is. They end up stored in <USERHOME>/.gitconfig file.
  8. Find a working directory, run the git clone command to get local copies.
git clone git@github.com:<user>/<repository name>.git

Comments

Post a Comment

Popular posts from this blog

Spring, Angular and other reasons I like and hate Bazel at the same time

For several weeks I've been trying to put together an Angular application served Java Spring MVC web server in Bazel. I've seen the Java, Angular combination works well in Google, and given the popularity of Java, I want get it to work with open source. How hard can it be to run arguably the best JS framework on a server in probably the most popular server-side language with  the mono-repo of planet-scale ? The rest of this post walks through the headaches and nightmares I had to get things to work but if you are just here to look for a working example, github/jiaqi/angular-on-java is all you need. https://github.com/jiaqi/angular-on-java Java web application with Appengine rule Surprisingly there isn't an official way of building Java web application in Bazel, the closest thing is the Appengine rule  and Spring MVC seems to work well with it. 3 Java classes, a JSP and an appengine.xml was all I need. At this point, the server starts well but I got "No ...
Post a Comment
Read more

Customize IdGenerator in JPA, gap between Hibernate and JPA annotations

JPA annotation is like a subset of Hibernate annotation, this means people will find something available in Hibernate missing in JPA. One of the important missing features in JPA is customized ID generator. JPA doesn't provide an approach for developer to plug in their own IdGenerator. For example, if you want the primary key of a table to be BigInteger coming from sequence, JPA will be out of solution. Assume you don't mind the mixture of Hibernate and JPA Annotation and your JPA provider is Hibernate, which is mostly the case, a solution before JPA starts introducing new Annotation is, to replace JPA @SequenceGenerator with Hibernate @GenericGenerator. Now, let the code talk. /** * Ordinary JPA sequence. * If the Long is changed into BigInteger, * there will be runtime error complaining about the type of primary key */ @Id @Column(name = "id", precision = 12) @GeneratedValue(strategy = GenerationType.SEQUENCE, generator = "XyzIdGenerator") @SequenceGe...
4 comments
Read more

Project Euler problem 220 - Heighway Dragon

This document goes through a Java solution for Project Euler problem 220 . If you want to achieve the pleasure of solving the unfamiliarity and you don't have a solution yet, PLEASE STOP READING UNTIL YOU FIND A SOLUTION. Problem 220 is to tell the coordinate after a given large number of steps in a Dragon Curve . The first thing came to my mind, is to DFS traverse a 50 level tree by 10^12 steps, during which it keeps track of a direction and a coordinate. Roughly estimate, this solution takes a 50 level recursion, which isn't horrible, and 10^12 switch/case calls. Written by a lazy and irresponsible Java engineer, this solution vaguely looks like: Traveler traveler = new Traveler(new Coordinate(0, 0), Direction.UP); void main() { try { traverse("Fa", 0); } catch (TerminationSignal signal) { print signal; } } void traverse(String plan, int level) { foreach(char c:plan) { switch(c) { case 'F': traveler.stepForward(); break; ca...
Post a Comment
Read more