Shine Tom

Greenhorn
+ Follow
since Sep 17, 2012
Merit badge: grant badges
For More
Cows and Likes
Cows
Total received
0
In last 30 days
0
Total given
0
Likes
Total received
0
Received in last 30 days
0
Total given
8
Given in last 30 days
0
Forums and Threads
Scavenger Hunt
expand Ranch Hand Scavenger Hunt
expand Greenhorn Scavenger Hunt

Recent posts by Shine Tom

Hello everyone,
I need some advice. I am given a eclipse plugin written by another guy and I need to extend this plugin with some extra features. I have little knowledge in Java and no experience in plugin development. I want to know which is the best way to start and to understand the existing plugin.

Thankyou!!
Shine
11 years ago
Hi Campbell,
what is said is true. I m not really familiar with java and also the Data Structure concept behind that. I m in the process of learning that by doing.
In my tree i can have n number of children ideally, not just a left or right. that is why i didnt try to make a Node class. or otherwise I should make a List<Node> children, which i was not so sure of..
11 years ago
Hello,
Can somebody please help me with my Tree implementation. I have an array list with values("1.1","1.2","1.3","1.3.1.1","1.3.1.2","1.4","1.4.1.1","1.4.2.1","1.4.2.1.1.1","1.4.2.1.1.2","1.5","1.6","1.6.1.1") and I m trying to create a Tree with this data. Please find below attached my code for the same.

My tree should look like this in the picture attached.


Now I want to print the parent of each node starting from the last one, so starting at "1.6.1.1" . and but dont know to to traverse the branch 1.4.1.1 and other children of 1.4 children. Please someone help me.
PS: I am new to java so please correct me if tehre is something wrong.
11 years ago
Can somebody help me with my Tree implementation. I have an array list with values("1.1","1.2","1.3","1.3.1.1","1.3.1.2","1.4","1.4.1.1","1.4.2.1","1.4.2.1.1.1","1.4.2.1.1.2","1.5","1.6","1.6.1.1") and I m trying to create a Tree with this data. Please find below attached my code for the same.

My tree should look like this in the picture attached.


Now I want to print the parent of each node starting from the last one, so starting at "1.6.1.1" . and but dont know to to traverse the branch 1.4.1.1 and it's children. Please someone help me.
PS: I am new to java so please correct me if tehre is something wrong.
11 years ago
Thanks Fred for replying

Rev 1.3 <-> Rev 1.5 if there is NO Rev 1.4 ?

:> i'll get it cleared. the people in charge have already left..
11 years ago
I was again sick.i m really sorry.

Rev branch 1.2.1.2.1.1 <-> Rev branch 1.2.1.3
is true (and vice-versa); and that is going to be quite difficult to program without some master table of valid versions.

true. I would need to implement 'something' to do that.

What about:
Rev 1.3 <-> Rev branch 1.3.1

: this versioning system doesnt have a version like 1.3.1.
1.3.1 will be considered as the base for 1.3.1.1

Rev 1.3 <-> Rev 1.5 if there is NO Rev 1.4 ?

: can this happen that a version is not there??
11 years ago
Hi Everyone,

I m so sorry for the late reply.. was sick and bedridden. Coming back to the thread..

Can versions be lettered

--> No

Are you guaranteed that there can't be a 1.9.1 made after 1.10 (

-> 1.9.1.1 can be made after 1.10 but when doing comparison, it is not needed to be compared. 1.10 will b e compared aganist 1.9 and 1.9.1.1 aganist 1.9.

I have attached the Versioning Structure.

Shine
11 years ago
Thanks Fred and Tony.. I will do my homewok and get that clear and get back.
11 years ago

Rev 1.9 <-> 1.10

Should return true

1.2 <-> 1.3.1

returns false.

it should return true only when the versions are consecutive.

Can a number be skipped, i.e. you have a 1.1 and a 1.3, but not a 1.2?

are you guaranteed to have a 1.3 before you have a 1.3.1?

: My understanding was versioning is done in a series, not that one version of the file is 1.2 and then comes 1.4.
Correct me if I am wrong.
11 years ago
Hello Everyone,
has anyone come across the need to compare the versions of a file and see if they are consecutive?
eg: Rev 1.1 <-> Rev 1.2 =>true
Rev 1.2 <-> Rev 1.3 =>true
Rev 1.3 <-> Rev 1.4 =>true
Rev 1.3 <-> Rev branch 1.3.1.1 =>true
Rev 1.3.1.1 <-> Rev 1.3.1.2 =>true
Rev 1.1<-> Rev 1.4 => false
Rev 1.2.1.2 <-> Rev 1.2.1.2.1.1 =>true

i was thinking to tokenize the string containing the version number with '.' as delimiter and then comparing each each digit to see if they are consecutive versions.

what do you think??
11 years ago
Thanks for the update. Alos one more doubt, what about in the case of eclipse plugins ? do they need a main method??
11 years ago

fred rosenberger wrote:Bob,

the original post asked about all java PROJECTS, not programs. I have worked on many PROJECTS that didn't have a main.



Hello Fred, Can you tell me why many java PROJECTS doesnt contain a main function. Please also tell me when there is no main method, how is the application executed.
Many Thanks,
Shine
11 years ago
Hello Everyone,

I found a diff algorithm in internet and then modified it according to my needs for showing the 'moves' instead of 'delete + insert'. the program also indicates insert and delete as well. Since my requirement is fulfilled, i m marking the thread as resolved.

Thankyou all once again
11 years ago
Hello Winston ,
Thankyou for your update. I will try to do little more research on this and will update the thread. As you said, the diff algorithm is not as simple as I have written.. what i tried to works for just words in a file but not for comparing normal files.
Regards,
Shine
11 years ago