in reply to Re^2: checking a set of numbers for consistency mod p
in thread checking a set of numbers for consistency mod p

Nice stuff. :) It's a shame it will silently go wrong when p > 8 * sizeof(int), though. If you're lucky, the compiler may support declaring a variable-sized int[] array to save the bother of mallocing, but just indexing into it will already make the code a chunk more complex.

And @LanX: there's no XS code here. The existence of Inline::C is the reason I never had to learn XS, and I'm very grateful for it. :)

  • Comment on Re^3: checking a set of numbers for consistency mod p

Replies are listed 'Best First'.
Re^4: checking a set of numbers for consistency mod p
by LanX (Saint) on Apr 16, 2022 at 21:30 UTC
    > And @LanX: there's no XS code here.

    This doesn't look like vanilla C

    > > SV* item = *av_fetch( array, i, 0 );

    Probably differing definitions of "XS" ?

    Cheers Rolf
    (addicted to the Perl Programming Language :)
    Wikisyntax for the Monastery

[reply]
[d/l]

      SV* item = *av_fetch( array, i, 0 );

      I worry I'm simply being trolled, but: that looks absolutely like vanilla C to me. We're calling a function, passing it some arguments, getting back some sort of pointer-to-a-pointer, which we dereference and store in a new pointer variable. Clearly the function av_fetch() and the type SV will have been declared somewhere.

      The only magic here is an implicit #include <perl.h>, which brings in perl's standard typedefs, function declarations, etc. XS is a whole 'nother language that is parsed by its own compiler (xsubpp) rather than by a C compiler.

[reply]
[d/l]
[reply]

In Section Seekers of Perl Wisdom