unified_texts stringlengths 32 30.1k | OpenStatus_id int64 0 4 | input_ids list | token_type_ids list | attention_mask list |
|---|---|---|---|---|
Long-lived RESTful interactions
===
We have a discussion going on in my team at the moment, and I'd be interested in other views. Suppose we have a RESTful web service whose role is to annotate documents by applying a variety of analysis algorithms and services. The basic interaction in clear: we have a resource which is the document collection; the client POSTs a new document to the collection, gets back the URI of the new document, then can GET that `docURI` to get the document back or GET `{docURI}/metadata` to see the general metadata, `{docURI}/ne` for named entities, etc. The problem is that some of the analyses may take a long time to complete. Suppose the client GETs the metadata URI before the analysis is complete, because it wants to be able to show partial or incremental results in the UI. Repeating the GET in future may yield more results.
Solutions we've discussed include:
- keeping the HTTP connection open
until all analyses are done (which
doesn't seem scalable)
- using
`content-length` and `accept-range`
headers to get incremental content (but
we don't know in advance how long
the final content will be)
- providing
an Atom feed for each resource so
the client subscribes to update
events rather than simply GETting
the resource (seems overly
complicated and possibly resource hungry if there are many active documents)
- just ignoring
idempotency and having GET return
whatever is available at the time (but it still
leaves the problem of the client
knowing when we're finally done).
Any opinions, or suggestions for alternative ways to handle long-lived or asynchronous interactions in a RESTful architecture?
Ian
| 0 | [
2,
175,
8,
8279,
760,
1566,
11224,
800,
3726,
3726,
95,
57,
21,
5460,
228,
27,
19,
51,
173,
35,
14,
688,
15,
17,
31,
22,
43,
44,
3158,
19,
89,
4146,
9,
5787,
95,
57,
21,
760,
1566,
2741,
365,
1196,
597,
25,
20,
40,
1270,
1... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How to work in untestable legacy code- in bug fixing
===
scenario:
you have tightly coupled legacy code that you cna not unit test
and you have to bug fix, what do you do to not get very depressed?
I read working efectively... and refactoring.. by fowler, however in both book unit testing is indispensable
Refactoring is out of the question and a code rewrite is on the table however it will take a long time
suggestions? | 0 | [
2,
184,
20,
170,
19,
367,
10543,
579,
7780,
1797,
8,
19,
6256,
20047,
800,
3726,
3726,
12705,
45,
42,
57,
6556,
13420,
7780,
1797,
30,
42,
272,
325,
52,
1237,
1289,
17,
42,
57,
20,
6256,
6098,
15,
98,
107,
42,
107,
20,
52,
164... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Save drop-down history in a Firefox Toolbar.
===
I'm doing some testing on Firefox toolbars for the sake of learning and I can find out any information on how to store the contents of a "search" drop-down inside the user's profile.
Is there any tutorial on how to sort this out? | 0 | [
2,
2079,
2804,
8,
2968,
447,
19,
21,
535,
18219,
5607,
1850,
9,
800,
3726,
3726,
31,
22,
79,
845,
109,
4431,
27,
535,
18219,
5607,
1850,
18,
26,
14,
8132,
16,
2477,
17,
31,
92,
477,
70,
186,
676,
27,
184,
20,
1718,
14,
8478,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How to do query auto-completion in Lucene?
===
I'm looking for a way to do query auto-completion in Lucene. I've Googled around a bit and played around a bit, but all of the examples I've seen seem to be setting up filters in Solr. We don't use Solr and aren't planning to move to using Solr in the near future, and Solr is obviously just wrapping around Lucene anyway, so I imagine there must be a way to do it!
I've looked into using EdgeNGramFilter, and I realise that I'd have to run the filter on the index fields and get the tokens out and then compare them against the inputted Query... I'm just struggling to make the connection between the two into a bit of code, so help is much appreciated! | 0 | [
2,
184,
20,
107,
25597,
3108,
8,
11103,
1336,
872,
19,
18515,
556,
60,
800,
3726,
3726,
31,
22,
79,
699,
26,
21,
161,
20,
107,
25597,
3108,
8,
11103,
1336,
872,
19,
18515,
556,
9,
31,
22,
195,
8144,
43,
140,
21,
1142,
17,
257,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
XSS Blacklist - Is anyone aware of a reasonable one?
===
As a temporary quick fix to mitigate the major risk while working on the permanent fix for XSS Vulnerability in a very large code base, I'm looking for a pre-existing XSS prevention blacklist that does a reasonable job of protecting against XSS.
Preferably a set of Regular Expressions.
I am fully aware that the best way is [output escaping][1] or if you need some markup from users to use whitelisting. But, with the size of the code base, we need something in quick to reduce the immediate footprint of the vulnerability and raise the bar whilst working on the real solution.
Is anyone aware of a good set?
[1]: http://stackoverflow.com/questions/71328/what-are-the-best-practices-for-avoid-xss-attacks-in-a-php-site#71444 | 0 | [
2,
993,
18,
18,
319,
5739,
13,
8,
25,
1276,
3854,
16,
21,
9954,
53,
60,
800,
3726,
3726,
28,
21,
4700,
2231,
6098,
20,
26476,
14,
394,
2029,
133,
638,
27,
14,
3032,
6098,
26,
993,
18,
18,
20607,
19,
21,
253,
370,
1797,
1000,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
What are the steps needed to create and publish a rubygem of your own?
===
So you've created a ruby library.
How do you create and publish your rubygem? And what common pitfalls and gotchas are there pertaining to creating and publishing rubygems?
The question is posed as a seed to create a nice step-by-step article on how to handle rubygem libraries. I'd appreciate helpful answers. Not so much RTFM.
| 0 | [
2,
98,
50,
14,
2382,
851,
20,
1600,
17,
10824,
21,
10811,
20231,
16,
154,
258,
60,
800,
3726,
3726,
86,
42,
22,
195,
679,
21,
10811,
1248,
9,
184,
107,
42,
1600,
17,
10824,
154,
10811,
20231,
60,
17,
98,
757,
4175,
5660,
18,
1... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Updating server-side progress on Rails application
===
I want to upload and then process a file in a Ruby on Rails app. The file upload is usually quite short, but the server-side processing can take some time (more than 20 seconds) so I want to give the user some indicator - something better than a meaningless 'processing...' screen.
I'm trying to use the following code in the view
<%= periodically_call_remote(:url => {:action => 'progress_monitor', :controller => 'files'},
:frequency => '5',
:update => "setProgress('progressBar','5')"
) %>
The content of the :update parameter is the javascript I want to run every 5 seconds
and the following code is in the files controller
def progress_monitor
render :text => 'whatever'
end
Eventually the progress_monitor method will return the current progress as an integer (% complete) and that will be passed into the 'setProgress' javascript code (that will update an on screen element)
However, I'm struggling to get a correct response from from the server that can then be passed into javascript.
Can anyone help, or am I approaching this the wrong way? | 0 | [
2,
71,
43,
1880,
8128,
8,
1416,
3455,
27,
2240,
18,
3010,
800,
3726,
3726,
31,
259,
20,
71,
8294,
17,
94,
953,
21,
3893,
19,
21,
10811,
27,
2240,
18,
4865,
9,
14,
3893,
71,
8294,
25,
951,
1450,
502,
15,
47,
14,
8128,
8,
1416... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
What is the best replacement for Windows' rand_s in Linux/POSIX?
===
The problem is not about randomness itself (we have rand), but in cryptographically secure PRNG. What can be used on Linux, or ideally POSIX? Does NSS have something useful? | 0 | [
2,
98,
25,
14,
246,
4610,
26,
1936,
22,
11310,
1,
18,
19,
13024,
118,
14882,
396,
60,
800,
3726,
3726,
14,
1448,
25,
52,
88,
5477,
720,
1145,
13,
5,
458,
57,
11310,
6,
15,
47,
19,
16277,
12084,
1326,
4315,
5396,
2723,
9,
98,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Virtual Machine Benchmarks
===
I am using VMware Server 1.0.7 at the moment to test software in virtual machines.
I have also tried Microsoft Virtual PC (do not remeber the version, could be 2004 or 2007) and VMware was way faster at the time.
I have heard of Parallels and VirtualBox but I did not have the time to try them out. Anybody has some benchmarks how fast is each of them (or some other)?
I searched for benchmarks on the web, but found nothing useful.
I am looking primarily for free software, but if it is really better than free ones I would pay for it.
Also, if you are using (or know of) a good virtualization software but have no benchmarks for it, please let me know. | 0 | [
2,
6599,
1940,
25324,
18,
800,
3726,
3726,
31,
589,
568,
13,
20147,
5011,
8128,
137,
9,
387,
9,
465,
35,
14,
688,
20,
1289,
2306,
19,
6599,
6035,
9,
31,
57,
67,
794,
7099,
6599,
5168,
13,
5,
537,
52,
11948,
17669,
14,
615,
15,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
PHP: running scheduled jobs (cron jobs)
===
I have a site on my webhotel I would like to run some scheduled tasks on. What methods of achieving this would you recommend?
What I’ve thought out so far is having a script included in the top of every page and then let this script check whether it’s time to run this job or not.
This is just a quick example of what I was thinking about:
if ($alreadyDone == 0 && time() > $timeToRunMaintainance) {
runTask();
$alreadyDone = 1;
}
Anything else I should take into consideration or is there a better method than this?
| 0 | [
2,
13,
26120,
45,
946,
3758,
4844,
13,
5,
19587,
4844,
6,
800,
3726,
3726,
31,
57,
21,
689,
27,
51,
2741,
7010,
532,
31,
83,
101,
20,
485,
109,
3758,
8674,
27,
9,
98,
3195,
16,
11784,
48,
83,
42,
12360,
60,
98,
31,
1,
195,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Is there an alternative to the SQL Profiler for SQL Server 2000
===
I am trying to optimize some stored procedures on a SQL Server 2000 database and when I try to use SQL Profiler I get an error message "In order to run a trace against SQL Server you have to be a member of sysadmin fixed server role.". It seems that only members of the sysadmin role can run traces on the server (something that was fixed in SQL Server 2005) and there is no way in hell that I will be granted that server role (company policies)
What I'm doing now is inserting the current time minus the time the procedure started at various stages of the code but I find this very tedious
I was also thinking of replicating the database to a local installation of SQL Server but the stored procedure is using data from many different databases that i will spend a lot of time copying data locally
So I was wondering if there is some other way of profiling SQL code? (Third party tools, different practices, something else ) | 0 | [
2,
25,
80,
40,
2676,
20,
14,
4444,
255,
5296,
139,
26,
4444,
255,
8128,
824,
800,
3726,
3726,
31,
589,
749,
20,
22864,
109,
8214,
8876,
27,
21,
4444,
255,
8128,
824,
6018,
17,
76,
31,
1131,
20,
275,
4444,
255,
5296,
139,
31,
1... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How to chain pseudo selectors in SASS
===
I'm trying to put together a selector in SASS that will operate on the visted, hovered state of a link, but I can't quite seem to get the markup right, can someone enlighten me?
I was writing it like this:
&:visited:hover
attribute: foo
| 0 | [
2,
184,
20,
2858,
8452,
23946,
18,
19,
9233,
18,
800,
3726,
3726,
31,
22,
79,
749,
20,
442,
429,
21,
23946,
19,
9233,
18,
30,
129,
4055,
27,
14,
9060,
1427,
15,
21033,
146,
16,
21,
3508,
15,
47,
31,
92,
22,
38,
1450,
2260,
2... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Short Integers in Python
===
Python allocates integers automatically based on the underlying system architecture. Unfortunately I have a huge dataset which needs to be fully loaded into memory.
So, is there a way to force Python to use only 2 bytes for some integers (equivalent of C++ 'short')? | 0 | [
2,
502,
13820,
18,
19,
20059,
800,
3726,
3726,
20059,
65,
2499,
7759,
13820,
18,
7499,
432,
27,
14,
10974,
329,
2607,
9,
6200,
31,
57,
21,
2329,
1054,
3554,
56,
2274,
20,
44,
2337,
8572,
77,
1912,
9,
86,
15,
25,
80,
21,
161,
2... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
What's the best way to detect if a given Javascript object is a DOM Element?
===
Say for instance I was writing a function that was designed to accept multiple argument types:
var overloaded = function (arg) {
if (is_dom_element(arg)) {
// Code for DOM Element argument...
}
};
What's the best way to implement __is\_dom\_element__ so that it works in a cross-browser, fairly accurate way?
| 0 | [
2,
98,
22,
18,
14,
246,
161,
20,
9092,
100,
21,
504,
8247,
8741,
3095,
25,
21,
11859,
4520,
60,
800,
3726,
3726,
395,
26,
4851,
31,
23,
1174,
21,
1990,
30,
23,
1006,
20,
3440,
1886,
5476,
2551,
45,
4033,
84,
22546,
800,
1990,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Working with latitude/longitude values in Java
===
Does anyone know of any free utility jars for java that assist with longitude/latitude manipulation in Java?
I am wanting to find the distance between two different points. This I know can be accomplished with the great circle distance.
<http://www.meridianworlddata.com/Distance-calculation.asp>
Also, given a point and a distance I would like to find the point that distance north, and that distance east in order to create a box around the point.
| 0 | [
2,
638,
29,
16337,
118,
2701,
16731,
4070,
19,
8247,
800,
3726,
3726,
630,
1276,
143,
16,
186,
551,
10082,
5112,
18,
26,
8247,
30,
5404,
29,
22291,
118,
8927,
16731,
17561,
19,
8247,
60,
31,
589,
4638,
20,
477,
14,
1583,
128,
81,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
What is a good OO C++ wrapper for sqlite
===
I'd like to find a good object oriented C++ (as opposed to C) wrapper for sqlite. What do people recommend? If you have several suggestions please put them in separate replies for voting purposes. Also, please indicate whether you have any experience of the wrapper you are suggesting and how you found it to use. | 0 | [
2,
98,
25,
21,
254,
13,
4328,
272,
20512,
28051,
26,
4444,
10601,
800,
3726,
3726,
31,
22,
43,
101,
20,
477,
21,
254,
3095,
13,
6800,
272,
20512,
13,
5,
472,
3499,
20,
272,
6,
28051,
26,
4444,
10601,
9,
98,
107,
148,
12360,
60... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Used ctrl-alt-f6 in linux, and cant't get my screen back.
===
This is obviously a stupid question.
I am coding in eclipse both on mac and linux, but I mixed up and used the mac shortcut to window tabbing (ctrl-cmd-f6), but i was using the linux on uni and screen went black. I've done this before, but this time i can't get back to my desktop. ctrl-alt f1-f6 gives me different terminals, f7 gives me a black screeen and f8 a blinking underscore in the top left corner. Shouldn't my session have been somewhere in f1-f6 and is it lost? | 0 | [
2,
147,
13,
4812,
6362,
8,
192,
38,
8,
410,
379,
19,
13024,
15,
17,
2973,
22,
38,
164,
51,
2324,
97,
9,
800,
3726,
3726,
48,
25,
4409,
21,
3553,
1301,
9,
31,
589,
13,
15458,
19,
11652,
156,
27,
1572,
17,
13024,
15,
47,
31,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Is there a wiki that also contains architectural diagrams?
===
I like a wiki to contain information that needs to be known within a team. Having the expression in mind, "A picture is worth a thousand words", I would like to make a small class diagram, sequence diagram or component diagram inside a wiki using an ajax or flash plugin.
We currently don't do any technical design because they are often lost in some program or out dated. Being able to put these in a wiki (and update them there) would make them useful again.
Do you know of any wiki's that have that functionality? | 4 | [
2,
25,
80,
21,
13,
17375,
30,
67,
1588,
5350,
14161,
18,
60,
800,
3726,
3726,
31,
101,
21,
13,
17375,
20,
3717,
676,
30,
2274,
20,
44,
167,
363,
21,
173,
9,
452,
14,
1803,
19,
594,
15,
13,
7,
58,
2151,
25,
2715,
21,
2996,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
RubyOnRails newbie question- Which version of rails should i start with?
===
I have been dabbling with Ruby for some time now and also was thinking of learning RoR they released a new version for it. :)
So now should I start learning RoR v1.2 or v2.x especially keeping the following in mind
- I couldn't find any great free books/in-depth tutorials on RoR 2.x yet
- I want to learn RoR with the eventual goal of doing some projects and hosting them (on services like heroku.com etc.)
Any advice? | 0 | [
2,
10811,
218,
7301,
18,
78,
5893,
1301,
8,
56,
615,
16,
2240,
18,
378,
31,
799,
29,
60,
800,
3726,
3726,
31,
57,
74,
14690,
8599,
29,
10811,
26,
109,
85,
130,
17,
67,
23,
1440,
16,
2477,
761,
248,
59,
261,
21,
78,
615,
26,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Delete variables in immediate window in C#
===
Once I've created a variable in the immediate window in C# (VS2008), is there any way to delete it so I can create a new variable with the same name but a different type? Apart from restarting the program that is. | 0 | [
2,
27448,
12157,
19,
5231,
1463,
19,
272,
5910,
800,
3726,
3726,
382,
31,
22,
195,
679,
21,
7612,
19,
14,
5231,
1463,
19,
272,
5910,
13,
5,
710,
18,
2753,
6,
15,
25,
80,
186,
161,
20,
27448,
32,
86,
31,
92,
1600,
21,
78,
761... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How to sort an array of UTF-8 strings?
===
I currentyl have no clue on how to sort an array which contains UTF-8 encoded strings in PHP. The array comes from a LDAP server so sorting via a database (would be no problem) is no solution.
The following does not work on my windows development machine (although I'd think that this should be at least a possible solution):
$array=array('Birnen', 'Äpfel', 'Ungetüme', 'Apfel', 'Ungetiere', 'Österreich');
$oldLocal=setlocale(LC_COLLATE, "0");
var_dump(setlocale(LC_COLLATE, 'German_Germany.65001'));
usort($array, 'strcoll');
var_dump(setlocale(LC_COLLATE, $oldLocal));
var_dump($array);
The output is:
string(20) "German_Germany.65001"
string(1) "C"
array(6) {
[0]=>
string(6) "Birnen"
[1]=>
string(9) "Ungetiere"
[2]=>
string(6) "Äpfel"
[3]=>
string(5) "Apfel"
[4]=>
string(9) "Ungetüme"
[5]=>
string(11) "Österreich"
}
This is complete nonsense. Using 1252 as the codepage for `setlocale()` gives another output but still a plainly wrong one:
string(19) "German_Germany.1252"
string(1) "C"
array(6) {
[0]=>
string(11) "Österreich"
[1]=>
string(6) "Äpfel"
[2]=>
string(5) "Apfel"
[3]=>
string(6) "Birnen"
[4]=>
string(9) "Ungetüme"
[5]=>
string(9) "Ungetiere"
}
Is there a way to sort an array with UTF-8 strings locale aware?
| 0 | [
2,
184,
20,
2058,
40,
7718,
16,
287,
11720,
8,
457,
7887,
60,
800,
3726,
3726,
31,
866,
3079,
57,
90,
8906,
27,
184,
20,
2058,
40,
7718,
56,
1588,
287,
11720,
8,
457,
13665,
7887,
19,
13,
26120,
9,
14,
7718,
1624,
37,
21,
644,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How do I get maven to "stamp" a build number into a properties file
===
I would like to be able to, as part of a maven build, set the build number (doesn't matter exactly what) in a properties file/class (so I can show it in a UI). Any ideas? | 0 | [
2,
184,
107,
31,
164,
1216,
3124,
20,
13,
7,
384,
10158,
7,
21,
1895,
234,
77,
21,
3704,
3893,
800,
3726,
3726,
31,
83,
101,
20,
44,
777,
20,
15,
28,
141,
16,
21,
1216,
3124,
1895,
15,
309,
14,
1895,
234,
13,
5,
24364,
22,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Performance Profiling Tips Netbeans for client applications
===
Do you have any tips for effective profiling using Netbeans?
The profiler is quite nice and powerful. I've used it to find problems in some of my Eclipse RCP client applications. However, I get the feeling that I could get some more value out of it.
Normally I set it to profile either all my classes (starting with xxx.mydomain) using an inclusive filter, or I use an exclude filter to remove all org.eclipse classes. This helps keep the overhead down. After running the section of code I am interested, I take a snapshot. I analyze for hotspots and then change the code, repeat the profiling, take another snapshot and compare again.
Any other suggestions or tips on how to get the most out of the profiler with client applications? | 0 | [
2,
956,
8721,
49,
802,
11034,
4275,
863,
5950,
26,
6819,
3767,
800,
3726,
3726,
107,
42,
57,
186,
11034,
26,
3140,
8721,
49,
802,
568,
4275,
863,
5950,
60,
14,
5296,
139,
25,
1450,
2210,
17,
2177,
9,
31,
22,
195,
147,
32,
20,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Delphi 2009 TurboPower library conversions
===
In the next few months I will be resurrecting a project which made extensive use of Orpheus and SysTools. The development system I used is long gone, so would like to update the libraries to my current development environment.
My question(s): is anyone porting, or has anyone ported the TurboPower libraries to Tiburon, if so did you encounter any problems; and if the answer is nobody, is it worth collaborating to produce a Delphi 2009 version, sharing the load.
| 0 | [
2,
23030,
588,
12036,
5484,
1248,
6263,
18,
800,
3726,
3726,
19,
14,
328,
310,
818,
31,
129,
44,
29506,
68,
21,
669,
56,
117,
3386,
275,
16,
29941,
17,
10315,
18,
20799,
18,
9,
14,
522,
329,
31,
147,
25,
175,
1042,
15,
86,
83,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Irretrievably deleting a data
===
Is there anyway in Java to delete data(eg:-a variable value, object) and be sure it can't be recovered from memory.Does setting a variable to null in Java, delete the value from memory? Any ideas? Your answer may not be limited to just Java. | 0 | [
2,
13810,
3367,
2443,
4801,
121,
1336,
68,
21,
1054,
800,
3726,
3726,
25,
80,
2774,
19,
8247,
20,
27448,
1054,
5,
5431,
45,
8,
58,
7612,
1923,
15,
3095,
6,
17,
44,
562,
32,
92,
22,
38,
44,
5863,
37,
1912,
9,
10739,
2697,
21,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How to save file using Eclipse Monkey?
===
I've recently started working with Aptana and Eclipse Monkey. What I want to do now is to create a script that saves a file then uploads it to a FTP.
Problem is that Eclipse Monkey is VERY poorly documented and Google returned only unrelated results.
I've made it upload the file, but I need the script to save the file before uploading.
sync.uploadCurrentEditor();
Do you know any resource for Eclipse Monkey with methods,etc ? | 0 | [
2,
184,
20,
2079,
3893,
568,
11652,
11861,
60,
800,
3726,
3726,
31,
22,
195,
1989,
373,
638,
29,
8442,
9068,
17,
11652,
11861,
9,
98,
31,
259,
20,
107,
130,
25,
20,
1600,
21,
3884,
30,
16815,
21,
3893,
94,
71,
8294,
18,
32,
20... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
What non-web-based tools exist to view IIS logs?
===
I'm looking for non-web-based tools to view IIS logs. I've been using [LogParser](http://www.microsoft.com/technet/scriptcenter/tools/logparser/default.mspx) but I was hoping for something with an interface. It doesn't need to do any fancy reports or charts -- just a list with some search filters is plenty. I need something lightweight that I can run directly on the web server, preferably without a complex install process. | 0 | [
2,
98,
538,
8,
14113,
8,
1281,
4672,
3182,
20,
1418,
595,
18,
18893,
60,
800,
3726,
3726,
31,
22,
79,
699,
26,
538,
8,
14113,
8,
1281,
4672,
20,
1418,
595,
18,
18893,
9,
31,
22,
195,
74,
568,
636,
5567,
3574,
4104,
500,
5,
2... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How to price a corporate web app?
===
I am putting together a proposal for a large multinational company for our licenced solution. Problem is I've never put together something this big before and so I don't know what is acceptable. Ignoring hosting or support (or even the functionality of the app) for the moment and just concentrating the licence - do you think it's more usual to do it on a per user basis - and if so would the company mind when prices fluctuate as more users come on board? Or is it more normal to do bands of users: 1-1000, 1000-5000, 5000-10000, 10000-25000, 25000-50000, 50000-100k, 100k+ (probably maximum usage). Does anyone know of any good links about this kind of thing? Has anyone here procured a complex, multilingual web app for 30000 users and how much is acceptable? | 0 | [
2,
184,
20,
2162,
21,
4871,
2741,
4865,
60,
800,
3726,
3726,
31,
589,
3873,
429,
21,
5149,
26,
21,
370,
22383,
237,
26,
318,
10899,
43,
4295,
9,
1448,
25,
31,
22,
195,
243,
442,
429,
301,
48,
580,
115,
17,
86,
31,
221,
22,
3... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Fax barcode recognition software to integrate in a c# application
===
My application is preparing a cover-sheet for submitting documents by fax. I identify the batch by printing a [Code39][1] on it.
The incoming faxes are received as tif files and my small c# service is polling for new faxes and calling a decoding function.
Currently I use a Win32 dll to recognize the barcode ([QSbar39][2]) and I am facing some problems with it - timeouts, hangs, errors etc. which are painful to handle.
I'd prefer the have some free .Net component or an open source class to integrate.
Whould you take a different approach? What tool do you use?
Many thanks for your answers!
[1]: http://en.wikipedia.org/wiki/Code_39
[2]: http://www.qsbarcode.de/ | 0 | [
2,
13,
18947,
748,
9375,
3514,
2306,
20,
18399,
19,
21,
272,
5910,
3010,
800,
3726,
3726,
51,
3010,
25,
7575,
21,
1227,
8,
17627,
26,
28848,
4374,
34,
13,
18947,
9,
31,
5808,
14,
13064,
34,
7312,
21,
636,
9375,
3412,
500,
2558,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Problem accessing file from different thread in Asp.net
===
I have a process in a website (Asp.net 3.5 using Linq-to-Sql for data access) that needs to work as follows:
1. Upload file
2. Record and save info regarding file to database
3. Import data from file into database
4. Redirect to different page
When run sequentially like this, everything works fine. However, since the files being imported can be quite large, I would like step 3 to run on a different thread from the UI thread. The user should get to step 4 while step 3 is still in progress, and the screen on step 4 will periodically update to let the user know when the import is complete.
I am handling the threading as follows:
public class Import {
public static void ImportPendingFile() {
Import i = new Import();
Thread newThread = new Thread(new ThreadStart(i.ImportFile));
newThread.Start();
}
public void ImportFile() {
// 1. Query DB to identify pending file
// 2. Open up and parse pending file
// 3. Import all data from file into DB
// 4. Update db to reflect that import completed successfully
}
}
And in the codebehind:
protected void butUpload(object sender, EventArgs e) {
// Save file, prepare for import
Import.ImportPendingFile();
Response.Redirect(NewLocation);
}
When doing this, I am able to confirm via debugger that the new thread is starting up properly. However, whenever I do this, the thread aborts when trying to access the file (step 2 in the code behind). This works fine when run in the main thread, so something about the multi-threaded situation is preventing this. I had thought that since the file is saved to disk (which it is) that there shouldn't be any problem with opening it up in a different thread. Any ideas where I have gone wrong and how I can fix it? Thanks!
Note: I am using a third-party assembly to open the file. Using reflector, I have found the following code related to how it opens up the file:
if (File.Exists(fileName)) {
using (FileStream stream = new FileStream(fileName, FileMode.Open)) {
// use stream to open file
}
}
| 0 | [
2,
1448,
1381,
68,
3893,
37,
421,
9322,
19,
28,
306,
9,
2328,
800,
3726,
3726,
31,
57,
21,
953,
19,
21,
2271,
13,
5,
472,
306,
9,
2328,
203,
9,
264,
568,
6294,
1251,
8,
262,
8,
18,
22402,
26,
1054,
1381,
6,
30,
2274,
20,
1... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Image icon beside the site URL
===
I would like to have information about the icons which are displayed alongside the site URLs on a web browser. Is this some browser specific feature? Where do we specify the icon source, ie, is it in some tag on the web page itself ? | 0 | [
2,
1961,
9801,
2113,
14,
689,
287,
6362,
800,
3726,
3726,
31,
83,
101,
20,
57,
676,
88,
14,
9801,
18,
56,
50,
6115,
2387,
14,
689,
13,
911,
7532,
27,
21,
2741,
16495,
9,
25,
48,
109,
16495,
1903,
1580,
60,
113,
107,
95,
19077,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
What's the difference between "Layers" and "Tiers"?
===
What's the difference between "Layers" and "Tiers"? | 0 | [
2,
98,
22,
18,
14,
2841,
128,
13,
7,
15187,
18,
7,
17,
13,
7,
5259,
18,
7,
60,
800,
3726,
3726,
98,
22,
18,
14,
2841,
128,
13,
7,
15187,
18,
7,
17,
13,
7,
5259,
18,
7,
60,
3,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
What is the most convincing way to require formalized unit testing?
===
This certainly presupposes that unit testing is a good thing. Our projects have some level of unit testing, but it's inconsistent at best.
What are the most convincing ways that you have used or have had used with you to convince everyone that formalized unit testing is a good thing and that making it required is really in the best interest of the 'largeish' projects we work on.
By formalized unit tests, I'm simply talking about
- Identifying the Unit Tests to be written
- Identifying the test data (or describe it)
- Writing these tests
- Tracking these tests (and re-using as needed)
- Making the results available
| 0 | [
2,
98,
25,
14,
127,
13650,
161,
20,
4077,
3337,
1333,
1237,
4431,
60,
800,
3726,
3726,
48,
3850,
782,
18,
576,
15690,
18,
30,
1237,
4431,
25,
21,
254,
584,
9,
318,
2314,
57,
109,
662,
16,
1237,
4431,
15,
47,
32,
22,
18,
22380,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Use of Migrations in Ruby on Rails
===
I would like to confirm that the following analysis is correct:
I am building a web app in RoR. I have a data structure for my postgres db designed (around 70 tables; this design may need changes and additions during development to reflect Rails ways of doing things. EG, I designed some user and role tables - but if it makes sense to use Restful Authentication, I will scrub them and replace with whatever RA requires. ).
I have a shellscript which calls a series of .sql files to populate the empty database with tables and initial data (eg, Towns gets pre-filled with post towns) as well as test data (eg, Companies gets a few dummy companies so I have data to play with).
for example (sorry for poor formatting):
CREATE TABLE towns (
id integer PRIMARY KEY DEFAULT nextval ('towns_seq'),
county_id integer REFERENCES counties ON DELETE RESTRICT ON UPDATE CASCADE,
country_id integer REFERENCES countries ON DELETE RESTRICT ON UPDATE CASCADE NOT NULL,
name text NOT NULL UNIQUE
);
Proposition 0: Data lasts longer than apps, so I am convinced that I want referential integrity enforced at the DB level as well as validations in my RoR models, despite the lack of DRYNESS.
Proposition 1: If I replace the script and sql files with Migrations, it is currently impossible to tell my Postgres database about the Foreign Key and other constraints I currently set in SQL DDL files within the migration code.
Proposition 2: The touted benefit of migrations is that changes to the schema are versioned along with the RoR model code. But if I keep my scripts and .sql files in railsapp/db, I can version them just as easily.
Proposition 3: Given that migrations lack functionality I want, and provide benefits I can replicate, there is little reason for me to consider using them. So I should --skipmigrations at script/generate model time.
My question: If Proposition 0 is accepted, are Propositions 1,2,3 true or false, and why?
Thanks!
| 0 | [
2,
275,
16,
8443,
18,
19,
10811,
27,
2240,
18,
800,
3726,
3726,
31,
83,
101,
20,
10265,
30,
14,
249,
2495,
25,
4456,
45,
31,
589,
353,
21,
2741,
4865,
19,
761,
248,
9,
31,
57,
21,
1054,
1411,
26,
51,
678,
6879,
18,
13,
9007,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
NHibernate nvarchar/ntext truncation problem
===
I'm using nhibernate to store some user settings for an app in a SQL Server Compact Edition table.
This is an excerpt the mapping file:
<property name="Name" type="string" />
<property name="Value" type="string" />
Name is a regular string/nvarchar(50), and Value is set as ntext in the DB
I'm trying to write a large amount of xml to the "Value" property. I get an exception every time:
@p1 : String truncation: max=4000, len=35287, value='<lots of xml..../>'
I've googled it quite a bit, and tried a number of different mapping configurations:
<property name="Name" type="string" />
<property name="Value" type="string" />
<column name="Value" sql-type="StringClob" />
</property>
That's one example. Other configurations include "ntext" instead of "StringClob". Those configurations that don't throw mapping exceptions still throw the string truncation exception.
Is this a problem ("feature") with SQL CE? Is it possible to put more than 4000 characters into a SQL CE database with nhibernate? If so, can anyone tell me how?
Many thanks! | 0 | [
2,
12109,
15191,
8820,
13,
103,
3311,
5433,
118,
103,
11969,
22328,
872,
1448,
800,
3726,
3726,
31,
22,
79,
568,
12109,
15191,
8820,
20,
1718,
109,
4155,
12410,
26,
40,
4865,
19,
21,
4444,
255,
8128,
8285,
1322,
859,
9,
48,
25,
40... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How do you visualize your sprint backlog?
===
Most Scrum teams have some sort of whiteboard or other board upon which the stories/tasks for the current sprint are visualized.
I'm curious as to how people organize this board? Do you use post-it notes? Are they color-coded? How do you group tasks? How do you distinguish the state of tasks? Etc...
| 0 | [
2,
184,
107,
42,
3458,
2952,
154,
6672,
97,
5567,
60,
800,
3726,
3726,
127,
26562,
952,
57,
109,
2058,
16,
359,
2806,
54,
89,
686,
685,
56,
14,
1650,
118,
6922,
4020,
26,
14,
866,
6672,
50,
3458,
1333,
9,
31,
22,
79,
7686,
28,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How do you deploy your common SharePoint library
===
We have a class library where we keep a lot of the stuff that we often use when doing sharepoint development. How would you go around deploying this? Right now our best bet is to have it in a separate solution, and deploy that so that the assembly is deployed to GAC. That way we ensure that the assembly is deployed to all application tiers and is available.
Is there a better approach than this? | 0 | [
2,
184,
107,
42,
17617,
154,
757,
1891,
3132,
1248,
800,
3726,
3726,
95,
57,
21,
718,
1248,
113,
95,
643,
21,
865,
16,
14,
3217,
30,
95,
478,
275,
76,
845,
1891,
3132,
522,
9,
184,
83,
42,
162,
140,
17617,
68,
48,
60,
193,
1... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How to work around the [1] IE bug while saving an excel file from a Web server ?
===
I've noticed that Internet Explorer adds a number in square brackets to files downloaded from the internet (usually [1]). This creates a big problem with downloading Excel spreadsheets as square brackets are not a valid filename character inside Excel worksheet name. That problem is IE specific, others browsers are keeping same file name.
So, if you have a pivot table auto-refreshed on file opening for example, you'll get an error message saying the name "file[1].yourPivotTableName" is not valid.
Is there any solution to that problem ? | 0 | [
2,
184,
20,
170,
140,
14,
636,
165,
500,
13,
660,
6256,
133,
7599,
40,
20700,
3893,
37,
21,
2741,
8128,
13,
60,
800,
3726,
3726,
31,
22,
195,
2711,
30,
2620,
8520,
10621,
21,
234,
19,
735,
21971,
20,
6488,
23887,
37,
14,
2620,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
delphi "Invalid use of keyword" in TQuery
===
I'm trying to populate a TDBGrid with the results of the following TQuery against the file Journal.db:
select * from Journal
where Journal.where = "RainPump"
Journal.db is a file created by a third party and I am unable to change the field names.
The problem is that the field I'm interested in is called 'where' and understandably causes the above error. How do I reference this field without causing the BDE (presumably) to explode?
| 0 | [
2,
23030,
13,
7,
108,
18506,
43,
275,
16,
1246,
9587,
7,
19,
13,
38,
8190,
93,
800,
3726,
3726,
31,
22,
79,
749,
20,
1675,
12383,
21,
13,
38,
9007,
16375,
29,
14,
1736,
16,
14,
249,
13,
38,
8190,
93,
149,
14,
3893,
1680,
9,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Optimising a SELECT query that runs slow on Oracle which runs quickly on SQL Server
===
I'm trying to run the following SQL statement in Oracle, and it takes ages to run:
SELECT orderID FROM tasks WHERE orderID NOT IN
(SELECT DISTINCT orderID FROM tasks WHERE
engineer1 IS NOT NULL AND engineer2 IS NOT NULL)
If I run just the sub-part that is in the IN clause, that runs very quickly in Oracle, i.e.
SELECT DISTINCT orderID FROM tasks WHERE
engineer1 IS NOT NULL AND engineer2 IS NOT NULL
Why does the whole statement take such a long time in Oracle? In SQL Server the whole statement runs quickly.
Alternatively is there a simpler/different/better SQL statement I should use?
Some more details about the problem:
- Each order is made of many tasks
- Each order will be allocated (one or more of its task will have engineer1 and engineer2 set) or the order can be unallocated (all its task have null values for the engineer fields)
- I am trying to find all the orderIDs that are unallocated. | 0 | [
2,
19259,
7552,
21,
5407,
25597,
30,
1461,
2276,
27,
15759,
56,
1461,
976,
27,
4444,
255,
8128,
800,
3726,
3726,
31,
22,
79,
749,
20,
485,
14,
249,
4444,
255,
3331,
19,
15759,
15,
17,
32,
1384,
5520,
20,
485,
45,
5407,
389,
1340... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
C,C++ compiler for Vista
===
i need to know where i can get free version of C,C++ compilers for windows vista.many of the versions i tried are not working in fullscreen mode. | 0 | [
2,
272,
15,
150,
20512,
21486,
26,
13520,
800,
3726,
3726,
31,
376,
20,
143,
113,
31,
92,
164,
551,
615,
16,
272,
15,
150,
20512,
21486,
18,
26,
1936,
13520,
9,
14842,
16,
14,
3281,
31,
794,
50,
52,
638,
19,
503,
7187,
3740,
9... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
How to update components in different threads? .NET CF
===
I´m programming a .NET Compact Framework application which shows maps on a PDA.
I´ve created an ad hoc component that paints it´s own piece of the whole map, using several of this components the big picture is composed. I did it this way to avoid the latency of painting the whole map in a single step.
What I would like to do know is to paint this pieces in their own thread, so the map appears to grow as a single entity and (also, and more important) to avoid freezing the rest of the user interface.
Right know each piece of the map is painted in its onPaint method. My idea is to, somehow, tell the system "execute this code in a thread please".
Something like:
protected override void OnPaint(PaintEventArgs e)
{
// <code to be executed in a thread>
e.Graphics.paintTHis();
e.Graphics.paintThat();
whateverItTakesToPaintThisPieceOfTheMap();
// </code to be executed in a thread>
}
Do you know how to do this? Or is my approach simply wrong?
Thanks for your time! | 0 | [
2,
184,
20,
11100,
5090,
19,
421,
20396,
60,
13,
9,
2328,
10084,
800,
3726,
3726,
31,
307,
3143,
21,
13,
9,
2328,
8285,
6596,
3010,
56,
1285,
6867,
27,
21,
351,
593,
9,
31,
13,
195,
679,
40,
21,
43,
21061,
5912,
30,
5107,
18,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
why would an application acts differently after VS debugger is attached?
===
There is an application written in c# trying to manage a socket connection and failing but being successful after same application is attached to visual studio.
how can it be debugged? | 0 | [
2,
483,
83,
40,
3010,
3167,
12670,
75,
4611,
121,
2345,
11356,
25,
3638,
60,
800,
3726,
3726,
80,
25,
40,
3010,
642,
19,
272,
5910,
749,
20,
4705,
21,
18482,
2760,
17,
7250,
47,
142,
1300,
75,
205,
3010,
25,
3638,
20,
3458,
1120... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
How can a task wait on multiple vxworks Queues?
===
We have a vxWorks design which requires one task to process both high and low priority messages sent over two message queues. The messages have to be processed in FIFO order.
Is there a way to do this? | 0 | [
2,
184,
92,
21,
3005,
1760,
27,
1886,
566,
396,
7684,
22521,
18,
60,
800,
3726,
3726,
95,
57,
21,
566,
396,
7684,
704,
56,
4781,
53,
3005,
20,
953,
156,
183,
17,
708,
9857,
7561,
795,
84,
81,
2802,
22521,
18,
9,
14,
7561,
57,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0... |
A good pattern/solution to the social web user problem of point whoring?
===
Take any social website like digg or stackoverflow that lets users reward points for stories/questions/etc. somehow.
What happens is quit similar to the process that lead to the rise of tabloid newspapers that feed only headlines and no content to its readers.
Users are usually smart enough to figure out strategies to maximize their point rewards. This may or may not coincide with what the social website aims to do, and what the general readership finds interesting.
I qualify this as a problem because the way to get most points is to involve as many users as possible. By definition that which can involve most users has to be closer to the lowest common denominator of all users. Given a random web crowd this unfortunately means mostly generic, subjective, argumentative and unspecific entries.
As the creator of a social website you have the unique chance to engineer social behavior and steer it towards some favorable direction. What would be a good pattern/solution to battle this particular problem? | 4 | [
2,
21,
254,
3732,
118,
18,
18687,
3309,
20,
14,
668,
2741,
4155,
1448,
16,
454,
72,
2090,
60,
800,
3726,
3726,
247,
186,
668,
2271,
101,
6131,
263,
54,
7566,
2549,
9990,
30,
6884,
3878,
7879,
819,
26,
1650,
118,
24652,
18,
118,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Expose VSTO functionality to VBA w/o local admin
===
What would be the best way to expose certain functionality in a Dotnet VSTO Excel add-in to VBA, without requiring the user to be a local administrator (i.e. no COM registration, <a href="http://www.devnewsgroups.net/group/microsoft.public.dotnet.framework/topic49734.aspx">no HttpListener</a>)? Would it be possible to use Microsoft Message Queues from VBA? | 0 | [
2,
13833,
4611,
262,
18548,
20,
566,
969,
619,
118,
111,
375,
21,
43,
2160,
800,
3726,
3726,
98,
83,
44,
14,
246,
161,
20,
13833,
1200,
18548,
19,
21,
14123,
2328,
4611,
262,
20700,
3547,
8,
108,
20,
566,
969,
15,
366,
9052,
14,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
SVG rendering in a PyGame application
===
In a [pyGame][1] application, I would like to render resolution-free GUI widgets described in SVG.
What tool and/or library can I use to reach this goal ?
(I like the [OCEMP GUI][2] toolkit but it seems to be bitmap dependent for its rendering)
[1]: http://www.pygame.org/
[2]: http://ocemp.sourceforge.net/gui.html | 0 | [
2,
13,
18,
22955,
15307,
19,
21,
7103,
5128,
3010,
800,
3726,
3726,
19,
21,
636,
6448,
5128,
500,
2558,
165,
500,
3010,
15,
31,
83,
101,
20,
16535,
4302,
8,
4639,
9457,
4807,
43,
3060,
18,
745,
19,
13,
18,
22955,
9,
98,
5607,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
What is the best way to forward a single qmail alias to /dev/null?
===
I would like to trash the mail received by a single qmail alias. I don't want anything logged, and I want qmail to be happy about having delivered the mail.
How can I do this, preferably without adding another local email account? | 0 | [
2,
98,
25,
14,
246,
161,
20,
917,
21,
345,
2593,
8079,
15794,
20,
13,
118,
14438,
118,
4215,
211,
60,
800,
3726,
3726,
31,
83,
101,
20,
10744,
14,
4216,
420,
34,
21,
345,
2593,
8079,
15794,
9,
31,
221,
22,
38,
259,
602,
13,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Case-insensitive search using Hibernate
===
I'm using Hibernate for ORM of my Java app to an Oracle database (not that the database vendor matters, we may switch to another database one day), and I want to retrieve objects from the database according to user-provided strings. For example, when searching for people, if the user is looking for people who live in 'fran', I want to be able to give her people in San Francisco.
SQL is not my strong suit, and I prefer Hibernate's <code>Criteria</code> building code to hard-coded strings as it is. Can anyone point me in the right direction about how to do this in code, and if impossible, how the hard-coded SQL should look like?
Thanks,
Yuval =8-) | 0 | [
2,
610,
8,
108,
19435,
2122,
568,
4148,
2102,
8820,
800,
3726,
3726,
31,
22,
79,
568,
4148,
2102,
8820,
26,
54,
79,
16,
51,
8247,
4865,
20,
40,
15759,
6018,
13,
5,
1270,
30,
14,
6018,
23510,
4556,
15,
95,
123,
5521,
20,
226,
6... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Auto-updating Bags in NHibernate.
===
I use ASP.Net with NHibernate accessing a Pgsql database.
For some of our Objects, we use NHibernate bags, which map to List<Object> objects in our application. Sometimes we have issues with needing to refresh the objects through NHibernate when we update anything to do with the lists in the database.
<bag name="Objects" inverse="true" lazy="true" generic="true" >
<key column="object_id" />
<one-to-many class="Object" />
</bag>
Above is a sample of the code I use for our bags.
I was wondering if anyone else came across this issue anywhere, and what you do to work around it? | 0 | [
2,
3108,
8,
576,
43,
1880,
9089,
19,
12109,
15191,
8820,
9,
800,
3726,
3726,
31,
275,
28,
306,
9,
2328,
29,
12109,
15191,
8820,
1381,
68,
21,
13,
9623,
18,
22402,
6018,
9,
26,
109,
16,
318,
3916,
15,
95,
275,
12109,
15191,
8820,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
What powers Google Chart?
===
Does any body know what powers Google Chart? I have been using it for a while but not sure what Google used to build it. | 4 | [
2,
98,
2737,
8144,
1795,
60,
800,
3726,
3726,
630,
186,
358,
143,
98,
2737,
8144,
1795,
60,
31,
57,
74,
568,
32,
26,
21,
133,
47,
52,
562,
98,
8144,
147,
20,
1895,
32,
9,
3,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
How to display the total of a level as the value of its last child in MDX
===
I have an MDX query which lists a measure for all 'Week' and 'Day' levels in the OLAP database. For example
SELECT
{
HIERARCHIZE( {[Business Time].[Week].members, [Business Time].[Date].members} )
}
ON ROWS,
{
[Measures].[Quantity]
}
ON COLUMNS
FROM [Sales]
Where the measure is displayed for a Week though, instead of showing the total of all the Day values, I would like to show the value for the last day within the week. For example
**Week 1: 12<br />**
15 Sept: 10<br />
16 Sept: 20<br />
17 Sept: 12<br />
18 Sept: 15<br />
19 Sept: 8<br />
20 Sept: 9<br />
21 Sept: 12<br />
**Week 2: 15<br />**
22 Sept: 12<br />
23 Sept: 15<br />
How can I achieve this within the MDX?
| 0 | [
2,
184,
20,
3042,
14,
600,
16,
21,
662,
28,
14,
1923,
16,
82,
236,
850,
19,
8138,
396,
800,
3726,
3726,
31,
57,
40,
8138,
396,
25597,
56,
7227,
21,
4058,
26,
65,
13,
22,
7219,
22,
17,
13,
22,
1185,
22,
2216,
19,
14,
13,
22... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Logging in J2ME
===
What logging solutions exist for j2me?
I'm specifically interested in easily excluding logging for "release" version, to have a smaller package & memory footprint. | 0 | [
2,
13,
13919,
19,
487,
135,
790,
800,
3726,
3726,
98,
13,
13919,
6776,
3182,
26,
487,
135,
790,
60,
31,
22,
79,
3524,
3158,
19,
2351,
13,
14938,
13,
13919,
26,
13,
7,
15202,
7,
615,
15,
20,
57,
21,
2012,
6030,
279,
1912,
18511... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
Dark colorscheme for eclipse?
===
Is Eclipse at all themeable? I would like to install a dark colorscheme for it, since I much prefer white text on dark background than the other way around. | 4 | [
2,
659,
5268,
17660,
62,
26,
11652,
60,
800,
3726,
3726,
25,
11652,
35,
65,
3184,
579,
60,
31,
83,
101,
20,
16146,
21,
659,
5268,
17660,
62,
26,
32,
15,
179,
31,
212,
6369,
359,
1854,
27,
659,
2395,
119,
14,
89,
161,
140,
9,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
One or more files do not match the primary file of the database (error 5173).
===
I got this error when I checked out my database from source control. It might sounds weird to check in the sql server database, but this was what I have done because this is just a personal project.
Anyone knows how to fix this? | 0 | [
2,
53,
54,
91,
6488,
107,
52,
730,
14,
1256,
3893,
16,
14,
6018,
13,
5,
29992,
331,
17170,
6,
9,
800,
3726,
3726,
31,
330,
48,
7019,
76,
31,
6505,
70,
51,
6018,
37,
1267,
569,
9,
32,
530,
2795,
5455,
20,
2631,
19,
14,
4444,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Is there a way to redefine malloc at link time on Windows?
===
I would like to replace the default malloc at link time to use a custom malloc. But when I try to redefine malloc in my program, I get this error:
MSVCRT.lib(MSVCR80.dll) : error LNK2005: _malloc already defined in test.lib(test.obj)
This works perfectly on any Unix, and it works on Windows with most functions, but not with malloc. How can I do this? And what is different with malloc that disallow overriding it?
I know I could replace every call to malloc with my custom malloc, or use a macro to do this, but I would rather not modify every third party library. | 0 | [
2,
25,
80,
21,
161,
20,
402,
62,
7509,
3668,
2499,
35,
3508,
85,
27,
1936,
60,
800,
3726,
3726,
31,
83,
101,
20,
3934,
14,
12838,
3668,
2499,
35,
3508,
85,
20,
275,
21,
5816,
3668,
2499,
9,
47,
76,
31,
1131,
20,
402,
62,
750... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Tag hierarchies and handling of
===
This is a real issue that applies on tagging items in general (and yes, this applies to StackOverflow too, and no, it is a question about StackOverflow).
The whole tagging issue helps cluster similar items, whatever items they may be (jokes, blog posts, so questions etc). However, there (usually but not strictly) is a hierarchy of tags, meaning that some tags _imply_ other tags too. To use a familiar example, the "c#" so tag implies also ".net"; another example, in a jokes database, a "blondes" tag implies the "derisive" tag, similarly to "irish" or "belge" or "canadian" etc depending on the joke's country origin.
How have you handled this, if you have, in your projects? I will supply an answer describing two different methods I have used in two separate cases (actually, the same mechanism but implemented in two different environments), but I am also interested not only on similar mechanisms, but also on your opinion on the hierarchy issue. | 0 | [
2,
3383,
21376,
1596,
17,
7988,
16,
800,
3726,
3726,
48,
25,
21,
683,
1513,
30,
13169,
27,
3383,
2762,
3755,
19,
297,
13,
5,
290,
1643,
15,
48,
13169,
20,
7566,
2549,
9990,
266,
15,
17,
90,
15,
32,
25,
21,
1301,
88,
7566,
2549... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Best practice regarding number of threads in GUI applications
===
In the past I've worked with a number of programmers who have worked exclusively writing GUI applications.
And I've been given the impression that they have almost universally minimised the use of multiple threads in their applications. In some cases they seem to have gone to extreme lengths to ensure that they use a single thread.
Is this common? Is this the generally accepted philosophy for gui application design?
And if so, why?
| 0 | [
2,
246,
1345,
3467,
234,
16,
20396,
19,
9457,
3767,
800,
3726,
3726,
19,
14,
640,
31,
22,
195,
577,
29,
21,
234,
16,
17968,
18,
72,
57,
577,
7008,
1174,
9457,
3767,
9,
17,
31,
22,
195,
74,
504,
14,
6394,
30,
59,
57,
557,
243... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How do you get a spreadsheet to open Excel instead of a browser window?
===
If you call javascript window.open and pass a url to a .xls file it open on some machines in the browser window. How can you force it into Excel? | 0 | [
2,
184,
107,
42,
164,
21,
1789,
17627,
20,
368,
20700,
700,
16,
21,
16495,
1463,
60,
800,
3726,
3726,
100,
42,
645,
8247,
8741,
1463,
9,
10157,
17,
1477,
21,
287,
6362,
20,
21,
13,
9,
396,
7532,
3893,
32,
368,
27,
109,
6035,
1... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0... |
Is Assert.Fail() considered bad practice?
===
I use Assert.Fail a lot when doing TDD. I'm usually working on one test at a time but when I get ideas for things I want to implement later I quickly write an empty test where the name of the test method indicates what I want to implement as sort of a todo-list. To make sure I don't forget I put an Assert.Fail() in the body.
When trying out xUnit.Net I found they hadn't implemented Assert.Fail. Of course you can always Assert.IsTrue(false) but this doesn't communicate my intention as well. I got the impression Assert.Fail wasn't implemented on purpose. Is this considered bad practice? If so why?
| 0 | [
2,
25,
10908,
9,
24910,
5,
6,
724,
896,
1345,
60,
800,
3726,
3726,
31,
275,
10908,
9,
24910,
21,
865,
76,
845,
15596,
43,
9,
31,
22,
79,
951,
638,
27,
53,
1289,
35,
21,
85,
47,
76,
31,
164,
3478,
26,
564,
31,
259,
20,
8713... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Directory listing in Python
===
How do I get a list of all files (and directories) in a given directory in Python? | 0 | [
2,
16755,
9554,
19,
20059,
800,
3726,
3726,
184,
107,
31,
164,
21,
968,
16,
65,
6488,
13,
5,
290,
559,
1596,
6,
19,
21,
504,
16755,
19,
20059,
60,
3,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
Python subprocess issue with ampersands
===
I'm currently having a major issue with a python script. The script runs arbitrary commands through a handler to convert incorrect error reporting into correct error reporting.
The issue I'm having is getting the script to work correctly on windows with a command that contains ampersands in it's path. I've attempted quoting the command, escaping the ampersand with ^ and neither works. I'm now out of ideas. Any suggestions? | 0 | [
2,
20059,
972,
16835,
1513,
29,
589,
7490,
290,
18,
800,
3726,
3726,
31,
22,
79,
871,
452,
21,
394,
1513,
29,
21,
20059,
3884,
9,
14,
3884,
1461,
17237,
14294,
120,
21,
24641,
20,
8406,
18867,
7019,
6670,
77,
4456,
7019,
6670,
9,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Java: "Could not find the main class. Program will exit"
===
I'm trying to run SQuirreL SQL.
I've downloaded it and installed it, but when I try to run it I get this error message:
>Java Virtual Machine Launcher.
>Could not find the main class.
>Program will exit.
I get the gist of this, but I have not idea how to fix it. Any help? | 0 | [
2,
8247,
45,
13,
7,
13431,
52,
477,
14,
407,
718,
9,
625,
129,
4350,
7,
800,
3726,
3726,
31,
22,
79,
749,
20,
485,
15150,
4444,
255,
9,
31,
22,
195,
23887,
32,
17,
4066,
32,
15,
47,
76,
31,
1131,
20,
485,
32,
31,
164,
48,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Will Subclipse 1.4.4 work with Subversion 1.3.2
===
Will Subclipse 1.4.4 work safely with Subversion 1.3.2?
I am confused because its [changelog][1] says
> NOTE: As of Subclipse 1.3.0, the minimum Subversion JavaHL requirement is 1.5.0.
[1]: http://subclipse.tigris.org/subclipse_1.4.x/changes.html | 0 | [
2,
129,
972,
150,
6013,
870,
137,
9,
300,
9,
300,
170,
29,
972,
10898,
137,
9,
240,
9,
135,
800,
3726,
3726,
129,
972,
150,
6013,
870,
137,
9,
300,
9,
300,
170,
9817,
29,
972,
10898,
137,
9,
240,
9,
135,
60,
31,
589,
4230,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Javascrpit Try/Catch
===
I've got a function that runs a user generated Regex. However, if the user enters a regex that won't run then it stops and falls over. I've tried wrapping the line in a Try/Catch block but alas nothing happens.
If it helps, I'm running jQuery but the codo below does not have it as I'm guessing that it's a little more fundamental than that.
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Strict//EN"
"http://www.w3.org/TR/xhtml1/DTD/xhtml1-strict.dtd">
<html>
<head>
<title>Regex</title>
<script type="text/javascript" charset="utf-8">
var grep = new RegExp('gr[');
try
{
var results = grep.exec('bob went to town');
}
catch (e)
{
//Do nothing?
}
alert('If you can see this then the script kept going');
</script>
</head>
<body>
</body>
</html>
| 0 | [
2,
8247,
18,
6711,
7328,
1131,
118,
18208,
800,
3726,
3726,
31,
22,
195,
330,
21,
1990,
30,
1461,
21,
4155,
6756,
7953,
1706,
9,
207,
15,
100,
14,
4155,
8104,
21,
7953,
1706,
30,
230,
22,
38,
485,
94,
32,
6604,
17,
2564,
84,
9... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Recursive overloading semantics in the Scala REPL - JVM languages
===
Using Scala's command line REPL:
def foo(x: Int): Unit = {}
def foo(x: String): Unit = {println(foo(2))}
gives
error: type mismatch;
found: Int(2)
required: String
It seems that you can't define overloaded recursive methods in the REPL. I thought this was a bug in the Scala REPL and filed it, but it was almost instantly closed with "wontfix: I don't see any way this could be supported given the semantics of the interpreter, because these two methods must to be compiled together." He recommended putting the methods in an enclosing object.
Is there a JVM language implementation or Scala expert who could explain why? I can see it would be a problem if the methods called each other for instance, but in this case?
Or if this is too large a question and you think I need more prerequisite knowledge, does someone have any good links to books or sites about language implementations, especially on the JVM? (I know about John Rose's blog, and the book Programming Language Pragmatics... but that's about it. :)
| 0 | [
2,
302,
24244,
84,
16866,
17220,
18,
19,
14,
25975,
302,
5727,
13,
8,
487,
20147,
2556,
800,
3726,
3726,
568,
25975,
22,
18,
1202,
293,
302,
5727,
45,
6312,
4310,
111,
5,
396,
45,
19,
38,
6,
45,
1237,
800,
13,
1,
6312,
4310,
1... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Getting started with AJAX with ASP.NET 3.5, what do I need on the server.
===
I have the .net framework 3.5 on my development machine and also am using the AJAX toolkit in my code. In order to publish this code to a server for my users, do I need anything on the server in order for my AJAX code to operate correctly? | 0 | [
2,
1017,
373,
29,
20624,
29,
28,
306,
9,
2328,
203,
9,
264,
15,
98,
107,
31,
376,
27,
14,
8128,
9,
800,
3726,
3726,
31,
57,
14,
13,
9,
2328,
6596,
203,
9,
264,
27,
51,
522,
1940,
17,
67,
589,
568,
14,
20624,
5607,
13703,
1... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Setting up F# in Visual Studio 2005
===
Are there any decent tutorials for setting up F# in Visual Studio 2005? Everything I have found points at VS2008.
ie: 'F# projects' under projects, etc. | 0 | [
2,
2697,
71,
398,
5910,
19,
3458,
1120,
812,
800,
3726,
3726,
50,
80,
186,
12238,
29724,
18,
26,
2697,
71,
398,
5910,
19,
3458,
1120,
812,
60,
796,
31,
57,
216,
819,
35,
4611,
2753,
9,
13,
660,
45,
13,
22,
410,
5910,
2314,
22,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
SQL Server - Partitioned Tables vs. Clustered Index?
===
Let's assume you have one massive table with three columns as shown below:
[id] INT NOT NULL,
[date] SMALLDATETIME NOT NULL,
[sales] FLOAT NULL
Also assume you are limited to one physical disk and one filegroup (PRIMARY). You expect this table to hold sales for 10,000,000+ ids, across 100's of dates (easily 1B+ records).
As with many data warehousing scenarios, the data will typically grow sequentially by date (i.e., each time you perform a data load, you will be inserting new dates, and maybe updating some of the more recent dates of data). For analytic purposes, the data will often be queried and aggregated for a random set of ~10,000 ids which will be specified via a join with another table. Often, these queries don't specify date ranges, or specify very wide date ranges, which leads me to my question: What is the best way to index / partition this table?
I have thought about this for a while, but am stuck with conflicting solutions:
**Option #1:** As data will be loaded sequentially by date, define the clustered index (and primary key) as [date], [id]. Also create a "sliding window" partitioning function / scheme on date allowing rapid movement of new data in / out of the table. Potentially create a non-clustered index on id to help with querying.
**Expected Outcome #1:** This setup will be very fast for data loading purposes, but sub-optimal when it comes to analytic reads as, in a worst case scenario (no limiting by dates, unlucky with set of id's queried), 100% of the data pages may be read.
**Option #2:** As the data will be queried for only a small subset of ids at a time, define the clustered index (and primary key) as [id], [date]. Do not bother to create a partitioned table.
**Expected Outcome #2:** Expected huge performance hit when it comes to loading data as we can no longer quickly limit by date. Expected huge performance benefit when it comes to my analytic queries as it will minimize the number of data pages read.
**Option #3:** Clustered (and primary key) as follows: [id], [date]; "sliding window" partition function / scheme on date.
**Expected Outcome #3:** Not sure what to expect. Given that the first column in the clustered index is [id] and thus (it is my understanding) the data is arranged by ID, I would expect good performance from my analytic queries. However, the data is partitioned by date, which is contrary to the definition of the clustered index (but still aligned as date is part of the index). I haven't found much documentation that speaks to this scenario and what, if any, performance benefits I may get from this, which brings me to my final, bonus question:
If I am creating a table on one filegroup on one disk, with a clustered index on one column, is there any benefit (besides partition switching when loading the data) that comes from defining a partition on the same column? | 0 | [
2,
4444,
255,
8128,
13,
8,
10711,
69,
7484,
4611,
9,
7460,
69,
4348,
60,
800,
3726,
3726,
408,
22,
18,
7158,
42,
57,
53,
3787,
859,
29,
132,
7498,
28,
1721,
1021,
45,
636,
1340,
500,
19,
38,
52,
16203,
15,
636,
8209,
500,
284,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Supporting urls like /similar-to-:product in rails
===
I have been trying to use routes.rb for creating a url /similar-to-:product (where product is dynamic) for my website. The issue is that routes.rb readily supports urls like /:product-similar but doesn't support the former because it requires :product to be preceded with a separator ('/' is a separator but '-' isn't). The list of separators is in ActionController::Routing::SEPARATORS
I can't add '-' as a separator because :product can also contain a hyphen. What is the best way of supporting a url like this?
One way that I have successfully tried is to not use routes.rb and put the url parsing logic in the controller itself, but that isn't the cleanest way. | 0 | [
2,
3134,
13,
911,
7532,
101,
13,
118,
19107,
8,
262,
8,
45,
14086,
19,
2240,
18,
800,
3726,
3726,
31,
57,
74,
749,
20,
275,
5050,
9,
7549,
26,
2936,
21,
287,
6362,
13,
118,
19107,
8,
262,
8,
45,
14086,
13,
5,
2798,
2374,
25,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
using the literal '@' with a string variable
===
I have a helper class pulling a string from an XML file, that string is a file path (so it has backslashes in it). I need to use that string as it is... how can I use it like I would with the literal command?
instead of this:
string filePath = @"C:\somepath\file.txt";
I want to do this:
string filePath = @helper.getFilePath(); //getFilePath returns a string
This isn't how I am actually using it, just to show what I mean a little clearer. Is there some sort of .ToLiteral() or something?
Thank you. | 0 | [
2,
568,
14,
20665,
13,
22,
1,
22,
29,
21,
3724,
7612,
800,
3726,
3726,
31,
57,
21,
448,
106,
718,
3303,
21,
3724,
37,
40,
23504,
3893,
15,
30,
3724,
25,
21,
3893,
2013,
13,
5,
656,
32,
63,
97,
18,
9545,
160,
19,
32,
6,
9,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Ideal size working area per developer
===
What would you say is the idea size physical work area per developer ? Not the size of the desktop :-) | 0 | [
2,
5628,
1072,
638,
217,
416,
10058,
800,
3726,
3726,
98,
83,
42,
395,
25,
14,
882,
1072,
1825,
170,
217,
416,
10058,
13,
60,
52,
14,
1072,
16,
14,
17404,
13,
45,
8,
6,
3,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
How to change css class of <li> element using ASP.NET?
===
I have several <li> elements with different id's on ASP.NET page:
<li id="li1" class="class1">
<li id="li2" class="class1">
<li id="li3" class="class1">
and can change their class using JavaScript like this:
li1.className="class2"
But is there a way to change <li> element class using ASP.NET? It could be something like:
WebControl control = (WebControl)FindControl("li1");
control.CssClass="class2";
But FindControl() doesn't work as I expected. Any suggestions?
Thanks in advance! | 0 | [
2,
184,
20,
753,
272,
18,
18,
718,
16,
13,
1,
1210,
1,
4520,
568,
28,
306,
9,
2328,
60,
800,
3726,
3726,
31,
57,
238,
279,
255,
38,
73,
1210,
1,
2065,
29,
421,
4924,
22,
18,
27,
28,
306,
9,
2328,
2478,
45,
13,
1,
1210,
4... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
What should an Application Controller do?
===
I am a bit confused in what the application controller should do? Because I see the functionality will also exists in your MVP pattern to make the decisions which form should be shown when a button is clicked? Are there any good examples for Windows Forms that uses the application controller pattern? | 0 | [
2,
98,
378,
40,
3010,
9919,
107,
60,
800,
3726,
3726,
31,
589,
21,
1142,
4230,
19,
98,
14,
3010,
9919,
378,
107,
60,
185,
31,
196,
14,
18548,
129,
67,
5636,
19,
154,
13552,
3732,
20,
233,
14,
6003,
56,
505,
378,
44,
1721,
76,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How do I implement IEqualityComparer for an immutable generic Pair struct?
===
Currently I have this:
struct Pair<T, K> : IEqualityComparer<Pair<T, K>>
{
readonly private T _first;
readonly private K _second;
readonly private int _hashCode;
public Pair(T first, K second)
{
_first = first;
_second = second;
_hashCode = (_first == null ? 0 : _first.GetHashCode()) ^
(_second == null ? 0 : _second.GetHashCode());
}
public T First { get { return _first; } }
public K Second { get { return _second; } }
#region IEqualityComparer<Pair<T,K>> Members
public bool Equals(Pair<T, K> x, Pair<T, K> y)
{
return x._hashCode == y._hashCode;
}
public int GetHashCode(Pair<T, K> obj)
{
return _hashCode;
}
#endregion
}
The problem is that First and Second may not be reference types (VS actually warns me about this), but the code still compiles. Should I cast them (First and Second) to objects before I compare them, or is there a better way to do this? | 0 | [
2,
184,
107,
31,
8713,
13,
660,
15583,
960,
3574,
106,
26,
40,
797,
7903,
579,
12733,
2146,
13,
10346,
60,
800,
3726,
3726,
871,
31,
57,
48,
45,
13,
10346,
2146,
1,
38,
15,
680,
1,
13,
45,
13,
660,
15583,
960,
3574,
106,
1,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
What are the pros and cons of Web Services and RMI in a Java-only environment?
===
When developing distributed applications, all written in Java by the same company, would you choose Web Services or RMI? What are the pros and cons in terms of performance, loose coupling, ...? Would anyone choose WS? | 0 | [
2,
98,
50,
14,
895,
18,
17,
11608,
16,
2741,
687,
17,
761,
1435,
19,
21,
8247,
8,
4965,
2307,
60,
800,
3726,
3726,
76,
3561,
4387,
3767,
15,
65,
642,
19,
8247,
34,
14,
205,
237,
15,
83,
42,
3538,
2741,
687,
54,
761,
1435,
60... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How do I set the proxy to be used by the JVM
===
Many times, a Java app needs to connect to the Internet. The most common example happens when it is reading an XML file and needs to download its schema.
I am behind a proxy server. How do I set my JVM to use the proxy ? | 0 | [
2,
184,
107,
31,
309,
14,
27188,
20,
44,
147,
34,
14,
487,
20147,
800,
3726,
3726,
151,
436,
15,
21,
8247,
4865,
2274,
20,
6379,
20,
14,
2620,
9,
14,
127,
757,
823,
5531,
76,
32,
25,
1876,
40,
23504,
3893,
17,
2274,
20,
7121,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Learning FreeBSD
===
What is the average time that it would take a complete novice, whose background is mostly Windows XP, to go through the FreeBSD handbook and get sufficient mastery to setup a server from the ground up? | 4 | [
2,
2477,
551,
4562,
43,
800,
3726,
3726,
98,
25,
14,
862,
85,
30,
32,
83,
247,
21,
1279,
21999,
15,
1196,
2395,
25,
1555,
1936,
23045,
15,
20,
162,
120,
14,
551,
4562,
43,
16582,
17,
164,
6722,
1129,
93,
20,
18161,
21,
8128,
3... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
difference between Array.slice and Array().slice
===
I am going through John Resig's excellent [Advanced javascript tutorial][1] and I do not thoroughly understand what's the difference between the following calls: (please note that 'arguments' is a builtin javascript word and is not exactly an array hence the hacking with the Array.slice instead of simply calling arguments.slice)
>>> arguments
[3, 1, 2, 3]
>>> Array.slice.call( arguments )
3,1,2,3 0=3 1=1 2=2 3=3
>>> Array.slice.call( arguments, 1 )
[]
>>> Array().slice.call( arguments )
3,1,2,3 0=3 1=1 2=2 3=3
>>> Array().slice.call( arguments, 1 )
1,2,3 0=1 1=2 2=3
Basically my misunderstanding boils down to the difference between Array.slice and Array().slice. What exactly is the difference between these two and why does not Array.slice.call behave as expected? (which is giving back all but the first element of the arguments list).
[1]: http://ejohn.org/apps/learn/#47
| 0 | [
2,
2841,
128,
7718,
9,
18,
11909,
17,
7718,
5,
6,
9,
18,
11909,
800,
3726,
3726,
31,
589,
228,
120,
239,
10719,
2816,
22,
18,
5977,
636,
1283,
2686,
11014,
8247,
8741,
29724,
500,
2558,
165,
500,
17,
31,
107,
52,
13632,
1369,
98... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Reading custom resource from within MIDP 2.0 midlet
===
How can one load custom (not an image, nor a sound file) resource file from /res within .jar using MIDP 2.0?
Thanks in advance. | 0 | [
2,
1876,
5816,
6577,
37,
363,
907,
306,
172,
9,
387,
907,
1336,
800,
3726,
3726,
184,
92,
53,
6305,
5816,
13,
5,
1270,
40,
1961,
15,
2127,
21,
646,
3893,
6,
6577,
3893,
37,
13,
118,
99,
18,
363,
13,
9,
6300,
568,
907,
306,
1... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
How do I create a WPF Rounded Corner container?
===
We are creating an XBAP application that we need to have rounded corners in various locations in a single page and we would like to have a WPF Rounded Corner container to place a bunch of other elements within. Does anyone have some suggestions or sample code on how we can best accomplish this? Either with styles on a <Grid> or with creating a custom control?
| 0 | [
2,
184,
107,
31,
1600,
21,
619,
7721,
8472,
1531,
12147,
60,
800,
3726,
3726,
95,
50,
2936,
40,
993,
969,
306,
3010,
30,
95,
376,
20,
57,
8472,
8894,
19,
617,
4095,
19,
21,
345,
2478,
17,
95,
83,
101,
20,
57,
21,
619,
7721,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Replace visual component at runtime in Delphi (win32)
===
Is it possible to, for instance, replace and free a TEdit with a subclassed component instantiated (conditionally) at runtime? If so, how and when it should be done? I've tried to set the parent to nil and to call free() in the form constructor and AfterConstruction methods but in both cases I got a runtime error. | 0 | [
2,
3934,
3458,
5912,
35,
485,
891,
19,
23030,
13,
5,
4181,
3125,
6,
800,
3726,
3726,
25,
32,
938,
20,
15,
26,
4851,
15,
3934,
17,
551,
21,
7859,
242,
29,
21,
972,
1898,
69,
5912,
6322,
49,
1669,
13,
5,
22141,
1326,
6,
35,
48... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Flash Charts and Graphs exported for use in PDF reports - automation
===
I want to put beautiful charts in a report that is available via html and pdf.
I'd prefer to use just one API. Flash is more interactive and useful in html- but I want to be able to use a snapshot of the same chart in a pdf I'm creating. For aesthetics, I'd prefer a vector format.
**What is the best way to accomplish this?** | 0 | [
2,
4433,
5158,
17,
7210,
18,
18011,
26,
275,
19,
13,
11124,
2813,
13,
8,
23217,
800,
3726,
3726,
31,
259,
20,
442,
1632,
5158,
19,
21,
1330,
30,
25,
904,
1197,
13,
15895,
17,
13,
11124,
9,
31,
22,
43,
6369,
20,
275,
114,
53,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How do I get files in my own file format to have its own dynamic icon?
===
Our application has a file format similar to the OpenDocument file format (see http://en.wikipedia.org/wiki/OpenDocument) - i.e. zipped with a manifest file, a thumbnail image, etc.
I notice that OpenOffice files have a preview image of the Open Office file as their icons, both in Windows and in Linux. Is there some way to accomplish this for our files: i.e. I want a dynamic icon based on the internal thumbnail.png? | 0 | [
2,
184,
107,
31,
164,
6488,
19,
51,
258,
3893,
2595,
20,
57,
82,
258,
7782,
9801,
60,
800,
3726,
3726,
318,
3010,
63,
21,
3893,
2595,
835,
20,
14,
368,
28132,
3893,
2595,
13,
5,
1798,
7775,
6903,
219,
9,
17375,
26132,
9,
5583,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
C++ superclass constructor calling rules
===
What are the C++ rules for calling the superclass constructor from a subclass one??
For example I know in Java, you must do it as the first line of the subclass constructor (and if you don't an implicit call to a no-arg super constructor is assumed - giving you a compile error if that's missing). | 0 | [
2,
272,
20512,
1026,
1898,
6960,
248,
2555,
1761,
800,
3726,
3726,
98,
50,
14,
272,
20512,
1761,
26,
2555,
14,
1026,
1898,
6960,
248,
37,
21,
972,
1898,
53,
60,
60,
26,
823,
31,
143,
19,
8247,
15,
42,
491,
107,
32,
28,
14,
64,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Python idiom to chain (flatten) an infinite iterable of finite iterables?
===
Suppose we have an iterator (an infinite one) that returns lists (or finite iterators), for example one returned by
infinite = itertools.cycle([[1,2,3]])
What is a good Python idiom to get an iterator (obviously infinite) that will return each of the elements from the first iterator, then each from the second one, etc. In the example above it would return `1,2,3,1,2,3,...`. The iterator is infinite, so `itertools.chain(*infinite)` will not work. | 0 | [
2,
20059,
28380,
20,
2858,
13,
5,
13830,
1316,
6,
40,
9698,
32,
106,
579,
16,
10796,
32,
106,
579,
18,
60,
800,
3726,
3726,
5787,
95,
57,
40,
32,
106,
3457,
13,
5,
210,
9698,
53,
6,
30,
4815,
7227,
13,
5,
248,
10796,
32,
106... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Unrooted Tests
===
When running all my tests in Eclipse (Eclipse 3.4 'Ganymede'), one test is listed under "Unrooted Tests". I'm using Junit 3.8 and this particular test extends TestCase. I do not see any difference between this test and the other tests. I don't remember seeing this occur in Eclipse 3.3 (Europa). | 0 | [
2,
367,
14032,
69,
4894,
800,
3726,
3726,
76,
946,
65,
51,
4894,
19,
11652,
13,
5,
3319,
6013,
870,
203,
9,
300,
13,
22,
2342,
93,
4688,
62,
22,
6,
15,
53,
1289,
25,
1510,
131,
13,
7,
1020,
14032,
69,
4894,
7,
9,
31,
22,
7... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Cyclic Dependencies
===
Consider a normal customer-orders application based on MVC pattern using WinForms.
The view part has grown too much and it needs to be split into smaller ones.
----------
For this example we are going to use 3 projects for the view part:
- **Main** - has dependencies to the other 2 projects. Instantiates the forms with the lists.
- **Customers** - has 2 forms - customers list and customer details.
- **Orders** - has 2 forms - orders list and order details.
----------
On the customer details form there is also a list of orders for that customer. The list is received from the OrdersController so it's no problem getting it. When the user selects an order, the list will get it's guid and pass it as reference to the Order Details form.
*This would mean that we need to have a reference to Orders Project in the Customers Project.* **(1)**
But also on the order details form there is a link to the customer that made that order. When clicked, it should open the Customer Details form.
*This would mean that we need to have a reference to Customers Project in the Orders Project.* **(2)**
**From (1) and (2) we'll have cyclic dependencies between the Orders and Customers projects.**
----------
**How can this be avoided?** Some kind of plug-in architecture? The project is already developed and the best solution would involve as little code change as possible.
| 0 | [
2,
13,
15888,
29411,
800,
3726,
3726,
3563,
21,
1826,
7705,
8,
7861,
18,
3010,
432,
27,
307,
8990,
3732,
568,
628,
4190,
18,
9,
14,
1418,
141,
63,
3651,
266,
212,
17,
32,
2274,
20,
44,
2132,
77,
2012,
53,
18,
9,
13,
8,
8,
8,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How to check if a trigger is invalid?
===
I'm working on databases that have moving tables auto-generated by some obscure tools. By the way, we have to track information changes in the table via some triggers. And, of course, it occurs that some changes in the table structure broke some triggers, by removing a column or changing its type, for example.
So, the question is: Is there a way to query the Oracle metadata to check is some triggers are broken, in order to send a report to the support team?
The user_triggers give all the triggers and tells if they are enable or not, but does not indicate if they are still valid. | 0 | [
2,
184,
20,
2631,
100,
21,
7286,
25,
16671,
60,
800,
3726,
3726,
31,
22,
79,
638,
27,
6018,
18,
30,
57,
1219,
7484,
3108,
8,
25314,
34,
109,
15472,
4672,
9,
34,
14,
161,
15,
95,
57,
20,
792,
676,
1693,
19,
14,
859,
1197,
109... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Designing an 'Order' schema in which there are disparate product definition tables
===
This is a scenario I've seen in multiple places over the years; I'm wondering if anyone else has run across a better solution than I have...
My company sells a relatively small number of products, however the products we sell are highly specialized (i.e. in order to select a given product, a significant number of details must be provided about it). The problem is that while the *amount* of detail required to choose a given product is relatively constant, the *kinds* of details required vary greatly between products. For instance:
Product X might have identifying characteristics like (hypothetically)
- 'Color',
- 'Material'
- 'Mean Time to Failure'
but Product Y might have characteristics
- 'Thickness',
- 'Diameter'
- 'Power Source'
The problem (one of them, anyway) in creating an order system that utilizes both Product X and Product Y is that an Order Line has to refer, at some point, to what it is "selling". Since Product X and Product Y are defined in two different tables - and denormalization of products using a wide table scheme is not an option (the product definitions are quite deep) - it's difficult to see a clear way to define the Order Line in such a way that order entry, editing and reporting are practical.
----------
**Things I've Tried In the Past**
- Create a parent table called 'Product' with columns common to Product X and Product Y, then using 'Product' as the reference for the OrderLine table, and creating a FK relationship with 'Product' as the primary side between the tables for Product X and Product Y. This basically places the 'Product' table as the parent of both OrderLine and all the disparate product tables (e.g. Products X and Y). It works fine for order entry, but causes problems with order reporting or editing since the 'Product' record has to track what kind of product it is in order to determine how to join 'Product' to its more detailed child, Product X or Product Y. **Advantages**: key relationships are preserved. **Disadvantages**: reporting, editing at the order line/product level.
- Create 'Product Type' and 'Product Key' columns at the Order Line level, then use some CASE logic or views to determine the customized product to which the line refers. This is similar to item (1), without the common 'Product' table. I consider it a more "quick and dirty" solution, since it completely does away with foreign keys between order lines and their product definitions. **Advantages**: quick solution. **Disadvantages**: same as item (1), plus lost RI.
- Homogenize the product definitions by creating a common header table and using key/value pairs for the customized attributes (OrderLine [n] <- [1] Product [1] <- [n] ProductAttribute). **Advantages**: key relationships are preserved; no ambiguity about product definition. **Disadvantages**: reporting (retrieving a list of products with their attributes, for instance), data typing of attribute values, performance (fetching product attributes, inserting or updating product attributes etc.)
If anyone else has tried a different strategy with more success, I'd sure like to hear about it.
Thank you.
| 0 | [
2,
15026,
40,
13,
22,
7861,
22,
23874,
19,
56,
80,
50,
1460,
6351,
591,
2374,
5465,
7484,
800,
3726,
3726,
48,
25,
21,
12705,
31,
22,
195,
541,
19,
1886,
1489,
84,
14,
122,
73,
31,
22,
79,
5712,
100,
1276,
962,
63,
485,
464,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
LabVIEW holds Excel Refference
===
I try to open and excel reference in LabVIEW and then close it after sometime. But the LabVIEW keeps holding the reference and does not release it unless I close the VI. Why is this happening? Is there anyway to force it to release the Reference? | 0 | [
2,
4343,
4725,
2763,
20700,
302,
6866,
2940,
800,
3726,
3726,
31,
1131,
20,
368,
17,
20700,
2801,
19,
4343,
4725,
17,
94,
543,
32,
75,
8530,
9,
47,
14,
4343,
4725,
8968,
1337,
14,
2801,
17,
630,
52,
830,
32,
4003,
31,
543,
14,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
What is the recomended whay to skin and entire aplication in WPF?
===
I want my WPF application to be skinable, by applying a certain xaml template, and the changes to be application wide, even for dynamic controls or controls that aren't even in the visual/logical tree.
What can I use to accomplish this type of functionality? Are there any good resources or tutorials that show how this specific task can be done?
| 0 | [
2,
98,
25,
14,
302,
960,
10726,
619,
12622,
20,
1188,
17,
1078,
21,
20669,
19,
619,
7721,
60,
800,
3726,
3726,
31,
259,
51,
619,
7721,
3010,
20,
44,
1188,
579,
15,
34,
11989,
21,
1200,
13,
6791,
8184,
22894,
15,
17,
14,
1693,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
*Real* world testing best practices
===
We are a small customer software development shop that works on variety of different projects for a variety of different customers. We are continuously adding feature requests and making minor bug fixes to these projects. The customers business changes ... their software needs to change.
In our environment the burden of the testing is put on the customer, they are the domain expert, and it also minimizes some of the cost for them. I don't want to get into the conversation of we should hire a tester, or testing charges should be part of the overall cost and so forth.
For a new project, the time and cost of testing is included, it's just in all the feature requests that get added over time where we start to have some testing issues. The customer wants changes rolled out into their environment as soon as possible ... which nowadays ... is very doable.
My question is, aside from unit testing from a code standpoint, what are best practices for test plan documentation? Is a simple document for each feature request work? Should the test process be done in a peer review? I'm looking for some insight on how others are handling this process.
Again ... we are small custom software development shop ... each developer, is designer, coder, tester and implementer ... it all just depends on the day and the time! :) | 0 | [
2,
1637,
7467,
2483,
126,
4431,
246,
5242,
800,
3726,
3726,
95,
50,
21,
284,
7705,
2306,
522,
2546,
30,
693,
27,
1747,
16,
421,
2314,
26,
21,
1747,
16,
421,
5279,
9,
95,
50,
11738,
4721,
1580,
12279,
17,
544,
1689,
6256,
6098,
1... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Create a database using T SQL on a specified location
===
How to create a database using T SQL script on a specified location? Let's say, I want to create a SQL server database on D:\temp\dbFolder. How to do this? | 0 | [
2,
1600,
21,
6018,
568,
13,
38,
4444,
255,
27,
21,
9931,
1474,
800,
3726,
3726,
184,
20,
1600,
21,
6018,
568,
13,
38,
4444,
255,
3884,
27,
21,
9931,
1474,
60,
408,
22,
18,
395,
15,
31,
259,
20,
1600,
21,
4444,
255,
8128,
6018,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0... |
Why does python pep-8 strongly recommend spaces over tabs for indentation?
===
I see on SO and pep-8 that the recommendation is to use spaces only for indentation in Python programs. I can understand the need for consistent indentation and I have felt that pain.
Is there an underlying reason for spaces to be preferred? I would have thought that tabs were far easier to work with. | 0 | [
2,
483,
630,
20059,
11841,
8,
457,
5020,
12360,
7644,
84,
6523,
18,
26,
19,
817,
8593,
60,
800,
3726,
3726,
31,
196,
27,
86,
17,
11841,
8,
457,
30,
14,
14066,
25,
20,
275,
7644,
104,
26,
19,
817,
8593,
19,
20059,
1726,
9,
31,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Can I add custom version strings to a .net DLL?
===
I can add custom version strings to a C++ DLL in Visual Studio by editing the .rc file by hand. For example, if I add to the VersionInfo section of the .rc file
VALUE "BuildDate", "2008/09/19 15:42:52"
Then that date is visible in the DLL's properties, under the Version tab.
Can I do the same for a C# DLL? Not just for build date, but for other version information (such as source control information) | 0 | [
2,
92,
31,
3547,
5816,
615,
7887,
20,
21,
13,
9,
2328,
13,
43,
211,
60,
800,
3726,
3726,
31,
92,
3547,
5816,
615,
7887,
20,
21,
272,
20512,
13,
43,
211,
19,
3458,
1120,
34,
9510,
14,
13,
9,
5453,
3893,
34,
224,
9,
26,
823,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
What is Test-and-Set used for?
===
After reading the Test-and-Set [Wikipedia entry][1], I am still left with the question "What would a Test-and-Set be used for?"
I realize that you can use it to implement Mutex (as described in wikipedia), but what other uses does it have?
[1]: http://en.wikipedia.org/wiki/Test-and-set | 0 | [
2,
98,
25,
1289,
8,
290,
8,
3554,
147,
26,
60,
800,
3726,
3726,
75,
1876,
14,
1289,
8,
290,
8,
3554,
636,
17375,
26132,
2792,
500,
2558,
165,
500,
15,
31,
589,
174,
225,
29,
14,
1301,
13,
7,
608,
83,
21,
1289,
8,
290,
8,
3... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Running away from SharePoint
===
Have any of you ever tried to run from sharepoint contracts ?
I've worked with sharepoint enought to know that it is not something that interests me. My instersts are more along the lines of APIs / backend / distributed development.
Have any of you found ways to move away from sharepoint and keep learning other things of interest? I'm currently in a position where sharepoint is in huge demand and i can't quite find a way to simply step aside from it.
any suggestions ? | 0 | [
2,
946,
229,
37,
1891,
3132,
800,
3726,
3726,
57,
186,
16,
42,
462,
794,
20,
485,
37,
1891,
3132,
8712,
13,
60,
31,
22,
195,
577,
29,
1891,
3132,
511,
38,
20,
143,
30,
32,
25,
52,
301,
30,
4408,
55,
9,
51,
19,
1911,
10044,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How can I normalize a URL in python
===
I'd like to know do I normalize a URL in python.
For example, If I have a url string like : "http://www.example.com/foo goo/bar.html"
I need a library in python that will transform the extra space (or any other non normalized character) to a proper URL.
Thank you. | 0 | [
2,
184,
92,
31,
1826,
2952,
21,
287,
6362,
19,
20059,
800,
3726,
3726,
31,
22,
43,
101,
20,
143,
107,
31,
1826,
2952,
21,
287,
6362,
19,
20059,
9,
26,
823,
15,
100,
31,
57,
21,
287,
6362,
3724,
101,
13,
45,
13,
7,
21127,
690... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Store Procedure; Insert Slowness
===
I have an SP that takes 10 seconds to run about 10 times (about a second every time it is ran). The platform is asp .net, and the server is SQL Server 2005. I have indexed the table (not on the PK also), and that is not the issue. Some caveats:
<ul>
<li>usp_SaveKeyword is not the issue. I commented out that entire SP and it made not difference. </li>
<li>I set @SearchID to 1 and the time was significantly reduced, only taking about 15ms on average for the transaction. </li>
<li>I commented out the entire stored procedure except the insert into tblSearches and strangely it took more time to execute. </li>
</ul>
Any ideas of what could be going on?
set ANSI_NULLS ON
go
ALTER PROCEDURE [dbo].[usp_NewSearch]
@Keyword VARCHAR(50),
@SessionID UNIQUEIDENTIFIER,
@time SMALLDATETIME = NULL,
@CityID INT = NULL
AS
BEGIN
SET NOCOUNT ON;
IF @time IS NULL SET @time = GETDATE();
DECLARE @KeywordID INT;
EXEC @KeywordID = usp_SaveKeyword @Keyword;
PRINT 'KeywordID : '
PRINT @KeywordID
DECLARE @SearchID BIGINT;
SELECT TOP 1 @SearchID = SearchID
FROM tblSearches
WHERE SessionID = @SessionID
AND KeywordID = @KeywordID;
IF @SearchID IS NULL BEGIN
INSERT INTO tblSearches
(KeywordID, [time], SessionID, CityID)
VALUES
(@KeywordID, @time, @SessionID, @CityID)
SELECT Scope_Identity();
END
ELSE BEGIN
SELECT @SearchID
END
END
| 0 | [
2,
1718,
7004,
73,
14692,
2276,
720,
800,
3726,
3726,
31,
57,
40,
3782,
30,
1384,
332,
2582,
20,
485,
88,
332,
436,
13,
5,
6901,
21,
153,
352,
85,
32,
25,
717,
6,
9,
14,
2452,
25,
28,
306,
13,
9,
2328,
15,
17,
14,
8128,
25... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.