Nick Brosnahan › Comments

"Nice! 48% of Americans (and 75% of republicans) are willing to place a bet that the Obama camp did something wrong when they have had no possibility of evaluating evidence that they did. I think I'll wait to hear the FBI tapes. Maybe they should too." - Nick Brosnahan

"Wow, it's all true. I understand now." - Nick Brosnahan

"Wow, it's all true. I understand now." - Nick Brosnahan

"Wow, it's all true. I understand now." - Nick Brosnahan

"Wow, it's all true. I understand now." - Nick Brosnahan

"You can't win. Learn them all." - Nick Brosnahan

"You can't win. Learn them all." - Nick Brosnahan

"You can't win. Learn them all." - Nick Brosnahan

"You can't win. Learn them all." - Nick Brosnahan

"1100087778366101931 Using irb" - Nick Brosnahan

"1100087778366101931 Using irb" - Nick Brosnahan

"1100087778366101931 Using irb" - Nick Brosnahan

"It's actually kind of cool and something I've not heard of before. Its basis is a plain old linked list, yes, but it's also got another set of pointers that allows you to traverse the list in a different way. It's really a twice-linked list that skips or re-orders items. And you can keep adding "alternate linkages" for every item up to "N" if you like. Think of it like this. Suppose the original base linked list was the set of integers 0..N. Now suppose you had an entry pointer for different sequences like "odd numbers" or "even numbers" or "prime numbers" or "perfect numbers". You can see how it could be kind of cool. Whether or not that's "obvious" is an exercise for the reader (and the patent examiner)." - Nick Brosnahan

"It's actually kind of cool and something I've not heard of before. Its basis is a plain old linked list, yes, but it's also got another set of pointers that allows you to traverse the list in a different way. It's really a twice-linked list that skips or re-orders items. And you can keep adding "alternate linkages" for every item up to "N" if you like. Think of it like this. Suppose the original base linked list was the set of integers 0..N. Now suppose you had an entry pointer for different sequences like "odd numbers" or "even numbers" or "prime numbers" or "perfect numbers". You can see how it could be kind of cool. Whether or not that's "obvious" is an exercise for the reader (and the patent examiner)." - Nick Brosnahan

"It's actually kind of cool and something I've not heard of before. Its basis is a plain old linked list, yes, but it's also got another set of pointers that allows you to traverse the list in a different way. It's really a twice-linked list that skips or re-orders items. And you can keep adding "alternate linkages" for every item up to "N" if you like. Think of it like this. Suppose the original base linked list was the set of integers 0..N. Now suppose you had an entry pointer for different sequences like "odd numbers" or "even numbers" or "prime numbers" or "perfect numbers". You can see how it could be kind of cool. Whether or not that's "obvious" is an exercise for the reader (and the patent examiner)." - Nick Brosnahan

"It's actually kind of cool and something I've not heard of before. Its basis is a plain old linked list, yes, but it's also got another set of pointers that allows you to traverse the list in a different way. It's really a twice-linked list that skips or re-orders items. And you can keep adding "alternate linkages" for every item up to "N" if you like. Think of it like this. Suppose the original base linked list was the set of integers 0..N. Now suppose you had an entry pointer for different sequences like "odd numbers" or "even numbers" or "prime numbers" or "perfect numbers". You can see how it could be kind of cool. Whether or not that's "obvious" is an exercise for the reader (and the patent examiner)." - Nick Brosnahan