I like the idea of a super-search filter; I dislike the idea of a general reading filter. Those are just first impressions, of course.
The problem is that this could be used to get around the limitations on finding the rep of a node without voting on it: repeatedly raise (or lower) the limit until you find the point at which the node disappears. This isn't neccessarly enough to scuttle the idea, of course -- there are already other tricks similar to this, though I can't think of any that do not involve spending /some/ votes.
In reply to Re: Filter by Node Rep
by theorbtwo
in thread Filter by Node Rep
by edan
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |