Latest Announcemnent
New thread

SharpLeech 1.0.0 (AKA Final)

Status
Not open for further replies.
Hey Hyperz,
It's awesome you got it to work on IPB 3, two questions really, when are you going to release the IPB 3 compatible one? I just re-downloaded and it's still the old one, and second are you going to release the new compatible source code as well? Thanks for your work again bud awesome contribution!! :D
Marc180
 
Well yes the download links are still those of version 1.0.0. When I said I finished adding IPB3 support I meant that it's done in the version I'm currently working on.

Not sure when the next version will drop as it depends on how much I work on it daily. I hate giving dates. I THINK somewhere next week. Could be sooner or later though. There's quite a few changes being made for the next version. Not all will be visible for the end user but the next version will have the 1st big changes to the source since it was written a year back. You gotta remember this app was written in a hurry back then and was in no way meant to be something that would be maintained like it is now. The next version will be 1.1.0 instead of 1.0.1 to reflect the changes.

About the source code the answer is no - for now that is. I don't see the need for it, the source that was released is pretty complete and more than enough to get some1 started (saving them weeks of work).
 
godamn i was begging for a little feature censored word option for almost 1 year, thinking he is nice by releasing the tool, well happy new year mate:)
 
Hyperz said:
Well yes the download links are still those of version 1.0.0. When I said I finished adding IPB3 support I meant that it's done in the version I'm currently working on.

Not sure when the next version will drop as it depends on how much I work on it daily. I hate giving dates. I THINK somewhere next week. Could be sooner or later though. There's quite a few changes being made for the next version. Not all will be visible for the end user but the next version will have the 1st big changes to the source since it was written a year back. You gotta remember this app was written in a hurry back then and was in no way meant to be something that would be maintained like it is now. The next version will be 1.1.0 instead of 1.0.1 to reflect the changes.

About the source code the answer is no - for now that is. I don't see the need for it, the source that was released is pretty complete and more than enough to get some1 started (saving them weeks of work).
Click to expand...
Sounds great Hyperz, awesome job again on the tool!
Marc180
 
wman said:
godamn i was begging for a little feature censored word option for almost 1 year, thinking he is nice by releasing the tool, well happy new year mate:)
Click to expand...

Same to you.

That little future is something I believe should be done on the forum side. You could just as easily implement that 'filter' in the forum. I don't want to stuff #Leech full of those little things that do little but bloat the program.
 
Hyperz said:
I doubt there will be smf support any time soon, if ever. Not enough boards use it.
Click to expand...

Which is quite odd, being it's very secure and, in my opinion, much more aesthetically pleasing than phpbb. Thanks for this though, it's a great app, and I appreciate the time put into it.
 
Cutless said:
Which is quite odd, being it's very secure and, in my opinion, much more aesthetically pleasing than phpbb.
Click to expand...

That might be so but that has nothing to do with why I'm not adding it atm. For every 3 warez sites using phpBB you'll find 1 or less SMF boards. It's simply not used enough.

A bit of news:
About that async implementation which could speed up the program, I've decided to push it back a bit because I'm going to re-write the whole backend in F# instead. That'll take a good deal of time since I only just started programming F# and the language is nothing like 99% of other languages out there (it's functional instead of imperative). It really cooks your brain if you're new to it. F# example:
Code: 
[LEFT] [FONT=monospace] let rec factorial n =
    match n with
    | 0I -> 1I
    | _ -> n * factorial (n - 1I)
[/FONT]
 [/LEFT]
 [LEFT] [FONT=monospace] open List
(* print a list of numbers recursively *)
let rec printlist lst =
    if lst <> [] then
        printf "%d\n" (nth lst 0)
        printlist (tl lst)
 
(* Same thing, using matching against list elements *)
let rec printlist2 l =
    match l with
    | []     -> ()
    | h :: t -> printfn "%A" h
                printlist2 t
 
(* Using shorthand for match *)
let rec printlist3 = function
    | []     -> ()
    | h :: t -> printfn "%A" h
                printlist3 t
 
(* Or, using a higher-order function *)
let printlist4 lst = List.iter (printfn "%A") lst
[/FONT]
 [/LEFT]
 [LEFT] [FONT=monospace] (* Fibonacci Number formula *)
let rec fib n =
    match n with
    | 0 | 1 -> n
    | _ -> fib (n - 1) + fib (n - 2)
 
(* An alternative approach - a lazy recursive sequence of Fibonacci numbers *)
let rec fibs = seq {
    yield! [1; 1];
    for (x, y) in Seq.zip fibs (Seq.skip 1 fibs) -> x + y }
 
(* Print even fibs *)
[1 .. 10]
|> List.map     fib
|> List.filter  (fun n -> (n % 2) = 0)
|> printlist
 
(* Same thing, using Comprehension syntax *)
[ for i in 1..10 do
    let r = fib i
    if r % 2 = 0 then yield r ]
|> printlist
[/FONT]
 [/LEFT]
 [LEFT] [FONT=monospace] (* Sample Windows Forms Program *)
 
(* We need to open the Windows Forms library *)
open System.Windows.Forms
 
(* Create a window and set a few properties *)
let form = new Form(Visible=true, TopMost=true, Text="Welcome to F#")
 
(* Create a label to show some text in the form *)
let label =
    let temp = new Label()
    let x = 3 + (4 * 5)
    (* Set the value of the Text*)
    temp.Text <- sprintf "x = %d" x
    (* Remember to return a value! *)
    temp
 
(* Add the label to the form *)
do form.Controls.Add(label)
 
(* Finally, run the form *)
[<STAThread>]
do Application.Run(form)
[/FONT]
 [/LEFT]
 [LEFT] [FONT=monospace] (* async workflows sample (parallel tasks) *)
 
(* very naive prime number detector *)
let is_prime (n:int) =
 let bound = int (System.Math.Sqrt(float n)) in
  {2 .. bound} |> Seq.exists (fun x -> n % x = 0) |> not
 
(* we are using async workflows *)
let primeAsync n =
    async { return (n, is_prime n) }
 
(* return primes between m and n using multiple threads *)  
let primes m n =
    {m .. n}
        |> Seq.map primeAsync
        |> Async.Parallel
        |> Async.RunSynchronously
        |> Array.filter snd
        |> Array.map fst
 
(* run a test *)
primes 1000000 1002000
    |> Array.iter (printfn "%d")
[/FONT]
 [/LEFT]
Heh. Anyway, I'll still work on an update in the mean time though.
 
Ha, yeah. That looks way more complicated than Python (lol)

I just took a programming course last semester and it happened to be Python instead of some useful language like vB or C. I've never heard of F# until now.

Looking forward to it Hyperz!
 
Sharpleech is one of the best free leechers i have ever saw - Its free and easy to use.
Me personally i don't use leech softwares but i really appreciate your hard work, no one wouldn't do that for free.

good job, Hyperz.
 
Thanks Shadow

jayfella said:
yeah good luck with that hyperz. Im going to learn another language, but most likely php or something like that.
Click to expand...

Cheers. I'm surprised F# didn't impress you because it's the best answer for parallel computing out there. Meaning that using F# in anything that benefits from having/using more threads will save you a huge amount of time, simplify your code and make the program program run twice as fast for every CPU core available =). Not sure if you know what a ray tracer is I found this one in F# http://www.ffconsultancy.com/dotnet/fsharp/raytracer/index.html , if that would of been C# the amount of code would of easily tripled. If you run the program you see it nicely uses all cores. I think that when we start having CPU's with 16 and more cores F# will be the standard where C# is now. Imperative languages just can't deal with parralel computing :(.
 
Status
Not open for further replies.
Back
Top