| Time |
S |
Nick |
Message |
| 00:12 |
|
|
SoniEx2 joined ##javaee |
| 01:53 |
|
|
scripty joined ##javaee |
| 02:04 |
|
|
scripty joined ##javaee |
| 02:14 |
|
scripty |
Howdy ALL |
| 04:15 |
|
sfisque |
javafx isn't 7. it's been around for some years. the advantage of swing is stability. the swing api has been solidified for over a decade. stable, reliable. blah blah blah |
| 04:48 |
|
|
scripty joined ##javaee |
| 06:14 |
|
|
scripty joined ##javaee |
| 07:45 |
|
|
scripty_ joined ##javaee |
| 07:47 |
|
|
SoniEx joined ##javaee |
| 09:47 |
|
|
EnderMoney joined ##javaee |
| 11:07 |
|
tjsnell |
and ugly |
| 14:06 |
|
|
Quest joined ##javaee |
| 14:20 |
|
|
scripty joined ##javaee |
| 14:25 |
|
|
scripty_ joined ##javaee |
| 14:27 |
|
scripty_ |
What are the tools used in web app ? |
| 14:30 |
|
Guest273 |
tools? |
| 14:30 |
|
scripty_ |
yeah tools |
| 14:31 |
|
scripty_ |
Hey Quest |
| 14:31 |
|
Quest |
scripty_, you mean frameworks, IDEs, technology. by tools? |
| 14:31 |
|
Quest |
hey.. |
| 14:32 |
|
scripty_ |
yeah (i really dont like framework ) |
| 14:33 |
|
scripty_ |
Any tools to find out there is a memory leak in your application |
| 14:33 |
|
scripty_ |
like that |
| 14:33 |
|
Quest |
well, JSP, servlets, frameworks like spring, struts, EJBs, JPA, Hibernate, html, css, javascript, jquery, and many more |
| 14:34 |
|
scripty_ |
I worked on JPA, Struts all the version and Spring since the beginning but i quit using all the frameworks ........ My question is different :/ |
| 14:35 |
|
Quest |
memory leaks? |
| 14:35 |
|
scripty_ |
yep |
| 14:35 |
|
Quest |
dont have experience in that. |
| 14:36 |
|
Quest |
may be a debugger? |
| 14:38 |
|
scripty_ |
there is a debugger 0_o |
| 14:40 |
|
Quest |
yes. there are debuggers |
| 14:40 |
|
scripty_ |
dont say its in IDE :P |
| 14:41 |
|
Quest |
http://www.vogella.com/articles/EclipseDebugging/article.html |
| 14:41 |
|
scripty_ |
i know that , Thank you :) |
| 14:42 |
|
Quest |
:) |
| 14:45 |
|
scripty_ |
Quest what all the IDE have you worked On ? |
| 14:45 |
|
sfisque |
if you want a quality profiler, jprofiler, but it's not cheap |
| 14:45 |
|
Quest |
netbeans , eclipse. but i heard more good things about IDEA |
| 14:45 |
|
sfisque |
idea is good, but you have to pay. the "freeware" version isnt so great |
| 14:46 |
|
Quest |
sfisque, would it do? |
| 14:46 |
|
sfisque |
any profiler worth it's salt will assist in finding memory leaks |
| 14:46 |
|
scripty_ |
Netbeans i hated it , my x-company forced me to use it :( |
| 14:47 |
|
scripty_ |
Netbeans is slow , very slow |
| 14:48 |
|
scripty_ |
sfisque thank you |
| 14:48 |
|
sfisque |
only on crappy hardware or badly managed OS. if you have a halfway decent setup, it's great |
| 14:49 |
|
scripty_ |
sfisque i had 1 GB RAM |
| 14:49 |
|
sfisque |
ROFL |
| 14:49 |
|
scripty_ |
They never upgraded |
| 14:49 |
|
sfisque |
that's barely enough to run a modern OS let alone an IDE |
| 14:50 |
|
sfisque |
my 7 year old macbook has 3gb of ram |
| 14:50 |
|
scripty_ |
They gave a new system with 1.5 GB , after many request to upgrade |
| 14:50 |
|
sfisque |
and it runs netbeans usably well |
| 14:51 |
|
sfisque |
my work machine is a quad core with 8gb. win7. netbeans smokes |
| 14:51 |
|
sfisque |
granted before they upgraded me (XP with 4gb) netbeans was painful. but i blame that on XP and not the memory |
| 14:52 |
|
sfisque |
on thing to keep in mind. if the AV on the machine is managed by "them", you want to negotiate a "quiet spot" on the harddrive that isnt aggressively scanned. otherwise, any IDEA will suffer |
| 14:52 |
|
sfisque |
***IDE |
| 14:54 |
|
scripty_ |
hmmm , they were using XP |
| 14:54 |
|
scripty_ |
and 1.5 GB RAM |
| 14:55 |
|
Quest |
had any one ever made a bruteforce algorithm? |
| 14:55 |
|
sfisque |
that would be part of it. XP isnt' optimized for multi-core. and 1.5 gb isn't enough. if you're building products, you need a large footprint. i give netbeans 1.25 gb alone. assume 256 for the OS, and 512 for "other stuff" and you're at 2gb minimum for a usable authoring platform |
| 14:56 |
|
sfisque |
many times quest |
| 14:58 |
|
Quest |
sfisque, you were able to print out ALL possible combinations for a given charset e.g char[] charset = "ABCDEFGHIJKLMNOPQRSTUVWXYZ".toCharArray(); ? |
| 14:59 |
|
Quest |
this simple thing is getting me crazy though ) |
| 15:00 |
|
sfisque |
do you want combinations or permutations. |
| 15:00 |
|
sfisque |
? |
| 15:03 |
|
Quest |
am.. combinations i think? what do you mean by permutations? |
| 15:04 |
|
Quest |
its like this. for the current example. a,b,c,d......z then at last index "z". it goes like aa,ab,ac....az. then aaa,aab,aac,aad........aaz to zzzzzzzzzzzzzzzzzzzzzzzzzz |
| 15:04 |
|
sfisque |
combination (aaab == aaba ) permutation ( aaab != aaba ) |
| 15:05 |
|
sfisque |
basically if you're after combinations, brute force would be a modified bubble sort |
| 15:05 |
|
Quest |
hm. k . but I only wanted to do that in the above said way |
| 15:05 |
|
|
scripty joined ##javaee |
| 15:05 |
|
sfisque |
so basically you have 3 loops |
| 15:05 |
|
scripty |
permutation , use backtracking |
| 15:06 |
|
sfisque |
one for end index, and the inner ones that loop through the set and construct the tuples |
| 15:07 |
|
Quest |
hm. |
| 15:07 |
|
Quest |
three loops |
| 15:07 |
|
Quest |
hm |
| 15:07 |
|
sfisque |
yah |
| 15:07 |
|
Quest |
and backtracking should be used? so that was the hudle? |
| 15:07 |
|
Quest |
hurdle* |
| 15:08 |
|
sfisque |
backtracking? for what? |
| 15:08 |
|
sfisque |
you're just going to brute force through the set |
| 15:08 |
|
Quest |
hm. |
| 15:08 |
|
sfisque |
outside loop tells you "how big each tuple is" (first iteration = 1, second iteration = 2, etc.) |
| 15:09 |
|
sfisque |
oh wait |
| 15:09 |
|
scripty |
sfisque, wat |
| 15:09 |
|
Quest |
cant I do it in just string concatinations way? |
| 15:09 |
|
sfisque |
you'll need recursion |
| 15:09 |
|
sfisque |
so you still need the outer loop to handle the "tuple size" |
| 15:10 |
|
scripty |
brb |
| 15:10 |
|
sfisque |
but since the tuple size is arbitrary until runtime, you cannot lock down the loops |
| 15:10 |
|
sfisque |
unless you actually unroll the looping and have 26^26 loop constructs |
| 15:11 |
|
sfisque |
so yeah, you probably could use backtracking, but that would not qualify as "brute force" |
| 15:11 |
|
Quest |
sfisque, heres what i wanted. http://pastebin.com/gUpXmMWZ |
| 15:12 |
|
Quest |
in a simple string concatinations thing |
| 15:12 |
|
sfisque |
right but what about the cases that omit. |
| 15:12 |
|
sfisque |
AC BD LZ |
| 15:13 |
|
sfisque |
you need to descend through all sorts of arrangements on the set |
| 15:13 |
|
Quest |
that i cant figure out |
| 15:14 |
|
Quest |
do you have a code that you wrote in the past about this? |
| 15:14 |
|
scripty |
I like this IRC they give solution to the requirement :P LOL |
| 15:14 |
|
sfisque |
well, that's what i'm describing. basically you need a loop that tells you how big a tuple is. then you need a loop to tell you the starting point. and then you need to loop thorugh the set enough times to assemble all the combintations for that "tuple size" |
| 15:16 |
|
Quest |
hm |
| 15:17 |
|
Quest |
k |
| 15:18 |
|
sfisque |
so N * N * sigma( i, j ) |
| 15:18 |
|
sfisque |
where i is the current index of the outer loop |
| 15:22 |
|
Quest |
trying |
| 15:23 |
|
sfisque |
the elegant solution would use a bitstring that is (26^2)/2 long |
| 15:27 |
|
Quest |
sfisque, the solution iam getting (well not a solution though) is to have as many for loops as the length of charset array. that is insane. this works ok. but i need intelligent one. heres the past. http://pastebin.com/j30EA50q |
| 15:37 |
|
sfisque |
that's the brute force solution |
| 15:37 |
|
sfisque |
by definition |
| 15:37 |
|
sfisque |
you're just muscling through the problem, one step at a time, no matter how many steps you take |
| 15:37 |
|
sfisque |
== brute force |
| 15:38 |
|
Quest |
hm |
| 15:38 |
|
scripty |
Brute force requires no brain :D |
| 15:38 |
|
Quest |
ya. but coding for it does. |
| 15:38 |
|
Quest |
:) |
| 15:38 |
|
scripty |
no |
| 15:38 |
|
Quest |
no. you mean you have made such algorithms? |
| 15:38 |
|
scripty |
I did couple of bruteforce when i was young |
| 15:39 |
|
Quest |
no. you mean you have made such algorithms with not using brain *? |
| 15:39 |
|
sfisque |
we all have Q. it's part of learning |
| 15:39 |
|
Quest |
hm |
| 15:39 |
|
scripty |
yes Quest |
| 15:39 |
|
scripty |
sfisque, is right |
| 15:39 |
|
sfisque |
you learn to do soemthing the simple way, and then you llearn the subtleties |
| 15:40 |
|
scripty |
Quest are you really Quest ? |
| 15:41 |
|
scripty |
Quest was Admin here |
| 15:41 |
|
Quest |
being admin does not means iam more learned than all present here :) |
| 15:42 |
|
scripty |
Being Admin means that ..... Unlike noob like me |
| 15:42 |
|
Quest |
I see my self least learned as i dont have much experience. but my passion for java resulted in me to own this channel. |
| 15:42 |
|
sfisque |
being admin means, having ops. nothing more, nothing less. |
| 15:43 |
|
scripty |
sfisque :D |
| 15:43 |
|
Quest |
ya :) |
| 15:43 |
|
Quest |
the truth is. i have 6 months of experience :) |
| 15:43 |
|
sfisque |
me too |
| 15:43 |
|
sfisque |
:P |
| 15:43 |
|
sfisque |
in dog years |
| 15:44 |
|
Quest |
6 months + 14 years |
| 15:44 |
|
Quest |
sfisque, ^ |
| 15:44 |
|
sfisque |
shhh |
| 15:45 |
|
Quest |
:) |
| 15:46 |
|
|
scripty joined ##javaee |
| 15:51 |
|
scripty |
brb |
| 16:05 |
|
pdurbin |
heh. dog years |
| 16:13 |
|
Quest |
sfisque, recursion is the only solution. its working . i gues..... http://pastebin.com/csxMN9Yx |
| 16:14 |
|
|
kobain joined ##javaee |
| 16:20 |
|
scripty |
yeppy ! yeppy ! yeppy! finally it got connected |
| 16:20 |
|
scripty |
lol |
| 17:13 |
|
scripty |
sfisque pls help |
| 17:14 |
|
pdurbin |
scripty: with what? |
| 17:15 |
|
scripty |
1 min |
| 17:18 |
|
scripty |
pdurbin it's all over my app got killed :( |
| 17:21 |
|
pdurbin |
scripty: why? |
| 17:21 |
|
scripty |
Never run bruteforce in script :) |
| 17:23 |
|
pdurbin |
ok |
| 17:23 |
|
* scripty |
lag : 0.3 seconds |
| 17:36 |
|
|
manulite joined ##javaee |
| 17:39 |
|
scripty |
I'm so glad there is java IRC :) |
| 17:50 |
|
|
Quest joined ##javaee |
| 17:50 |
|
Quest |
scripty, what got connected? |
| 17:51 |
|
sfisque |
great Q. was doing stuff with kids. |
| 17:54 |
|
Quest |
so its good? |
| 17:54 |
|
sfisque |
it's good if it works :-) |
| 17:58 |
|
Quest |
it works but iam not satisfied yet. |
| 17:59 |
|
sfisque |
then make it better. good means it's good, but you can always make it better :-) |
| 17:59 |
|
Quest |
hm |
| 18:06 |
|
scripty |
Hey Quest , i mean Internet :P |
| 18:08 |
|
Quest |
:) |
| 18:09 |
|
Quest |
sfisque, this is a misery. every time i try, its not exactly what i thought of. CC comes after BZ and BB comes after AZ. so BA and CA, CB are missed out. and its not in the sequence that is in "stated way". see last output is WZZZ XXXX XXXY XXXZ XXYY XXYZ XXZZ XYYY XYYZ XYZZ XZZZ YYYY YYYZ YYZZ YZZZ ZZZZ |
| 18:10 |
|
Quest |
stated way. http://pastebin.com/fYPwYyQR |
| 18:10 |
|
sfisque |
they are not missing. if you're looking for combinations, AB == BA |
| 18:10 |
|
sfisque |
are you looking for combinations or permutations? |
| 18:10 |
|
Quest |
no. AB != BA |
| 18:11 |
|
Quest |
the password to be bruteforced can be AB which is not equal to BA |
| 18:11 |
|
sfisque |
then you are looking for permutations |
| 18:11 |
|
Quest |
permutations then |
| 18:11 |
|
scripty |
:D |
| 18:12 |
|
scripty |
I like combination |
| 18:12 |
|
Quest |
I like results |
| 18:12 |
|
scripty |
:( |
| 18:12 |
|
Quest |
:) |
| 18:16 |
|
scripty |
All i get is process out of memory |
| 18:16 |
|
scripty |
:( |
| 18:20 |
|
scripty |
In 5 min i got my password :D |
| 18:20 |
|
Quest |
which password? |
| 18:21 |
|
scripty |
i dont have in IRC :P |
| 19:14 |
|
|
znurgl joined ##javaee |
| 19:29 |
|
|
znurgl left ##javaee |
| 20:48 |
|
|
SoniEx2 joined ##javaee |
| 22:16 |
|
|
kobain joined ##javaee |
| 22:18 |
|
|
Quest joined ##javaee |
| 22:18 |
|
|
tjsnell joined ##javaee |
| 23:47 |
|
|
kobain joined ##javaee |
| 23:55 |
|
|
raoul- joined ##javaee |
