Perl 6 - the future is here, just unevenly distributed

IRC log for #pdl, 2013-05-26

| Channels | #pdl index | Today | | Search | Google Search | Plain-Text | summary

All times shown according to UTC.

Time Nick Message
01:06 LimitSupremum joined #pdl
01:06 LimitSupremum how do you get the index of the first 1?
01:30 sivoais pdldoc which
01:31 sivoais whereis which
01:31 liddle_piddle_bot sivoais: Found which in PDL::Primitive (http://pdl.sourceforge.net/PDLdocs/Primitive.html#which)
01:31 sivoais ah, there
01:33 sivoais LimitSupremum: you can use which(). I'm not sure if that is the most efficient, but it isn't an operation suited to auto-looping
01:33 LimitSupremum I found that after aproposing a few random guesses
01:34 LimitSupremum I'm making something that computes the smith set
01:34 * sivoais looks up Smith set
01:35 sivoais sounds interesting! It would be nice to have something like that up on CPAN ;-)
01:36 sivoais ah, according to Wikipedia, the algorithms used are commonly graph-theoretic
01:46 LimitSupremum something like that is up on CPAN
01:46 LimitSupremum http://search.cpan.org/~jhi/Graph-0.96/lib/Graph.pod#Connected_Graphs_and_Their_Components
01:47 LimitSupremum this'll compute strongly connected components
01:56 Meiermann joined #pdl
03:10 LimitSupremum joined #pdl
14:19 chm joined #pdl
14:22 chm $pdl->which->min is probably the way to go.
14:23 chm If you have an idea for a feature or function, please be sure to add it to the Feature Request tracker at sf.net.
14:23 chm For example, "find first one" is a commonly optimized routine that does exactly what you are looking for.
14:24 chm It should be readily implementable in PDL::PP.
14:25 chm This is the URL of the sf.net PDL feature requests tracker: http://sourceforge.net/p/pdl/feature-requests/
17:14 LimitSupremum joined #pdl
19:35 LimitSupremum joined #pdl

| Channels | #pdl index | Today | | Search | Google Search | Plain-Text | summary