unified_texts stringlengths 32 30.1k | OpenStatus_id int64 0 4 | input_ids list | token_type_ids list | attention_mask list |
|---|---|---|---|---|
initialize a const array in a class initializer in C++
===
I have the following class in C++:
class a {
const b[2];
// other stuff follows
// and here's the constructor
a(void);
}
The question is, how do I initialize b in the initialization list, given that I can't initialize it inside the curly-braces section (what's it really called?) of the constructor, because b is `const`?
This doesn't work:
a::a(void) :
b([2,3])
{
// other initialization stuff
} | 0 | [
2,
2104,
2952,
21,
11608,
38,
7718,
19,
21,
718,
2104,
11907,
19,
272,
20512,
800,
3726,
3726,
31,
57,
14,
249,
718,
19,
272,
20512,
45,
718,
21,
13,
1,
11608,
38,
334,
2558,
135,
12660,
12894,
89,
3217,
2415,
12894,
17,
235,
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... |
Word 97-2003 document to HTML conversion - programatically
===
I need to convert Word binary documents (version 97 up to 2003) into HTML documents programatically. I have googled for 3rd party libraries but most results are junk built on top of System.IO.Package which, ofcourse, are useless for other word documents except Word 2007 - Office Open XML.
Do you know a good tool / library for .NET to programatically convert them ? | 2 | [
2,
833,
9427,
8,
3325,
4492,
20,
13,
15895,
6263,
13,
8,
625,
721,
8438,
800,
3726,
3726,
31,
376,
20,
8406,
833,
14171,
4374,
13,
5,
10898,
9427,
71,
20,
973,
6,
77,
13,
15895,
4374,
625,
721,
8438,
9,
31,
57,
8144,
43,
26,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How do I send arrays between views in CakePHP
===
I am not sure if I formulated the question right, but still ...
I have a view that shows a flash embed and this flash take as parameter a `/controller/action` URL that generates a XML. I nee to send, from this view, an array to the XML generator action. How is the best way ? Is there a `helper->set()` method like or I have to create an specific URL to send this array to that action ? | 0 | [
2,
184,
107,
31,
2660,
7718,
18,
128,
4146,
19,
8390,
26120,
800,
3726,
3726,
31,
589,
52,
562,
100,
31,
22112,
14,
1301,
193,
15,
47,
174,
13,
9,
9,
9,
31,
57,
21,
1418,
30,
1285,
21,
4433,
11911,
69,
17,
48,
4433,
247,
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... |
Is one's complement a real-world issue, or just a historical one?
===
[Another question][1] asked about determining odd/evenness in C, and the idiomatic (x & 1) approach was correctly flagged as broken for [one's complement-based][2] systems, which the C standard allows for.
Do systems really exist in the 'real world' outside of computer museums? I've been coding since the 1970's and I'm pretty sure I've never met such a beast.
Is anyone actually developing or testing code for such a system? And, if not, should we worry about such things or should we put them into [Room 101][3] along with paper tape and punch cards...?
[1]: http://stackoverflow.com/questions/160930
[2]: http://en.wikipedia.org/wiki/Signed_number_representations#Ones.27_complement
[3]: http://en.wikipedia.org/wiki/Room_101 | 0 | [
2,
25,
53,
22,
18,
10838,
21,
683,
8,
4423,
1513,
15,
54,
114,
21,
1668,
53,
60,
800,
3726,
3726,
636,
14945,
1301,
500,
2558,
165,
500,
411,
88,
13521,
4210,
118,
4943,
720,
19,
272,
15,
17,
14,
28380,
12479,
13,
5,
396,
279,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
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 you recommend books for getting started with Web Development on a Mac?
===
As a dyed in the wool Windows dev I surprised myself bought a Mac and I feel such a noob again. I'm basically looking to get up to speed quickly and need advice on making the transition as an experienced windows dev to OSX.
Can you recommend any development books specifically in the area of getting up and running using Apache, Python and Ruby/Rails geared towards the Mac?
Also what dev tools/languages are already installed on OSX 10.5 out of the box?
I'm also looking for a decent reference text on OSX that explains stuff an advanced user might need to know beyond all the pointy clicky stuff e.g. where stuff goes on the filesystem when I install an app (yeah I know that last question not on-topic).
Thanks in advance
Kev
| 4 | [
2,
92,
42,
12360,
964,
26,
1017,
373,
29,
2741,
522,
27,
21,
1572,
60,
800,
3726,
3726,
28,
21,
14943,
43,
19,
14,
6564,
1936,
9664,
31,
2948,
992,
2448,
21,
1572,
17,
31,
583,
145,
21,
90,
4995,
188,
9,
31,
22,
79,
11374,
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... |
What are main/best Maven respositories to use?
===
What are the main/best Maven repositories to use that will include the majority of your open source Java package dependencies.
Also in what order should these be included? Does it matter? | 4 | [
2,
98,
50,
407,
118,
4936,
1216,
3124,
10719,
14882,
262,
2829,
20,
275,
60,
800,
3726,
3726,
98,
50,
14,
407,
118,
4936,
1216,
3124,
302,
14882,
262,
2829,
20,
275,
30,
129,
468,
14,
1698,
16,
154,
368,
1267,
8247,
6030,
29411,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
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... |
How to indicate that a method was unsuccessful
===
I have several similar methods, say eg. CalculatePoint(...) and CalculateListOfPoints(...). Occasionally, they may not succeed, and need to indicate this to the caller. For CalculateListOfPoints, which returns a generic List<Point>, I could return an empty list and require the caller to check this; however Point is a value type and so I can't return null there.
Ideally I would like the methods to 'look' similar; one solution could be to define them as
public Point CalculatePoint(... out Boolean boSuccess);
public List<Point> CalculateListOfPoints(... out Boolean boSuccess);
or alternatively to return a Point? for CalculatePoint, and return null to indicate failure. That would mean having to cast back to the non-nullable type though, which seems excessive.
Another route would be to return the Boolean boSuccess, have the result (Point or List<Point>) as an 'out' parameter, and call them TryToCalculatePoint or somtheing...
What is best practice? | 0 | [
2,
184,
20,
4342,
30,
21,
2109,
23,
7225,
800,
3726,
3726,
31,
57,
238,
835,
3195,
15,
395,
12369,
9,
18469,
3132,
5,
9,
9,
9,
6,
17,
18469,
5739,
1041,
3132,
18,
5,
9,
9,
9,
6,
9,
4533,
15,
59,
123,
52,
7952,
15,
17,
37... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
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 data type when reading XML data in SAS
===
I need to control the data type when reading XML data in SAS. The XML data are written and accessed using the XML libname engine in SAS.
SAS seems to guess the data type based on the contents of a column: If I write "20081002" to my XML data in a character column, it will be read back in as a numerical variable.
An example:
filename my_xml '/tmp/my.xml'; * Yes, I use SAS on Unix *;
libname my_xml XML;
data my_xml.data_type_test;
text_char="This is obviously text";
date_char="20081002";
num_char="42";
genuine_num=42;
run;
proc copy inlib=my_xml outlib=WORK;
run;
libname my_xml;
filename my_xml CLEAR;
Only the last column is defined as numerical data type in the XML data, but when I copy it into my WORK library, only the column *text_char* is character. The other 3 are now numeric.
How can I control the data type when reading XML data in SAS?
| 0 | [
2,
2697,
1054,
1001,
76,
1876,
23504,
1054,
19,
9233,
800,
3726,
3726,
31,
376,
20,
569,
14,
1054,
1001,
76,
1876,
23504,
1054,
19,
9233,
9,
14,
23504,
1054,
50,
642,
17,
12904,
568,
14,
23504,
13,
8326,
7259,
1406,
19,
9233,
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... |
Is it possible to unlisten on a socket ?
===
Is it possible to unlisten on a socket after you have called listen(fd, backlog)?
| 0 | [
2,
25,
32,
938,
20,
367,
13891,
27,
21,
18482,
13,
60,
800,
3726,
3726,
25,
32,
938,
20,
367,
13891,
27,
21,
18482,
75,
42,
57,
227,
3834,
5,
410,
43,
15,
97,
5567,
6,
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... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
How can I read binary data from wfstream?
===
I have a slight problem reading data from file. I want to be able to read wstring's, aswell as a chunk of raw data of arbitrary size (size is in bytes).
std::wfstream stream(file.c_str());
std::wstring comType;
stream >> comType;
int comSize;
stream >> comSize;
char *comData = new char[comSize];
memset(comData, 0, comSize);
stream.read(comData, comSize);
//error C2664 : 'std::basic_istream<_Elem,_Traits>::read'
// : cannot convert parameter 1 from 'char *' to 'wchar_t *'
Perhaps I am using wrong streams, or something along those lines. Basically, I want to read a wstring, size of the data followed (which could be any number of bytes), followed by that many bytes of component data. Obviously, I can't read char's because the template assumes wchar_t's.
I can read wchar\_t's but then I have to make sure the data is stored as aligned by sizeof(wchar\_t). Otherwise, I could end up corrupting the stream. A scenario would be when the data is 15 bytes. I would have to read 16 bytes, then mask the unwanted byte, seek the stream to 15 bytes offset (if possible with wchar_t templated?) to be able to read the next data chunk.
Clearly, there *should* be a nicer way of achieving what I am trying to do. | 0 | [
2,
184,
92,
31,
1302,
14171,
1054,
37,
13,
15263,
11260,
60,
800,
3726,
3726,
31,
57,
21,
6442,
1448,
1876,
1054,
37,
3893,
9,
31,
259,
20,
44,
777,
20,
1302,
619,
11130,
22,
18,
15,
28,
854,
28,
21,
15009,
16,
4333,
1054,
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... |
Inserting EOF into a java string
===
I'd like to invoke bash using a string as input. Something like:
sh -l -c "./foo"
I'd like to do this from Java. Unfortunately, when I try to invoke the command using getRuntime().exec I get the following error:
foo": -c: line 0: unexpected EOF while looking for matching `"'
foo": -c: line 1: syntax error: unexpected end of file
It seems to be related to my string not being terminated with an EOF. Is there a way to insert a platform specific EOF into a Java string? Or should I be looking for another approach, like writing to a temp script before invoking "sh" ?
| 0 | [
2,
14692,
68,
13,
62,
1041,
77,
21,
8247,
3724,
800,
3726,
3726,
31,
22,
43,
101,
20,
28371,
13158,
568,
21,
3724,
28,
6367,
9,
301,
101,
45,
5527,
13,
8,
255,
13,
8,
150,
13,
7,
9,
118,
4120,
111,
7,
31,
22,
43,
101,
20,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Hidden features of Perl
===
There have been a whole series of these questions so far, and for some reason Perl seems to have been left out.
What are some really useful but esoteric language features in Perl that you've been able to actually employ to do useful work? And please, no responses that say "the entire language is composed of esoteric features." That's not helpful.
Guidelines:
- Try to limit answers the Perl core and not CPAN
- One feature per answer
- Please give an example and a short description
See Also:
- [Hidden features of C][7]
- [Hidden features of C#][1]
- [Hidden features of C++][2]
- [Hidden features of Java][3]
- [Hidden features of JavaScript][4]
- [Hidden features of Ruby][5]
- [Hidden features of PHP][6]
- [Hidden features of Python][8]
[1]: http://stackoverflow.com/questions/9033/hidden-features-of-c
[2]: http://stackoverflow.com/questions/75538/hidden-features-of-c
[3]: http://stackoverflow.com/questions/15496/hidden-features-of-java
[4]: http://stackoverflow.com/questions/61088/hidden-features-of-javascript
[5]: http://stackoverflow.com/questions/63998/hidden-features-of-ruby
[6]: http://stackoverflow.com/questions/61401/hidden-features-of-php
[7]: http://stackoverflow.com/questions/132241/hidden-features-of-c
[8]: http://stackoverflow.com/questions/101268/hidden-features-of-python | 0 | [
2,
3689,
967,
16,
416,
255,
800,
3726,
3726,
80,
57,
74,
21,
979,
231,
16,
158,
2346,
86,
463,
15,
17,
26,
109,
1215,
416,
255,
2206,
20,
57,
74,
225,
70,
9,
98,
50,
109,
510,
4811,
47,
27850,
816,
967,
19,
416,
255,
30,
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... |
K & R Exercise: My Code Works, But Feels Stinky; Advice for Cleanup?
===
I'm working on the K&R book. I've read farther ahead than I've done exercises, mostly for lack of time. I'm catching up, and have done almost all the exercises from chapter 1, which is the tutorial.
My issue was exercise 1-18. The exercise is to:
> Write a program to remove trailing blanks and
> tabs from line of input, and to delete entirely blank lines
My code (below) does that, and works. My problem with it is the trim method I implemented. It feels ... wrong ... somehow. Like if I saw similar code in C# in a code review, I'd probably go nuts. (C# being one of my specialties.)
Can anyone offer some advice on cleaning this up -- with the catch that said advice has to only use knowledge from Chapter 1 of K & R. (I know there are a zillion ways to clean this up using the full C library; we're just talking Chapter 1 and basic stdio.h here.) Also, when giving the advice, can you explain why it will help? (I am, after all, trying to learn! And who better to learn from than the experts here?)
#include <stdio.h>
#define MAXLINE 1000
int getline(char line[], int max);
void trim(char line[], char ret[]);
int main()
{
char line[MAXLINE];
char out[MAXLINE];
int length;
while ((length = getline(line, MAXLINE)) > 0)
{
trim(line, out);
printf("%s", out);
}
return 0;
}
int getline(char line[], int max)
{
int c, i;
for (i = 0; i < max - 1 && (c = getchar()) != EOF && c != '\n'; ++i)
line[i] = c;
if (c == '\n')
{
line[i] = c;
++i;
}
line[i] = '\0';
return i;
}
void trim(char line[], char ret[])
{
int i = 0;
while ((ret[i] = line[i]) != '\0')
++i;
if (i == 1)
{
// Special case to remove entirely blank line
ret[0] = '\0';
return;
}
for ( ; i >= 0; --i)
{
if (ret[i] == ' ' || ret[i] == '\t')
ret[i] = '\0';
else if (ret[i] != '\0' && ret[i] != '\r' && ret[i] != '\n')
break;
}
for (i = 0; i < MAXLINE; ++i)
{
if (ret[i] == '\n')
{
break;
}
else if (ret[i] == '\0')
{
ret[i] = '\n';
ret[i + 1] = '\0';
break;
}
}
} | 0 | [
2,
680,
279,
761,
5935,
45,
51,
1797,
693,
15,
47,
5121,
18313,
93,
73,
4978,
26,
26862,
60,
800,
3726,
3726,
31,
22,
79,
638,
27,
14,
680,
1569,
139,
360,
9,
31,
22,
195,
1302,
8605,
2173,
119,
31,
22,
195,
677,
12612,
15,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Parenthesis surrounding return values
===
Quite often in ANSI C code I can see parenthesis sorrounding a single return value.
Like this:-
int foo(int x) {
if (x)
return (-1);
else
return (0);
}
Why use () around the return value in those cases? Any ideas? I can see no reason for that... | 0 | [
2,
4766,
438,
4557,
2470,
788,
4070,
800,
3726,
3726,
1450,
478,
19,
40,
18,
49,
272,
1797,
31,
92,
196,
4766,
438,
4557,
7779,
5000,
68,
21,
345,
788,
1923,
9,
101,
48,
45,
8,
19,
38,
4310,
111,
5,
6391,
993,
6,
13,
1,
100,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
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... |
WPF Bind to a Collection of objects, sorted by IDs stored in order in another Collection in C#
===
For those of you that like puzzles: I had this problem recently and am sure there must be a nicer solution.
Consider :
- an ObservableCollection of **Foo** objects called *foos*.
- **Foo** contains a string ID field
- I have no control over *foos*
- *foos* will be changing
Then:
- I have another collection called *sortLikeThis*
- *sortListThis* contains strings
- The strings are the IDs in the order in which the *foos* are to be shown
Plus:
- There may be objects in *foos* with an ID that is not in *sortLikeThis*. These need to go at the end.
- Likewise, there may be strings in *sortLikeThis* that do not appear in *foos*.
Is there a nice way to bind to and show in wpf the **Foo** objects in *foos* in the order defined by IDs in *sortLikeThis* ?
Thanks,
Lee. | 0 | [
2,
619,
7721,
10193,
20,
21,
1206,
16,
3916,
15,
22554,
34,
13,
9178,
8214,
19,
389,
19,
226,
1206,
19,
272,
5910,
800,
3726,
3726,
26,
273,
16,
42,
30,
101,
9164,
18,
45,
31,
41,
48,
1448,
1989,
17,
589,
562,
80,
491,
44,
2... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How to evict file from system cache on Linux?
===
When running performance tests file system cache hit or miss can significantly influence test results. Therefore generally before running such tests used files are evicted from system cache. How to do that on Linux? | 0 | [
2,
184,
20,
13,
17715,
38,
3893,
37,
329,
16522,
27,
13024,
60,
800,
3726,
3726,
76,
946,
956,
4894,
3893,
329,
16522,
770,
54,
1501,
92,
5085,
1915,
1289,
1736,
9,
1793,
1469,
115,
946,
145,
4894,
147,
6488,
50,
27141,
37,
329,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
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 do you track the time of replicated rows for Subscribers in SQL Server 2005?
===
The basic problem is like this:
A subscriber has successfully replicated a row from the publisher. Now, how do we keep track the time of this row being last successfully replicated?
A friend has suggested the following solution, which he used for his SQL Server 2000:
1) Add a timestamp column.
2) Change the replication stored procedure to update the timestamp column (!).
The step #2 sets off all sorts of warning bells within me, so I'm asking if there are better solutions for SQL Server 2005 in this situation, before I even go into detail with his solution.
| 0 | [
2,
184,
107,
42,
792,
14,
85,
16,
22156,
43,
11295,
26,
19549,
19,
4444,
255,
8128,
812,
60,
800,
3726,
3726,
14,
2125,
1448,
25,
101,
48,
45,
21,
13,
20330,
139,
63,
3673,
22156,
43,
21,
3131,
37,
14,
5916,
9,
130,
15,
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... |
Can I run ASP and ASP.NET pages in the same web app simultaneously?
===
In the process of updating a web app from ASP to ASP.NET, I want to insert one of the new files into the old app to test something - is this an offence against reason? | 0 | [
2,
92,
31,
485,
28,
306,
17,
28,
306,
9,
2328,
4434,
19,
14,
205,
2741,
4865,
6888,
60,
800,
3726,
3726,
19,
14,
953,
16,
71,
43,
1880,
21,
2741,
4865,
37,
28,
306,
20,
28,
306,
9,
2328,
15,
31,
259,
20,
14692,
53,
16,
14,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Determining the height of an HTML table that is dynamically filled
===
I would like to draw a diagram in HTML. The positioning structure looks like this:
<div id='hostDiv'>
<div id='backgroundDiv'>
... drawing the background ...
</div>
<div id='foregroundDiv' style='position: absolute;'>
... drawing the foreground ...
</div>
</div>
The foreground contains a Table element that is dynamically populated with text, hence the row heights might alter depending on the amount of text going into a cell.
How can I predict the final height of the Table element in the foregroun? I need this information to set the correct height of the background. Is there a way to pre-render the Table from Javascript and read out its height? Or some other trick?
PS. The size of the hostDiv may vary as the browser resizes.
| 0 | [
2,
13521,
14,
2947,
16,
40,
13,
15895,
859,
30,
25,
7782,
1326,
1943,
800,
3726,
3726,
31,
83,
101,
20,
2003,
21,
14161,
19,
13,
15895,
9,
14,
649,
68,
1411,
1879,
101,
48,
45,
13,
1,
12916,
4924,
3726,
22,
11694,
12916,
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... |
Html textbox and dropdown width are not the same
===
I'm trying to have two inputs (one textbox, one drop down) to have the same width.
You can set the width through css, but for some reason, the select box is always a few pixels smaller.
Any suggestions/ideas about the reason/work around?
Having the following HTML
<form action="theAction" method="post" class="searchForm" >
<fieldset>
<legend>Search</legend>
<p>
<label for="name">Product name</label>
<input class="searchInput" type="text" name="name" id="name" value="" />
</p>
<p>
<label for="ml2">Product Group</label>
<select class="searchInput" name="ml2" id="ml2">
<option value="158">INDUSTRIAL PRIMERS/FILLERS</option>
<option value="168">CV CLEAR COATS</option>
<option value="171">CV PRIMERS/FILLERS</option>
<option value="" selected="selected">All</option>
</select>
</p>
<input type="submit" class="search" value="Show" name="Show" id="Show" />
<input type="reset" value="Reset" name="reset" id="reset" class="reset"/>
</fieldset>
</form>
And the follwing CSS
.searchInput{
width: 100px;
overflow: hidden;
} | 0 | [
2,
13,
15895,
1854,
5309,
17,
2804,
2968,
9456,
50,
52,
14,
205,
800,
3726,
3726,
31,
22,
79,
749,
20,
57,
81,
6367,
18,
13,
5,
849,
1854,
5309,
15,
53,
2804,
125,
6,
20,
57,
14,
205,
9456,
9,
42,
92,
309,
14,
9456,
120,
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... |
Corner desks vs straight desks
===
The company I work for are currently undergoing a site wide renovation and I'm involved in the 'consultation' on what the R&D work spaces are going to be like.
There is no scope for individual private offices - so lets not start on that topic.
One big requirement is that the office layout can be flexible (i.e. tema areas can be created and changed as necessary).
In order to allow this one of the most significant changes is that we will be losing our corner facing desks. The rationale being that since no one has big CRT monitors any more we don't need to waste the space in the corner.
People are reluctant about this change but I'm not sure if thats just because people don't like change or if there is a real reason behind it. I've moved my setup out of the corner onto a straight edge to see how much impact it has on myself.
We've also been told that this is now happening across the industry... that people are being moved out of their corners into more bench-like arrangement.
So my the question is twofold:
1. Is it really important to have a corner?
2. Is there really an industry-wide move 'out of the corners'?
I know there are a lot of questions already on here about conditions for developers but nothing about this specific question I don't think. | 2 | [
2,
1531,
2911,
18,
4611,
1599,
2911,
18,
800,
3726,
3726,
14,
237,
31,
170,
26,
50,
871,
16863,
21,
689,
1051,
10707,
17,
31,
22,
79,
1013,
19,
14,
13,
22,
27230,
8593,
22,
27,
98,
14,
761,
1569,
43,
170,
7644,
50,
228,
20,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
What are .git/info/grafts for?
===
I am trying to figure out what is the 'grafts' in the Git.
For example, in one of the latest comments <a href="http://log.emmanuelebassi.net/archives/2007/09/when-the-levee-breaks/">here</a>, Tobu suppose to use <b>git-filter-branch</b> and <b>.git/info/grafts</b> to join two repositories.
But I don't undestand why I need these <em>grafts</em>? It seems, that all work without last two commands. | 0 | [
2,
98,
50,
13,
9,
10404,
118,
108,
4120,
118,
12461,
38,
18,
26,
60,
800,
3726,
3726,
31,
589,
749,
20,
1465,
70,
98,
25,
14,
13,
22,
12461,
38,
18,
22,
19,
14,
13,
10404,
9,
26,
823,
15,
19,
53,
16,
14,
5736,
7534,
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... |
Howto deactivate caching inside a jsp page
===
I understand there is a HTTP response header directive to disable page caching:
Cache-Control:no-cache
I can modify the header by "hand":
<%response.addHeader("Cache-Control","no-cache");%>
But is there a "nice" way to make the JSP interpreter return this header line in the server response?
(I checked the <%@page ...%> directive. It seems there is nothing like that.) | 0 | [
2,
184,
262,
121,
19516,
1373,
1658,
7192,
572,
21,
487,
3401,
2478,
800,
3726,
3726,
31,
1369,
80,
25,
21,
7775,
1627,
157,
106,
15626,
20,
1460,
579,
2478,
1658,
7192,
45,
16522,
8,
12898,
45,
251,
8,
793,
2569,
31,
92,
17579,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
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 slow are .net exceptions?
===
I don't want a discussion about when to and not to throw exceptions. I wish to resolve a simple issue. 99% of the time the argument for not throwing exceptions revolves around them being slow while the other side claims (with benchmark test) that the speed is not the issue . I've read numerous blogs, articles, and posts pertaining one side or the other. So which is it? | 0 | [
2,
184,
2276,
50,
13,
9,
2328,
13392,
60,
800,
3726,
3726,
31,
221,
22,
38,
259,
21,
5460,
88,
76,
20,
17,
52,
20,
3814,
13392,
9,
31,
2536,
20,
9854,
21,
1935,
1513,
9,
13,
26014,
16,
14,
85,
14,
5476,
26,
52,
6033,
13392,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
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 Server Query Question: If I stop a long running query, does it rollback?
===
A query that is used to loop through <b>17 millions records to remove duplicates</b> has been running now for about <b>16 hours</b> and I wanted to know if the query is stopped right now if it will finalize the delete statements or if it has been deleting while running this query? Indeed, if I do stop it, does it finalize the deletes or rolls back?
I have found that when I do a
select count(*) from myTable
That the rows that it returns (while doing this query) is about 5 less than what the starting row count was. Obviously the server resources are extremely poor, so does that mean that this process has taken 16 hours to find 5 duplicates (when there are actually thousands), and this could be running for days?
This query took 6 seconds on 2000 rows of test data, and it works great on that set of data, so I figured it would take 15 hours for the complete set.
Any ideas?
Below is the query:
--Declare the looping variable
DECLARE @LoopVar char(10)
DECLARE
--Set private variables that will be used throughout
@long DECIMAL,
@lat DECIMAL,
@phoneNumber char(10),
@businessname varchar(64),
@winner char(10)
SET @LoopVar = (SELECT MIN(RecordID) FROM MyTable)
WHILE @LoopVar is not null
BEGIN
--initialize the private variables (essentially this is a .ctor)
SELECT
@long = null,
@lat = null,
@businessname = null,
@phoneNumber = null,
@winner = null
-- load data from the row declared when setting @LoopVar
SELECT
@long = longitude,
@lat = latitude,
@businessname = BusinessName,
@phoneNumber = Phone
FROM MyTable
WHERE RecordID = @LoopVar
--find the winning row with that data. The winning row means
SELECT top 1 @Winner = RecordID
FROM MyTable
WHERE @long = longitude
AND @lat = latitude
AND @businessname = BusinessName
AND @phoneNumber = Phone
ORDER BY
CASE WHEN webAddress is not null THEN 1 ELSE 2 END,
CASE WHEN caption1 is not null THEN 1 ELSE 2 END,
CASE WHEN caption2 is not null THEN 1 ELSE 2 END,
RecordID
--delete any losers.
DELETE FROM MyTable
WHERE @long = longitude
AND @lat = latitude
AND @businessname = BusinessName
AND @phoneNumber = Phone
AND @winner != RecordID
-- prep the next loop value to go ahead and perform the next duplicate query.
SET @LoopVar = (SELECT MIN(RecordID)
FROM MyTable
WHERE @LoopVar < RecordID)
END
| 0 | [
2,
4444,
255,
8128,
25597,
1301,
45,
100,
31,
747,
21,
175,
946,
25597,
15,
630,
32,
3001,
1958,
60,
800,
3726,
3726,
21,
25597,
30,
25,
147,
20,
5293,
120,
13,
1,
220,
1,
1053,
11999,
742,
20,
4681,
19429,
18,
1,
118,
220,
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... |
Visual Studio 2005: All projects in solution explorer expanded on first opening of solution
===
Is any way to tell the solution explorer of Visual Studio 2005 not to expand all projects on the first opening of the solutio after svn-checkout? | 0 | [
2,
3458,
1120,
18228,
65,
2314,
19,
4295,
8520,
2766,
27,
64,
1214,
16,
4295,
800,
3726,
3726,
25,
186,
161,
20,
494,
14,
4295,
8520,
16,
3458,
1120,
812,
52,
20,
6073,
65,
2314,
27,
14,
64,
1214,
16,
14,
86,
2377,
15752,
75,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
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... |
Refactoring Code: When do I what?
===
Ever since I started using .NET, I've just been creating Helper classes or Partial classes to keep code located and contained in their own little containers, etc.
What I'm looking to know is the best practices for making ones code as clean and polished as it possibly could be.
Obviously clean code is subjective, but I'm talking about when to use things (not how to use them) such as polymorphism, inheritance, interfaces, classes and how to design classes more appropriately (to make them more useful, not just say 'DatabaseHelper', as some considered this bad practice in the [code smells wiki][1]).
Are there any resources out there that could possibly help with this kind of decision making?
Bare in mind that I haven't even started a CS or software engineering course, and that a teaching resource is fairly limited in real-life.
[1]: http://stackoverflow.com/questions/114342/what-are-code-smells-what-is-the-best-way-to-correct-them | 0 | [
2,
302,
17455,
68,
1797,
45,
76,
107,
31,
98,
60,
800,
3726,
3726,
462,
179,
31,
373,
568,
13,
9,
2328,
15,
31,
22,
195,
114,
74,
2936,
448,
106,
2684,
54,
7284,
2684,
20,
643,
1797,
335,
17,
3437,
19,
66,
258,
265,
18988,
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... |
Using Selenium IDE with random values
===
Is it possible to create Selenium tests using the Firefox plugin that use randomly generated values to help do regression tests?
**The full story:**
I would like to help my clients do acceptance testing by providing them with a suite of tests that use some smarts to create random (or at least pseudo-random) values for the database. One of the issues with my Selenium IDE tests at the moment is that they have predefined values - which makes some types of testing problematic.
| 0 | [
2,
568,
23027,
14311,
13,
3448,
29,
5477,
4070,
800,
3726,
3726,
25,
32,
938,
20,
1600,
23027,
14311,
4894,
568,
14,
535,
18219,
10922,
108,
30,
275,
21324,
6756,
4070,
20,
448,
107,
27369,
4894,
60,
13,
1409,
124,
503,
609,
45,
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... |
could not read column value from result set ; String index out of range: 0
===
I'm reading data from a table( from a MySQL Database) with Hibernate SQL Query.
The thing is, the table contains a colum that is mapped to a char in Hibernate Model, and sometimes this column is empty.
And I suppose this is where my exception comes from.
How can I map a colum of char to my hibernate model without getting this error ?
Thanks for your answers ! | 0 | [
2,
110,
52,
1302,
4698,
1923,
37,
829,
309,
13,
73,
3724,
4348,
70,
16,
978,
45,
713,
800,
3726,
3726,
31,
22,
79,
1876,
1054,
37,
21,
859,
5,
37,
21,
51,
18,
22402,
6018,
6,
29,
4148,
2102,
8820,
4444,
255,
25597,
9,
14,
58... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
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 makes an application an "enterprise" or "enterprise-level" application?
===
Is it just a buzzword that means nothing or is there a definition of what makes an application (desktop or web) an enterprise application? | 0 | [
2,
98,
1364,
40,
3010,
40,
13,
7,
13679,
15839,
62,
7,
54,
13,
7,
13679,
15839,
62,
8,
3906,
7,
3010,
60,
800,
3726,
3726,
25,
32,
114,
21,
9122,
9587,
30,
1108,
626,
54,
25,
80,
21,
5465,
16,
98,
1364,
40,
3010,
13,
5,
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,
0,
0,
0,
0,
0,
0... |
Visual Studio 2008: make ctrl-k, ctrl-n (next bookmark) stay within the same file
===
In Visual Studio 2003 you could jump to the next bookmark with ctrl k, ctrl-n; it stayed within the same file and wrapped around to the top of the file when there were no furter bookmarks in the file. Now in VS 2008 this seems to have changed, and ctrl-k, ctrl-n jumps to other files with bookmarks. How can I change this back to the old behavior? | 0 | [
2,
3458,
1120,
15573,
233,
13,
4812,
6362,
8,
197,
15,
13,
4812,
6362,
8,
103,
13,
5,
20021,
360,
4527,
6,
1179,
363,
14,
205,
3893,
800,
3726,
3726,
19,
3458,
1120,
973,
42,
110,
3936,
20,
14,
328,
360,
4527,
29,
13,
4812,
63... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
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 any way to determine the amuont of time a client spends on a web page
===
Assuming I have an open source web server or proxy I can enhance, let's say apache or squid. Is there a way to determine the time each client spends on a web page?
HTTP is of course stateless, so it's not trivial, but maybe someone has an idea on how to approach this problem?
Thanks. | 0 | [
2,
25,
80,
186,
161,
20,
3746,
14,
21,
3677,
218,
38,
16,
85,
21,
6819,
3256,
18,
27,
21,
2741,
2478,
800,
3726,
3726,
11704,
31,
57,
40,
368,
1267,
2741,
8128,
54,
27188,
31,
92,
10734,
15,
408,
22,
18,
395,
17140,
54,
25756,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
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... |
Making every pixel of an image having a specific color transparent
===
I have an object of the type System.Drawing.Image and want to make every pixel which has some specific color, for example black, transparent (that is, set alpha to 0 for this pixel).
What is the best way to do this? | 0 | [
2,
544,
352,
18146,
16,
40,
1961,
452,
21,
1903,
1665,
14862,
800,
3726,
3726,
31,
57,
40,
3095,
16,
14,
1001,
329,
9,
3030,
3546,
9,
22039,
17,
259,
20,
233,
352,
18146,
56,
63,
109,
1903,
1665,
15,
26,
823,
319,
15,
14862,
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... |
CruiseControl.NET view NUnit xml test result when Nant build file executes NUnit
===
I have a Nant build file which executes NUnit after compiling the dll's. I am executing the NAnt build file with a <nant> task in CruiseControl. So NAnt is running the tests not CruiseControl.
How do I configure it so that the CruiseControl web dashboard can be used to view the NUnit output ? | 0 | [
2,
6581,
12898,
9,
2328,
1418,
10210,
242,
23504,
1289,
829,
76,
13,
11028,
1895,
3893,
15644,
18,
10210,
242,
800,
3726,
3726,
31,
57,
21,
13,
11028,
1895,
3893,
56,
15644,
18,
10210,
242,
75,
24378,
14,
13,
43,
211,
22,
18,
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... |
Disable Intellisense in XAML Editor in VS2008?
===
Is there a way to disable Intellisense in the XAML editor in Visual Studio 2008? It is often a big performance drain while typing, and sometimes I'll sit for ten or more seconds waiting while the list automatically popups up.
It appears that in Options->Text Editors->XAML, the Intellisense section is section is unavailable (grayed out). We open documents in Full XAML View, and don't use any third party enhancements.
It's so bad that sometimes I'll just open the file elsewhere and edit what I need, but I'd really like to get this solved so I *don't* have to use an external application. | 0 | [
2,
1460,
579,
14635,
3159,
6498,
19,
13,
6791,
8184,
1835,
19,
4611,
2753,
60,
800,
3726,
3726,
25,
80,
21,
161,
20,
1460,
579,
14635,
3159,
6498,
19,
14,
13,
6791,
8184,
1835,
19,
3458,
1120,
570,
60,
32,
25,
478,
21,
580,
956,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
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... |
Unknown Outlook MailItem EntryID
===
My Outlook add-in handles NewInspector event of the Inspector object, in order to display a custom form for the mail item.
I can get EntryID of the CurrentItem of the Inspector object which is passed as a parameter of the event. But, the problem is that the EntryID of the current mail item is shorter than it should be, and is unknown. I know every EntryID of every mail item that was created, and i can see that specific mail item has a wrong EntryID.
What is wrong? | 0 | [
2,
2562,
19837,
4216,
2119,
79,
2792,
1340,
800,
3726,
3726,
51,
19837,
3547,
8,
108,
3053,
18,
78,
108,
7350,
248,
807,
16,
14,
6517,
3095,
15,
19,
389,
20,
3042,
21,
5816,
505,
26,
14,
4216,
9101,
9,
31,
92,
164,
2792,
1340,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
What are your techniques for avoiding the use of the Singleton Pattern?
===
Let's face it. The Singleton Pattern is [highly controversial][1] topic with hordes programmers on *both* sides of the fence. There are those who feel like the Singleton is nothing more then a glorified global variable, and others who swear by pattern and use it incessantly. I don't want the [Singleton Controversy][2] to lie at the heart of my question, however. **Everyone can have a tug-of-war and battle it out and see who wins for all I care**. What I'm trying to say is, I don't believe there is a single correct answer and I'm not intentionally trying inflame partisan bickering. I am simply interested in *singleton-alternatives* when I ask the question:
**What are your techniques for avoiding the use of the Singleton Pattern?**
For example, many times when I have used the singleton pattern in the past, I am simply interested in preserving the state/values of one or several variables. The state/values of variables, however, can be preserved between each instantiation of the class using **static variables** instead of using the singleton pattern.
What other idea's do you have?
[1]: http://stackoverflow.com/questions/11831/singletons-good-design-or-a-crutch#11839
[2]: http://code.google.com/p/google-singleton-detector/wiki/WhySingletonsAreControversial | 0 | [
2,
98,
50,
154,
4212,
26,
10298,
14,
275,
16,
14,
345,
444,
3732,
60,
800,
3726,
3726,
408,
22,
18,
276,
32,
9,
14,
345,
444,
3732,
25,
636,
4542,
102,
5621,
500,
2558,
165,
500,
8303,
29,
18429,
18,
17968,
18,
27,
1637,
8110,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
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 insert email headers with a Thunderbird extension?
===
I'm building a Thunderbird extension and would like to add my own header to all outgoing email (e.g. <myext-version: 1.0> ). Any idea how to do this? I know it's possible since this is done in the OpenPGP Enigmail extension. Thanks! | 0 | [
2,
184,
107,
42,
14692,
8517,
157,
445,
29,
21,
25763,
3896,
60,
800,
3726,
3726,
31,
22,
79,
353,
21,
25763,
3896,
17,
83,
101,
20,
3547,
51,
258,
157,
106,
20,
65,
25193,
8517,
13,
5,
62,
9,
263,
9,
279,
255,
38,
73,
915,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
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... |
Adjusting the auto-complete dropdown width on a textbox
===
I am using a textbox in a .NET 2 winforms app that is setup with a custom AutoCompleteSource. Is there anyway through code that I can increase the width of the list that appears containing the auto complete suggestions?
Ideally I would like to do this without increasing the width of the textbox as I am short for space in the UI. | 0 | [
2,
22209,
14,
3108,
8,
15990,
2804,
2968,
9456,
27,
21,
1854,
5309,
800,
3726,
3726,
31,
589,
568,
21,
1854,
5309,
19,
21,
13,
9,
2328,
172,
628,
4190,
18,
4865,
30,
25,
18161,
29,
21,
5816,
3108,
15990,
12097,
9,
25,
80,
2774,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
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 merge jsp pre-compiled web.xml fragment with main web.xml using Ant
===
We have the usual **web.xml** for our web application which includes some jsp and jsp tag files. I want to switch to using pre-compiled jsp's. I have the pre-compilation happening in the build ok, and it generates the web.xml fragment and now I want to merge the fragment into the main web.xml.
Is there an **include** type directive for **web.xml** that will let me include the fragment.
Ideally I will leave things as is for DEV- as its useful to change jsp's on the fly and see the changes immediately but then for UAT/PROD, the jsp's will be pre-compiled and thus work faster. | 0 | [
2,
184,
20,
12666,
487,
3401,
782,
8,
11103,
49,
1294,
2741,
9,
396,
8184,
14847,
29,
407,
2741,
9,
396,
8184,
568,
40,
38,
800,
3726,
3726,
95,
57,
14,
3820,
13,
1409,
14113,
9,
396,
8184,
1409,
26,
318,
2741,
3010,
56,
1103,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
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... |
Component for creating PDF files (.net)
===
What .net component for creating PDF files can you recommend ?
One condition is that it has to be able to create PDF files from HTML | 0 | [
2,
5912,
26,
2936,
13,
11124,
6488,
13,
5,
9,
2328,
6,
800,
3726,
3726,
98,
13,
9,
2328,
5912,
26,
2936,
13,
11124,
6488,
92,
42,
12360,
13,
60,
53,
2874,
25,
30,
32,
63,
20,
44,
777,
20,
1600,
13,
11124,
6488,
37,
13,
15895... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
web.xml and relative paths
===
in web.xml i set my welcome file to a jsp within web.xml
<welcome-file>WEB-INF/index.jsp</welcome-file>
inside index.jsp i then forward on to a servlet
<% response.sendRedirect(response.encodeRedirectURL("myServlet/")); %>
however the application tries to find the servlet at the following path
applicationName/WEB-INF/myServlet
the problem is that web-inf should not be in the path. If i move index.jsp out of web-inf then the problem goes but is there another way i can get around this?
| 0 | [
2,
2741,
9,
396,
8184,
17,
4543,
12074,
800,
3726,
3726,
19,
2741,
9,
396,
8184,
31,
309,
51,
5575,
3893,
20,
21,
487,
3401,
363,
2741,
9,
396,
8184,
13,
1,
16873,
8,
16877,
1,
14113,
8,
108,
410,
118,
25671,
9,
728,
3401,
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... |
Why does ActiveRecord's serialize randomly corrupt my data?
===
I use <code>serialize</code> in one ActiveRecord model to serialize an Array of simple Hashes into a text database field. I even use the second parameter to coerce deserialization into Arrays.
class Shop < ActiveRecord::Base
serialize : recipients, Array
end
It seems to work fine but, after a few requests, the content of <code>recipients</code> turns to HashOfIndifferentAccess hashes instead of arrays. This only happens after a few reloads of the models and I haven't been able to reproduce it in tests or the console, only in production environment. | 0 | [
2,
483,
630,
1348,
14953,
22,
18,
5956,
2952,
21324,
11305,
51,
1054,
60,
800,
3726,
3726,
31,
275,
13,
1,
9375,
1,
4104,
2815,
2952,
1,
118,
9375,
1,
19,
53,
1348,
14953,
1061,
20,
5956,
2952,
40,
7718,
16,
1935,
63,
438,
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... |
Best Way To Get Started With Mac Development
===
I just recently got my first mac. I do lots of programming on windows but now I want to get into Mac development. What are some languages i should know or tools i should use to get started with mac development? | 0 | [
2,
246,
161,
20,
164,
373,
29,
1572,
522,
800,
3726,
3726,
31,
114,
1989,
330,
51,
64,
1572,
9,
31,
107,
7503,
16,
3143,
27,
1936,
47,
130,
31,
259,
20,
164,
77,
1572,
522,
9,
98,
50,
109,
2556,
31,
378,
143,
54,
4672,
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,
0,
0,
0,
0,
0,
0,
0... |
What's the best way to create an etag?
===
What's a good method of programatically generating etag for web pages, and is this practice recommended? Some sites recommend turning etags off, others recommend producing them manually, and some recommend leaving the default settings active - what's the best way here? | 4 | [
2,
98,
22,
18,
14,
246,
161,
20,
1600,
40,
13,
62,
8628,
60,
800,
3726,
3726,
98,
22,
18,
21,
254,
2109,
16,
625,
721,
8438,
13500,
13,
62,
8628,
26,
2741,
4434,
15,
17,
25,
48,
1345,
5773,
60,
109,
3259,
12360,
2101,
13,
57... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Events in C#
===
Just how much slower are events? I have written a streaming XML parser (that can handle open-ended and incomplete documents) and by tearing out the events and using an interface instead I got a significant speed boost.
Does any one else have any war stories?
(Let's not open the GC can of worms here, we all know it's broken :)) | 0 | [
2,
963,
19,
272,
5910,
800,
3726,
3726,
114,
184,
212,
14085,
50,
963,
60,
31,
57,
642,
21,
11920,
23504,
2017,
4104,
13,
5,
887,
92,
3053,
368,
8,
10726,
17,
14011,
4374,
6,
17,
34,
14788,
70,
14,
963,
17,
568,
40,
6573,
700,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
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... |
Sorting sets of ordered linked lists
===
I'm looking for an elegant, high performance solution to the following problem.
There are 256 linked lists.
- Each list contains the same types of object that among other things holds a whole number that is used to define a sort order.
- All numbers across all lists are unique
- Each individual list is sorted in ascending order by these numbers
How would you create a single ascending ordered list from all the objects from the 256 original linked lists? I'd prefer not to brute force it, and have a few other ideas, but this seems like one of those problems that there's a standard, optimal solution for.
| 0 | [
2,
2058,
68,
3415,
16,
1905,
4727,
7227,
800,
3726,
3726,
31,
22,
79,
699,
26,
40,
11614,
15,
183,
956,
4295,
20,
14,
249,
1448,
9,
80,
50,
13,
16910,
4727,
7227,
9,
13,
8,
206,
968,
1588,
14,
205,
2551,
16,
3095,
30,
497,
8... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
XMLTextReader in .NET 1.1
===
I have a process that reads an XML file. It uses the XMLTextReader class to do this as it is supposed to be a fast, forward only XML parser/reader.
Works just great with a 1 megabyte test file but comes to a complete halt when working on a 12 meg file in the live system.
Are there any solutions to this other than writing my own XML reader? That's not the end of the world but I would prefer to use available standard components if possible | 0 | [
2,
23504,
11969,
10647,
106,
19,
13,
9,
2328,
137,
9,
165,
800,
3726,
3726,
31,
57,
21,
953,
30,
11137,
40,
23504,
3893,
9,
32,
2027,
14,
23504,
11969,
10647,
106,
718,
20,
107,
48,
28,
32,
25,
2293,
20,
44,
21,
1512,
15,
917,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
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... |
Perforce trigger to deny submission of unchanged files?
===
I have a rather apathetic coworker who is constantly checking in unchanged files. Why any version control system would allow this is beyond me, but that's a topic for another question. I want to create a trigger that will deny the submission of unchanged files. However, I have no experience with Perforce triggers. From what I've read, I'm guessing this would be a "Change-content" trigger since the files being submitted would have to be diffed against the respective head revisions they are about to replace. I would need to iterate over the incoming files and make sure they had all indeed changed. The problem is, I have no idea how to go about it.
Can anyone with Perforce trigger experience offer an example or at least point me in the right direction? | 0 | [
2,
416,
8774,
7286,
20,
9258,
10923,
16,
18088,
6488,
60,
800,
3726,
3726,
31,
57,
21,
864,
21,
8353,
9329,
326,
22560,
72,
25,
7545,
9886,
19,
18088,
6488,
9,
483,
186,
615,
569,
329,
83,
1655,
48,
25,
1701,
55,
15,
47,
30,
2... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
What is a good Ruby on Rails hosting service?
===
I'm looking to deploy a new project I'm working on but need hosting. A managed server is overkill for me. I just need shared space.
I've looked at [SpeedyRails][1] and [RailsPlayground][2] and they both seem to have pros and cons. Does anyone have experience with either? Does anyone have a different recommendation?
[1]: http://www.speedyrails.com/
[2]: http://www.railsplayground.com/ | 0 | [
2,
98,
25,
21,
254,
10811,
27,
2240,
18,
10637,
365,
60,
800,
3726,
3726,
31,
22,
79,
699,
20,
17617,
21,
78,
669,
31,
22,
79,
638,
27,
47,
376,
10637,
9,
21,
1471,
8128,
25,
84,
7577,
26,
55,
9,
31,
114,
376,
2592,
726,
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... |
Avoid being blocked by web mail companies for mass/bulk emailing ?
===
Our company is sending out a lot of emails per day and planning to send even more in future. (thousands) Also there are mass mailouts as well in the ten thousands every now and then.
Anybody has experience with hotmail, yahoo (web.de, gmx.net) and similar webmail companies blocking your emails because "too many from the same source in a period of time" have been sent to them?
What can be done about it? Spreading email mailouts over a whole day/night? At what rate?
(we are talking about legal emailing just to make sure...) | 0 | [
2,
2658,
142,
8388,
34,
2741,
4216,
1532,
26,
1619,
118,
9077,
197,
8517,
68,
13,
60,
800,
3726,
3726,
318,
237,
25,
4907,
70,
21,
865,
16,
8517,
18,
416,
208,
17,
2334,
20,
2660,
166,
91,
19,
1022,
9,
13,
5,
27904,
18,
6,
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... |
C#, Get other application text from TextBox and TextArea?
===
Good morgning,
I would like to be able to analyze text where I am writting whatever the application I am. Example, If I am here, typing in this TextArea, I would like to be able to get the text, same way if I were in the Subject Textbox in my Outlook.
I have search Google without success, maybe it's because it require Win32API call.
The goal would be to start having fun with multiple algorithm like "Bloom Filter" and Markov Chain.
Is it possible with C# and how to start? | 0 | [
2,
272,
5910,
15,
164,
89,
3010,
1854,
37,
1854,
5309,
17,
1854,
17760,
60,
800,
3726,
3726,
254,
25824,
2981,
15,
31,
83,
101,
20,
44,
777,
20,
16051,
1854,
113,
31,
589,
20127,
1203,
2099,
14,
3010,
31,
589,
9,
823,
15,
100,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
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... |
JavaScript ClientSide vs. ServerSide Validation
===
Which is better to do client side or server side validation?
In our situation we are using
- jQuery and MVC.
- jSon data to pass between our View and Controller.
Alot of the validation I do is validating data as users enter it.
For example I use the the keypress event to prevent letters in a text box, set a max number of characters and that a number is with in a range.
I guess the better question would be, Are there any benefits to doing server side validation over client side?
| 0 | [
2,
8247,
8741,
6819,
1416,
4611,
9,
8128,
1416,
27999,
800,
3726,
3726,
56,
25,
574,
20,
107,
6819,
270,
54,
8128,
270,
27999,
60,
19,
318,
1858,
95,
50,
568,
13,
8,
487,
8190,
93,
17,
307,
8990,
9,
13,
8,
487,
528,
1054,
20,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Registering a COM server with WiX
===
I have been trying to determine a best case solution for registering a COM server using WiX to create a Windows Installer package and am struggling.
In this post <a href="http://blog.deploymentengineering.com/2008/09/howto-use-regsvr32exe-with-wix.html">http://blog.deploymentengineering.com/2008/09/howto-use-regsvr32exe-with-wix.html</a>
there is an open request for the "Setup police" to crack down on using regsvr32 through an exe custom action. I know the evils of using regsvr32 as it registers to the system rather than the user, but I also recall that OleSelfRegister can have issues from a microsoft support bulletin (sorry, can't find the link) - and I believe they recommended using regsvr32.
Any advice? | 0 | [
2,
2243,
68,
21,
13,
960,
8128,
29,
4807,
396,
800,
3726,
3726,
31,
57,
74,
749,
20,
3746,
21,
246,
610,
4295,
26,
2243,
68,
21,
13,
960,
8128,
568,
4807,
396,
20,
1600,
21,
1936,
16146,
106,
6030,
17,
589,
7587,
9,
19,
48,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
MySQL server goes away in XAMPP
===
I am trying to install xampp 1.6.7 in a Red Hat Enterprise Edition. I followed the installation instructions and after that I started the stack with the command
sudo /opt/lampp/lampp start
And I get te usual response
XAMPP: Starting Apache with SSL (and PHP5)...
XAMPP: Starting MySQL...
XAMPP: Starting ProFTPD...
XAMPP for Linux started.
But when I check the status of the components of the stack MySQL is not running, and I get:
Version: XAMPP for Linux 1.5.5
Apache is running.
MySQL is not running.
ProFTPD is running.
This not always happens immediatly. Some times MySQL runs for a little while before crashing. I checked the logs and found nothing.
Thanks in advance!! | 0 | [
2,
51,
18,
22402,
8128,
1852,
229,
19,
993,
765,
3421,
800,
3726,
3726,
31,
589,
749,
20,
16146,
993,
765,
3421,
137,
9,
379,
9,
465,
19,
21,
402,
2970,
6002,
1322,
9,
31,
709,
14,
7758,
7650,
17,
75,
30,
31,
373,
14,
7566,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Reading very large files in PHP
===
fopen is failing when I try to read in a very moderately sized file in PHP. A 6 meg file makes it choke, though smaller files around 100k are just fine. i've read that it is sometimes necessary to recompile PHP with the -D_FILE_OFFSET_BITS=64 flag in order to read files over 20 gigs or something ridiculous, but shouldn't I have no problems with a 6 meg file? Eventually we'll want to read in files that are around 100 megs, and it would be nice be able to open them and then read through them line by line with fgets as I'm able to do with smaller files.
What are your tricks/solutions for reading and doing operations on very large files in PHP? | 0 | [
2,
1876,
253,
370,
6488,
19,
13,
26120,
800,
3726,
3726,
398,
10157,
25,
7250,
76,
31,
1131,
20,
1302,
19,
21,
253,
20773,
13,
6560,
3893,
19,
13,
26120,
9,
21,
400,
10905,
3893,
1364,
32,
16105,
15,
362,
2012,
6488,
140,
808,
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 transfer data from one database to another with Hibernate?
===
I have an application A with a domain-model which is mapped to a database using Hibernate. I have another application B that uses exactly the same domain-model-classes as A and adds some additional classes.
My goal is to read data from database A in application B and transfer that data into the database of B (to make a copy of it). In addition, some the domain-classes of B have associations (OneToOne) to domain-classes of A (but in the database of B, of course).
What's the best strategy to accomplish this? I thought of two session factories and using <code>Session.replicate()</code> (how does that work?). Or should I better introduce an additional mapping layer between these two domain-models for loose coupling? | 0 | [
2,
184,
20,
2617,
1054,
37,
53,
6018,
20,
226,
29,
4148,
2102,
8820,
60,
800,
3726,
3726,
31,
57,
40,
3010,
21,
29,
21,
4603,
8,
13998,
56,
25,
20877,
20,
21,
6018,
568,
4148,
2102,
8820,
9,
31,
57,
226,
3010,
334,
30,
2027,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
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... |
Building a web crawler - using Webkit packages
===
I'm trying to build a web crawler.<br>
I need 2 things:<ul>
<li>Convert the HTML into a DOM object.</li>
<li>Execute existing Javascripts on demand.</li>
</ul>
First of all, I couldn't find a good documentation source.<br>
I searched through <a href="http://webkit.org/">Webkit Main Page</a> but couldn't find much information for users of the package, and no usefull code examples.<p/>
Also, in some forums I've seen instructions not to use the Webkit interface for crawlers, but directly the DOM and Javascript inner packages.<p/>
</p>
I'm searching for <b>Documentation</b> and <b>Code Examples</b>.<br>
Also, any recommendations on proper usage.<br>
<br>
Work environment:<ul>
<li>OS: Windows</li>
<li>Lang: C++</li>
</ul> | 0 | [
2,
353,
21,
2741,
12392,
106,
13,
8,
568,
2741,
13703,
16875,
800,
3726,
3726,
31,
22,
79,
749,
20,
1895,
21,
2741,
12392,
106,
9,
1,
5145,
1,
31,
376,
172,
564,
45,
1,
1287,
1,
13,
1,
1210,
1,
1126,
8122,
14,
13,
15895,
77,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
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 modify "static" after "import" mean?
===
like this:
import static com.showboy.Myclass;
public class Anotherclass{}
And what's the different between "import static com.showboy.Myclass" and "import com.showboy.Myckass"? | 0 | [
2,
98,
22,
18,
14,
17579,
13,
7,
18077,
7,
75,
13,
7,
1660,
1993,
7,
884,
60,
800,
3726,
3726,
101,
48,
45,
9010,
12038,
13,
960,
9,
9303,
5352,
9,
915,
1898,
73,
317,
718,
226,
1898,
1,
17,
98,
22,
18,
14,
421,
128,
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... |
Visual Studio 2008 - Add Reference
===
When adding a DLL as a reference to an ASP.Net project, VS2008 adds several files to the bin directory. If the DLL is called foo.dll, VS2008 adds foo.dll.refresh, foo.pdb and foo.xml. I know what foo.dll is :-), why does VS2008 add the other three files? What do those three files do? Can I delete them? Do they need to be added in source control? | 0 | [
2,
3458,
1120,
570,
13,
8,
3547,
2801,
800,
3726,
3726,
76,
4721,
21,
13,
43,
211,
28,
21,
2801,
20,
40,
28,
306,
9,
2328,
669,
15,
4611,
2753,
10621,
238,
6488,
20,
14,
4511,
16755,
9,
100,
14,
13,
43,
211,
25,
227,
4310,
1... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How does a "Schema changed after the target table was created" error occur?
===
I hit this error while my web application was trying to execute a SELECT INTO on a MSSQL 2005 database. I really have two questions:
1. What does this error mean and how does this happen?
2. Is there a way to prevent these errors by coding in a different way? | 0 | [
2,
184,
630,
21,
13,
7,
7526,
540,
1015,
75,
14,
2935,
859,
23,
679,
7,
7019,
3744,
60,
800,
3726,
3726,
31,
770,
48,
7019,
133,
51,
2741,
3010,
23,
749,
20,
15644,
21,
5407,
77,
27,
21,
4235,
18,
22402,
812,
6018,
9,
31,
51... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
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... |
Dataflow Programming API for Java?
===
I am looking for a Dataflow / Concurrent Programming API for Java.
I know there's [DataRush][1], but it's not free. What I'm interested in specifically is multicore data processing, and not distributed, which rules out [MapReduce][2] or [Hadoop][3].
Any thoughts?
Thanks,
Rollo
[1]: http://www.pervasivedatarush.com/
[2]: http://en.wikipedia.org/wiki/MapReduce
[3]: http://en.wikipedia.org/wiki/Hadoop | 0 | [
2,
1054,
9990,
3143,
21,
2159,
26,
8247,
60,
800,
3726,
3726,
31,
589,
699,
26,
21,
1054,
9990,
13,
118,
19513,
3143,
21,
2159,
26,
8247,
9,
31,
143,
80,
22,
18,
636,
18768,
15770,
500,
2558,
165,
500,
15,
47,
32,
22,
18,
52,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
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 preserve markup tags when using XSLT?
===
I've got an XML document containing news stories, and the body element of a news story contains p tags amongst the plain text. When I use XSL to retrieve the body, e.g.
<xsl:value-of select="body" />
the p tags seem to get stripped out. I'm using Visual Studio 2005's implementation of XSL.
Does anyone have any ideas how to avoid this? Thanks. | 0 | [
2,
184,
107,
31,
6224,
943,
576,
3383,
18,
76,
568,
993,
18,
255,
38,
60,
800,
3726,
3726,
31,
22,
195,
330,
40,
23504,
4492,
3503,
996,
1650,
15,
17,
14,
358,
4520,
16,
21,
996,
609,
1588,
351,
3383,
18,
4667,
14,
3748,
1854,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
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 development for the web
===
I'm looking to start developing for the web using Java - I have some basic Java knowledge, so that's not a problem, but I'm at a loss when it comes to deciphering the various technologies for use in web applications.
What options are available to me? How do they work? Are there any frameworks similar to Django/Ruby on Rails which I could use to simplify things?
Any links which could help with understanding what's available would be much appreciated. | 0 | [
2,
8247,
522,
26,
14,
2741,
800,
3726,
3726,
31,
22,
79,
699,
20,
799,
3561,
26,
14,
2741,
568,
8247,
13,
8,
31,
57,
109,
2125,
8247,
1918,
15,
86,
30,
22,
18,
52,
21,
1448,
15,
47,
31,
22,
79,
35,
21,
1526,
76,
32,
1624,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
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 the maximum number of allowed connections to an Oracle database?
===
What's the best way, using SQL, to check the maximum number of connections that is allowed for an Oracle database? In the end, I would like to show the current number of sessions and the total number allowed, e.g. "Currently, 23 out of 80 connections are used". | 0 | [
2,
184,
20,
2631,
14,
2979,
234,
16,
1159,
6760,
20,
40,
15759,
6018,
60,
800,
3726,
3726,
98,
22,
18,
14,
246,
161,
15,
568,
4444,
255,
15,
20,
2631,
14,
2979,
234,
16,
6760,
30,
25,
1159,
26,
40,
15759,
6018,
60,
19,
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... |
JQuery Facebox Plugin : Get it inside the form tag
===
I am wanting to use the Facebox plugin for JQuery but am having a few issues getting it running how I want. The div that houses the facebox content is created outside of the <form runat=server> tag so even though I am loading up some web controls none of them are firing back to the server.
Has anyone dealt with this that can give me some pointers? | 0 | [
2,
487,
8190,
93,
276,
5309,
10922,
108,
13,
45,
164,
32,
572,
14,
505,
3383,
800,
3726,
3726,
31,
589,
4638,
20,
275,
14,
276,
5309,
10922,
108,
26,
487,
8190,
93,
47,
589,
452,
21,
310,
1549,
1017,
32,
946,
184,
31,
259,
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 if a process is running via a batch script
===
How can I check if an application is running from a batch (well cmd) file?
I need to not launch another instance if a program is already running. (I can't change the app to make it single instance only.)
Also the application could be running as any user. | 0 | [
2,
184,
20,
2631,
100,
21,
953,
25,
946,
1197,
21,
13064,
3884,
800,
3726,
3726,
184,
92,
31,
2631,
100,
40,
3010,
25,
946,
37,
21,
13064,
13,
5,
854,
2390,
43,
6,
3893,
60,
31,
376,
20,
52,
3394,
226,
4851,
100,
21,
625,
25... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Font problems in charts (Reporting services 2008)
===
While generating charts using RS 2008 betas, RC0 and such., I never specified any fonts for axis labels, legends etc. They were all rendered with the Arial font by default, which looked awesome. But as soon as we switched to RS 2008 final, the fonts got all messed up - they are rendered in some kind of bold console font.
My initial thought was that the default changed - I tried setting the font to Arial explicitly (either through RDL or the designer). That didn't work - only certain fonts seem to work (e.g. Calibri). What's even more weird, the legend does not listen to the font setting - it is always rendered in this ugly bold thing.
One other thought was maybe the fonts are missing somewhere, however, the Tablix element is using the same fonts and they seem to work.
Here's a preview:
![alt text][1]
All the label fonts are set to Calibri here (including the legend).
This behaviour is universal - it is seen using the development studio preview, the report viewing control and while exporting it to all available formats.
So, obviously, I'm stuck - has anyone ever encountered this behaviour ?
[1]: http://files.sauliaus.info/badchart.jpg "Ugly font" | 0 | [
2,
9978,
1716,
19,
5158,
13,
5,
17437,
68,
687,
570,
6,
800,
3726,
3726,
133,
13500,
5158,
568,
13,
1224,
570,
8434,
18,
15,
16462,
387,
17,
145,
9,
15,
31,
243,
9931,
186,
9978,
18,
26,
8577,
13173,
15,
10089,
2722,
9,
59,
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... |
How to replay soap message?
===
I would like to replay soap message against my server. I've recorded a few messages and i've tampered with Timestamps, soapbodies etc and now I would like to see that my SecurityAssertions lites up like xmastrees. The deployed server will use clientcertificates and servercertifivcates for authentisation, and the whole messageflow will go encrypted with ssl. But I would still like to test the implementation with http and no authentication.
How would one do to replay a soapmessage? Is there any application around that can do this easy? | 0 | [
2,
184,
20,
13942,
6447,
2802,
60,
800,
3726,
3726,
31,
83,
101,
20,
13942,
6447,
2802,
149,
51,
8128,
9,
31,
22,
195,
801,
21,
310,
7561,
17,
31,
22,
195,
29129,
43,
29,
436,
4919,
1919,
15,
6447,
1192,
10139,
2722,
17,
130,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
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... |
RoR: Model validation question
===
I have a basic ActiveRecord model in which i have two fields that i would like to validate. The requirement is that at least one of the fields must have a value. Both can have values, but at least one needs a value.
How do i express this with
validates_presence_of
statements? For example:
validates_presence_of :main_file
validates_presence_of :alt_file
i don't want an error to be generated if only one of them is empty, only if both are empty. | 0 | [
2,
761,
248,
45,
1061,
27999,
1301,
800,
3726,
3726,
31,
57,
21,
2125,
1348,
14953,
1061,
19,
56,
31,
57,
81,
2861,
30,
31,
83,
101,
20,
7394,
1373,
9,
14,
8981,
25,
30,
35,
639,
53,
16,
14,
2861,
491,
57,
21,
1923,
9,
156,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
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... |
Convert Char[] to a list<byte> (c#)
===
How can I convert a Char[] (of any length) to a list < byte> ? | 0 | [
2,
8406,
4892,
2558,
500,
20,
21,
968,
1,
23246,
1,
13,
5,
150,
5910,
6,
800,
3726,
3726,
184,
92,
31,
8406,
21,
4892,
2558,
500,
13,
5,
1041,
186,
1476,
6,
20,
21,
968,
13,
1,
34,
591,
1,
13,
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... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
How do I Shutdown - Restart - Logoff via bat file
===
I've been using Remote Desktop to get into a workstation but I'm not able to use the shutdown/restart function in the Start menu while doing this.
I've put a few really helpful options in the answer below.
*As I cannot accept this answer, please vote up if you find it appropriate.* | 0 | [
2,
184,
107,
31,
28450,
13,
8,
22767,
13,
8,
6738,
1299,
1197,
3570,
3893,
800,
3726,
3726,
31,
22,
195,
74,
568,
5388,
17404,
20,
164,
77,
21,
170,
10839,
47,
31,
22,
79,
52,
777,
20,
275,
14,
28450,
118,
99,
13680,
1990,
19,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
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 launch a Windows process as 64-bit from 32-bit code?
===
To pop up the UAC dialog in Vista when writing to the HKLM registry hive, we opt to not use the Win32 Registry API, as when Vista permissions are lacking, we'd need to relaunch our entire application with administrator rights. Instead, we do this trick:
ShellExecute(hWnd, "runas" /* display UAC prompt on Vista */, windir + "\\Reg", "add HKLM\\Software\\Company\\KeyName /v valueName /t REG_MULTI_TZ /d ValueData", NULL, SW_HIDE);
This solution works fine, besides that our application is a 32-bit one, and it runs the REG.EXE command as it would be a 32-bit app using the WOW compatibility layer! :( If REG.EXE is ran from the command line, it's properly ran in 64-bit mode. This matters, because if it's ran as a 32-bit app, the registry keys will end up in the wrong place due to [registry reflection][1].
So is there any way to launch a 64-bit app programmatically from a 32-bit app and not have it run using the WOW64 subsystem like its parent 32-bit process (i.e. a "*" suffix in the Task Manager)?
[1]: http://msdn.microsoft.com/en-us/library/aa384235(VS.85).aspx | 0 | [
2,
184,
20,
3394,
21,
1936,
953,
28,
4384,
8,
3326,
37,
2512,
8,
3326,
1797,
60,
800,
3726,
3726,
20,
1675,
71,
14,
287,
1738,
28223,
19,
13520,
76,
1174,
20,
14,
13,
11321,
10363,
18269,
25535,
15,
95,
17034,
20,
52,
275,
14,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
what's the Spring's role in SSH?
===
what's the Spring act as role in Struts+Spring+Hibernate? | 0 | [
2,
98,
22,
18,
14,
1573,
22,
18,
597,
19,
13,
18,
1635,
60,
800,
3726,
3726,
98,
22,
18,
14,
1573,
601,
28,
597,
19,
18316,
18,
2430,
15827,
2430,
8630,
106,
8820,
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... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
How to add FK with connected users to the DB?
===
I use FB1.5.3 and need to eventually add some FK to the database.
It happens that if I try to do it while anyone else is connected to the DB I get an exception.
Is there a way to add an FK while the system is running?
| 0 | [
2,
184,
20,
3547,
15795,
29,
2587,
3878,
20,
14,
13,
9007,
60,
800,
3726,
3726,
31,
275,
13,
13478,
165,
9,
264,
9,
240,
17,
376,
20,
878,
3547,
109,
15795,
20,
14,
6018,
9,
32,
5531,
30,
100,
31,
1131,
20,
107,
32,
133,
127... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
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 Duplicate Delete Query over Millions of Rows for Performance
===
This has been an adventure. I started with the looping duplicate query [located in my previous question][1], but each loop would go over all **17 million records**...**meaning it would take weeks** (just running *select count * from MyTable* takes my server 4:30 minutes => mssql 2005). I gleamed information from this site and at this post:<br/>
> <a
> href="http://weblogs.sqlteam.com/jeffs/archive/2007/03/28/60146.aspx">http://weblogs.sqlteam.com/jeffs/archive/2007/03/28/60146.aspx</a>
And have arrived at the query below. The question is, is this the correct type of query to run on 17 million records for any type of performance? If it isn't, what is?
SQL QUERY:
DELETE tl_acxiomimport.dbo.tblacxiomlistings
WHERE RecordID in
(SELECT RecordID
FROM tl_acxiomimport.dbo.tblacxiomlistings
EXCEPT
SELECT RecordID
FROM (
SELECT RecordID, Rank() over (Partition BY BusinessName, latitude, longitude, Phone ORDER BY webaddress DESC, caption1 DESC, caption2 DESC ) AS Rank
FROM tl_acxiomimport.dbo.tblacxiomlistings
) al WHERE Rank = 1)
[1]: http://stackoverflow.com/questions/161960/sql-server-query-question-if-i-stop-a-long-running-query-does-it-rollback | 0 | [
2,
4444,
255,
19429,
27448,
25597,
84,
11999,
16,
11295,
26,
956,
800,
3726,
3726,
48,
63,
74,
40,
5270,
9,
31,
373,
29,
14,
5293,
68,
19429,
25597,
636,
18215,
19,
51,
1158,
1301,
500,
2558,
165,
500,
15,
47,
206,
5293,
83,
162... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
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 the checked option in a group of radio inputs with JavaScript?
===
How to get the checked option in a group of radio inputs with JavaScript? | 0 | [
2,
184,
20,
164,
14,
6505,
4255,
19,
21,
214,
16,
603,
6367,
18,
29,
8247,
8741,
60,
800,
3726,
3726,
184,
20,
164,
14,
6505,
4255,
19,
21,
214,
16,
603,
6367,
18,
29,
8247,
8741,
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,
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... |
Finding the default application for opening a particular file type on Windows
===
I'm developing an application targeting .NET Framework 2.0 using C# for which I need to be able to find the default application that is used for opening a particular file type.
I know that, for example, if you just want to open a file using that application you can use something like:
System.Diagnostics.Process.Start( "C:\...\...\myfile.html" );
to open an HTML document in the default browser, or
System.Diagnostics.Process.Start( "C:\...\...\myfile.txt" );
to open a text file in the default text editor.
However, what I want to be able to do is to open files that don't necessarily have a *.txt* extension (for example), in the default text editor, so I need to be able to find out the default application for opening *.txt* files, which will allow me to invoke it directly.
I'm guessing there's some Win32 API that I'll need to P/Invoke in order to do this, however a quick look with both Google and MSDN didn't reveal anything of much interest; I did find a very large number of completely irrelevant pages, but nothing like I'm looking for. If anyone knows which API/methods I should be using I'd be very happy to hear from you.
Many thanks,
Bart | 0 | [
2,
3007,
14,
12838,
3010,
26,
1214,
21,
1498,
3893,
1001,
27,
1936,
800,
3726,
3726,
31,
22,
79,
3561,
40,
3010,
15972,
13,
9,
2328,
6596,
172,
9,
387,
568,
272,
5910,
26,
56,
31,
376,
20,
44,
777,
20,
477,
14,
12838,
3010,
30... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
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 wrong with DateTime.Parse(myString)?
===
I was browsing Scott Hanselman's [Developer Interview question list][1], and ran across this question:
> What is wrong with
> DateTime.Parse(myString)?
While I know there are inherent risks in parsing a string of unknow format or origin, are there other reasons? Is it to use DateTime.ParseExact instead? Should it be myString.ToString() first?
[1]: http://www.hanselman.com/blog/WhatGreatNETDevelopersOughtToKnowMoreNETInterviewQuestions.aspx | 0 | [
2,
98,
25,
1389,
29,
1231,
891,
9,
3574,
870,
5,
915,
11130,
6,
60,
800,
3726,
3726,
31,
23,
10175,
68,
1824,
4800,
19965,
22,
18,
636,
26051,
106,
2421,
1301,
968,
500,
2558,
165,
500,
15,
17,
717,
464,
48,
1301,
45,
13,
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... |
With WinDbg, can I modify an item in memory while a process is running?
===
Can I, using an address found in a map file, use windbg to alter a variable in memory while the app is running?
I'm really interested in turning on/off functionality in run-time maybe with a variable.
How would you do this? | 0 | [
2,
29,
1511,
19924,
15,
92,
31,
17579,
40,
9101,
19,
1912,
133,
21,
953,
25,
946,
60,
800,
3726,
3726,
92,
31,
15,
568,
40,
3218,
216,
19,
21,
2942,
3893,
15,
275,
1511,
19924,
20,
7835,
21,
7612,
19,
1912,
133,
14,
4865,
25,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How Do You Evaluate Software Development Products and Technologies?
===
We are often in the position of making decisions about which operating systems, programming languages, third-party libraries, and other tools to use while developing systems. This is often a guessing game, as you often can't know how good a fit a particular tool will be until after you have developed the system.
What are the things that are most important to consider while choosing development technologies?
----
Highly-rated answers will be summarized here:
* Value - Does it really solve a problem for you? Is buying it preferable to making something similar yourself?
* Product maturity - How long has it been around? How many other systems have been implemented using it?
* Vendor maturity - How long has the vendor been around? Do they have a good track record? Can you expect the product to be supported for as long as you will need it?
* Support
* Openness - Is it based on open standards? Are compatible products available from multiple vendors? Is the source available? Can you customize it for your purposes?
* Training - How long will it take for developers to learn to use the tool or technology effectively?
* Skill availability - Can you hire people who know how to use the tool?
* Price - Can you afford it? Is it a one-time cost, or ongoing? How do you factor in all the associated costs (training, hiring, support, etc.) | 0 | [
2,
184,
107,
42,
13,
15599,
2306,
522,
1985,
17,
5740,
60,
800,
3726,
3726,
95,
50,
478,
19,
14,
649,
16,
544,
6003,
88,
56,
2455,
1242,
15,
3143,
2556,
15,
422,
8,
9635,
8649,
15,
17,
89,
4672,
20,
275,
133,
3561,
1242,
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... |
Is there any way to create a patch for an ASP.Net web application installer?
===
Is it possible to create patch installers for web deployment installers generated in VS2005?
I have a situation in which it is undesirable to perform a complete uninstall/reinstall of a web site, but in which periodic bug fixes and minor upgrades are made.
I've tried following the instructions in various online posts about using msimsp.exe to generate a patch file, but most/all of them rely on some usage of msiexec.exe to create an administrative install for comparison, since msimsp.exe can't cope with compressed content (e.g. CAB files). Web installations don't really have an administrative install, however, and ultimately the patch creation fails.
Of course, I can create an installer containing *just* the changed files by hand, but that's prone to error, and having an automated process is more desirable.
Any help is appreciated. | 0 | [
2,
25,
80,
186,
161,
20,
1600,
21,
7331,
26,
40,
28,
306,
9,
2328,
2741,
3010,
16146,
106,
60,
800,
3726,
3726,
25,
32,
938,
20,
1600,
7331,
16146,
445,
26,
2741,
10475,
16146,
445,
6756,
19,
4611,
2835,
60,
31,
57,
21,
1858,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
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... |
Streaming audio to a browser
===
I have a large amount of audio stored on my web server in a very custom format that can't be replayed by anything other than my own application. That application is a Win32 app that can connect to my web server and stream and replay that audio.
I'd really like to be able to do the streaming and replaying from within a browser, but don't know where to start. Ideally I'd like the technology to be cross-platform (unlike my current Win32 app) and cross-browser (IE 6 and above and Firefox).
My current thoughts are to look at things like:
- Flash, but doesn't that only replay mp3 audio?
- Java, are VMs freely available still?
- Converting the audio to a WAV file on the web server and then using someone else's plugin to replay that file. I'd rather keep the conversion off the web server for performance reasons, but is still an option.
- Writing my own custom plugin to do the complete stream and replay operation.
Any guidance would be most useful.
| 0 | [
2,
11920,
4023,
20,
21,
16495,
800,
3726,
3726,
31,
57,
21,
370,
2006,
16,
4023,
8214,
27,
51,
2741,
8128,
19,
21,
253,
5816,
2595,
30,
92,
22,
38,
44,
13942,
69,
34,
602,
89,
119,
51,
258,
3010,
9,
30,
3010,
25,
21,
628,
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... |
Web Sevices authentication - best practices?
===
We have SOAP web services in production that are relying on SOAP Headers (containing plain client credentials) for the authentication. The WS are used in heterogeneous environments with .NET/Java/PHP/Python/C++ clients both web app or desktop app.
We are considering a v2 for those WS andI am wondering what are considered as the *best practices* for WS SOAP authentication? (reasonably secure, yet easy to handle on a wide variety of platforms). | 0 | [
2,
2741,
1353,
18507,
18,
27963,
13,
8,
246,
5242,
60,
800,
3726,
3726,
95,
57,
6447,
2741,
687,
19,
637,
30,
50,
21760,
27,
6447,
157,
445,
13,
5,
26425,
3748,
6819,
5059,
43,
10107,
18,
6,
26,
14,
27963,
9,
14,
619,
18,
50,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
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 count query
===
Hi why doesn't this work in SQL Server 2005?
select HALID, count(HALID) as CH from Outages.FaultsInOutages
where CH > 3
group by HALID
I get invalid column name 'CH' | 0 | [
2,
4444,
255,
2468,
25597,
800,
3726,
3726,
4148,
483,
1437,
22,
38,
48,
170,
19,
4444,
255,
8128,
812,
60,
5407,
3557,
1340,
15,
2468,
5,
15643,
43,
6,
28,
6193,
37,
70,
14465,
9,
410,
9708,
18,
108,
1320,
14465,
113,
6193,
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,
0,
0,
0... |
Whats the point of @import?
===
Can someone explain what the benefits of using the @import syntax are, over just including css using the standard link method? Thanks. | 0 | [
2,
98,
18,
14,
454,
16,
13,
1,
1660,
1993,
60,
800,
3726,
3726,
92,
737,
3271,
98,
14,
5800,
16,
568,
14,
13,
1,
1660,
1993,
22649,
50,
15,
84,
114,
215,
272,
18,
18,
568,
14,
1236,
3508,
2109,
60,
3669,
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... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
With Rails, where should I put html snippets? I don't want partials but I want them reloaded during development.
===
Being lazy (and liking DRY code), I'm the kind of guy who's going to write a few little wrappers for recurring HTML markup. Those provided by Rails are good already, but sometimes you have something a little more specific that I know I'm going to repeat over and over.
In some situations a partial can be the solution, but sometimes I'm just going to call the snippet way too often to justify the overhead of using partials.
Right now I create a helper/html_helper.rb file and stick them in there. The problem is that helpers are not reloaded dynamically per request during development. So each time I tweak my snippet or the code around it, I have to kill the server and restart it.
Granted, it's just a 5 seconds process, but I love Rails' convenience of just developing and then refreshing the browser. So I'd love to have that for my markup snippets as well.
Note: Just sticking 'unloadable' inside the helper module doesn't work. | 0 | [
2,
29,
2240,
18,
15,
113,
378,
31,
442,
13,
15895,
13,
29061,
18,
60,
31,
221,
22,
38,
259,
7284,
18,
47,
31,
259,
105,
27339,
69,
112,
522,
9,
800,
3726,
3726,
142,
16792,
13,
5,
290,
19007,
2273,
1797,
6,
15,
31,
22,
79,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
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... |
Track started applications in Windows
===
We're trying to put together kiosk solution where we can charge people by hour for applications they use. As such, we need a way to figure out when an application is started, when it is closed and log this information for billing. I am a reasonably experienced .NET programmer so a managed code solution would be great. I have also dabbled in Windows API a little bit so that might work too. Any ideas out there? | 0 | [
2,
792,
373,
3767,
19,
1936,
800,
3726,
3726,
95,
22,
99,
749,
20,
442,
429,
28092,
4295,
113,
95,
92,
1906,
148,
34,
1671,
26,
3767,
59,
275,
9,
28,
145,
15,
95,
376,
21,
161,
20,
1465,
70,
76,
40,
3010,
25,
373,
15,
76,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How to know the real size of a web page?
===
I wan't to know the real size of a web page (HTML + CSS + Javascript + Images + etc.) but from the browser side, maybe with a software, Firefox Add-On or similar? | 0 | [
2,
184,
20,
143,
14,
683,
1072,
16,
21,
2741,
2478,
60,
800,
3726,
3726,
31,
10685,
22,
38,
20,
143,
14,
683,
1072,
16,
21,
2741,
2478,
13,
5,
15895,
2754,
272,
18,
18,
2754,
8247,
8741,
2754,
3502,
2754,
2722,
9,
6,
47,
37,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
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 Join question
===
I have 3 tables
1. <b>Links</b><br/>
Link ID<br/>
Link Name<br/>
GroupID (FK into Groups)<br/>
SubGroupID (FK into Subgroups)<br/>
<br/>
2. <b>Groups</b><br/>
GroupID<br/>
GroupName<br/>
3. <b>SubGroup</b><br/>
SubGroupID<br/>
SubGroupName<br/>
GroupID (FK into Groups)<br/>
Every link needs to have a GroupID but teh SubGroupID is optional. How do i write a SQL query to show: <br/>
<b>Links.LinkName, Groups.GroupName, SubGroup.SubGroupName<br/></b>
For the records with no subgroup just put a blank entry in that field. If i have 250 link rows, i should get back 250 reecords from this query.
Is there a way to do this in one query or do i need to do multiple queries?
thks,
ak | 0 | [
2,
4444,
255,
1865,
1301,
800,
3726,
3726,
31,
57,
203,
7484,
137,
9,
13,
1,
220,
1,
6258,
18,
1,
118,
220,
1,
5145,
118,
1,
3508,
4924,
1,
5145,
118,
1,
3508,
204,
1,
5145,
118,
1,
214,
1340,
13,
5,
410,
197,
77,
1170,
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... |
Const in C
===
Quick question:
int testfunc1 (const int a)
{
return a;
}
int testfunc2 (int const a)
{
return a;
}
Are these two functions the same in every aspect or is there a difference? I'm interested in an answer for the C-language, but if there is something interested in the C++ case I'd like to know as well. | 0 | [
2,
11608,
38,
19,
272,
800,
3726,
3726,
2231,
1301,
45,
19,
38,
1289,
16638,
150,
165,
13,
5,
12124,
38,
19,
38,
21,
6,
13,
1,
788,
21,
73,
13,
1,
19,
38,
1289,
16638,
150,
135,
13,
5,
6391,
11608,
38,
21,
6,
13,
1,
788,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
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... |
Asking to see employer's code/database in an interview
===
I've been asked to write code/design things in an interview. Sometimes even to provide code samples. Very reasonable and very wise (always surprised when this DOESN'T happen)
I had a job a year or so back where the code was so awful that I would not have taken the job, if I'd seen the mess I had to deal with ahead of time. And I can't tell you how many horrendous databases I've had to work with.
Is it out of the question for me to ask **them** to provide a code sample and to view their database design? Assuming I'd be happy to sign an NDA, part of me feels it would insane to take a job without examining the codebase or database I'd be working with.
Anyone done this? | 0 | [
2,
3379,
20,
196,
11726,
22,
18,
1797,
118,
18768,
8436,
19,
40,
2421,
800,
3726,
3726,
31,
22,
195,
74,
411,
20,
2757,
1797,
118,
19862,
564,
19,
40,
2421,
9,
1030,
166,
20,
1181,
1797,
7855,
9,
253,
9954,
17,
253,
6714,
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... |
Spring MVC Form tags: Is there a standard way to add "No selection" item?
===
There is a select dropdown and I want to add "No selection" item to the list wich should give me 'null' when submitted.
I'm using SimpleFormController derived controller.
protected Map referenceData(HttpServletRequest httpServletRequest, Object o, Errors errors) throws Exception {
Map<String, Object> map = new HashMap<String, Object>();
map.put("countryList", Arrays.asList(Country.values()));
return map;
}
And the jspx part is
<form:select path="country" items="${countryList}" title="country"/>
One possible solution seems to be in adding a null value to the beginning of the list and then using a custom PropertyEditor to disply this 'null' as 'No selection'.
Is there a better solution?
| 0 | [
2,
1573,
307,
8990,
505,
3383,
18,
45,
25,
80,
21,
1236,
161,
20,
3547,
13,
7,
251,
3155,
7,
9101,
60,
800,
3726,
3726,
80,
25,
21,
5407,
2804,
2968,
17,
31,
259,
20,
3547,
13,
7,
251,
3155,
7,
9101,
20,
14,
968,
13,
13583,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
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 script diagrams in SQL 2000 (or save them another way)?
===
It's possible to create digrams in SQL Server 2000 that can be useful to show the relationships between tables. The problem we run into is that when somebody refreshes our development database, the diagrams get lost. We can load tables, stored procedures, views, etc. with SQL scripts, but we have to create the diagrams by hand.
Is there a way to script out the diagrams? Or can they be saved outside of the database some other way? | 0 | [
2,
25,
80,
21,
161,
20,
3884,
14161,
18,
19,
4444,
255,
824,
13,
5,
248,
2079,
105,
226,
161,
6,
60,
800,
3726,
3726,
32,
22,
18,
938,
20,
1600,
926,
6295,
18,
19,
4444,
255,
8128,
824,
30,
92,
44,
4811,
20,
298,
14,
5833,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
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 fashionable programming language in academia?
===
When I was last at university the language de-jour for projects was Java. I was wondering if this is still the case.
Last I checked my university had switched to teaching Python as it's first language and from what I can see python seems to be gaining popularity among the "We need to make something quickly" crowd.
Haskel was also the main functional programming language at my old university is it still a big hitter of has it been supplanted by something else?
What languages should somone who is considdering going back into academia watch out for? | 0 | [
2,
98,
25,
14,
23006,
3143,
816,
19,
19450,
60,
800,
3726,
3726,
76,
31,
23,
236,
35,
155,
14,
816,
121,
8,
13901,
26,
2314,
23,
8247,
9,
31,
23,
5712,
100,
48,
25,
174,
14,
610,
9,
236,
31,
6505,
51,
155,
41,
6667,
20,
25... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Mock IIdentity and IPrincipal
===
I just wanna ask what would be better approach to supply these objects in my unit tests.
In my unit test I am testing CSLA object. CSLA object is internally using one property and one method of ApplicationUser object. ApplicationUser is inherited from IPrincipal.
The properties are:
1) ApplicationContext.User.IsInRole(...) - the method is part of IPrincipal
2) ApplicationContext.User.Identity.Name - the name is property of IIdentity which is part of ApplicationUser aka IPricipal
Example of my test (using RhinoMock):
public void BeforeTest()
{
mocks = new MockRepository();
IPrincipal mockPrincipal = mocks.CreateMock<IPrincipal>();
ApplicationContext.User = mockPrincipal;
using (mocks.Record()) {
Expect.Call(mockPrincipal.IsInRole(Roles.ROLE_MAN_PERSON)).Return(true);
Expect.Call(mockPrincipal.Identity.Name).Return("ju"); //doesn't work!!!! return null ref exc
}
}
I have slight problem with second value, the identity name. I tried to mock it but have problem to assign mocked IIdentity to ApplicationUser, as it is done internaly.
I was told to just create some IIPrincipal (including IIdentity) by myself and not to mock it at all. Which can be done for sure. Not sure if this can be called as Stub using?
So can you advice me how to deal with IPrincipal and IIdentity? Any suggestion most welcome.
| 0 | [
2,
10506,
31,
13384,
856,
17,
31,
27921,
800,
3726,
3726,
31,
114,
11024,
1349,
98,
83,
44,
574,
2141,
20,
2837,
158,
3916,
19,
51,
1237,
4894,
9,
19,
51,
1237,
1289,
31,
589,
4431,
272,
18,
531,
3095,
9,
272,
18,
531,
3095,
2... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
What is the difference between "global::System" and "System" in .NET?
===
I just upgraded a VS 2005 project to VS 2008 and was examining the changes. I noticed one of the .Desinger.cs files had changed significantly. The majority of the changes were simply replacements of *System* with *global::System*. For example,
protected override System.Data.DataTable CreateInstance()
became
protected override global::System.Data.DataTable CreateInstance()
What's going on here? | 0 | [
2,
98,
25,
14,
2841,
128,
13,
7,
26763,
45,
45,
10724,
7,
17,
13,
7,
10724,
7,
19,
13,
9,
2328,
60,
800,
3726,
3726,
31,
114,
9958,
21,
4611,
812,
669,
20,
4611,
570,
17,
23,
14470,
14,
1693,
9,
31,
2711,
53,
16,
14,
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... |
Performing AJAX delete operations restfully in rails
===
How do you perform delete and put operations restfully in rails? I have read the documentation and thought I was doing everything properly, but I can't seem to get it to work.
For example, if I wanted to delete an employee I would create a controller called "EmployeesController" and create a destroy method to perform the delete.
Then I went into the routes.rb file and entered `map.resources :employees`, which gives you access to the URL helper functions.
In whatever I want to call the Ajax operation from, I should just have a line like:
<%= link_to_remote "Delete", employee_path(@employee), :method => :delete %>
When I click on the link, it is still is sending a POST operation, so it does nothing.
What am I missing or doing wrong? | 0 | [
2,
2955,
20624,
27448,
1311,
760,
5655,
19,
2240,
18,
800,
3726,
3726,
184,
107,
42,
2985,
27448,
17,
442,
1311,
760,
5655,
19,
2240,
18,
60,
31,
57,
1302,
14,
13945,
17,
289,
31,
23,
845,
796,
7428,
15,
47,
31,
92,
22,
38,
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... |
How to find unused/dead code in java projects
===
What tools do you use to find unused/dead code in large java projects? Our product has been in development for some years, and it is getting very hard to manually detect code that is no longer in use. We do however try to delete as much unused code as possible.
Suggestions for general strategies/techniques (other than specific tools) are also appreciated. | 0 | [
2,
184,
20,
477,
18927,
118,
14260,
1797,
19,
8247,
2314,
800,
3726,
3726,
98,
4672,
107,
42,
275,
20,
477,
18927,
118,
14260,
1797,
19,
370,
8247,
2314,
60,
318,
2374,
63,
74,
19,
522,
26,
109,
122,
15,
17,
32,
25,
1017,
253,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
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... |
Utilizing Java API from a Cobol program
===
We have some COBOL programs running on our mainframe and we need one of those to communicate with out back end vault through a Java API. Is there any way a Cobol program can invoke the Java program?
Would it be possible to use a Web Service from Cobol? How would I integrate a Cobol program with anything else? | 0 | [
2,
19894,
8247,
21,
2159,
37,
21,
326,
6966,
625,
800,
3726,
3726,
95,
57,
109,
326,
6966,
1726,
946,
27,
318,
407,
8361,
17,
95,
376,
53,
16,
273,
20,
8709,
29,
70,
97,
241,
8654,
120,
21,
8247,
21,
2159,
9,
25,
80,
186,
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... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.