unified_texts stringlengths 32 30.1k | OpenStatus_id int64 0 4 | input_ids list | token_type_ids list | attention_mask list |
|---|---|---|---|---|
Is there a jQuery equivalent of MooTools' Element() constructor?
===
I am going to be starting a javascript reporting engine for my website, and have started some prototyping using MooTools. I really like being able to do things like this:
function showLeagues(leagues) {
var leagueList = $("leagues");
leagueList.empty();
for(var i = 0; i<leagues.length; ++i) {
var listItem = getLeagueListElement(leagues[i]);
leagueList.adopt(listItem);
}
}
function getLeagueListElement(league) {
var listItem = new Element('li');
var newElement = new Element('a', {
'html': league.name,
'href': '?league='+league.key,
'events': {
'click': function() { showLeague(league); return false; }
}
});
listItem.adopt(newElement);
return listItem;
}
From what I've seen, jQuery's "adopt" type methods only take html strings or DOM Elements. Is there any jQuery equivalent to MooTools' [Element][1]?
[1]: http://mootools.net/docs/Element/Element#Element:constructor | 0 | [
2,
25,
80,
21,
487,
8190,
93,
4602,
16,
13,
8765,
20799,
18,
22,
4520,
5,
6,
6960,
248,
60,
800,
3726,
3726,
31,
589,
228,
20,
44,
1422,
21,
8247,
8741,
6670,
1406,
26,
51,
2271,
15,
17,
57,
373,
109,
9347,
1084,
3181,
568,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
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... |
Get the list of hyperlinks in a PDF file
===
I have a pdf file.I need to find all the hyperlinks available in that file and then make change on those links. | 0 | [
2,
164,
14,
968,
16,
5443,
6258,
18,
19,
21,
13,
11124,
3893,
800,
3726,
3726,
31,
57,
21,
13,
11124,
3893,
9,
49,
376,
20,
477,
65,
14,
5443,
6258,
18,
904,
19,
30,
3893,
17,
94,
233,
753,
27,
273,
6271,
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... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
Are there any command line tools to generate windows icons?
===
I am working on a project that requires a number of icons generated from a set of source images. I have a script that generates all the required images with judicious use of [ImageMagick][1], although I have not found a suitable tool to package the images as icons.
I have a set of png files (from dimensions of 16x16 up to 256x256, and in a range of bit depths) and I would like to generate some nice vista icons in the build script. The closest tool I have found to what I need is [png2ico][2], although this fails to cope with the large Vista icons, and does not support proper transparency in the icons it produces.
Before I invest time in writing such a tool, does anyone know of anything that will do the job?
[1]: http://www.imagemagick.org/script/index.php
[2]: http://winterdrache.de/freeware/png2ico/ | 0 | [
2,
50,
80,
186,
1202,
293,
4672,
20,
7920,
1936,
9801,
18,
60,
800,
3726,
3726,
31,
589,
638,
27,
21,
669,
30,
4781,
21,
234,
16,
9801,
18,
6756,
37,
21,
309,
16,
1267,
3502,
9,
31,
57,
21,
3884,
30,
7920,
18,
65,
14,
1390,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
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... |
"You can't forward declare classes that overload operator&"?
===
In the Google C++ Style Guide, there's a section on [Operator Overloading][1] that has a curious statement:
> Overloading also has surprising
> ramifications. For instance, you can't
> forward declare classes that overload
> `operator&`.
This seems incorrect, and I haven't been able to find any code that causes GCC to have a problem with it. Does anyone know what that statement is referring to?
[1]: http://google-styleguide.googlecode.com/svn/trunk/cppguide.xml#Operator_Overloading | 0 | [
2,
13,
7,
245,
92,
22,
38,
917,
10123,
2684,
30,
84,
8294,
6022,
1569,
7,
60,
800,
3726,
3726,
19,
14,
8144,
272,
20512,
1034,
3378,
15,
80,
22,
18,
21,
1050,
27,
636,
9477,
3457,
84,
16866,
500,
2558,
165,
500,
30,
63,
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... |
What's the best way to pass a "row of data" from one C# console app to another C# console app?
===
I have a C# console app "App1" that reads a row of data from a table in a SQL Server 2005 DB. I want App1 to pass all the data in this row to App2, another C# console app. What is the best way to do this?
My first (naive) attempt was to do this:
object[] o = myrow.ItemArray;
// make a string that separates each item by a space... for example "1 2 myVar".
// pass this string to App2 via command line.
This has some flaws: what if one of the entries in the row was "my var" instead of "myVar"? Also, the order of the items would be hardcoded in the receiving app (App2).
So what's the best way to do this? Would it be appropriate to pass an xml string to App2 via command line?
Cheers! | 0 | [
2,
98,
22,
18,
14,
246,
161,
20,
1477,
21,
13,
7,
5417,
16,
1054,
7,
37,
53,
272,
5910,
8650,
4865,
20,
226,
272,
5910,
8650,
4865,
60,
800,
3726,
3726,
31,
57,
21,
272,
5910,
8650,
4865,
13,
7,
7753,
165,
7,
30,
11137,
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... |
Is there a way to have content from an IFRAME overflow onto the parent frame?
===
I have a UI widget that needs to be put in an IFRAME both for performance reasons and so we can syndicate it out to affiliate sites easily. The UI for the widget includes tool-tips that display over the top of other page content. See screenshot below or **[go to the site][1]** to see it in action. Is there any way to make content from within the IFRAME overlap the parent frame's content?
![Tool-tip content needs to overlap parent frame content][2]
[1]: http://www.bookabach.co.nz/
[2]: http://segdeha.com/assets/imgs/bookabach-calendar.png | 0 | [
2,
25,
80,
21,
161,
20,
57,
2331,
37,
40,
31,
8361,
20285,
1204,
14,
4766,
3523,
60,
800,
3726,
3726,
31,
57,
21,
13,
5661,
4807,
43,
3060,
30,
2274,
20,
44,
442,
19,
40,
31,
8361,
156,
26,
956,
2932,
17,
86,
95,
92,
17013,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
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 turn a DataRow into an XML string using C#?
===
I have a DataRow with columns col1 and col2. Each column has a value: val1 and val2 respectively. How can I turn this into an xml string using C#?
For the DataRow mentioned above I'd like the following string:
<col1>val1</col1><col2>val2</col2>
| 0 | [
2,
184,
92,
31,
805,
21,
1054,
5417,
77,
40,
23504,
3724,
568,
272,
5910,
60,
800,
3726,
3726,
31,
57,
21,
1054,
5417,
29,
7498,
3313,
165,
17,
3313,
135,
9,
206,
4698,
63,
21,
1923,
45,
3347,
165,
17,
3347,
135,
2820,
9,
184,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
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 Format for Query Defined Field
===
I have the following query in iSeries SQL which I output to a file.
SELECT SSLOTMAK, SSLOTMDL, SSLOTYER, sum(SSCOUNT)
FROM prqhdrss
GROUP BY SSLOTMAK, SSLOTMDL, SSLotyer HAVING sum(SSCOUNT) > 4 ORDER
BY SSLOTMAK, SSLOTMDL, SSLOTYER
When I run it, the field created be the sum(SSCOUNT) is a 31 Packed field. This does not allow me to send it to my PC. How can I force SQL to create the field as a non-packed field. | 0 | [
2,
2697,
2595,
26,
25597,
2811,
575,
800,
3726,
3726,
31,
57,
14,
249,
25597,
19,
31,
8231,
4444,
255,
56,
31,
5196,
20,
21,
3893,
9,
5407,
13,
18,
18,
5639,
15409,
15,
13,
18,
18,
5639,
79,
8643,
15,
13,
18,
18,
5639,
4366,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
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 Script to edit page content on the fly
===
I'm writing an article about editing pages in order to hand pick what you really want to print. There are many tools (like "Print What you like") but I also found this script. Anyone knows anything about it? I haven't found any kind of documentation or references.
javascript:document.body.contentEditable='true'; document.designMode='on'; void 0
Thanks! | 0 | [
2,
8247,
3884,
20,
9392,
2478,
2331,
27,
14,
2855,
800,
3726,
3726,
31,
22,
79,
1174,
40,
2002,
88,
9510,
4434,
19,
389,
20,
224,
2036,
98,
42,
510,
259,
20,
4793,
9,
80,
50,
151,
4672,
13,
5,
1403,
13,
7,
10299,
98,
42,
101... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
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... |
Are there any tools or techniques to help determine the exact cause of a nonsecure page element error?
===
I run into this quite often where a new page is supposedly "tested" and ready to go. But as soon as I change the page from http to https (secure) mode I get the "This page contains both secure and nonsecure items." error.
Usually I can find the problem and fix it pretty quick. Today is different. I've checked every image reference and every javascript reference and their source and haven't found anything that should be causing this error.
Are there any developer tools or techniques that can point out specifically what is causing this error? | 0 | [
2,
50,
80,
186,
4672,
54,
4212,
20,
448,
3746,
14,
5340,
1679,
16,
21,
538,
22917,
2478,
4520,
7019,
60,
800,
3726,
3726,
31,
485,
77,
48,
1450,
478,
113,
21,
78,
2478,
25,
11731,
13,
7,
22372,
7,
17,
1451,
20,
162,
9,
47,
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... |
Why not use SPARKAda?
===
Beyond some valid reasons not to use a new tool such as support of legacy code, no in-house [SPARKAda][1] knowledge base, why hasn't SPARKAda caught on? It seems like a very sound tool for many projects requiring high reliability, so I don't understand why its not so common. I would be more comfortable knowing that the avionics software that powers my flight was developed using a programming language that lends itself to verifiability techniques as suppose to being written in the C language.
[1]: 'http://en.wikipedia.org/wiki/SPARK_(programming_language)' | 0 | [
2,
483,
52,
275,
9026,
4405,
60,
800,
3726,
3726,
1701,
109,
7394,
2932,
52,
20,
275,
21,
78,
5607,
145,
28,
555,
16,
7780,
1797,
15,
90,
19,
8,
1682,
636,
18,
9407,
4405,
500,
2558,
165,
500,
1918,
1000,
15,
483,
9979,
22,
38... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
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 get records after a certain time using SQL datetime field
===
If I have a datetime field, how do I get just records created later than a certain time, ignoring the date altogether?
It's a logging table, it tells when people are connecting and doing something in our application. I want to find out how often people are on later than 5pm. | 0 | [
2,
184,
20,
164,
742,
75,
21,
1200,
85,
568,
4444,
255,
1231,
891,
575,
800,
3726,
3726,
100,
31,
57,
21,
1231,
891,
575,
15,
184,
107,
31,
164,
114,
742,
679,
138,
119,
21,
1200,
85,
15,
9321,
14,
1231,
11206,
60,
32,
22,
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 do I ignore a GAC reference from Cassini?
===
I have an assembly in the GAC which gets loaded when I'm debugging a web app. However, I've changed that assembly in the web app that I'm debugging but VS2008/Cassini is picking up the one in the GAC.
How do I make VS2008/Cassini use the one that I'm debugging? | 0 | [
2,
184,
107,
31,
7174,
21,
4369,
150,
2801,
37,
5913,
2651,
60,
800,
3726,
3726,
31,
57,
40,
1475,
19,
14,
4369,
150,
56,
3049,
8572,
76,
31,
22,
79,
121,
16254,
2762,
21,
2741,
4865,
9,
207,
15,
31,
22,
195,
1015,
30,
1475,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
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 create help documentation for an Excel VBA solution?
===
VBA solutions can vary widely in size.
I would like to add **help** documentation to all solutions but the level of effort to create and deploy the **help** needs to match the size of the solution.
| 0 | [
2,
98,
25,
14,
246,
161,
20,
1600,
448,
13945,
26,
40,
20700,
566,
969,
4295,
60,
800,
3726,
3726,
566,
969,
6776,
92,
7392,
2525,
19,
1072,
9,
31,
83,
101,
20,
3547,
13,
1409,
14593,
1409,
13945,
20,
65,
6776,
47,
14,
662,
16... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
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... |
(CSS?) Eliminating browser's 'selected' lines around a hyperlinked image?
===
The attached screenshot is from OS X/Firefox 3. Note that the center tab (an image) has a dotted line around it, apparently because it was the most-recently selected tab. Is there a way I can eliminate this dotted line in CSS or JavaScript? (Hmmm...the free image hosting service has reduced the size of the image. But if you could see it, you'd notice a dotted-line select area around the block.)
![Screen Shot][1]
[1]: http://www.freeimagehosting.net/uploads/th.fadf78173b.png | 0 | [
2,
13,
5,
6824,
18,
60,
6,
17653,
16495,
22,
18,
13,
22,
18,
7138,
22,
1560,
140,
21,
5443,
6258,
69,
1961,
60,
800,
3726,
3726,
14,
3638,
2324,
7868,
25,
37,
13,
759,
993,
118,
5929,
18219,
203,
9,
1945,
30,
14,
459,
6523,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
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... |
Persisting configuration items in .net
===
I have a set of configuration items I need to persist to a "human readable" file. These items are in a hierarchy:
<pre>
Device 1
Name
Channel 1
Name
Size
...
Channel N
Name
...
Device M
Name
Channel 1
</pre>
Each of these item could be stored in a Dictionary with a string Key and a value. They could also be in a structure/DTO.
I don't care about the format of the file as long as it's human readable. It could be XML or it could have something more like INI format
<pre>
[Header]
Key=value
Key2=value
...
</pre>
Is there a way to minimize the amount of boiler plate code I would need to write to manage storing/reading configuration items?
Should I just create Data Transfer Objects (DTO)/structures and mark them serializable (Does that generate bloated XML still human readable?)
Is there other suggestions? | 0 | [
2,
22084,
68,
8091,
3755,
19,
13,
9,
2328,
800,
3726,
3726,
31,
57,
21,
309,
16,
8091,
3755,
31,
376,
20,
22084,
20,
21,
13,
7,
7057,
1302,
579,
7,
3893,
9,
158,
3755,
50,
19,
21,
14417,
45,
13,
1,
3515,
1,
3646,
137,
204,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
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... |
find an application base url
===
I'd like to find the base url of my application, so I can automatically reference other files in my application tree...
So given a file config.php in the base of my application, if a file in a subdirectory includes it, knows what to prefix a url with.
application/config.php
application/admin/something.php
application/css/style.css
So given that `http://www.example.com/application/admin/something.php` is accessed, I want it to be able to know that the css file is in `$approot/css/style.css`. In this case, `$approot` is "`/application`" but I'd like it to know if the application is installed elsewhere.
I'm not sure if it's possible, many applications (phpMyAdmin, Squirrelmail I think) have to set a config variable to begin with. It would be more user friendly if it just knew. | 0 | [
2,
477,
40,
3010,
1000,
287,
6362,
800,
3726,
3726,
31,
22,
43,
101,
20,
477,
14,
1000,
287,
6362,
16,
51,
3010,
15,
86,
31,
92,
7499,
2801,
89,
6488,
19,
51,
3010,
1541,
9,
9,
9,
86,
504,
21,
3893,
13,
14093,
2816,
9,
26120... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
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... |
Irregular shaped Windows Form (C#)
===
What is the easiest way to do this? Is it possible with managed code?
Thanks for your time. | 0 | [
2,
10687,
9733,
1936,
505,
13,
5,
150,
5910,
6,
800,
3726,
3726,
98,
25,
14,
27237,
161,
20,
107,
48,
60,
25,
32,
938,
29,
1471,
1797,
60,
3669,
26,
154,
85,
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,
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,
0,
0,
0,
0,
0,
0,
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 best way to build a common utilities library?
===
I am wondering what is the best way to construct a common utilities library that can be used in different projects. I am using .Net and C#.
Should I create a separate project for each utility such as Logging, Authentication, Excel etc. and release them separately along with dependencies or should i include all utilities in one common utils assembly along with all dependencies bundled and only reference the necessary dependencies in projects that use the common utils? | 0 | [
2,
98,
25,
14,
246,
161,
20,
1895,
21,
757,
19817,
1248,
60,
800,
3726,
3726,
31,
589,
5712,
98,
25,
14,
246,
161,
20,
6960,
21,
757,
19817,
1248,
30,
92,
44,
147,
19,
421,
2314,
9,
31,
589,
568,
13,
9,
2328,
17,
272,
5910,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
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... |
Make DOM element effectively read-only
===
I'm writing a .NET forms control to edit HTML using MSHTML. I am creating some custom elements and want to make them effectively read-only. I thought I could go about this by focusing on the entire element any time focus entered anywhere in that element but the HtmlElement.Focus() doesn't select the entire element and I don't seem to be able to capture entry of the cursor.
Another option would be to raise an event whenever the text of the element is changed (on KeyDown I expect) but I can't get that event to fire, either. Any ideas about why my expectations about event behavior is wrong or alternate suggestions for implementation? | 0 | [
2,
233,
11859,
4520,
5463,
1302,
8,
4965,
800,
3726,
3726,
31,
22,
79,
1174,
21,
13,
9,
2328,
1997,
569,
20,
9392,
13,
15895,
568,
4235,
15895,
9,
31,
589,
2936,
109,
5816,
2065,
17,
259,
20,
233,
105,
5463,
1302,
8,
4965,
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... |
Circular References in Java
===
Given an aggregation of class instances which refer to each other in a complex, circular, fashion: is it possible that the garbage collector may not be able to free these objects? | 0 | [
2,
8155,
7231,
19,
8247,
800,
3726,
3726,
504,
40,
27255,
16,
718,
13946,
56,
5017,
20,
206,
89,
19,
21,
1502,
15,
8155,
15,
3161,
45,
25,
32,
938,
30,
14,
15024,
10836,
123,
52,
44,
777,
20,
551,
158,
3916,
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... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
Proper way to deal with variations in JSON serialization
===
I have a web service that uses Python's SimpleJSON to serialize JSON, and a javascript/ client that uses Google's Visualization [API][1]. When I try to read in the JSON response using Google Data Table's Query method, I am getting a "invalid label" error.
I noticed that Google spreadsheet outputs JSON without quotes around the object keys. I tried reading in JSON without the quotes and that works. I was wondering what was the best way to get SimpleJSON output to be read into Google datable using
`query = new google.visualization.Query("http://www.myuri.com/api/")`.
I could use a regex to remove the quotes, but that seems sloppy. The javascript JSON parsing libraries I've tried won't read in JSON syntax without quotes around the object keys.
Here's some good background reading re: quotes around object keys:
[http://simonwillison.net/2006/Oct/11/json/][1].
[1]: http://code.google.com/apis/visualization/documentation/reference.html | 0 | [
2,
4119,
161,
20,
1183,
29,
8194,
19,
487,
528,
5956,
1829,
800,
3726,
3726,
31,
57,
21,
2741,
365,
30,
2027,
20059,
22,
18,
1935,
728,
528,
20,
5956,
2952,
487,
528,
15,
17,
21,
8247,
8741,
118,
6819,
30,
2027,
8144,
22,
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... |
Converting OOo macros to Excel macros
===
I have an OpenDocument spreadsheet with macros in StarBasic/OOoBasic that I want to convert into an Excel spreadsheet, with macros transliterated to VBA. While OpenOffice.org claims to have the ability to translate VBA macros to StarBasic and back, my attempts to have OOo convert these original StarBasic macros to VBA have all failed.
Is there any guaranteed way to get these macros moved to VBA and Excel, without completely rewriting them? | 0 | [
2,
19583,
635,
4328,
9069,
18,
20,
20700,
9069,
18,
800,
3726,
3726,
31,
57,
40,
368,
28132,
1789,
17627,
29,
9069,
18,
19,
778,
26467,
118,
111,
4328,
26467,
30,
31,
259,
20,
8406,
77,
40,
20700,
1789,
17627,
15,
29,
9069,
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... |
Big integers in C#
===
Currently I am [borrowing `java.math.BigInteger` from the J# libraries as described here](http://msdn.microsoft.com/en-us/magazine/cc163696.aspx). Having never used a library for working with large integers before, this seems slow, on the order of 10 times slower, even for `ulong` length numbers. Does anyone have any better (preferably free) libraries, or is this level of performance normal? | 0 | [
2,
580,
13820,
18,
19,
272,
5910,
800,
3726,
3726,
871,
31,
589,
636,
6157,
5417,
68,
13,
1,
1004,
1385,
9,
14825,
9,
6407,
6391,
13699,
1,
37,
14,
487,
5910,
8649,
28,
745,
235,
500,
5,
21127,
6903,
79,
18,
43,
103,
9,
22019,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
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... |
Need Help With HttpWebRequest object
===
I'm trying to build a proxy module for .NET, but I'm having trouble copying the Headers from the current request to the new request. I am setting the headers of the new request, because I want the proxy to support SOAP requests. Here is a portion of my code. I can post everything if need, but this is the only part that seems related to the issue I am having:
<pre>
<code>
HttpApplication app = (HttpApplication)sender; // sender from context.BeginRequest event
HttpRequest crntReq = app.Request; // set a reference to request object for easier access
HttpWebRequest proxyReq = (HttpWebRequest)HttpWebRequest.Create(crntReq.Url.AbsoluteUri);
// parse headers from current httpcontext.request.headers and add each name->value to the
// new request object
foreach (string header in crntReq.Headers)
{
proxyReq.Headers.Add(header, crntReq.Headers[header]); // throws exception :(
}
</code>
</pre>
<br />
When my code hits the foreach loop, it throws an exception for the Headers.Add function. I'm assuming the collection has access restrictions, for security purposes. It appears that some of the header values are accessible with properties for the HttpWebRequest object itself. However in this case I'd rather get rid of the abstraction and set the properties manually. The exception that I'm receiving is:<br /><i>{"This header must be modified using the appropriate property.\r\nParameter name: name"}</i>
<hr>
Thanks in advance for your help,
CJAM | 0 | [
2,
376,
448,
29,
7775,
458,
3692,
10351,
3095,
800,
3726,
3726,
31,
22,
79,
749,
20,
1895,
21,
27188,
12613,
26,
13,
9,
2328,
15,
47,
31,
22,
79,
452,
2572,
4344,
68,
14,
157,
445,
37,
14,
866,
3772,
20,
14,
78,
3772,
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... |
Autocomplete Dropdown - too much data, timing out
===
So, I have an autocomplete dropdown with a list of townships. Initially I just had the 20 or so that we had in the database... but recently, we have noticed that some of our data lies in other counties... even other states. So, the answer to that was buy one of those databases with all towns in the US (yes, I know, geocoding is the answer but due to time constraints we are doing this until we have time for that feature).
So, when we had 20-25 towns the autocomplete worked stellarly... now that there are 80,000 it's not as easy.
As I type I am thinking that the best way to do this is default to this state, then there will be much less. I will add a state selector to the page that defaults to NJ then you can pick another state if need be, this will narrow down the list to < 1000. Though, I may have the same issue? Does anyone know of a work around for an autocomplete with a lot of data?
should I post teh codez of my webservice? | 0 | [
2,
3108,
15990,
2804,
2968,
13,
8,
266,
212,
1054,
15,
11812,
70,
800,
3726,
3726,
86,
15,
31,
57,
40,
3108,
15990,
2804,
2968,
29,
21,
968,
16,
1606,
18,
9,
1537,
31,
114,
41,
14,
434,
54,
86,
30,
95,
41,
19,
14,
6018,
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... |
What's a good Web Crawler tool
===
I need to index a whole lot of webpages, what good webcrawler utilities are there? I'm preferably after something that can talk to .NET, but that's not a showstopper.
What I really need is something that I can give a site url to & it will follow every link and store the content for indexing. | 0 | [
2,
98,
22,
18,
21,
254,
2741,
12392,
106,
5607,
800,
3726,
3726,
31,
376,
20,
4348,
21,
979,
865,
16,
2741,
6486,
18,
15,
98,
254,
2741,
24916,
106,
19817,
50,
80,
60,
31,
22,
79,
6369,
4801,
75,
301,
30,
92,
930,
20,
13,
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... |
How to check out all VB6 Project files from VSS?
===
I have a VB6 project in Visual Source Safe 6.0. When I open the project I want to Check Out (Get) all the files in the project so that I can edit them.
I have the VSS Options (within VB6) set to act on the Project recursively, but when I check out the project.vbp it only checks out the project file, not all the modules, etc. Those files all remain write protected until I individually check out each one.
| 0 | [
2,
184,
20,
2631,
70,
65,
13,
20468,
379,
669,
6488,
37,
4611,
18,
60,
800,
3726,
3726,
31,
57,
21,
13,
20468,
379,
669,
19,
3458,
1267,
1834,
400,
9,
387,
9,
76,
31,
368,
14,
669,
31,
259,
20,
2631,
70,
13,
5,
3060,
6,
65... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
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... |
Disable the postback on an <ASP:LinkButton>
===
I have an ASP.NET linkbutton control on my form. I would like to use it for javascript on the client side and prevent it from posting back to the server. (I'd like to use the linkbutton control so I can skin it and disable it in some cases, so a straight up <a> tag is not preferred).
How do I prevent it from posting back to the server? | 0 | [
2,
1460,
579,
14,
678,
1958,
27,
40,
13,
1,
472,
306,
45,
6258,
811,
444,
1,
800,
3726,
3726,
31,
57,
40,
28,
306,
9,
2328,
3508,
811,
444,
569,
27,
51,
505,
9,
31,
83,
101,
20,
275,
32,
26,
8247,
8741,
27,
14,
6819,
270,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
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... |
Re-center Modal Popup with Javascript
===
I have a modal popup that initially shows some content but expands a div if a checkbox is selected. The modal expands correctly but doesn't recenter unless you scroll up or down. Is there a javascript event I can tack on to my javascript function to recenter the entire modal? | 0 | [
2,
302,
8,
12641,
13,
20756,
1675,
576,
29,
8247,
8741,
800,
3726,
3726,
31,
57,
21,
13,
20756,
1675,
576,
30,
1537,
1285,
109,
2331,
47,
6073,
18,
21,
13,
12916,
100,
21,
2631,
5309,
25,
1704,
9,
14,
13,
20756,
6073,
18,
12044,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
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... |
Break on unhandled exception in ASP.Net
===
When debugging an application in VS.Net, there are 2 options for breaking on exceptions. Break as soon as an exception is thrown, and breaking only when an exception isn't caught. This works fine when developing desktop applications. However, when developing ASP.Net applications, all exceptions are eventually caught by the code in IIS. Is it possible to disable this behaviour, so that the debugger breaks when my ASP.Net application code fails to catch an exception? | 0 | [
2,
1442,
27,
367,
3203,
1294,
5391,
19,
28,
306,
9,
2328,
800,
3726,
3726,
76,
121,
16254,
2762,
40,
3010,
19,
4611,
9,
2328,
15,
80,
50,
172,
6368,
26,
3892,
27,
13392,
9,
1442,
28,
651,
28,
40,
5391,
25,
6027,
15,
17,
3892,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
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... |
Nano hacks: most useful tiny programs you've coded or come across
===
It's the first <a href="http://oreilly.com/catalog/opensources/book/larry.html">great virtue</a> of programmers. All of us have, at one time or another automated a task with a bit of throw-away code. Sometimes it takes a couple seconds tapping out a one-liner, sometimes we spend an exorbitant amount of time automating away a two-second task and then never use it again.
What tiny hack have you found useful enough to <b>reuse</b>? To make go so far as to make an alias for?
Note: before answering, please check to make sure it's not already on <a href="http://stackoverflow.com/questions/68372/what-is-your-single-most-favorite-command-line-trick-using-bash">favourite command-line tricks using BASH</a> or perl/ruby one-liner questions. | 0 | [
2,
10371,
11835,
18,
45,
127,
4811,
3228,
1726,
42,
22,
195,
13,
22254,
54,
340,
464,
800,
3726,
3726,
32,
22,
18,
14,
64,
13,
1,
58,
746,
14057,
3726,
7,
21127,
6903,
111,
15382,
9,
960,
118,
9709,
5567,
118,
10157,
12097,
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... |
NUnit assembly not found
===
I've used NUnit before, but not in a while, and never on this machine. I unzipped version 2.4.8 under Program Files, and I keep getting this error when trying to load my tests.
**Could not load file or assembly 'nunit.framework, Version=2.4.8.0, Culture=neutral, PublicKeyToken=96d09a1eb7f44a77' or one of its dependencies. The system cannot find the file specified**
In order to simplify the problem, I've compiled the most basic possible test file.
using NUnit.Framework;
namespace test
{
[TestFixture]
public class Tester
{
[Test]
public void ATest()
{
Assert.IsTrue( false, "At least the test ran!" );
}
}
}
I've added "C:\Program Files\NUnit-2.4.8-net-2.0\bin" to my PATH (and rebooted). Note that if I copy the test assembly into that folder, then
<pre>
C:\Program Files\NUnit-2.4.8-net-2.0\bin>nunit-console test.dll
</pre>
works, but
<pre>
C:\Program Files\NUnit-2.4.8-net-2.0\bin>nunit-console c:\dev\nunit_test\test.dll
</pre>
and
<pre>
C:\dev\nunit_test>nunit_console test.dll
</pre>
fail with the above error.
Presumably I could get around this by copying the NUnit.Framework dll into my project's bin folder, but I don't remember having to do this in the past. Moreover, I get the same error in the GUI. Shouldn't the GUI know where the framework is located (that is, in the same folder)? | 0 | [
2,
10210,
242,
1475,
52,
216,
800,
3726,
3726,
31,
22,
195,
147,
10210,
242,
115,
15,
47,
52,
19,
21,
133,
15,
17,
243,
27,
48,
1940,
9,
31,
367,
2553,
3421,
69,
615,
172,
9,
300,
9,
457,
131,
625,
6488,
15,
17,
31,
643,
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... |
Cannot open user default database. Login failed. SQL 2005
===
I have taken a copy of a database home with me so I can do some testing. However when I try to run a stored procedure I get Cannot open user default database. Login failed..
I have checked and checked and checked I can open tables in the databases login to sql management studio and access the default as well as other databases any ideas?
Possibly a corrupt user it was from sql 2000 at work to 2005 at home | 0 | [
2,
1967,
368,
4155,
12838,
6018,
9,
6738,
108,
1702,
9,
4444,
255,
812,
800,
3726,
3726,
31,
57,
658,
21,
4344,
16,
21,
6018,
213,
29,
55,
86,
31,
92,
107,
109,
4431,
9,
207,
76,
31,
1131,
20,
485,
21,
8214,
7004,
31,
164,
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 give a name to an Eclipse Update Site?
===
I'm generating an Eclipse update site and I'm trying to give it a label so that when it appears in a user's sites list, it would appear as a name (e.g., "Ganymede project") rather than as a URL.
I haven't been able to find any parameter for it in the PDE or site.xml | 0 | [
2,
184,
20,
590,
21,
204,
20,
40,
11652,
11100,
689,
60,
800,
3726,
3726,
31,
22,
79,
13500,
40,
11652,
11100,
689,
17,
31,
22,
79,
749,
20,
590,
32,
21,
1899,
86,
30,
76,
32,
1780,
19,
21,
4155,
22,
18,
3259,
968,
15,
32,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
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 practices: What's the best way for constructing headers and footers? Call it all from the controller, or include from the view file?
===
Best practices: What's the best way for constructing headers and footers? Call it all from the controller, or include from the view file?
I'm using Codeigniter. What's best practice? Loading all the included view files from the controller, like this?
class Page extends Controller {
function index()
{
$data['page_title'] = 'Your title';
$this->load->view('header');
$this->load->view('menu');
$this->load->view('content', $data);
$this->load->view('footer');
}
}
or calling the single view file and calling the header and footer views from there, like this:
//controller file
class Page extends Controller {
function index()
{
$data['page_title'] = 'Your title';
$this->load->view('content', $data);
}
}
//view file
<?php $this->load->view('header'); ?>
<p>The data from the controller</p>
<?php $this->load->view('footer'); ?>
I've seen it done both ways, but want to choose now before I go too far down a path and screw myself.
Cheers.
jon | 0 | [
2,
246,
5242,
45,
98,
22,
18,
14,
246,
161,
26,
18660,
157,
445,
17,
1749,
445,
60,
645,
32,
65,
37,
14,
9919,
15,
54,
468,
37,
14,
1418,
3893,
60,
800,
3726,
3726,
246,
5242,
45,
98,
22,
18,
14,
246,
161,
26,
18660,
157,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
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 view old version of a file in a static view, from the command line?
===
In a static view, how can I view an old version of a file?
Given an empty file (called `empty` in this example) I can subvert `diff` to show me the old version:
<pre>
% cleartool diff -ser empty File@@/main/28
</pre>
This feels like a pretty ugly hack. Have I missed a more basic command? Is there a neater way to do this?
(I don't want to edit the config spec - that's pretty tedious, and I'm trying to look at a bunch of old versions.) | 0 | [
2,
184,
92,
31,
1418,
315,
615,
16,
21,
3893,
19,
21,
12038,
1418,
15,
37,
14,
1202,
293,
60,
800,
3726,
3726,
19,
21,
12038,
1418,
15,
184,
92,
31,
1418,
40,
315,
615,
16,
21,
3893,
60,
504,
40,
2424,
3893,
13,
5,
4580,
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... |
ShowDialog() from keyboard hook in c#
===
I want to call some show dialog when a keyboard hook is triggered but I'm having some difficultys:
- ShowDialog() blocks so I can't call it from the hook triggered event because it will block the OS.
- I can start a new thread and call ShowDialog() from there, but I get some nasty exception. I guess I can't call ShowDialog() in any other thread.
- I can start a timer: in the next 50 milliseconds call ShowDialog() (which is a nasty hack btw and I rather no do this) But then the timer fires in a new thread and I get then I run into the same problem explained in the previous bullet
I'm sure there must be a way. | 0 | [
2,
298,
4286,
5567,
5,
6,
37,
8896,
5559,
19,
272,
5910,
800,
3726,
3726,
31,
259,
20,
645,
109,
298,
28223,
76,
21,
8896,
5559,
25,
15164,
47,
31,
22,
79,
452,
109,
6967,
18,
45,
13,
8,
298,
4286,
5567,
5,
6,
5198,
86,
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... |
Send Cookies
===
Ok, if i have this right, my code can get cookies at a specific url, but then once i get the cookie, into the container, how can i send it to the client via socket? like the code directly below does here for regular http-page requests.<pre>byte[] buffer = new byte[bz];
rebu = responsestream.Read(buffer, 0, bz);
while (rebu != 0)
{
soket.Send(buffer, rebu, 0);
rebu = responsestream.Read(buffer, 0, bz);
}</pre>
My code section for requests/responses<pre>System.Net.Configuration.HttpWebRequestElement wr = new System.Net.Configuration.HttpWebRequestElement();
wr.UseUnsafeHeaderParsing = true;
HttpWebRequest request = (HttpWebRequest)WebRequest.Create(url);
CookieContainer cookieContainer = new CookieContainer();
request.CookieContainer = cookieContainer;
request.CookieContainer.Add(cookieContainer.GetCookies((Uri)url));
HttpWebResponse response = (HttpWebResponse)request.GetResponse();
Stream responsestream = response.GetResponseStream();
byte[] buffer = new byte[bz];
rebu = responsestream.Read(buffer, 0, bz);
while (rebu != 0)
{
soket.Send(buffer, rebu, 0);
rebu = responsestream.Read(buffer, 0, bz);
}</pre>
This is part of a proxy server im coding and i'm having trouble with cookies.
C#.net3.5 | 0 | [
2,
2660,
19396,
800,
3726,
3726,
5854,
15,
100,
31,
57,
48,
193,
15,
51,
1797,
92,
164,
19396,
35,
21,
1903,
287,
6362,
15,
47,
94,
382,
31,
164,
14,
19980,
15,
77,
14,
12147,
15,
184,
92,
31,
2660,
32,
20,
14,
6819,
1197,
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... |
Is it worthwhile to use a bit vector/array rather than a simple array of bools?
===
When I want an array of flags it has typically pained me to use an entire byte (or word) to store each one, as would be the result if I made an array of <code>bool</code>s or some other numeric type that could be set to 0 or 1. But now I wonder whether using a structure that is more space-efficient is worth it given the (albeit hopefully very slight) additional overhead of shifting and bit testing.
In my company we use Rogue Wave tools (though hopefully not for much longer) and it's their <code>RWBitVec</code> that I've used for this purpose up until now. | 0 | [
2,
25,
32,
29604,
20,
275,
21,
1142,
7497,
118,
8576,
93,
864,
119,
21,
1935,
7718,
16,
9827,
7532,
60,
800,
3726,
3726,
76,
31,
259,
40,
7718,
16,
9318,
32,
63,
2442,
1257,
69,
55,
20,
275,
40,
1078,
34,
591,
13,
5,
248,
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... |
How can I run all JUnit unit tests except those ending in "IntegrationTest" in my IntelliJ IDEA project using the integrated test runner?
===
I basically want to run all JUnit ***unit*** tests in my IntelliJ IDEA project (excluding JUnit integration tests), using the static suite() method of JUnit. Why use the static suite() method? Because I can then use IntelliJ IDEA's JUnit test runner to run all unit tests in my application (and easily exclude all integration tests by naming convention). The code so far looks like this:
package com.acme;
import junit.framework.Test;
import junit.framework.TestCase;
import junit.framework.TestSuite;
import java.util.ArrayList;
import java.util.Iterator;
import java.util.List;
public class AllUnitTests extends TestCase {
public static Test suite() {
List classes = getUnitTestClasses();
return createTestSuite(classes);
}
private static List getUnitTestClasses() {
List classes = new ArrayList();
classes.add(CalculatorTest.class);
return classes;
}
private static TestSuite createTestSuite(List allClasses) {
TestSuite suite = new TestSuite("All Unit Tests");
for (Iterator i = allClasses.iterator(); i.hasNext();) {
suite.addTestSuite((Class<? extends TestCase>) i.next());
}
return suite;
}
}
The method getUnitTestClasses() should be rewritten to add all project classes extending TestCase, except if the class name ends in "IntegrationTest".
I know I can do this easily in Maven for example, but I need to do it in IntelliJ IDEA so I can use the integrated test runner - I like the green bar :)
| 0 | [
2,
184,
92,
31,
485,
65,
7446,
242,
1237,
4894,
1613,
273,
3119,
19,
13,
7,
12370,
857,
10543,
7,
19,
51,
19,
4213,
9999,
882,
669,
568,
14,
5547,
1289,
4510,
60,
800,
3726,
3726,
31,
11374,
259,
20,
485,
65,
7446,
242,
8980,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
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... |
In Python, how do I find the index of an item given a list containing it?
===
For a list ["foo","bar","baz"] and a variable "bar", what's the cleanest way to get its index 1 in python? | 0 | [
2,
19,
20059,
15,
184,
107,
31,
477,
14,
4348,
16,
40,
9101,
504,
21,
968,
3503,
32,
60,
800,
3726,
3726,
26,
21,
968,
636,
7,
4120,
111,
7,
15,
7,
1850,
7,
15,
7,
969,
380,
7,
500,
17,
21,
7612,
13,
7,
1850,
7,
15,
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... |
Do you accept "kibibyte" as a unit of measurement?
===
For decades, in the field of computing (except disk manufacturers), a KB (kilobyte) was understood to mean 1024 bytes. In the past few years, there has been a movement to use KiB ("kibibyte") to mean 1024 bytes, and <i>change the meaning of kilobyte to be 1000 bytes</i>, dooming us to many more years of confusion. On the other hand, the movement seems to be confined to Gnome, and some <a href="http://en.wikipedia.org/wiki/Talk:Kilobyte#Kibibyte.3F">overzealous wikipedia editing</a>.
Let's settle this once and for all, right here on stackoverflow. <i>Will you be converting your programs to use KiB?</i> If you have ever displayed a filesize in KB, did you divide by 1000 or 1024?
| 0 | [
2,
107,
42,
3440,
13,
7,
1520,
2161,
23246,
7,
28,
21,
1237,
16,
11688,
60,
800,
3726,
3726,
26,
3784,
15,
19,
14,
575,
16,
10626,
13,
5,
10066,
8582,
8571,
6,
15,
21,
15251,
13,
5,
1520,
1415,
23246,
6,
23,
4014,
20,
884,
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... |
How can I get MSBUILD to evaluate and print the full path when given a relative path?
===
How can I get MSBuild to evaluate and print in a `<Message />` task an absolute path given a relative path?
**Property Group**
<Source_Dir>..\..\..\Public\Server\</Source_Dir>
<Program_Dir>c:\Program Files (x86)\Program\</Program_Dir>
**Task**
<Message Importance="low" Text="Copying '$(Source_Dir.FullPath)' to '$(Program_Dir)'" />
**Output**
>Copying '' to 'c:\Program Files (x86)\Program\' | 0 | [
2,
184,
92,
31,
164,
4235,
29361,
20,
13,
15599,
17,
4793,
14,
503,
2013,
76,
504,
21,
4543,
2013,
60,
800,
3726,
3726,
184,
92,
31,
164,
4235,
29361,
20,
13,
15599,
17,
4793,
19,
21,
13,
1,
3845,
18,
1303,
13,
118,
1,
3005,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
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... |
Offline access to MoinMoin wiki using Google Gears
===
How to add offline access functionality to [MoinMoin wiki][1]?
As a minimum, I would love to have browsing access to all pages on a server-based wiki (while being offline). Search and other things, which do not modify the content, are secondary. An added bonus would be if this solution allowed to update wiki content while offline and push it back to the wiki when online.
Google Gears looks like a good candidate for trying to solve this, but other solutions are also welcome.
An interesting property of MoinMoin is that it keeps content in regular files instead of the database. This can make it easier to port wiki content from one location to another, but I don't know if that can play any role in answering this question.
[1]: http://moinmo.in | 0 | [
2,
168,
1143,
1381,
20,
1873,
108,
1293,
108,
13,
17375,
568,
8144,
4256,
18,
800,
3726,
3726,
184,
20,
3547,
168,
1143,
1381,
18548,
20,
636,
1293,
108,
1293,
108,
13,
17375,
500,
2558,
165,
500,
60,
28,
21,
5187,
15,
31,
83,
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... |
select top 10 records for each category.
===
I want to return top 10 records from each section in the one query. Can anyone help how to do it. Section is one of the column in the table.
| 0 | [
2,
5407,
371,
332,
742,
26,
206,
3230,
9,
800,
3726,
3726,
31,
259,
20,
788,
371,
332,
742,
37,
206,
1050,
19,
14,
53,
25597,
9,
92,
1276,
448,
184,
20,
107,
32,
9,
1050,
25,
53,
16,
14,
4698,
19,
14,
859,
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... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
GCC Inline Assembler- How to "BSWAP" the lower 32-bit of 64-bit register???
===
I've been looking for the answer 'how to use 'BSWAP' for lower 32-bit sub-register of 64-bit register.' For example, "0x0123456789abcdef" is inside RAX register, and I want to change it to **"0x01234567efcdab89"** with a single instruction. (because of performance) So I tried following inline function:
#define BSWAP(T) { \
__asm__ __volatile__ ( \
"bswap %k0" \
: "=q" (T) \
: "q" (T)); \
}
And the result was **"0x00000000efcdab89"**. TT-TT I, actually, don't understand why the compiler acts like this. Does anybody know the efficient solution???
- A Korean boy, who haven't slept for 2 days to solve this problem. =_= | 0 | [
2,
489,
3384,
19,
1143,
13,
13736,
139,
8,
184,
20,
13,
7,
4562,
1608,
306,
7,
14,
987,
2512,
8,
3326,
16,
4384,
8,
3326,
2243,
60,
60,
60,
800,
3726,
3726,
31,
22,
195,
74,
699,
26,
14,
1623,
13,
22,
1544,
20,
275,
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... |
Do you use NULL or 0 (zero) for pointers in C++?
===
In the early days of C++ when it was bolted on top of C, you could not use NULL as it was defined as (void\*)0. You could not assign NULL to any pointer other than void\*, which made it kind of useless. Back in those days, it was accepted that you used 0 (zero) for null pointers.
To this day, I have continued to use zero as a null pointer but those around me insist on using NULL. I personally do not see any benefit to giving a name (NULL) to an existing value - and since I also like to test pointers as truth values:
if (p && !q)
do_something();
then using zero makes more sense (as in if you use NULL, you cannot logically use p && !q - you need to explicitly compare against NULL, unless you assume NULL is zero, in which case why use NULL).
Is there any objective reason to prefer zero over NULL (or vice versa), or is all just personal preference? | 0 | [
2,
107,
42,
275,
16203,
54,
713,
13,
5,
15938,
6,
26,
454,
445,
19,
272,
20512,
60,
800,
3726,
3726,
19,
14,
274,
509,
16,
272,
20512,
76,
32,
23,
21601,
27,
371,
16,
272,
15,
42,
110,
52,
275,
16203,
28,
32,
23,
2811,
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... |
Visual C++ Redistributables without using VCRedist_x86.exe
===
I'm developing in an environment that is severely constrained, but the developers also have tight control over.
VCRedist_x86.exe - A 4Mb redistributable - is no fun (four hours to transfer). I'd really prefer to just redistribute MFC90.dll, msvcm90.dll, msvcp90.dll and msvcr90.dll - that's more like 2Mb. However, [Redistributing Visual C++ Files][1] says:
>It is not supported to redistribute C/C++ applications that are built without a manifest. Visual C++ libraries cannot be used by C/C++ applications without a manifest binding the application to these libraries. For more information, see [Choosing a Deployment Method][2].
My original plan of copying the DLLs into the program's working directory doesn't seem to
work in this brave new world of manifests.
My next guess is to bodge up the registry entries required to populate the files into the WinSxS directory and populate it myself (rather than using the 4 meg program).
**How can I sucessfully distribute the necessary files but keep the overhead down?**
[1]: http://msdn.microsoft.com/en-us/library/ms235299.aspx
[2]: http://msdn.microsoft.com/en-us/library/ms235316.aspx | 0 | [
2,
3458,
272,
20512,
402,
403,
13202,
5924,
18,
366,
568,
13,
8990,
2095,
702,
1,
396,
3274,
9,
1706,
62,
800,
3726,
3726,
31,
22,
79,
3561,
19,
40,
2307,
30,
25,
8953,
28751,
15,
47,
14,
10168,
67,
57,
2618,
569,
84,
9,
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... |
What is the most important feature in Mono 2.0?
===
[Mono 2.0 was just officially released][1]. What single feature do you think is the most important?
[1]: http://www.mono-project.com/Main_Page | 0 | [
2,
98,
25,
14,
127,
681,
1580,
19,
4129,
172,
9,
387,
60,
800,
3726,
3726,
636,
20027,
172,
9,
387,
23,
114,
2320,
261,
500,
2558,
165,
500,
9,
98,
345,
1580,
107,
42,
277,
25,
14,
127,
681,
60,
636,
165,
500,
45,
7775,
6903... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
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... |
C++ Convert SQLVARCHAR to string
===
I need to convert from a SQLVARCHAR to a string data type
***variable definitions as follows:***
string strFirstName;
SQLVARCHAR rtnFirstName[50];
***Want to be able to accomplish the following:***
if (strFirstName.empty()) strFirstName = rtnFirstName;
***Gives an error that the binary '=': no operator found which takes a right-hand operand of typ 'SQLVARCHAR[50]' (or there is no acceptable conversion)*** | 0 | [
2,
272,
20512,
8406,
4444,
255,
3311,
5433,
20,
3724,
800,
3726,
3726,
31,
376,
20,
8406,
37,
21,
4444,
255,
3311,
5433,
20,
21,
3724,
1054,
1001,
8980,
8220,
579,
18544,
28,
2415,
45,
2483,
1409,
3724,
13,
9729,
3552,
7259,
73,
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... |
C# boxing question
===
First, two examples:
// This works
int foo = 43;
long lFoo = foo;
// This doesn't
object foo = (int)43;
long? nullFoo = foo as long?; // returns null
long lFoo = (long)foo; // throws InvalidCastException
if (foo.GetType() == typeof(int))
Console.WriteLine("But foo is an int..."); // This gets written out
Now, my guess as to why the second doesn't work is because of boxing. The purpose behind this code is to implement `IComparable`. I need some way to coerce an object into either a long or a ulong as appropriate, or if it's neither, than to throw an error. I don't want to have to implement checks for each basic numeric type (byte, int, long, ubyte, ...) I'd rather just catch them in the largest numeric type and deal with it that way. Thoughts from all the smart people here? How can I unbox the object, preferably avoiding reflection, but I suppose if that's the only way... Or should I just not implement the non-generics version of `IComparable`? | 0 | [
2,
272,
5910,
8131,
1301,
800,
3726,
3726,
64,
15,
81,
3770,
45,
12894,
48,
693,
19,
38,
4310,
111,
800,
5016,
73,
175,
13,
9641,
4328,
800,
4310,
111,
73,
12894,
48,
1437,
22,
38,
3095,
4310,
111,
800,
13,
5,
6391,
6,
4644,
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... |
php cURL iis 6.0 windows server 2003
===
having issue setting up cURL with iis 6.0, windows server 2003, php 5.2.6
have installed to C:\PHP
set PHPRC = C:\PHP\php.ini
copied ssleay32.dll andlibeay32.dll to C:\PHP
in php.ini, uncommented the line
extension=php_curl.dll
still getting
"Fatal error: Call to undefined function curl_init()" | 0 | [
2,
13,
26120,
14320,
595,
18,
400,
9,
387,
1936,
8128,
973,
800,
3726,
3726,
452,
1513,
2697,
71,
14320,
29,
595,
18,
400,
9,
387,
15,
1936,
8128,
973,
15,
13,
26120,
331,
9,
135,
9,
379,
57,
4066,
20,
272,
45,
1,
26120,
309,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
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... |
Are there any better geolocation databases / technologies / services or has anyone done any work with improving the accuracy of existing systems?
===
I am working on integrating geolocation services into a website and the best source of data I've found so far is MaxMind's GeoIP API with GeoLite City data. Even this data seems to often be questionable though. For example, I am located in downtown Palo Alto, but it locates my IP as being in Portola Valley, which is about 7 miles away. Palo Alto has a population of 60k+, whereas Portola Valley has a population of less than 5k. I would think if you see an IP originating somewhere around there it would make more sense to assume it was coming from the highly populated city, not the tiny one. I've also had it locate Palo Alto IPs completely across the country in Kentucky, etc.
Does anyone know of any better sources of data, or any tools/technologies/efforts to improve the accuracy of geolocation efforts? Commercial solutions are fine. | 0 | [
2,
50,
80,
186,
574,
6389,
19032,
6018,
18,
13,
118,
5740,
13,
118,
687,
54,
63,
1276,
677,
186,
170,
29,
9273,
14,
11270,
16,
3149,
1242,
60,
800,
3726,
3726,
31,
589,
638,
27,
24529,
6389,
19032,
687,
77,
21,
2271,
17,
14,
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... |
Is there a practical limit to the size of bit masks?
===
There's a common way to store multiple values in one variable, by using a bitmask. For example, if a user has read, write and execute privileges on an item, that can be converted to a single number by saying `read = 4 (2^2), write = 2 (2^1), execute = 1 (2^0)` and then add them together to get 7.
I use this technique in several web applications, where I'd usually store the variable into a field and give it a type of MEDIUMINT or whatever, depending on the number of different values.
What I'm interested in, is whether or not there is a practical limit to the number of values you can store like this? For example, if the number was over 64, you couldn't use (64 bit) integers any more. If this was the case, what would you use? How would it affect your program logic (ie: could you still use bitwise comparisons)?
*I know that once you start getting really large sets of values, a different method would be the optimal solution, but I'm interested in the boundaries of **this** method.* | 0 | [
2,
25,
80,
21,
5713,
4496,
20,
14,
1072,
16,
1142,
18992,
60,
800,
3726,
3726,
80,
22,
18,
21,
757,
161,
20,
1718,
1886,
4070,
19,
53,
7612,
15,
34,
568,
21,
1142,
23265,
9,
26,
823,
15,
100,
21,
4155,
63,
1302,
15,
2757,
17... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
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... |
TCustomDataSet C++ Builder
===
I'm looking for an example of a TCustomDataSet implementation in C++ beyond the TTextDataset example that ships as an example project within C++ Builder.
The TTextDataset is hard to learn from because the code is not documented very well and it only shows a single field example.
I've created my own class that descends TDataSet and it mostly works however, the GUI controls (grids mostly) don't work 100% for certain use cases.
Anyone have some good links on this topic...
Here is a link to the example code I used to study from:
http://195.19.138.139:3000/p/SOFTWARE/temp/CBuilder5/Examples/DBTasks/TextData/textdataset.cpp
| 0 | [
2,
13,
38,
4636,
6015,
18768,
3554,
272,
20512,
14960,
800,
3726,
3726,
31,
22,
79,
699,
26,
40,
823,
16,
21,
13,
38,
4636,
6015,
18768,
3554,
6123,
19,
272,
20512,
1701,
14,
13,
38,
11969,
18768,
3554,
823,
30,
2034,
28,
40,
82... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
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 change the index page for rails?
===
I know that to change the index page for rails I need to do three things: delete the index.html, do something with routes.rb, and probably make an action that the route will point to. It's the details that I am a little fuzzy on :-) | 0 | [
2,
184,
107,
31,
753,
14,
4348,
2478,
26,
2240,
18,
60,
800,
3726,
3726,
31,
143,
30,
20,
753,
14,
4348,
2478,
26,
2240,
18,
31,
376,
20,
107,
132,
564,
45,
27448,
14,
4348,
9,
15895,
15,
107,
301,
29,
5050,
9,
7549,
15,
17,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
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 tie a dropdown list to a gridview in Sharepoint 2007?
===
This should be a really really simple thing, but for some reason it is just eluding me.
I want a Sharepoint page which will have a drop down list that is tied to a database lookup table.
When an item is selected and they click a GO button, I want it to update a gridview that is also on the page.
I'm looking for a simple how to - while assuming I'm a sharepoint idiot. BTW, I am using the Microsoft Office Sharepoint Designer.
Thanks, | 0 | [
2,
184,
20,
3795,
21,
2804,
2968,
968,
20,
21,
7354,
4725,
19,
1891,
3132,
624,
60,
800,
3726,
3726,
48,
378,
44,
21,
510,
510,
1935,
584,
15,
47,
26,
109,
1215,
32,
25,
114,
931,
3192,
68,
55,
9,
31,
259,
21,
1891,
3132,
24... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
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... |
Ruby and duck typing: design by contract impossible?
===
Method signature in Java:
public List<String> getFilesIn(List<File> directories)
similar one in ruby
def get_files_in(directories)
In the case of Java, the type system gives me information about what the method expects and delivers. In Ruby's case, I have **no** clue what I'm supposed to pass in, or what I'll expect to receive.
In Java, the object must formally implement the interface. In Ruby, the object being passed in must respond to whatever methods are called in the method defined here.
This seems highly problematic:
1. Even with 100% accurate, up-to-date documentation, the Ruby code has to essentially expose its implementation, breaking encapsulation. "OO puritiy" aside, this would seem to be a maintenance nightmare.
1. The Ruby code gives me **no** clue what's being returned; I would have to essentially experiment, or read the code to find out what methods the returned object would respond to.
Not looking to debate static typing vs duck typing, but looking to understand how you maintain a production system where you have almost no ability to design by contact. | 0 | [
2,
10811,
17,
7026,
25266,
45,
704,
34,
1305,
3992,
60,
800,
3726,
3726,
2109,
7810,
19,
8247,
45,
317,
968,
1,
11130,
1,
164,
16877,
18,
108,
5,
5739,
1,
16877,
1,
559,
1596,
6,
835,
53,
19,
10811,
6312,
164,
1,
16877,
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... |
Object database for Ruby on Rails
===
Is there drop-in replacement for ActiveRecord that uses some sort of Object Store?
I am thinking something like Erlang's MNesia would be ideal. | 0 | [
2,
3095,
6018,
26,
10811,
27,
2240,
18,
800,
3726,
3726,
25,
80,
2804,
8,
108,
4610,
26,
1348,
14953,
30,
2027,
109,
2058,
16,
3095,
1718,
60,
31,
589,
1440,
301,
101,
13,
106,
9949,
22,
18,
307,
2696,
549,
83,
44,
5628,
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... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
[C++] UTF-8 to ASCII using ICU Library
===
I have a std::string with UTF-8 characters in it.
I want to convert the string to its closest equivalent with ASCII characters.
For example:
Łódź => Lodz
Assunção => Assuncao
Schloß => Schloss
Unfortunatly ICU library is realy unintuitive and I haven't found good documentation on its usage, so it would take me too much time to learn to use it. Time I dont have.
Could someone give a little example about how can this be done??
thanks. | 0 | [
2,
636,
150,
20512,
500,
287,
11720,
8,
457,
20,
28,
1892,
49,
568,
13,
22722,
1248,
800,
3726,
3726,
31,
57,
21,
354,
43,
45,
45,
11130,
29,
287,
11720,
8,
457,
1766,
19,
32,
9,
31,
259,
20,
8406,
14,
3724,
20,
82,
6993,
46... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
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... |
Algorithm to determine if array contains n...n+m?
===
I saw this question on Reddit, and there were no positive solutions presented, and I thought it would be a perfect question to ask here. This was in a thread about interview questions:
> Write a method that takes an int array of size n, and returns (True/False) if the array consists of the numbers n...n+1, all numbers in that range and only numbers in that range. The array is not guaranteed to be sorted. (For instance, {2,3,1} would return true. {1,3,1} would return false, {1,2,4} would return false.
> The problem I had with this one is that my interviewer kept asking me to optimize (faster O(n), less memory, etc), to the point where he claimed you could do it in one pass of the array using a constant amount of memory. Never figured that one out.
Along with your solutions please indicate if they assume that the array contains unique items. | 0 | [
2,
9083,
20,
3746,
100,
7718,
1588,
13,
103,
9,
9,
9,
103,
2430,
79,
60,
800,
3726,
3726,
31,
441,
48,
1301,
27,
402,
43,
242,
15,
17,
80,
46,
90,
2221,
6776,
1831,
15,
17,
31,
289,
32,
83,
44,
21,
2107,
1301,
20,
1349,
23... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
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 someone give a good tutorial on WWF?
===
In particular, I am interested in:
1) Getting up a _free_ environment setup to do workflows.
2) How to use existing workflow items/states and what is involved in that.
Thanks! | 0 | [
2,
92,
737,
590,
21,
254,
29724,
27,
20844,
60,
800,
3726,
3726,
19,
1498,
15,
31,
589,
3158,
19,
45,
137,
6,
1017,
71,
21,
13,
1,
4639,
1,
2307,
18161,
20,
107,
170,
9990,
18,
9,
172,
6,
184,
20,
275,
3149,
170,
9990,
3755,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
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,
0,
0,
0,
0... |
Speeding Up Perl
===
This is really two questions, but they are so similar, and to keep it simple, I figured I'd just roll them together:
- **Firstly**: Given an established perl project, what are some decent ways to speed it up beyond just plain in-code optimization?
- **Secondly**: When writing a program from scratch in perl, what are some good ways to greatly improve performance?
For the first question, imagine you are handed a decently written project and you need to improve performance, but you can't seem to get much of a gain through refactoring/optimization. What would you do to speed it up in this case short of rewriting it in something like C?
**Please stay away from general optimization techniques unless they are _perl specific_.**
I asked this about [Python](http://stackoverflow.com/questions/172720/speeding-up-python) earlier, and I figured it might be good to do it for other languages (I'm especially curious if there are corollaries to [psycho](http://psyco.sourceforge.net/) and [pyrex](http://www.cosc.canterbury.ac.nz/greg.ewing/python/Pyrex/) for Perl). | 0 | [
2,
1362,
68,
71,
416,
255,
800,
3726,
3726,
48,
25,
510,
81,
2346,
15,
47,
59,
50,
86,
835,
15,
17,
20,
643,
32,
1935,
15,
31,
5700,
31,
22,
43,
114,
3001,
105,
429,
45,
13,
8,
13,
1409,
3552,
102,
1409,
45,
504,
40,
613,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
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... |
Overriding DataGridViewTextBoxCell Paint Method
===
I am trying to override the DataGridViewTextBoxCell's paint method in a derived class so that I can indent the foreground text by some variable amount of pixels. I would like it if the width of the column adjusts so that its total width is the length of my cells text plus the "buffer" indent. Does anyone know of a way to accomplish this? My lame implementation is listed below:
public class MyTextBoxCell : DataGridViewTextBoxCell{ ....
protected override void Paint(Graphics graphics, Rectangle clipBounds, Rectangle cellBounds, int rowIndex, DataGridViewElementStates cellState, object value, object formattedValue, string errorText, DataGridViewCellStyle cellStyle, DataGridViewAdvancedBorderStyle advancedBorderStyle, DataGridViewPaintParts paintParts) {
clipBounds.Inflate(100, 0);
DataGridViewPaintParts pp = DataGridViewPaintParts.Background | DataGridViewPaintParts.Border | DataGridViewPaintParts.ContentBackground
| DataGridViewPaintParts.ErrorIcon;
base.Paint(graphics, clipBounds, cellBounds, rowIndex, cellState, value, formattedValue, errorText, cellStyle, advancedBorderStyle, pp);
string text = formattedValue as string;
//My lame attempt to indent 20 pixels??
TextRenderer.DrawText(graphics, text, cellStyle.Font, new Point(cellBounds.Location.X + 20, cellBounds.Location.Y), cellStyle.SelectionForeColor ,TextFormatFlags.EndEllipsis);
}
}
| 0 | [
2,
84,
5175,
68,
1054,
16375,
4725,
11969,
5309,
9725,
5107,
2109,
800,
3726,
3726,
31,
589,
749,
20,
84,
11891,
14,
1054,
16375,
4725,
11969,
5309,
9725,
22,
18,
5107,
2109,
19,
21,
3981,
718,
86,
30,
31,
92,
19,
817,
38,
14,
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... |
Storing Crystal Reports in XML files?
===
I was talking to somebody a recently who mentioned it was possible to store reports created using Crystal Reports as XML files.
Upon Googling this, I can't find anything suggesting that this is the case (using <I>data</i> stored in XML in a report, yes, but actually storing the report, the part stored by default as a .rpt file, no.
Am I correct in assuming that there was in fact some sort of misunderstanding between us and it in fact not possible to do this? | 0 | [
2,
25615,
4282,
2813,
19,
23504,
6488,
60,
800,
3726,
3726,
31,
23,
1582,
20,
8861,
21,
1989,
72,
2211,
32,
23,
938,
20,
1718,
2813,
679,
568,
4282,
2813,
28,
23504,
6488,
9,
685,
162,
5598,
802,
48,
15,
31,
92,
22,
38,
477,
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... |
Design Pattern for implementing plugins in your application?
===
What is the standard way for allowing and implementing a plugin system for your application?
In my last application I made a simple interface for all plugins that they must implement. I then load all assemblies in the apps directory and toss out any that don't implement that interface.
One of the methods in the interface is a DoWork() method that periodically gets called on all loaded assemblies to perform any actions the plugins may have.
What is the "proper" way to do a plugin system? Do you just create an Interface for plugins? Should you periodically call a particular method in all plugins? Is there a more sophisticated way? | 0 | [
2,
704,
3732,
26,
17333,
10922,
108,
18,
19,
154,
3010,
60,
800,
3726,
3726,
98,
25,
14,
1236,
161,
26,
2719,
17,
17333,
21,
10922,
108,
329,
26,
154,
3010,
60,
19,
51,
236,
3010,
31,
117,
21,
1935,
6573,
26,
65,
10922,
108,
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 do I get the list of open file handles by process in C#?
===
How do I get the list of open file handles by process id in C#?
I'm interested in digging down and getting the file names as well.
Looking for the programmatic equivalent of what process explorer does.
Most likely this will require interop. | 0 | [
2,
184,
107,
31,
164,
14,
968,
16,
368,
3893,
3053,
18,
34,
953,
19,
272,
5910,
60,
800,
3726,
3726,
184,
107,
31,
164,
14,
968,
16,
368,
3893,
3053,
18,
34,
953,
4924,
19,
272,
5910,
60,
31,
22,
79,
3158,
19,
11004,
125,
17... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
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... |
Creating an instance from a class name
===
I'm trying to create an instance of a class at run time. The classes I'm trying to create all inherit from a base class, ConfigMgrObj, and are named `ConfigMgr_xxxxxx` e.g. `ConfigMgr_Collection`. They all take a special object that I'm calling oController and a string as arguments.
This is the line I'm using to do it, where ClassToGet is a string that contains the name of the class e.g. `ConfigMgr_Collection`.
object oNewObject = System.Activator.CreateInstance(null, "StackOverflowNamespace." + ClassToGet, new object[] { oController, ClassToGet });
This throws a TypeLoadException exception. What's up with it? | 0 | [
2,
2936,
40,
4851,
37,
21,
718,
204,
800,
3726,
3726,
31,
22,
79,
749,
20,
1600,
40,
4851,
16,
21,
718,
35,
485,
85,
9,
14,
2684,
31,
22,
79,
749,
20,
1600,
65,
17569,
37,
21,
1000,
718,
15,
1065,
1707,
14020,
7944,
11741,
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... |
Skipping the 'CompressResources' build step for XCode iPhone apps
===
Is it possible to set an iPhone XCode project to skip the 'CompressResources' build step?
Specifically, I want to skip the stage where it runs pngcrush on all of my .png files, many of which don't survive the experience in a form which my app can read.
| 0 | [
2,
27225,
14,
13,
22,
960,
5890,
99,
12097,
18,
22,
1895,
1424,
26,
993,
9375,
21024,
4865,
18,
800,
3726,
3726,
25,
32,
938,
20,
309,
40,
21024,
993,
9375,
669,
20,
12532,
14,
13,
22,
960,
5890,
99,
12097,
18,
22,
1895,
1424,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
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 most efficient way to get the first item from an associative array in JavaScript?
===
I need to get just the first item (actually, just the first key) off a rather large associative array in JavaScript. Here's how I'm doing it currently (using jQuery):
getKey = function (data) {
var firstKey;
$.each(data, function (key, val) {
firstKey = key;
return false;
});
return firstKey;
};
Just guessing, but I'd say there's got to be a better (read: more efficient) way of doing this. Any suggestions? | 0 | [
2,
98,
25,
14,
127,
8243,
161,
20,
164,
14,
64,
9101,
37,
40,
28,
18,
16325,
3366,
7718,
19,
8247,
8741,
60,
800,
3726,
3726,
31,
376,
20,
164,
114,
14,
64,
9101,
13,
5,
15661,
15,
114,
14,
64,
1246,
6,
168,
21,
864,
370,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
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 run an outside executable after a solution is built in Visual Studio 2008?
===
I'm not talking about a post build event for a project. Rather, I want to run an executable automatically after the entire solution is built. Is there a way to do a post build event for the solution? | 0 | [
2,
25,
80,
21,
161,
20,
485,
40,
719,
1396,
17194,
5924,
75,
21,
4295,
25,
392,
19,
3458,
1120,
570,
60,
800,
3726,
3726,
31,
22,
79,
52,
1582,
88,
21,
678,
1895,
807,
26,
21,
669,
9,
864,
15,
31,
259,
20,
485,
40,
1396,
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 implement a single instance of application on running by java?
===
Sometime I see many application such as msn, windows media player and etc.
are single instance application (when user execute while application is running
new application instance will not created).
In C#, I use `Mutext` class for implement this but I don't know what method in java
language.
| 0 | [
2,
184,
20,
8713,
21,
345,
4851,
16,
3010,
27,
946,
34,
8247,
60,
800,
3726,
3726,
8530,
31,
196,
151,
3010,
145,
28,
4235,
103,
15,
1936,
941,
517,
17,
2722,
9,
50,
345,
4851,
3010,
13,
5,
3185,
4155,
15644,
133,
3010,
25,
94... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
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... |
Interview Questions on Socket Programming and Multi-Threading
===
Please anybody can tell me the questions, that can be asked in an interview for below topics
- Socket Programming
- Multi-Threading
An advance thanks goes to everybody who provide their time
| 0 | [
2,
2421,
2346,
27,
18482,
3143,
17,
1889,
8,
96,
22883,
800,
3726,
3726,
2247,
11181,
92,
494,
55,
14,
2346,
15,
30,
92,
44,
411,
19,
40,
2421,
26,
1021,
7569,
13,
8,
18482,
3143,
13,
8,
1889,
8,
96,
22883,
40,
3612,
3669,
185... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
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,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
Process and Thread
===
What is the data that Process and Thread will not share ?
An advance thanks goes to everybody who provide their time | 0 | [
2,
953,
17,
9322,
800,
3726,
3726,
98,
25,
14,
1054,
30,
953,
17,
9322,
129,
52,
1891,
13,
60,
40,
3612,
3669,
1852,
20,
8903,
72,
1181,
66,
85,
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,
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... |
What's a good C memory allocator for embedded systems?
===
I have an single threaded, embedded application that allocates and deallocates lots and lots of small blocks (32-64b). The perfect scenario for a cache based allocator. And although I could TRY to write one it'll likely be a waste of time, and not as well tested and tuned as some solution that's already been on the front lines.
So what would be the best allocator I could use for this scenario?
Note: I'm using a Lua Virtual Machine in the system (which is the culprit of 80+% of the allocations), so I can't trivially refactor my code to use stack allocations to increase allocation performance. | 0 | [
2,
98,
22,
18,
21,
254,
272,
1912,
65,
2499,
3457,
26,
12138,
1242,
60,
800,
3726,
3726,
31,
57,
40,
345,
9322,
69,
15,
12138,
3010,
30,
65,
2499,
7759,
17,
1183,
10799,
7759,
7503,
17,
7503,
16,
284,
5198,
13,
5,
3125,
8,
347... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
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 find out the installed version of the iPhone SDK?
===
What is the easiest way of finding out what version of the iPhone SDK is installed on my OS X?
When you log into the Apple's iPhone Developer Center, you can see the build number of the current available version of the SDK, but you have to remember if you have already downloaded that version or not.
What is the easiest way of staying current? | 0 | [
2,
98,
22,
18,
14,
246,
161,
20,
477,
70,
14,
4066,
615,
16,
14,
21024,
13,
18,
43,
197,
60,
800,
3726,
3726,
98,
25,
14,
27237,
161,
16,
3007,
70,
98,
615,
16,
14,
21024,
13,
18,
43,
197,
25,
4066,
27,
51,
13,
759,
993,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
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 use a function-based index on a column that contains NULLs in Oracle 10+?
===
Lets just say you have a table in Oracle:
CREATE TABLE person (
id NUMBER PRIMARY KEY,
given_names VARCHAR2(50),
surname VARCHAR2(50)
);
with these function-based indices:
CREATE INDEX idx_person_upper_given_names ON person (UPPER(given_names));
CREATE INDEX idx_person_upper_given_names ON person (UPPER(given_names));
Now, given_names has no NULL values but for argument's sake last_name does. If I do this:
SELECT * FROM person WHERE UPPER(given_names) LIKE 'P%'
the explain plan tells me its using the index but change it to:
SELECT * FROM person WHERE UPPER(last_name) LIKE 'P%'
it doesn't. The Oracle docs say that to use the function-based index will only be used when several conditions are met, one of which is ensuring there are no NULL values since they aren't indexed.
I've tried these queries:
SELECT * FROM person WHERE UPPER(last_name) LIKE 'P%' AND UPPER(last_name) IS NOT NULL
and
SELECT * FROM person WHERE UPPER(last_name) LIKE 'P%' AND last_name IS NOT NULL
In the latter case I even added an index on last_name but no matter what I try it uses a full table scan. Assuming I can't get rid of the NULL values, how do I get this query to use the index on UPPER(last_name)?
| 0 | [
2,
184,
20,
275,
21,
1990,
8,
1281,
4348,
27,
21,
4698,
30,
1588,
16203,
18,
19,
15759,
332,
2430,
60,
800,
3726,
3726,
6884,
114,
395,
42,
57,
21,
859,
19,
15759,
45,
1600,
859,
840,
13,
5,
4924,
234,
1256,
1246,
15,
504,
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 do you store themes in the database?
===
I know how to load themes dynamically when they are stored locally. Is it possible to store theses themes in the database yet still apply them programmatically as described in referenced MSDN article?
Also - If you do store them in the filesystem, is it possible to change the path of the App_Themes directory to a different location? Like Amazon S3?
[Apply Themes Programattically][1]
[1]: http://msdn.microsoft.com/en-us/library/tx35bd89.aspx | 0 | [
2,
184,
107,
42,
1718,
6876,
19,
14,
6018,
60,
800,
3726,
3726,
31,
143,
184,
20,
6305,
6876,
7782,
1326,
76,
59,
50,
8214,
6680,
9,
25,
32,
938,
20,
1718,
158,
18,
6876,
19,
14,
6018,
768,
174,
5645,
105,
625,
6732,
1326,
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... |
The encoding 'UTF-8' is not supported by the Java runtime.
===
Whenever I start several of my java applications I see the following message output on the console (usually under linux):
Warning: The encoding 'UTF-8' is not supported by the Java runtime.
If java supports unicode and UTF-8, what causes this message? I've yet to find any reference, or answer to this anywhere else. | 0 | [
2,
14,
19608,
13,
22,
1982,
410,
8,
457,
22,
25,
52,
1827,
34,
14,
8247,
485,
891,
9,
800,
3726,
3726,
6634,
31,
799,
238,
16,
51,
8247,
3767,
31,
196,
14,
249,
2802,
5196,
27,
14,
8650,
13,
5,
13075,
131,
13024,
6,
45,
3590... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
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... |
Sun Java System Portal Server
===
How can we make a web-src for Access Manager customizations and a par-src for portal server customizations?Are there concrete steps to do this?
Thanks & Regards,
Vivek | 0 | [
2,
939,
8247,
329,
8281,
8128,
800,
3726,
3726,
184,
92,
95,
233,
21,
2741,
8,
18,
5453,
26,
1381,
1382,
5816,
1829,
18,
17,
21,
2017,
8,
18,
5453,
26,
8281,
8128,
5816,
1829,
18,
60,
1509,
80,
4105,
2382,
20,
107,
48,
60,
366... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
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,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
Asp.Net MVC: Is there support for controller level filter attributes?
===
I have a filter attribute that I'd like to be applied to every action on my controller. Is there a built in mechanism to support this? Right now, I'm manually adding the filter to each action, but that's error prone and tedious. If there isn't support for controller level filter attributes, is there a better way to perform the logic? | 0 | [
2,
28,
306,
9,
2328,
307,
8990,
45,
25,
80,
555,
26,
9919,
662,
11945,
13422,
60,
800,
3726,
3726,
31,
57,
21,
11945,
35,
14755,
30,
31,
22,
43,
101,
20,
44,
2435,
20,
352,
1028,
27,
51,
9919,
9,
25,
80,
21,
392,
19,
6534,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
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 are Array.Sort() and Array.IndexOf() methods static?
===
Always was interested why are [Array.Sort()][1] and [Array.IndexOf()][2] methods made static and similar [ArrayList.Sort()][3] and [ArrayList.IndexOf()][4] are designed as member methods. Thank you for any ideas.
[1]: http://msdn.microsoft.com/en-us/library/system.array.sort.aspx
[2]: http://msdn.microsoft.com/en-us/library/system.array.indexof.aspx
[3]: http://msdn.microsoft.com/en-us/library/system.collections.arraylist.sort.aspx
[4]: http://msdn.microsoft.com/en-us/library/system.collections.arraylist.indexof.aspx | 0 | [
2,
483,
50,
7718,
9,
22843,
5,
6,
17,
7718,
9,
25671,
1041,
5,
6,
3195,
12038,
60,
800,
3726,
3726,
550,
23,
3158,
483,
50,
636,
8576,
93,
9,
22843,
5,
6,
500,
2558,
165,
500,
17,
636,
8576,
93,
9,
25671,
1041,
5,
6,
500,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
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... |
Any viewstate implementation for JSP-Servlet app !
===
Do you know any implementation / technique which would provide similar behavior as Viewstate provides in ASP.NET. (Serializing the data into hidden field within the HTML form).
I am using only JSP, Servlet, and Spring MVC.
| 0 | [
2,
186,
1418,
3859,
6123,
26,
487,
3401,
8,
10321,
1336,
4865,
13,
187,
800,
3726,
3726,
107,
42,
143,
186,
6123,
13,
118,
4873,
56,
83,
1181,
835,
3257,
28,
1418,
3859,
1927,
19,
28,
306,
9,
2328,
9,
13,
5,
4104,
2815,
3335,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
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... |
Roulette Selection in Genetic Algorithms
===
Can anyone provide some pseudo code for a roulette selection function? How would I implement this:
![alt text][1]
I don't really understand how to read this math notation. I never took any probability or statistics.
[1]: http://upload.wikimedia.org/math/0/d/2/0d24a82d8e813380f670bf80ae74486b.png | 0 | [
2,
8341,
15030,
3155,
19,
6211,
15935,
800,
3726,
3726,
92,
1276,
1181,
109,
8452,
1797,
26,
21,
8341,
15030,
3155,
1990,
60,
184,
83,
31,
8713,
48,
45,
13,
187,
2558,
192,
38,
1854,
500,
2558,
165,
500,
31,
221,
22,
38,
510,
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... |
SQL Absolute value across columns
===
I have a table that looks something like this:
<pre>
word big expensive smart fast
dog 9 -10 -20 4
professor 2 4 40 -7
ferrari 7 50 0 48
alaska 10 0 1 0
gnat -3 0 0 0
</pre>
The + and - values are associated with the word, so professor is smart and dog is not smart. Alaska is big, as a proportion of the total value associated with its entries, and the opposite is true of gnat.
Is there a good way to get the absolute value of the number farthest from zero, and some token whether absolute value =/= value? Relatedly, how might I calculate whether the results for a given value are proportionately large with respect to the other values? I would write something to format the output to the effect of: "dog: not smart, probably not expensive; professor smart; ferrari: fast, expensive; alaska: big; gnat: probably small." (The formatting is not a question, just an illustration, I am stuck on the underlying queries.)
Also, the rest of the program is python, so if there is any python solution with normal dbapi modules or a more abstract module, any help appreciated. | 0 | [
2,
4444,
255,
7070,
1923,
464,
7498,
800,
3726,
3726,
31,
57,
21,
859,
30,
1879,
301,
101,
48,
45,
13,
1,
3515,
1,
833,
580,
5381,
3978,
1512,
1952,
561,
13,
8,
1036,
13,
8,
1323,
268,
1032,
172,
268,
1417,
13,
8,
465,
14076,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
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... |
Alert boxes in Python?
===
Is it possible to produce an alert similar to JavaScript's alert("message") in python, with an application running as a daemon. | 0 | [
2,
7863,
8120,
19,
20059,
60,
800,
3726,
3726,
25,
32,
938,
20,
2213,
40,
7863,
835,
20,
8247,
8741,
22,
18,
7863,
5,
7,
3845,
18,
1303,
7,
6,
19,
20059,
15,
29,
40,
3010,
946,
28,
21,
13127,
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... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
What is the best ASP.NET WIKI out there?
===
Can anyone recommend a good asp.net wiki that is easily skinnable, has an API (auto upload initial wiki content) and scalable?
| 4 | [
2,
98,
25,
14,
246,
28,
306,
9,
2328,
13,
17375,
70,
80,
60,
800,
3726,
3726,
92,
1276,
12360,
21,
254,
28,
306,
9,
2328,
13,
17375,
30,
25,
2351,
1188,
103,
579,
15,
63,
40,
21,
2159,
13,
5,
18042,
71,
8294,
2104,
13,
17375... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
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,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
how to read the last row with SQL
===
What is the most efficient way to read the last row with SQL? The table is indexed on a unique key--the "bottom" key values represent the last row.
Thank you
rp | 0 | [
2,
184,
20,
1302,
14,
236,
3131,
29,
4444,
255,
800,
3726,
3726,
98,
25,
14,
127,
8243,
161,
20,
1302,
14,
236,
3131,
29,
4444,
255,
60,
14,
859,
25,
4348,
69,
27,
21,
2619,
1246,
8,
8,
124,
13,
7,
22389,
7,
1246,
4070,
3501... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
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,
0,
0,
0,
0,
0,
0,
0,
0... |
What are some of the major shifts in thinking required to become a good RIA developer?
===
I've been developing web apps for over a decade now, all the way from CGI to ASP.Net and Struts/Spring/Hibernate (not that that is the latest and greatest). I love the web and web development, but recently, a few things have happened that make me ask the above question:
1. I've been experimenting with [Adobe Flex][1].
2. I've been thinking and reading more and more about [SOFEA][2] and [SOUI][3].
3. Related developments such as Google [Chrome][4] and [Gears][5] (remember [Netscape's promise][6]?), as well as [WPF][7] and [Silverlight][8].
All of this leads me to believe that we're starting to come full-circle after a 15-year distraction kicked-off by the invention of the web. Over this period of time, we've been so fascinated by all the web has to offer that we didn't notice that the usability (and the developer experience) of web apps pretty much sucked in comparison to desktop apps. It seems we're now saying "Screw this! We love the web's benefits but we also want better usability, offline capabilities, and better integration with the desktop!". All of the above mentioned developments seem to be moving us in this direction. Don't get me wrong, I don't think Web 1.0 MVC-based frameworks are going away anytime soon, but I do think things like Flex and WPF are going to be a lot more wide-spread. This means all of us web app developers will have to become more familiar with fat (rich) client development (a.k.a "thin server" development).
I hate to follow this 50,000-foot view with such a relatively narrow question, but here we go. Being a long-time web developer, having recently played with Flex, I'm faced with difficulties that I last experienced when I dabbled in Java Swing development a long time ago. It mainly revolves around the **flow of control between my code and the framework's code**. Most things are asynchronous as to not freeze the UI. This leads to a completely different style of development compared to web apps built on Web 1.0 MVC-based frameworks that requires different thinking.
So, I'm looking for all the seasoned developers out there who have seen it all, as well as the Web 2.0 developers who have grown up with AJAX and Flex to part with some of their wisdom:
**For traditional web app developers, what are the major shifts in thinking required to become a great RIA developer?**
And here comes the pre-emtive clarification: I'm mostly interested in the effects of shifting ALL of the presentation logic from the (fat) server to the (fat) client. The web services aspect is also interesting, but only secondary to me (since I'm more familiar with it). However, feel free to comment on both.
Lastly, some slightly related buzzwords to round out the picture: [Amazon EC2/S3][9], [Google App Engine][10].
[1]: http://www.adobe.com/products/flex/
[2]: http://wisdomofganesh.blogspot.com/2007/11/sofea-and-soui-there-is-difference.html
[3]: http://www.appcelerant.com/mvc_is_dead.html
[4]: http://www.google.com/chrome
[5]: http://gears.google.com/
[6]: http://www.linuxjournal.com/content/gacl
[7]: http://en.wikipedia.org/wiki/Windows_Presentation_Foundation
[8]: http://en.wikipedia.org/wiki/Silverlight
[9]: http://aws.amazon.com/
[10]: http://code.google.com/appengine/ | 0 | [
2,
98,
50,
109,
16,
14,
394,
14162,
19,
1440,
1390,
20,
533,
21,
254,
13,
2548,
10058,
60,
800,
3726,
3726,
31,
22,
195,
74,
3561,
2741,
4865,
18,
26,
84,
21,
3953,
130,
15,
65,
14,
161,
37,
272,
2234,
20,
28,
306,
9,
2328,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
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 show SQL server 2000 server roles through an SQL query
===
what sql query will i need to show the activated server roles in a specific user? | 0 | [
2,
184,
20,
298,
4444,
255,
8128,
824,
8128,
2954,
120,
40,
4444,
255,
25597,
800,
3726,
3726,
98,
4444,
255,
25597,
129,
31,
376,
20,
298,
14,
9654,
8128,
2954,
19,
21,
1903,
4155,
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... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
What do you do about references when unloading a project in Visual Studio?
===
When you unload a project in Visual Studio, any referencing projects get warning triangles on their reference to the unloaded project. I've written myself a macro to do clever stuff (detect add/remove of project and transform any references from-to file/project dependency), but I can't believe that I'm not missing something much simpler. How can the unload function be any use if I have to go around manually changing references (and it breaks the 'personal solutions/shared projects' team development paradigm).
(This question is related to answers to [this question][1] about structuring large solutions in Visual Studio - some answers mentioned having solutions with lots of projects, but 'unloading' unused projects to improve performance.)
[1]: http://stackoverflow.com/questions/152053/structuring-projects-dependencies-of-large-winforms-applications-in-c | 0 | [
2,
98,
107,
42,
107,
88,
7231,
76,
367,
16866,
21,
669,
19,
3458,
1120,
60,
800,
3726,
3726,
76,
42,
367,
8294,
21,
669,
19,
3458,
1120,
15,
186,
13,
29254,
2314,
164,
3590,
8676,
18,
27,
66,
2801,
20,
14,
29248,
669,
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... |
Map-Navigation Project, How is road data generally stored/represented?
===
Navigation systems like the Garmin and TomTom have always fascinated me. I've wanted to implement small map/navigation applications to try out various pathing algorithms and expand on my knowledge of them.
This is a two part question:
**1.) How is Map data stored?** - When you have a network of roads, how is this data generally stored? What parts of the data are retained inorder to reproduce a map later? Is each road stored as a series of points where it changes direction? Does anyone have specifics on how map/road data is stored/represented it would be very helpful.
**2.) Navigation/Pathing** - When doing basic pathing on this map data (a la Garmin) is my assumption correct that it is converted to a directed graph? Is each road intersection a vertex with the edge weights the distance between vertexes? This is what I was thinking about doing so I could try some basic well known pathing algorithms and see what I get.
I've seen [this][1] publically available map data on the US but I'm not sure how it is represented and if it is detailed enough for me to be able to build my directed graph out of it.
If anyone has any information I would appreciate it. The more detailed knowledge you have the better.
[1]: http://www.bts.gov/publications/north_american_transportation_atlas_data/ | 0 | [
2,
2942,
8,
325,
13227,
857,
669,
15,
184,
25,
383,
1054,
1469,
8214,
118,
28628,
60,
800,
3726,
3726,
8368,
1242,
101,
14,
3126,
2160,
17,
2067,
6015,
57,
550,
17452,
55,
9,
31,
22,
195,
417,
20,
8713,
284,
2942,
118,
325,
1322... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
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... |
.NET - Find all references of property assignment
===
I am using VB.NET. In Visual Studio, if I right-click a property name and click "Find All References", it searches for all instances of the property being used.
However, a property is always used either for assignment (Set method) or retrieval (Get method). Is there any way of searching for only one of these uses? e.g. search for all uses of the property in code where it is being assigned a value, not when the value is being retrieved.
Thanks.
| 0 | [
2,
13,
9,
2328,
13,
8,
477,
65,
7231,
16,
1354,
8427,
800,
3726,
3726,
31,
589,
568,
13,
20468,
9,
2328,
9,
19,
3458,
1120,
15,
100,
31,
193,
8,
150,
10129,
21,
1354,
204,
17,
10840,
13,
7,
19811,
65,
7231,
7,
15,
32,
19994,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
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... |
Size of varchar columns
===
In sql server does it make a difference if I define a varchar column to be of length 32 or 128? | 0 | [
2,
1072,
16,
4033,
5433,
7498,
800,
3726,
3726,
19,
4444,
255,
8128,
630,
32,
233,
21,
2841,
100,
31,
9267,
21,
4033,
5433,
4698,
20,
44,
16,
1476,
2512,
54,
13218,
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... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
Hash of a string to be of specific length
===
Is there a way to generate a hash of a string so that the hash itself would be of specific length? I've got a function that generates 41-byte hashes (SHA-1), but I need it to be 33-bytes max (because of certain hardware limitations). If I truncate the 41-byte hash to 33, I'd probably (certainly!) lost the uniqueness.
Thanks in advance for any tips/pointers! | 0 | [
2,
19170,
16,
21,
3724,
20,
44,
16,
1903,
1476,
800,
3726,
3726,
25,
80,
21,
161,
20,
7920,
21,
19170,
16,
21,
3724,
86,
30,
14,
19170,
1145,
83,
44,
16,
1903,
1476,
60,
31,
22,
195,
330,
21,
1990,
30,
7920,
18,
4390,
8,
232... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
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 sort a generic list
===
I have a generic list...
public List<ApprovalEventDto> ApprovalEvents
The ApprovalEventDto has
public class ApprovalEventDto
{
public string Event { get; set; }
public DateTime EventDate { get; set; }
}
How do I sort the list by the event date?
| 0 | [
2,
184,
107,
31,
2058,
21,
12733,
968,
800,
3726,
3726,
31,
57,
21,
12733,
968,
9,
9,
9,
317,
968,
1569,
255,
38,
73,
7753,
661,
13631,
6645,
43,
262,
1569,
263,
38,
73,
4988,
4943,
38,
18,
14,
4988,
4943,
38,
43,
262,
63,
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... |
c++ library for rotating a point over a given axis?
===
suggest one graphing library for simple transformation of a point from one coordinate system to another coordinate system which is rotated by a angle and some point transformation and just for 2d.
And any graphing tool for plotting and verifying the same visually? | 0 | [
2,
272,
20512,
1248,
26,
16164,
21,
454,
84,
21,
504,
8577,
60,
800,
3726,
3726,
5601,
53,
7210,
68,
1248,
26,
1935,
6978,
16,
21,
454,
37,
53,
15154,
329,
20,
226,
15154,
329,
56,
25,
24107,
34,
21,
5334,
17,
109,
454,
6978,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
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... |
Testing socket connection in Python
===
This question will expand on: [http://stackoverflow.com/questions/68774/best-way-to-open-a-socket-in-python][1]<br />
When opening a socket how can I test to see if it has been established, and that it did not timeout, or generally fail.
[1]: http://stackoverflow.com/questions/68774/best-way-to-open-a-socket-in-python | 0 | [
2,
4431,
18482,
2760,
19,
20059,
800,
3726,
3726,
48,
1301,
129,
6073,
27,
45,
636,
21127,
6903,
25325,
2549,
9990,
9,
960,
118,
24652,
18,
118,
4279,
4536,
12918,
4936,
8,
1443,
8,
262,
8,
10157,
8,
58,
8,
18,
5668,
1198,
8,
10... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
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... |
Initializing a large structure in C
===
In our code we used to have something like this:
*(controller->bigstruct) = *( struct bigstruct ){ 0 };
This used to work great, and then we upgraded versions of GCC and suddenly started seeing stack overflows. Looking at the assembly, the old GCC code (2.x) was basically doing this:
memset(controller->bs, 0, sizeof(struct bigstruct));
The new GCC (3.4.x) was doing this
struct bigstruct temp = { 0 };
controller->bigstruct = temp;
After reviewing the C99 spec, I could see why; C99 basically requires that anonymous structures exist on the stack. It's a good concept, but this structure was 4 Megabytes large, and only ever intended to exist on heap!
We've resorted to making our own 'initialize' function that explicitly sets the members, but that's ugly and a maintenance headache. I don't consider memset a proper solution, because I can't know that a bit-value of 0 is an appropriate zero value for the type ( nit-picking, I know, but there you are; I don't mind that the compiler does it, because it *can* know )
What is the "correct", or at least best, way to initialize a large structure like this?
| 0 | [
2,
2104,
3335,
21,
370,
1411,
19,
272,
800,
3726,
3726,
19,
318,
1797,
95,
147,
20,
57,
301,
101,
48,
45,
1637,
5,
12898,
1252,
8,
1,
6407,
10346,
6,
800,
1637,
5,
13,
10346,
580,
10346,
13,
6,
1,
713,
13,
1,
73,
48,
147,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
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.