Re^3: An efficient way to gather a common portion of several strings' beginnings


"be consistent"
	PerlMonks

Re^3: An efficient way to gather a common portion of several strings' beginnings

by BrowserUk (Patriarch)

on Nov 15, 2015 at 18:28 UTC ( [id://1147740]=note: print w/replies, xml )

Need Help??

in reply to Re^2: An efficient way to gather a common portion of several strings' beginnings
in thread An efficient way to gather a common portion of several strings' beginnings

This solution fails for the null-infested (qq{\000\000\000}, qq{\000\000}, qq{\000}) list of strings

And what you got from the OPs sample data is that his data is infested with nulls?

but GrandFather assumes nulls will not be present in any strings

And mine doesn't?

Oh. I see. He states that he's assuming it rather than leaving the bloody obvious to be bloody obvious. (Whatever did I do to rattle your cage recently?)

With the rise and rise of 'Social' network sites: 'Computers are making people easier to use everyday'

Examine what is said, not who speaks -- Silence betokens consent -- Love the truth but pardon error.

"Science is about questioning the status quo. Questioning authority". I knew I was on the right track :)

In the absence of evidence, opinion is indistinguishable from prejudice.

Comment on Re^3: An efficient way to gather a common portion of several strings' beginnings

Replies are listed 'Best First'.

Re^4: An efficient way to gather a common portion of several strings' beginnings
by AnomalousMonk (Archbishop) on Nov 15, 2015 at 21:50 UTC

... the bloody obvious ...

At certain seasons and in certain weathers, the throbbing of the pieces of shrapnel still lodged in my feet from the unspoken assumptions, corner cases and such like of projects past leads me obsessively to ponder the bloody obvious.