PureBasic Forums - English

Anyone know of a way to get the location of the original item that an alias points to?

freak: I'm not sure what you meant by "poor response." Do you mean that you decided that interest is low based on downloads, forum posts, emails, etc.? If so, perhaps you are underestimating interest. Maybe some people don't even want to download a non-x86 version, or a version that does not create ...

Rather than continue to post new versions here, I've posted my version to a wikispaces page. I'll still report significant updates here, if there are any. Also, the page has an RSS feed. The page is at http://mike74swiki.wikispaces.com/Big+Multiply and the RSS feed is http://mike74swiki.wikispaces ...

Another variation of Demivec's code:

Procedure.s MultiplyBig(factor_1$,factor_2$) ;returns Prod$ as factor_1$*factor_2$, factors can have leading zeroes and be negative

Protected n.l,len_factor_1.l,len_factor_2.l,len_diff.l

len_factor_1 = Len(factor_1$)
len_factor_2 = Len(factor_2$)
If len ...

I don't know how it works with *s = t, but you're right as far as CopyMemory goes -- you need to make sure that the memory area being copied to is big enough (or use MoveMemory, which is supposedly slower). The PB Help file has some info.

Actual answer: I don't know... I would think not, but I really don't know.

Did you initialize your Zahl3 variable with a value like PDwyer suggested?

Michael,

I just realized I had made another change... Take the ".s" off the *s.s in the procedure. Sorry!

I'm using the PB 4.0 Beta for Mac. Maybe there are one or more bugs involved. Be careful not to write to any random memory address! You can mess up your computer big time!

Michael,

Your GetNumber works if you replace

*s=t

with

CopyMemory(@t, *s, Len(t))

If you put a "Debug *s" in the procedure you get the right string. I don't why its address isn't the same as the address of zahl3.

Maybe this is better...

Procedure.s MultiplyBig(factor_1$,factor_2$) ;returns Prod$ as factor_1$*factor_2$, factors can have leading zeroes and be negative

Protected n.l,len_factor_1.l,len_factor_2.l

len_factor_1=Len(factor_1$)
len_factor_2=Len(factor_2$)
If len_factor_2>len_factor_1 ;make ...

I just realized that taking out the second loop that I did is likely to reduce performance -- it probably would have usually found the first non-zero number very quickly.

Took a couple of loops out of Demivec's code:

Edit: Code removed. See next two messages I posted.

Michael,

That was my understanding of what your code was doing although I did find it difficult to understand exactly how it was doing it. When I looked at the way it was factorizing I realized that it was doing some redundant evaluations. For example, it factors 16 as both 2x8 and 8x2. I would ...

I think I answered my question!

Global total = 0
Global Dim iterdepth.l(50)
Procedure.s getuniquefactors(g.l, lastfactor.l, x.s)

i = lastfactor
resstring.s = ""
While i*i<=g
If g%i = 0
iterdepth(i) + 1
x = x + "-" + Str(i)
Debug x + "-" + Str(g/i)
resstring = Str(g/i ...