|
Slacker007 wrote: I like this site a lot and I just want it to get better, that's all.
As do we all. 
Just say 'NO' to evaluated arguments for diadic functions! Ash
|
|
|
|
|
My thinking on this is that the community should help those who help themselves.
If someone is too lazy to even attempt to post a sensible question, or too lazy to even bother explaining their problem, then I feel we should invest a corresponding amount of effort into helping them. ie none. If you cannot frame your thoughts around a question then how can you hope to be a programmer?
If the issue is clearly just one of language then please help them with grammar, phrasing ans spelling.
If it's a code dump, delete the question.
cheers,
Chris Maunder
The Code Project | Co-founder
Microsoft C++ MVP
|
|
|
|
|
I posted an alternate tip/trick, and there's no view count for it. It seems to me that after the alternate is posted, it should start gaining views every time the original tip/trick is viewed.
".45 ACP - because shooting twice is just silly" - JSOP, 2010
-----
You can never have too much ammo - unless you're swimming, or on fire. - JSOP, 2010
-----
"Why don't you tie a kerosene-soaked rag around your ankles so the ants won't climb up and eat your candy ass." - Dale Earnhardt, 1997
|
|
|
|
|
Originally view count for alternat(iv)es and originals was the same, which obviously isn't correct. As Chris can't tell which part of the page is being looked at, he decided to drop the alt view count; IMO your suggestion does make sense. But then, what should be done about the bookmarks? If a T/T with one (or more) alts gets bookmarked, how should the rep points be distributed amongst all authors?
|
|
|
|
|
If the alternative is marked as accepted by the OP, then any bookmarks attributed to the original tip should also be applied to the alternative (starting with any bookmarks made after the alternative was submitted.
Also, alternatives have their own votes, don't they?
".45 ACP - because shooting twice is just silly" - JSOP, 2010
-----
You can never have too much ammo - unless you're swimming, or on fire. - JSOP, 2010
-----
"Why don't you tie a kerosene-soaked rag around your ankles so the ants won't climb up and eat your candy ass." - Dale Earnhardt, 1997
|
|
|
|
|
It is very difficult to distinguish those components of a reputation that have lower scores, once a reasonable overall rep has been attained.
It has occurred to me that something like a Polar Area Chart might make it easier to view.
Henry Minute
Do not read medical books! You could die of a misprint. - Mark Twain
Girl: (staring) "Why do you need an icy cucumber?"
“I want to report a fraud. The government is lying to us all.”
|
|
|
|
|
I'm not sure how a polar chart would represent time in an intuitive way.
I see a couple of possible approaches though:
1. a logarithmic graph would cope better with curves that have different magnitudes. The one problem with that is it doesn't handle zero very well. And then, people would seem to become less active over time, which in the long run would be accurate, but not necessarily in a span of a few years.
2. an interactive graph (the SilverLight thingies all those hi-rep members are supposed to be developing) could have buttons to enable/disable components, causing a vertical rescale, and allowing to zoom in on the lesser achievements.
3. a two-scale graph would be the easy way out: have a left and a right scale; everything that is less than 10% of total rep, would use the right scale, scaled up by a factor of 10 w.r.t. the left scale.
[ADDED] Maybe best to use dashed lines for the curves that got scaled up [/ADDED]
|
|
|
|
|
As usual you have spotted the flaw in my suggestion.
Why don't you fu................................ 
I think something other than the existing graph would be an improvement, although I had discounted a logarithmic scale for similar reasons.
Rather than a two scale graph I think two graphs might be a better approach, with a split along the lines you suggest.
Henry Minute
Do not read medical books! You could die of a misprint. - Mark Twain
Girl: (staring) "Why do you need an icy cucumber?"
“I want to report a fraud. The government is lying to us all.”
|
|
|
|
|
Henry Minute wrote: two graphs might be a better approach
That would break a number of popular applications though; a single-graph solution, at best one that preserves the graph's size, would be preferred.
|
|
|
|
|
Luc Pattyn wrote: That would break a number of popular applications though
Seems like a good tactic on Chris' part in that case. While you guys faff about updating 'certain popular applications' he would have more time to create 'certain popular web services'.
Henry Minute
Do not read medical books! You could die of a misprint. - Mark Twain
Girl: (staring) "Why do you need an icy cucumber?"
“I want to report a fraud. The government is lying to us all.”
|
|
|
|
|
Hmm. Having read that, I can tell you you won't be invited to join my tactical advisory committee any time soon. 
|
|
|
|
|
Henry Minute wrote: Why don't you fu......
Sorry, I seldom fulminate when reading a suboptimal suggestion, what would be the point? I prefer offering better suggestions.
|
|
|
|
|
Maybe have multiple graphs, with each graph having its own tab (assuming a dynamic graph is out of the question). There would be one graph for overall reputation (i.e., the graph that currently exists), and one other graph for each sub-category of reputation.
|
|
|
|
|
Although that (multi-tab) is not a bad idea, I'm not sure that a graph for each component is necessary. Broadly speaking, I've examined a few rep graphs, peoples' rep divides into two clusters. The higher point cluster is readily differentiated but the lower scoring cluster is difficult due to the scale imposed by the former one. So IMHO only two would be required.
Henry Minute
Do not read medical books! You could die of a misprint. - Mark Twain
Girl: (staring) "Why do you need an icy cucumber?"
“I want to report a fraud. The government is lying to us all.”
|
|
|
|
|
Well, there is always the guy who has attained 30,000 debater points, 1,000 organizer points, and only 100 enquirer points who might want to see a third graph. 
|
|
|
|
|
There are many many links out there to articles on code project that have been moved, so when you hit code project you just get this custom 404 pages saying that the url doesn't exist. in this case, if you take the filename after the last slash in the url and search it you always get the page you were looking for. The custom 404 page doesn't even have a search box, so you have to click on the CodeProject title image to go home to start the search.
I feel that they custom 404 page should parse the filename, put it in a search box, and show 10 results right there on the 404 page, saying sorry the page could not be found, maybe you were looking for one of there pages. and I promise you, in the realm of CodeProject broken links, the first result will always be the one we were looking for.
Please implement this codeproject.com gods, It would make our lives easier.
|
|
|
|
|
I don't know if what you suggest is possible but it sounds like a damned good idea.
Henry Minute
Do not read medical books! You could die of a misprint. - Mark Twain
Girl: (staring) "Why do you need an icy cucumber?"
“I want to report a fraud. The government is lying to us all.”
|
|
|
|
|
I don't see why it wouldn't be possible, Code Project appears to be written in asp.net, which can be configured to pass the offending url as a querystring to the 404 page. but that doesn't even need to be done because codeproject doesn't redirect on 404 (which is odd) the offending url stays (this is great because that's how I find the broken link article anyway) so all that would have to be done is parse the page url and use the search api that the site already uses.
The big question here is, a site with 7 millions members (30,000 online at any given time all of which have some kind of interest in programming) doesn't do this already, or even why didn't it from conception.
I'm not bashing code project, I love it here. I just think that this was overlooked, and should be rectified.
|
|
|
|
|
We have a few things in place for this:
1. If an article has been moved (and we have that move recorded - not always the case, unfortunately), or the URL is to the old location for articles before the move to ASP.NET, then the 404 handler usually finds the new location and sends you transparently to the new location
2. If it can't find the article then the 404 handler automatically searches to find either a direct filename match, or a close name match (best bets). It will display these on the page.
3. If none of these work then the search box is at the top-right of every page, so you can search directly from there.
We currently have an issue with 3 of our older servers that are due for retirement in a couple of weeks. They are not redirecting properly (IIS6 issues), but the newer IIS 7.X servers work as they should.
cheers,
Chris Maunder
The Code Project | Co-founder
Microsoft C++ MVP
|
|
|
|
|
I hear you. But at least once a day I hit a link and make my way here to a dead page that just says Page Not Found Unfortunately the page you requested was not found. But there is a search box on that page now, not too long ago it didn't have one, I just don't see why the it doesn't auto search when it falls through all those systems. Because it does often.
Just a suggestion.
|
|
|
|
|
Have a look at the message posted by 'Trollslayer' for this article[^]. Since this is still not approved only admins/editors can see it.
Definitely there is a message posted there[^] but the title is missing and thus one cannot open and see the content.
|
|
|
|
|
+1
They show up briefly - sometimes - and then go away.
".45 ACP - because shooting twice is just silly" - JSOP, 2010
-----
You can never have too much ammo - unless you're swimming, or on fire. - JSOP, 2010
-----
"Why don't you tie a kerosene-soaked rag around your ankles so the ants won't climb up and eat your candy ass." - Dale Earnhardt, 1997
|
|
|
|
|
No problem here 
When the wise (person) points at the moon the fool looks at the finger (Chinese proverb)
|
|
|
|
|
Works fine in FF3.6 and Chr7; you must be using IE.
|
|
|
|
|
Yep! IE8, forgot to mention!
|
|
|
|
General 
News 
Suggestion 
Question 
Bug 
Answer 
Joke 
Praise 
Rant 
Admin 
Submit an article or tip
