| |
| |
| |
|
Page: 1 2 3 4 5 6
Comments:
<0> probably that there is no such method as drawCircle.
<1> but dosnt work
<1> yes there is
<2> Lion-O: imagine that
<1> http://dr-bill.net/CSC012/docs/CSLib/DrawingBox.html#drawCircle(int,%20int,%20int)
<2> e^lnx: where? The API docs don't show it :)
<2> e^lnx: haha
<0> yeah, sure.
<2> if you examine that link closely, you'll see it takes THREE ints, not four
<2> and why would you expect us to know about your CSC012 custom cl***es?
<0> jottinger: telepathy.
<2> Lion-O: BTW, JES isn't solaris... and Sun's been pushing Java into the admin domain for a long time
<0> I'm surprised you don't know. Any helpchannel, including you know who, has psychic people.
<1> g.drawCircle(sp.x,ep.y,20) will this work than?
<2> e^lnx: i dunno, it's your code
<2> and your cl***
<1> damn
<2> maybe it'll draw a box
<0> jottinger: I know. But JES is now part of the Solaris Enterprise System.. And yeah; you're right about Sun pushing Java but so far I haven't paid much attention to that.
<2> if it was me, I'd use Graphics2D.drawOval(int,int,int,int)
<2> Lion-O: have they changed the kernel over to sol10?
<0> jottinger: JES runs on Sol10 without problems. Pretty nice environment too, if a bit cryptic here and there.
<2> hmm
<2> oh, I see what'shappening
<2> I'm confusing JDS with JES
<0> aaah
<0> not surprising considering how many new names they're releasing these days.
<2> yeah, they're changing the company a lot
<2> it's actually kinda neat to watch
<2> It'd be great if RMS would shut up every now and then, just long enough to think
<0> hmm, aye.
<0> I do think the whole 'movement' has changed a lot in the IT world, but sometimes I'm beginning to think they're trying to overdo it.
<2> yeah
<2> "code want to be free" is a little anthropomorphic for me
<0> lol
<2> hey, what irc server is the other channel on?
<0> my code wants to be saved :P
<2> my code just wants to be good
<0> my code isn't that old yet, still very pubering :P
<2> luckily, its desire is easy to fulfill, by virtue of being mine
<3> my code wants to be admired
<3> :)
<0> jottinger: see /notice
<2> I saw
<2> wolfey: good luck with that
<2> actually, my code doesn't earn a lot of kudos either
<3> ::)
<2> it's funny, people see my code and say "but that's not that great"
<2> but a year later, they're still waiting for that first bug report
<3> ::)
<0> hehehe
<2> It isn't perfect, and I *do* have bugs, of course
<2> but fixing them is usually trivial at worst
<3> jottinger: well once you know what input activates bug
<3> it's trivial
<3> problem is when it goes wrong and you dont even know WHEN
<3> :))
<3> you just see weird things
<3> :))
<4> Hello
<2> wolfey: then why not write code so that that sort of thing is clear? :)
<2> ... goodbye
<3> :))
<3> 15:02 -!- mode/#slovenia [+b *!*@86.124.*] by X
<3> 15:02 -!- xlzzg was kicked from #slovenia by X [(wolfy3d) <xlzzg> Lisa Vidal stripping at cams19. com !]
<3> another domain ban;)
<3> i think if one user from ISP is annoying, let all ISP users suffer
<3> that's only fair.
<3> :)
<4> Hello.
<3> hello
<0> damn undernet.org, ban 'm all! ;-)
<4> heh
<5> hi
<3> Lion-O: yes
<3> :)
<4> I need help programming something simple. I'm not expecting anyone to do it for me, but any help or guidence will be appriciated.
<3> NrGSTaR: okey, now you can explain your problem
<3> and we'll se if we can do it
<3> :)
<4> What I am expected to do is to write a method that counts sequences of the same type of length of integers from a rising or falling sequences with differnce of 1 between them. like, for example... if n=3, then from the array "1,2,3,5,8,3,3,2" the result will be 1 (1,2,3)
<5> simple indeed
<4> should be. it should be something like "int BlahBlah (int[], arr, int n)
<3> well your result aint int
<3> or you mean 1?
<3> what about 3 3? that is 0 (3,3)
<5> NrGSTaR: you're expected to return first number of sequence or entire sequence? WHat if there is more than one sequence in input data?
<5> NrGSTaR: or none
<4> 3,3 has no difference between the numbers, it should be raising or falling, like, 1,2 and 3,2.. but if the n=3 then only 1,2,3 or 5,6,7 will be accepted.
<4> Just the number of sequences.
<5> ok
<5> so, what's the problem?
<4> so if there is more, like "1,2,3,6,7,5,3,4,5" it will result 2.
<5> 3
<4> Ummm well I don't know where to begin :) So any guidence will be appriciated :)
<5> (123)(67)(345)
<5> NrGSTaR: first, break problem into simpler parts
<4> 6,7 will not be considered, since it has only 2 numbers in the sequence.
<5> n is min length of sequence?
<4> yep
<4> :)
<5> NrGSTaR: eg. write a method that analyzes your array starting from given index and goes until it either finds a sequence or end of array; it should return last index of a sequence or -1 if no sequence has been found
<2> well, figure out how to determine a sequence
<5> then, just call it a number of times
<4> One thing I should say is that I'm a beginner
<4> :)
<4> like, an "hello world" beginner :)
<3> i'd do it in one for loop with previous difference, previous element, counter for elements of sequence, counter for sequences found... while lastDifference = this element - previouselement, then counter for elements ++, if now difference is not the same anymore, if counter of elements >= given minimum sequence... counter of sequences ++
<4> Maybe I should just sit and learn. Is this conisdered complicated ?
<3> and return counter of sequences
<5> int count;int idx;while((idx=findSeq(arr,n,idx)) != -1)count++;
<2> NrGSTaR: do you know how to convert that input into an array of ints?
<4> no :/
<2> okay
<2> well, that's your first task
<4> I mean I am a total beginner, but I dont want anyone to "do the job" for me, I want to understand.
<5> NrGSTaR: that's basic algorithm, not guaranteed to be bug-free
<3> gilead: too complicated:) MINE IS EASIRE
<3> :)
<3> LINEAR
<3> :)
<4> :)
<4> uumm
<4> I'll be back in a minute
<3> Rob_uknow: updated version : http://86.61.107.81/netlines-homepage/netlines.jar in case you wanted to see :P
<3> :)
<6> not webstart enabled?
<3> well i dont yet have full access to a static web server
<3> so no, no webstart
<3> no sense at this point
<6> you just need a jnlp file
<3> Rob_uknow: was that u?
<6> yes
<3> so works now
<3> ?
<6> well
<6> how can I place the icons?
<6> I wasn't able to just put the icon everwhere
<3> there must be a free path using horizontal and vertical moves
<6> oke
<6> then it seemed to work
<3> if shape is blocked, you cant move
<3> good:)
<3> thank U
<6> opening files on my windows xp machine takes a while
<6> does anyone know what could cause that?
<3> windows xp.
<3> :)
Return to
#java
or
Go to some related
logs:
#AllNiteCafe
#php
Unknown device 1904:8139 +debian
#linuxhelp
#MissKitten
#asm
#asm
block iptables stayalive
#linuxhelp
#chatzone
|
|