unified_texts stringlengths 32 30.1k | OpenStatus_id int64 0 4 | input_ids list | token_type_ids list | attention_mask list |
|---|---|---|---|---|
Best way to store tags in a sql server table?
===
What's the best way to store tags for a record? Just use a varchar field? What about when selecting rows that contains tag x? Use the like operator?
thanks! | 0 | [
2,
246,
161,
20,
1718,
3383,
18,
19,
21,
4444,
255,
8128,
859,
60,
800,
3726,
3726,
98,
22,
18,
14,
246,
161,
20,
1718,
3383,
18,
26,
21,
571,
60,
114,
275,
21,
4033,
5433,
575,
60,
98,
88,
76,
20764,
11295,
30,
1588,
3383,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
Algorithm to estimate number of English translation words from Japanese source
===
I'm trying to come up with a way to estimate the number of English words a translation from Japanese will turn into. Japanese has three main scripts -- [Kanji][1], [Hiragana][2], and [Katakana][3] -- and each has a different average character-to-word ratio (Kanji being the lowest, Katakana the highest).
**Examples:**
- computer: コンピュータ (Katakana - 6
characters); 計算機 (Kanji: 3
characters)
- whale: くじら (Hiragana --
3 characters); 鯨 (Kanji: 1
character)
As data, I have a large glossary of Japanese words and their English translations, and a fairly large corpus of matched Japanese source documents and their English translations. I want to come up with a formula that will count numbers of Kanji, Hiragana, and Katakana characters in a source text, and estimate the number of English words this is likely to turn into.
[1]: http://en.wikipedia.org/wiki/Kanji
[2]: http://en.wikipedia.org/wiki/Hiragana
[3]: http://en.wikipedia.org/wiki/Katakana | 0 | [
2,
9083,
20,
10243,
234,
16,
486,
4064,
715,
37,
1095,
1267,
800,
3726,
3726,
31,
22,
79,
749,
20,
340,
71,
29,
21,
161,
20,
10243,
14,
234,
16,
486,
715,
21,
4064,
37,
1095,
129,
805,
77,
9,
1095,
63,
132,
407,
17505,
13,
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... |
Mounting NTFS filesystem on CentOS 5.2
===
I want to mount some internal and external NTFS drives in CentOS 5.2, preferably automatically upon boot-up. Doesn't matter if it's read/write or read-only, but read/write would be preferred, if it's safe. | 0 | [
2,
17022,
13,
2877,
11754,
3893,
10724,
27,
5802,
759,
331,
9,
135,
800,
3726,
3726,
31,
259,
20,
2149,
109,
3117,
17,
4886,
13,
2877,
11754,
10396,
19,
5802,
759,
331,
9,
135,
15,
6369,
4801,
7499,
685,
6801,
8,
576,
9,
1437,
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 could make Erlang more popular and widespread?
===
I want to know what you think could make Erlang a "popular" and widely used language. For example, could it be more libraries, better IDE, a killer app, a five minute install, more grassroots community, a scalable RDBMS, etc...? | 0 | [
2,
98,
110,
233,
13,
106,
9949,
91,
844,
17,
6025,
60,
800,
3726,
3726,
31,
259,
20,
143,
98,
42,
277,
110,
233,
13,
106,
9949,
21,
13,
7,
28252,
7,
17,
2525,
147,
816,
9,
26,
823,
15,
110,
32,
44,
91,
8649,
15,
574,
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... |
How do small software patches correct big software?
===
One thing I've always wondered about is how software patches work. A lot of software seems to just release new versions on their binaries that need to be installed over older versions, but some software (operating systems like Windows in particular) seem to be able to release very small patches that correct bugs or add functionality to existing software.
Most of the time the patches I see can't possibly replace entire applications, or even small files that are used within applications. To me it seems like the actual binary is being modified.
How are these kinds of patches actually implemented? Could anyone point me to any resources that explain how this works, or is it just as simple as replacing small components such as linked libraries in an application?
I'll probably never need to do a deployment in this manner, but I am curious to find out how it works. If I'm correct in my understanding that patches can really modify only portions of binary files, is this possible to do in .NET? If it is I'd like to learn it since that's the framework I'm most familiar with and I'd like to understand how it works. | 0 | [
2,
184,
107,
284,
2306,
16359,
4456,
580,
2306,
60,
800,
3726,
3726,
53,
584,
31,
22,
195,
550,
3519,
88,
25,
184,
2306,
16359,
170,
9,
21,
865,
16,
2306,
2206,
20,
114,
830,
78,
3281,
27,
66,
4511,
11301,
30,
376,
20,
44,
406... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Change the value of a text box to its current order in a sortable table
===
I have set up a nice sortable table with jQuery and it is quite nice. But now i want to extend it.
Each table row has a text box, and i want i am after is to, every time a row is dropped, the text boxes update to reflect the order of the text boxes. **E.g. The text box up the top always has the value of '1', the second is always '2' and so on.**
I am using jQuery and the [Table Drag and Drop JQuery plugin](http://www.isocra.com/2008/02/table-drag-and-drop-jquery-plugin/)
[Here](http://massiveatom.com/sandbox/js/sortable.html) is the live example of the code.
And some extracts:
js:
<script type="text/javascript">
$(document).ready(function() {
$("#table-2").tableDnD({
onDrop: function(table, row) {
var rows = table.tBodies[0].rows;
var debugStr = "Order: ";
for (var i=0; i<rows.length; i++) {
debugStr += rows[i].id+", ";
}
console.log(debugStr)
document.forms['productform'].sort1.value = debugStr;
document.forms['productform'].sort2.value = debugStr;
document.forms['productform'].sort3.value = debugStr;
document.forms['productform'].sort4.value = debugStr;
},
});
});
</script>
the table:
<form name="productform">
<table cellspacing="0" id="table-2" name="productform">
<thead>
<tr><td>Product</td> <td>Order</td></tr>
</thead>
<tbody>
<tr class="row1" id="Pol"> <td><a href="1/">Pol</a></td> <td><input type="textbox" name="sort1"/></td> </tr>
<tr class="row2" id="Evo"> <td><a href="2/">Evo</a></td> <td><input type="textbox" name="sort2"/></td> </tr>
<tr class="row3" id="Kal"> <td><a href="3/">Kal</a></td> <td><input type="textbox" name="sort3"/></td> </tr>
<tr class="row4" id="Lok"> <td><a href="4/">Lok</a></td> <td><input type="textbox" name="sort4"/></td> </tr>
</tbody>
</table>
</form>
| 0 | [
2,
753,
14,
1923,
16,
21,
1854,
1649,
20,
82,
866,
389,
19,
21,
2058,
579,
859,
800,
3726,
3726,
31,
57,
309,
71,
21,
2210,
2058,
579,
859,
29,
487,
8190,
93,
17,
32,
25,
1450,
2210,
9,
47,
130,
31,
259,
20,
7206,
32,
9,
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... |
Collaboration desktop sharing - Multiple Mouse
===
I'm using Windows Xp and i'm looking for a software where I can see the screen of a remote desktop and be able to show a second mouse (or pointer of any sort) that I can mouse to just show something.
I want to work with a peer over the net, pretty much like the XP programming method. I find it useful, but it's pretty hard over the internet to do such thing.
I don't want to control the computer, but it would be a plus. All I want is to see the remote desktop and have my pointer (or marker) to point to a line of code that need to be changed or something like.
Do you know any software like this ? | 0 | [
2,
4004,
17404,
6126,
13,
8,
1886,
7567,
800,
3726,
3726,
31,
22,
79,
568,
1936,
23045,
17,
31,
22,
79,
699,
26,
21,
2306,
113,
31,
92,
196,
14,
2324,
16,
21,
5388,
17404,
17,
44,
777,
20,
298,
21,
153,
7567,
13,
5,
248,
454... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 free software for creating windows help files for your program?
===
Is there a free software for creating windows help files for your program?
I would like something that allows an output of both CHM and HTML files. | 0 | [
2,
25,
80,
21,
551,
2306,
26,
2936,
1936,
448,
6488,
26,
154,
625,
60,
800,
3726,
3726,
25,
80,
21,
551,
2306,
26,
2936,
1936,
448,
6488,
26,
154,
625,
60,
31,
83,
101,
301,
30,
2965,
40,
5196,
16,
156,
6193,
79,
17,
13,
158... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
Any experience with compiling VB script
===
I have a home-spun 2000 line VB script, that has become progressively slow with each additional code i add. It was created as a private debugging aid and now that it has becomes really useful, i want to polish it and ship it along with our product.
I thought i could speed it up by compiling it and making it an exe and further i want to have a user interface for my tool, which might be possible once i use the extra libraries that the compiling platform might give me. I'm also considering extending the script by calling win32 functions for whatever missing functionalities i require.
I have VB 6.0 or i can buy an external compiler. But i also need the created program (not the compiler itself) to run fine in Vista. What are my best options? | 0 | [
2,
186,
1496,
29,
24378,
13,
20468,
3884,
800,
3726,
3726,
31,
57,
21,
213,
8,
18,
13562,
824,
293,
13,
20468,
3884,
15,
30,
63,
533,
22799,
2276,
29,
206,
1351,
1797,
31,
3547,
9,
32,
23,
679,
28,
21,
932,
121,
16254,
2762,
3... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
What is "Total Funcational Programming"?
===
[Wikipedia][1] has this to say:
> Total functional programming (also
> known as strong functional
> programming, to be contrasted with
> ordinary, or weak functional
> programming) is a programming paradigm
> which restricts the range of programs
> to those which are provably
> terminating.
and
> These restrictions mean that total
> functional programming is not
> Turing-complete. However, the set of
> algorithms which can be used is still
> huge. For example, any algorithm which
> has had an asymptotic upper bound
> calculated for it can be trivially
> transformed into a
> provably-terminating function by using
> the upper bound as an extra argument
> which is decremented upon each
> iteration or recursion.
There is also a Lambda The Ultimate Post about a paper on [Total Functional Programming][2].
I hadn't come across that until last week on a mailing list.
Are there any more resources, references or any example implementations that you know of?
[1]: http://en.wikipedia.org/wiki/Total_functional_programming
[2]: http://lambda-the-ultimate.org/node/2003 | 0 | [
2,
98,
25,
13,
7,
20148,
2414,
16893,
192,
3143,
7,
60,
800,
3726,
3726,
636,
17375,
26132,
500,
2558,
165,
500,
63,
48,
20,
395,
45,
13,
1,
600,
7652,
3143,
13,
5,
2573,
13,
1,
167,
28,
966,
7652,
13,
1,
3143,
15,
20,
44,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
HTTP communication monitoring on OS X
===
What application do you use to monitor HTTP communication on OS X?
| 0 | [
2,
7775,
3291,
8984,
27,
13,
759,
993,
800,
3726,
3726,
98,
3010,
107,
42,
275,
20,
7626,
7775,
3291,
27,
13,
759,
993,
60,
3,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
Calling C/C++ from python?
===
What would be the quickest way to construct a python binding to a C or C++ library?
(using windows if this matters)
| 0 | [
2,
2555,
272,
118,
150,
20512,
37,
20059,
60,
800,
3726,
3726,
98,
83,
44,
14,
2231,
1430,
161,
20,
6960,
21,
20059,
8728,
20,
21,
272,
54,
272,
20512,
1248,
60,
13,
5,
12655,
1936,
100,
48,
4556,
6,
3,
0,
0,
0,
0,
0,
0,
0... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
Is Lambda Probe dead?
===
Besides the tool not being updated for over a year, the website has been down for days. Does anyone know where to get the source or if the project will be moved to a community repository?
Background: Lambda Probe is a useful tool for viewing stats on a running tomcat server. It used to be found at http://www.lambdaprobe.org.
| 0 | [
2,
25,
13,
24187,
13044,
828,
60,
800,
3726,
3726,
3410,
14,
5607,
52,
142,
6372,
26,
84,
21,
159,
15,
14,
2271,
63,
74,
125,
26,
509,
9,
630,
1276,
143,
113,
20,
164,
14,
1267,
54,
100,
14,
669,
129,
44,
385,
20,
21,
514,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
In what ways can you get your free software project some exposure?
===
In what way can you get your free software project some exposure?
Please do not assume that the project is open source. | 0 | [
2,
19,
98,
2847,
92,
42,
164,
154,
551,
2306,
669,
109,
6587,
60,
800,
3726,
3726,
19,
98,
161,
92,
42,
164,
154,
551,
2306,
669,
109,
6587,
60,
2247,
107,
52,
7158,
30,
14,
669,
25,
368,
1267,
9,
3,
0,
0,
0,
0,
0,
0,
0,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
Smart home in Emacs
===
Can you have smart behavior for the home key in Emacs? By smart I mean that instead of going to the character number 0, it should go to the first non-blank character, and go to 0 on a second pressing, and back to the first non-blank in a third and so on.
Having smart end would be nice as well. | 0 | [
2,
3978,
213,
19,
13,
62,
6893,
18,
800,
3726,
3726,
92,
42,
57,
3978,
3257,
26,
14,
213,
1246,
19,
13,
62,
6893,
18,
60,
34,
3978,
31,
884,
30,
700,
16,
228,
20,
14,
925,
234,
713,
15,
32,
378,
162,
20,
14,
64,
538,
8,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How to set OS X Terminal's default home?
===
For some reason after I installed Boot Camp, my os x terminal started to point to the Boot Camp drive instead of my os x home directory by default! Once in the terminal I know how to switch back an forth and am able to do that, but I was wondering how to make my terminal default back to my os x home folder?
I've checked my Home Directory under System Preferences->Accounts->Control-click on my account and it is pointing to the right place. I've also tried unmounting it with no luck. | 0 | [
2,
184,
20,
309,
13,
759,
993,
3855,
22,
18,
12838,
213,
60,
800,
3726,
3726,
26,
109,
1215,
75,
31,
4066,
6801,
1232,
15,
51,
13,
759,
993,
3855,
373,
20,
454,
20,
14,
6801,
1232,
1493,
700,
16,
51,
13,
759,
993,
213,
16755,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
WebFocus - is there a free/open source alternative?
===
What is a good free/open source alternative to [WebFOCUS][1]?
Is there an ASP.NET way of getting info from an OLAP cube?
[1]: http://en.wikipedia.org/wiki/WebFOCUS | 0 | [
2,
2741,
23371,
13,
8,
25,
80,
21,
551,
118,
10157,
1267,
2676,
60,
800,
3726,
3726,
98,
25,
21,
254,
551,
118,
10157,
1267,
2676,
20,
636,
14113,
23371,
500,
2558,
165,
500,
60,
25,
80,
40,
28,
306,
9,
2328,
161,
16,
1017,
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... |
What's a Windows text editor that matches this criteria ...
===
My Situation: I love [e editor](http://www.e-texteditor.com), however I'm on a new computer and my license is being used on my old one. I can't exactly afford another license, so I'm looking for a free editor that meets the follow criteria:
* Decent syntax highlighting
* Ability to view a directory and its contents on the side panel, *without* the need to create it as a 'project' **(Very Important)**
* Easily themable (I like dark themes)
* Tabs
Also would be nice:
* S/FTP support
* Code snippets/bundles
* Multi-line editing
And is not (*Simply listed because they're common suggestions, but I've tried and not found them to meet my criteria*):
* Vim/Emacs
* Notepad++
* Crimson/Emerald Editor
* Programmer's Notepad
* Wordpad/Notepad :P
Thanks. Oh, and as a reference, here's a picture of my current setup: [Link](http://screencast.com/t/ftyoxrg05v) | 0 | [
2,
98,
22,
18,
21,
1936,
1854,
1835,
30,
1717,
48,
9157,
13,
9,
9,
9,
800,
3726,
3726,
51,
1858,
45,
31,
339,
636,
62,
1835,
500,
5,
21127,
6903,
6483,
9,
62,
8,
11969,
13401,
9,
960,
6,
15,
207,
31,
22,
79,
27,
21,
78,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 brighten the colors in the rxvt family of terminals?
===
I know how to lighten the colors for certain commands, however I'd like to lighten the standard ansi colors across all commands. | 0 | [
2,
184,
107,
31,
2673,
219,
14,
5268,
19,
14,
13,
21141,
710,
38,
190,
16,
3855,
18,
60,
800,
3726,
3726,
31,
143,
184,
20,
471,
219,
14,
5268,
26,
1200,
14294,
15,
207,
31,
22,
43,
101,
20,
471,
219,
14,
1236,
40,
18,
49,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
Checking if array is multidimensional or not?
===
What is the most efficient way to check if an array is a flat array of primitive values or if it is a multidimensional array? Is there any way to do this without actually looping through an array and running is_array() on each of its elements? | 0 | [
2,
9886,
100,
7718,
25,
1889,
7865,
54,
52,
60,
800,
3726,
3726,
98,
25,
14,
127,
8243,
161,
20,
2631,
100,
40,
7718,
25,
21,
1844,
7718,
16,
11473,
4070,
54,
100,
32,
25,
21,
1889,
7865,
7718,
60,
25,
80,
186,
161,
20,
107,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Adding custom log locations to the OS X console application...
===
After searching online, the best solution I've found so far is to just make a symbolic link in either "/Library/logs/" or "~/Library/logs/" to get it to show up in the Console application.
I'm wondering if it would be possible to add a new directory or log file to the "root" level directly under the "LOG FILES" section in the console.
Here's a quick screenshot:
![OS X Console][1]
[1]: http://www.nickawilliams.com/images/misc/osxconsole.png | 0 | [
2,
4721,
5816,
6738,
4095,
20,
14,
13,
759,
993,
8650,
3010,
9,
9,
9,
800,
3726,
3726,
75,
5792,
2087,
15,
14,
246,
4295,
31,
22,
195,
216,
86,
463,
25,
20,
114,
233,
21,
12882,
3508,
19,
694,
13,
7,
118,
1210,
2559,
622,
11... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Debugging SharePoint 2007 Code
===
How do you test your SharePoint 2007 code? Since SharePoint runs on a remote server, and I'm developing on a windows xp machine (with the necessary .dll files copied into my GAC), I haven't had much luck with finding easy ways to debug. Breakpoints don't work, etc.
The best way I've come up with is to enable page tracing in the web.config file, write trace messages throughout my code, and access trace.axd whenever I need to test.
Does anyone have any better suggestions for debugging? Am I missing something? | 0 | [
2,
121,
16254,
2762,
1891,
3132,
624,
1797,
800,
3726,
3726,
184,
107,
42,
1289,
154,
1891,
3132,
624,
1797,
60,
179,
1891,
3132,
1461,
27,
21,
5388,
8128,
15,
17,
31,
22,
79,
3561,
27,
21,
1936,
23045,
1940,
13,
5,
1410,
14,
23... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How do you pass an object to a windsor container instead of a type?
===
I have the following class:
public class ViewPage<TView,TPresenter> : Page
where TView : IView
where TPresenter : Presenter<TView>
{
public ViewPage()
{
if (!(this is TView))
throw new Exception(String.Format("The view must be of type {0}", typeof(TView)));
IWindsorContainer container = new WindsorContainer();
container.AddComponent("view", typeof(IView), typeof(TView));
container.AddComponent("presenter", typeof(Presenter<TView>), typeof(TPresenter));
TPresenter presenter = container[typeof(TPresenter)] as TPresenter;
}
}
and this is the Presenter code:
public class Presenter<T> where T : IView
{
public T View { get; private set; }
public Presenter(T view)
{
this.View = view;
}
}
I'd like to pass the current instance of ViewPage to TPresenter via Windsor instead of having it instantiate a new object. Is this possible? | 0 | [
2,
184,
107,
42,
1477,
40,
3095,
20,
21,
10784,
12147,
700,
16,
21,
1001,
60,
800,
3726,
3726,
31,
57,
14,
249,
718,
45,
317,
718,
1418,
6486,
1,
38,
4725,
15,
38,
3914,
106,
1,
13,
45,
2478,
113,
13,
38,
4725,
13,
45,
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... |
Whats the default intellisense shortcut in vs2008?
===
I'd like to open the intelligence window without typing a character and then backspacing it. I can't seem to remember the shortcut for this. What is it?
thnx | 0 | [
2,
98,
18,
14,
12838,
14635,
3159,
6498,
502,
4118,
19,
4611,
2753,
60,
800,
3726,
3726,
31,
22,
43,
101,
20,
368,
14,
2872,
1463,
366,
25266,
21,
925,
17,
94,
97,
18,
10055,
68,
32,
9,
31,
92,
22,
38,
2260,
20,
1518,
14,
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,
0,
0,
0,
0... |
PHP's SPL: Do its interfaces involving arrays cover all array properties?
===
Would it be possible to write a class that is virtually indistinguishable from an actual PHP array by implementing all the necessary SPL interfaces? Are they missing anything that would be critical?
I'd like to build a more advanced Array object, but I want to make sure I wouldn't break an existing app that uses arrays everywhere if I substituted them with a custom Array class. | 0 | [
2,
13,
26120,
22,
18,
11202,
45,
107,
82,
6573,
18,
4838,
7718,
18,
1227,
65,
7718,
3704,
60,
800,
3726,
3726,
83,
32,
44,
938,
20,
2757,
21,
718,
30,
25,
9149,
19,
25502,
37,
40,
3463,
13,
26120,
7718,
34,
17333,
65,
14,
2378... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 connect & administer SQL Server database remotely through internet?
===
How do I connect to SQL Server remotely and administer my datbase objects? I need to connect to my database in the web hosting company's server. I have the server name, ip address, my database username & password. I have an installation of SQL server 2000 in my machine. I searched the net but couldnt find understandable links. Can I use SQL server Enterprise Manager for this? A step by step info will help a lot. Thanks... | 0 | [
2,
184,
20,
6379,
279,
14839,
4444,
255,
8128,
6018,
23288,
120,
2620,
60,
800,
3726,
3726,
184,
107,
31,
6379,
20,
4444,
255,
8128,
23288,
17,
14839,
51,
1331,
38,
8436,
3916,
60,
31,
376,
20,
6379,
20,
51,
6018,
19,
14,
2741,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
for-loop mechanisem efficiency tips
===
As I am using for-loops on large multi-dim arrays, any saving on the for-loop mechanisem itself is meaningful.
accordingly am looking for any tips on how to reduce this overhead.
| 0 | [
2,
26,
8,
18786,
55,
3606,
2628,
79,
7836,
11034,
800,
3726,
3726,
28,
31,
589,
568,
26,
8,
18786,
18,
27,
370,
1889,
8,
14160,
7718,
18,
15,
186,
7599,
27,
14,
26,
8,
18786,
55,
3606,
2628,
79,
1145,
25,
16912,
9,
12932,
589,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
How do I dictate the destination folder of a clickOnce application?
===
How do I dictate the destination folder of a clickOnce application? | 0 | [
2,
184,
107,
31,
25250,
14,
6970,
19294,
16,
21,
10840,
13120,
3010,
60,
800,
3726,
3726,
184,
107,
31,
25250,
14,
6970,
19294,
16,
21,
10840,
13120,
3010,
60,
3,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
Peformance Analysis
===
Can anyone recommend some useful performance analysis tools for PHP scripts? Anything that could help me find problematic or unusually slow blocks of code, details about execution time, etc. would be really helpful. I know there are tools out there, but I'm wondering what people recommend as being the most useful and well-designed. | 4 | [
2,
3560,
4190,
2416,
2495,
800,
3726,
3726,
92,
1276,
12360,
109,
4811,
956,
2495,
4672,
26,
13,
26120,
17505,
60,
602,
30,
110,
448,
55,
477,
21070,
54,
15200,
2276,
5198,
16,
1797,
15,
3289,
88,
5769,
85,
15,
2722,
9,
83,
44,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 performance difference in using .resx file and satellite assembly?
===
Which is the best way to go forward while building a localized aspx web application, .resx files of satellite assemblies? Is there any performance comparisons available any where on web? | 0 | [
2,
25,
80,
186,
956,
2841,
19,
568,
13,
9,
99,
18,
396,
3893,
17,
4958,
1475,
60,
800,
3726,
3726,
56,
25,
14,
246,
161,
20,
162,
917,
133,
353,
21,
24821,
28,
306,
396,
2741,
3010,
15,
13,
9,
99,
18,
396,
6488,
16,
4958,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
Deploy a Desktop Shortcut to a Device running Windows CE 4.2 (VS2005)
===
I have an application written using VS2005 in C# targeting the Compact Framework 2.0 SP2. As part of the solution, I have CAB deploy project which deploys to the device without a problem. What I can't do is create a shortcut to my application on the devices desktop.
I have spent several hours reading various bits of documentation (why is the search at the MSDN site so bad?), followed the instructions but no joy.
What I've done is:
- Add the "Windows Folder" node to the File System
- Created a folder underneath that named "Desktop"
- Created a shortcut to the Applications Primary Output and placed that in the "Desktop" folder
What am I missing?
| 0 | [
2,
17617,
21,
17404,
502,
4118,
20,
21,
3646,
946,
1936,
4000,
268,
9,
135,
13,
5,
710,
18,
2835,
6,
800,
3726,
3726,
31,
57,
40,
3010,
642,
568,
4611,
2835,
19,
272,
5910,
15972,
14,
8285,
6596,
172,
9,
387,
3782,
135,
9,
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... |
Multiple repositories, single setup
===
If I use multiple repositories, all located under a single root folder, how can I set it up so that they will use a single master svnconf/passwd file for setup but still allow me to customize each if the need arises?
This is on windows but I guess the process would be similar on other systems. | 0 | [
2,
1886,
302,
14882,
262,
2829,
15,
345,
18161,
800,
3726,
3726,
100,
31,
275,
1886,
302,
14882,
262,
2829,
15,
65,
335,
131,
21,
345,
5900,
19294,
15,
184,
92,
31,
309,
32,
71,
86,
30,
59,
129,
275,
21,
345,
1129,
13,
18,
165... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Easy way to embed svn revision number in page in PHP?
===
Notice in the bottom right hand corner of this page it has the SVN revision id? I'm assuming that's dynamic.
I'd love to add that to some of my sites, just as a comment in the source to make sure code pushes are going through.
NOTE: You can also assume that the working directory of the site in question is an svn checkout of the repo in question. | 0 | [
2,
2010,
161,
20,
11911,
69,
13,
18,
16578,
11323,
234,
19,
2478,
19,
13,
26120,
60,
800,
3726,
3726,
3551,
19,
14,
2129,
193,
224,
1531,
16,
48,
2478,
32,
63,
14,
13,
18,
16578,
11323,
4924,
60,
31,
22,
79,
11704,
30,
22,
18,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Why Stackoverflow binds user actions dynamically with javascript?
===
Checking the HTML source of a question I see for instance:
<a id="comments-link-xxxxx" class="comments-link">add comment</a><noscript> JavaScript is needed to access comments.</noscript>
And then in the javascript source:
// Setup our click events..
$().ready(function() {
$("a[id^='comments-link-']").click(function() { comments.show($(this).attr("id").substr("comments-link-".length)); });
});
It seems that all the user click events are binded this way.
The downsides of this approach are obvious for people browsing the site with no javascript but, what are the advantages of adding events dynamically whith javascript over declaring them directly? | 0 | [
2,
483,
7566,
2549,
9990,
10193,
18,
4155,
3078,
7782,
1326,
29,
8247,
8741,
60,
800,
3726,
3726,
9886,
14,
13,
15895,
1267,
16,
21,
1301,
31,
196,
26,
4851,
45,
13,
1,
58,
4924,
3726,
7,
960,
6601,
8,
6258,
8,
8962,
13290,
7,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Looking for up-to-date eclipse plugin for C#
===
I used to work with eclipse for nearly all the languages I need. I'm asked to work on a tool developped in C# and so, I would like to stay in the same familiar environnment.
I've found the [improve's plugin](http://www.improve-technologies.com/alpha/esharp/) nut its last release if from 2004 and .NET 1.1 which is quite old. Is there a newer plugin to program in C# whithin eclipse or am I forced to take a look at VS? | 0 | [
2,
699,
26,
71,
8,
262,
8,
8209,
11652,
10922,
108,
26,
272,
5910,
800,
3726,
3726,
31,
147,
20,
170,
29,
11652,
26,
1212,
65,
14,
2556,
31,
376,
9,
31,
22,
79,
411,
20,
170,
27,
21,
5607,
2803,
3631,
19,
272,
5910,
17,
86,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Should I stick with the ReportViewer control or buy a third party tool?
===
we need reports in our web application and there is the free ReportViewer Control from microsoft (normally used, to display reports from the reporting services). I like the fact, that the Report Format (.RDL-Format) from the ReportViewer is a documented XML-Format. But the functionality is somewhat limited, when the ReportViewer is used without the ReportingServices.
Is there a good replacement, which is based or compatible with the .RDL-Format?
The first Reports are build in the application, but later, the customer should make his reports by himself.
| 0 | [
2,
378,
31,
5258,
29,
14,
1330,
4725,
106,
569,
54,
3034,
21,
422,
346,
5607,
60,
800,
3726,
3726,
95,
376,
2813,
19,
318,
2741,
3010,
17,
80,
25,
14,
551,
1330,
4725,
106,
569,
37,
7099,
13,
5,
17462,
102,
147,
15,
20,
3042,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Merge several DLLs into one DLL
===
I've got a lot of small DLLs which I would like to make into one big(er) DLL (as [suggested here](http://stackoverflow.com/questions/127029/comparing-cold-start-to-warm-start#129090)). I can do so by merging my projects but I would like a less intrusive way.
Can several DLLs be merged into one unit?
A quick search found [this thread](http://social.msdn.microsoft.com/Forums/en-US/vcgeneral/thread/22fed4ab-a3f8-4d5f-be03-6d5e7dc3db01/) that claims this is not possible. Does anyone know otherwise?
*Note that I'm talking about native C++ code not .NET so ILMerge is out.* | 0 | [
2,
12666,
238,
13,
43,
211,
18,
77,
53,
13,
43,
211,
800,
3726,
3726,
31,
22,
195,
330,
21,
865,
16,
284,
13,
43,
211,
18,
56,
31,
83,
101,
20,
233,
77,
53,
580,
5,
106,
6,
13,
43,
211,
13,
5,
472,
636,
18,
21606,
1430,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Do you think a software company should impose developers a coding-style?
===
If you think it shouldn't, explain why.
If yes, how deep should the guidelines be in your opinion? For example, indentation of code should be included?
| 4 | [
2,
107,
42,
277,
21,
2306,
237,
378,
18009,
10168,
21,
13,
15458,
8,
4381,
60,
800,
3726,
3726,
100,
42,
277,
32,
5714,
22,
38,
15,
3271,
483,
9,
100,
1643,
15,
184,
855,
378,
14,
12629,
44,
19,
154,
4052,
60,
26,
823,
15,
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,
0,
0,
0,
0,
0,
0,
0,
0... |
Why does "abcd".StartsWith("") return true?
===
Title is the entire question. Can someone give me a reason why this happens? | 0 | [
2,
483,
630,
13,
7,
21880,
43,
7,
9,
13680,
18,
1410,
5,
7,
7,
6,
788,
1151,
60,
800,
3726,
3726,
581,
25,
14,
1078,
1301,
9,
92,
737,
590,
55,
21,
1215,
483,
48,
5531,
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,
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... |
System.Web.HttpContextWrapper2 error in sutekishop - MVC 3
===
I am currently try to use the [sutekishop .Net CMS product][1] but am getting the error
"Could not load type 'System.Web.HttpContextWrapper2'..."
Is this an MVC assembly mismatch? i have uninstalled mvc 5 and installed 3 (required according to the set up) but am still getting the issues.
Any ideas?
Rhys
Full error:
Could not load type 'System.Web.HttpContextWrapper2' from assembly 'System.Web.Abstractions, Version=3.5.0.0, Culture=neutral, PublicKeyToken=31bf3856ad364e35'.
[TypeLoadException: Could not load type 'System.Web.HttpContextWrapper2' from assembly 'System.Web.Abstractions, Version=3.5.0.0, Culture=neutral, PublicKeyToken=31bf3856ad364e35'.]
System.Web.Mvc.MvcHandler.ProcessRequest(HttpContext httpContext) +0
System.Web.Mvc.MvcHandler.System.Web.IHttpHandler.ProcessRequest(HttpContext httpContext) +36
System.Web.CallHandlerExecutionStep.System.Web.HttpApplication.IExecutionStep.Execute() +181
System.Web.HttpApplication.ExecuteStep(IExecutionStep step, Boolean& completedSynchronously) +75
[1]: http://code.google.com/p/sutekishop/ | 0 | [
2,
329,
9,
14113,
9,
21127,
1126,
11969,
499,
525,
8763,
135,
7019,
19,
21006,
10803,
18,
5347,
13,
8,
307,
8990,
203,
800,
3726,
3726,
31,
589,
871,
1131,
20,
275,
14,
636,
18,
6567,
1520,
18,
5347,
13,
9,
2328,
2390,
18,
2374,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
A universal reflections API?
===
Some time back I was working on an algorithm that processed code, and required a reflections API. We were interested in its implementation for multiple languages, but the reflections API for a language would not work for any other language. So is there any thing like a "universal reflections API" that would work for all languages, or maybe for a few mainstream languages (.NET,Java,Ruby,Python) | 0 | [
2,
21,
4172,
20498,
21,
2159,
60,
800,
3726,
3726,
109,
85,
97,
31,
23,
638,
27,
40,
9083,
30,
16697,
1797,
15,
17,
1390,
21,
20498,
21,
2159,
9,
95,
46,
3158,
19,
82,
6123,
26,
1886,
2556,
15,
47,
14,
20498,
21,
2159,
26,
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 count which number occurs maximum in a set of numbers ?
===
Suppose we have a vector/array in C++, we wish to count which of these N elements has maximum repetitive occurrences... which algorithm is best suited for this job?
example :
int a={2,456,34,3456,2,435,2,456,2}
the output is 4 becuase 2 occurs 4 times that is the maximum number of times 2 occurs.
| 0 | [
2,
184,
20,
2468,
56,
234,
3690,
2979,
19,
21,
309,
16,
2116,
13,
60,
800,
3726,
3726,
5787,
95,
57,
21,
7497,
118,
8576,
93,
19,
272,
20512,
15,
95,
2536,
20,
2468,
56,
16,
158,
13,
103,
2065,
63,
2979,
24935,
12933,
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... |
Free set of forms, icons, styles, etc for web-based admin interfaces
===
Is there any free set of forms, icons, styles, images, etc for building web-based admin interfaces? If yes, which is the best? | 0 | [
2,
551,
309,
16,
1997,
15,
9801,
18,
15,
6443,
15,
2722,
26,
2741,
8,
1281,
21,
43,
2160,
6573,
18,
800,
3726,
3726,
25,
80,
186,
551,
309,
16,
1997,
15,
9801,
18,
15,
6443,
15,
3502,
15,
2722,
26,
353,
2741,
8,
1281,
21,
43... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
What existing style and coding standard documents should be used on a C++ project?
===
The following have been proposed for an upcoming C++ project.
- C++ Coding Standard, by Sutter and Alexandrescu
- JSF Air Vehicle C++ coding standards
- The Elements of C++ Style
- Effective C++ 3rd Edition, by Eric Meyer
Are there other choices? Or these the documents that should used? | 0 | [
2,
98,
3149,
1034,
17,
13,
15458,
1236,
4374,
378,
44,
147,
27,
21,
272,
20512,
669,
60,
800,
3726,
3726,
14,
249,
57,
74,
2097,
26,
40,
9078,
272,
20512,
669,
9,
13,
8,
272,
20512,
13,
15458,
1236,
15,
34,
13,
18,
13274,
17,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Creating, opening and printing a word file from C++
===
I have three related questions.
I want to create a word file with a name from C++. I want to be able to sent the printing command to this file, so that the file is being printed without the user having to open the document and do it manually and I want to be able to open the document. Opening the document should just open word which then opens the file.
| 0 | [
2,
2936,
15,
1214,
17,
7312,
21,
833,
3893,
37,
272,
20512,
800,
3726,
3726,
31,
57,
132,
1597,
2346,
9,
31,
259,
20,
1600,
21,
833,
3893,
29,
21,
204,
37,
272,
20512,
9,
31,
259,
20,
44,
777,
20,
795,
14,
7312,
1202,
20,
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... |
What continous integration tool is best for a C++ project?
===
Cruisecontrol and Hudson are two popular continuous integration systems. Although both systems are able to do the automated continuous builds nicely, it just seems a lot easier to create a batch or bash build script, then use Windows scheduler or cron to schedule builds.
Are there better continuous integration systems available for C++ projects? Or is just using a script and a scheduler the simpler way? | 0 | [
2,
98,
13,
13391,
1291,
8078,
5607,
25,
246,
26,
21,
272,
20512,
669,
60,
800,
3726,
3726,
6581,
12898,
17,
6195,
50,
81,
844,
6357,
8078,
1242,
9,
419,
156,
1242,
50,
777,
20,
107,
14,
14904,
6357,
1895,
18,
24050,
15,
32,
114,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Text difference algorithm
===
I need an algorithm that can compare two text files and highlight their difference and ( even better!) can compute their difference in a meaningful way ( meaning, two similar files should have a similarity score higher than two dissimilar file, with the word similar defined in the normal terms). It sounds easy to implement, but it's not.
The implementation can be in c# or python, thanks | 0 | [
2,
1854,
2841,
9083,
800,
3726,
3726,
31,
376,
40,
9083,
30,
92,
11590,
81,
1854,
6488,
17,
14373,
66,
2841,
17,
13,
5,
166,
574,
187,
6,
92,
23909,
66,
2841,
19,
21,
16912,
161,
13,
5,
1813,
15,
81,
835,
6488,
378,
57,
21,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
What is the best practice when having a terminate clause...see explanation :)
===
The case goes as following:
You have a Boolean property called FullScreenEnabled. You enter some method, and the code within this method is executed iff FullScreenEnabled is true. Which of the 2 approaches bellow do you use in your everyday programming:
<a href="http://img219.imageshack.us/my.php?image=92149485zf7.jpg" target="_blank"><img src="http://img219.imageshack.us/img219/1387/92149485zf7.th.jpg" border="0" /></a>
http://img219.imageshack.us/my.php?image=92149485zf7.jpg
Thanks for the response!
--k | 0 | [
2,
98,
25,
14,
246,
1345,
76,
452,
21,
17952,
9040,
9,
9,
9,
1798,
5764,
13,
45,
6,
800,
3726,
3726,
14,
610,
1852,
28,
249,
45,
42,
57,
21,
9827,
413,
210,
1354,
227,
503,
7187,
219,
579,
43,
9,
42,
2830,
109,
2109,
15,
1... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
What are some recommendations for porting C++ code to the MacOS?
===
For a upcoming project, there are plans to port the existing C++ code that compiles on Windows and Linux to the MacOS(leopard). The MacOS uses the g++ compiler. By having the same compiler as Linux, it does not seem like there would be any issues, but there always are.
Are there any recommendations or problems to watch out for during the port? | 0 | [
2,
98,
50,
109,
12121,
26,
1295,
68,
272,
20512,
1797,
20,
14,
1572,
759,
60,
800,
3726,
3726,
26,
21,
9078,
669,
15,
80,
50,
1753,
20,
1295,
14,
3149,
272,
20512,
1797,
30,
26561,
18,
27,
1936,
17,
13024,
20,
14,
1572,
759,
5... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Deploying database for ASP .NET Website
===
I was just browsing through questions on stack overflow, and i've come up to a post where it suggests of deploying database by simply copying the mdf file in the app_data folder and modifying your connection string.
I know that some people do create an mdf file in the app_code during development, but for going life, Is this realy a viable way and a good practice to deploy your database?
What I usualy do during development time is to have written my own sql script file to build the database, and run it on my local sql server. When site is about to go life I ran the script on the target server and set my site to talk to the database. To be honest I've never utilize the app_code folder for storing the database, I usually use it to store my data access layer logic..
Am I doing the wrong thing here? Is it really a good practice to utilize the app_data folder to store your database? One problem that I can see with this method is that, deployment going to be slow. Transfering mdf file accross the internet will definately be much slower than running my sql script files. Looking forwards to hear your thoughts and experience on this matters. Cheers.
RWendi | 0 | [
2,
17617,
68,
6018,
26,
28,
306,
13,
9,
2328,
2271,
800,
3726,
3726,
31,
23,
114,
10175,
68,
120,
2346,
27,
7566,
20285,
15,
17,
31,
22,
195,
340,
71,
20,
21,
678,
113,
32,
5049,
16,
17617,
68,
6018,
34,
1659,
4344,
68,
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... |
How to properly setup a multi module SpringMVC application created by appfuse in Eclipse?
===
I am trying to setup a multi module SpringMVC appfuse applicaiton in Eclipse but it seems that I'm facing lots of errors in Eclipse after I import the project in Eclipse. Can anyone please help me with a step by step guideline showing the ideal way to setup such application in Eclipse? | 0 | [
2,
184,
20,
7428,
18161,
21,
1889,
12613,
1573,
79,
8990,
3010,
679,
34,
4865,
13072,
19,
11652,
60,
800,
3726,
3726,
31,
589,
749,
20,
18161,
21,
1889,
12613,
1573,
79,
8990,
4865,
13072,
4865,
16904,
49,
444,
19,
11652,
47,
32,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How to compare two PDF files?
===
I need to compare large count of PDF files for it optical content. Because the PDF files was created on different platforms and with different versions of the software there are structural differences. For example:
- the chunking of text can be different
- the write order can be different
- the position can be differ some pixels
It should compare the content like a human people and not the internal structure. I want test for regressions between different versions of the PDF generator that we used. | 4 | [
2,
184,
20,
11590,
81,
13,
11124,
6488,
60,
800,
3726,
3726,
31,
376,
20,
11590,
370,
2468,
16,
13,
11124,
6488,
26,
32,
9445,
2331,
9,
185,
14,
13,
11124,
6488,
23,
679,
27,
421,
6843,
17,
29,
421,
3281,
16,
14,
2306,
80,
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... |
Why are the people in the industry who have not heard of Stackoverflow, jQuery, Twitter, Csla, DntTV etc?
===
Being a passionate developer I'm sometimes amazing when people in the industry have not heard about key technologies / news stories / new sites / Development Podcasts etc.
Does not reading RSS feeds, listening to podcasts, following key Twitter users indicate that a person is not passionate about their occupation and therefore not the best that they can be. Would you hire such a person? | 4 | [
2,
483,
50,
14,
148,
19,
14,
1230,
72,
57,
52,
752,
16,
7566,
2549,
9990,
15,
487,
8190,
93,
15,
10623,
15,
272,
18,
531,
15,
13,
43,
2877,
1709,
2722,
60,
800,
3726,
3726,
142,
21,
12637,
10058,
31,
22,
79,
1030,
5289,
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 approach something complex?
===
You know that particular part of your code that is essential for the project but will probably take a lot of time to get it done? Do you ever get the feeling that you'd rather work on something else (probably less important) or not code at all instead of working on that part? That beast you try so hard to avoid and use every lazy trick you know to delay its inevitable implementation?
Now, I'm probably just being lazy, but I've always had to deal with code like that. Write something I don't feel like writing (and it's worse if you're doing it for fun and not getting paid!). A large system that will take a lot of time to get it into a stage where you get back any useful results or indication of it working. How do you start coding something like that? Most people would probably suggest divide and conquer and similar architectural techniques, but this isn't about how you do it; it's about how you get yourself started on doing it. What's the very first steps you'd take? | 0 | [
2,
184,
20,
2141,
301,
1502,
60,
800,
3726,
3726,
42,
143,
30,
1498,
141,
16,
154,
1797,
30,
25,
5832,
26,
14,
669,
47,
129,
910,
247,
21,
865,
16,
85,
20,
164,
32,
677,
60,
107,
42,
462,
164,
14,
1249,
30,
42,
22,
43,
864... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Relational Database Design Patterns?
===
Design patterns are usually related to object oriented design. **Are there [design patterns][1] for creating and programming [relational databases][2]?** Many problems surely must have reusable solutions.
Examples would include patterns for table design, stored procedures, triggers, etc...
Is there an online repository of such patterns, similar to [martinfowler.com][3]?
[1]: en.wikipedia.org/wiki/Design_pattern_(computer_science)
[2]: http://en.wikipedia.org/wiki/Relational_database
[3]: http://martinfowler.com | 0 | [
2,
5827,
192,
6018,
704,
6282,
60,
800,
3726,
3726,
704,
6282,
50,
951,
1597,
20,
3095,
13,
6800,
704,
9,
13,
1409,
1509,
80,
636,
19862,
6282,
500,
2558,
165,
500,
26,
2936,
17,
3143,
636,
99,
10832,
192,
6018,
18,
500,
2558,
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... |
Lisp+PHP ?
===
At the moment I use PHP for almost everything I develop for the Web but its linguistic limitations are starting to annoy me. However, as I developed some practices and maintain some PHP libraries that help me a lot, I don't feel I'd be ready to just switch to LISP throwing away all my PHP output. It could even be impossible on the servers where all I have access to is a regular LAMP hosting account.
Ergo, my questions are:
Could LISP code be just combined with PHP one? Are there solutions for side-by-side LISP/PHP, interface for their interoperability or perphaps just an implementation of one for the other? Or is it a mutually exclusive choice? | 0 | [
2,
2093,
3401,
2430,
26120,
13,
60,
800,
3726,
3726,
35,
14,
688,
31,
275,
13,
26120,
26,
557,
796,
31,
2803,
26,
14,
2741,
47,
82,
13171,
14070,
50,
1422,
20,
13,
28328,
55,
9,
207,
15,
28,
31,
885,
109,
5242,
17,
4027,
109,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
What techniques do you use to maximise code reuse?
===
Some years ago I was told about a study into code reuse. Apparently it was found that, on average, programmers have a 7 minute window when searching for code to reuse. If they don't find code that suits their needs within that window they'll write their own.
This was presented in the context of needing to carefully manage your code for reuse to ensure that you can find what you need within the window.
How do you (individuals and organisations) manage your source to make it easier to reuse?
Do you specifically maintain a reuse library? And if so, how do you index it to maximise your hit rate?
| 0 | [
2,
98,
4212,
107,
42,
275,
20,
10584,
2628,
1797,
302,
3699,
60,
800,
3726,
3726,
109,
122,
1464,
31,
23,
470,
88,
21,
949,
77,
1797,
302,
3699,
9,
3083,
32,
23,
216,
30,
15,
27,
862,
15,
17968,
18,
57,
21,
453,
2038,
1463,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 validate user input JDBC?
===
Is there a built-in way to escape user input in java using the JDBC? Something similar to the php version mysql_real_escape() function. What's the best way to validate input? | 0 | [
2,
246,
161,
20,
7394,
1373,
4155,
6367,
487,
43,
7229,
60,
800,
3726,
3726,
25,
80,
21,
392,
8,
108,
161,
20,
2220,
4155,
6367,
19,
8247,
568,
14,
487,
43,
7229,
60,
301,
835,
20,
14,
13,
26120,
615,
51,
18,
22402,
1,
7467,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
What are the various "Build action" settings in VS.NET project properties and what do they do?
===
For the most part you just take whatever Visual Studio sets it for you as a default.. I'm referring to the BuildAction Property for each file selected in your solution explorer. There are a number of options and its difficult to know what each one of them will do.
| 0 | [
2,
98,
50,
14,
617,
13,
7,
29361,
1028,
7,
12410,
19,
4611,
9,
2328,
669,
3704,
17,
98,
107,
59,
107,
60,
800,
3726,
3726,
26,
14,
127,
141,
42,
114,
247,
2099,
3458,
1120,
3415,
32,
26,
42,
28,
21,
12838,
9,
9,
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... |
FAT-16 On Modern OS
===
I've got a project that was written in BASIC. I'm not sure of the exact reason, but the app will not function except when being run from a FAT-16 file system.
I'd rather try to set up and environment that will support this app in a modern OS (Vista/XP) instead of rewriting it.
Does anyone know how to get an app like this running in XP/Vista through some kind of code change (to the BASIC code) or FAT-16 "emulator" (if such a thing exists)?
| 0 | [
2,
4211,
8,
1091,
27,
773,
13,
759,
800,
3726,
3726,
31,
22,
195,
330,
21,
669,
30,
23,
642,
19,
2125,
9,
31,
22,
79,
52,
562,
16,
14,
5340,
1215,
15,
47,
14,
4865,
129,
52,
1990,
1613,
76,
142,
485,
37,
21,
4211,
8,
1091,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
gdbinit conflict with Xcode debugging
===
I've a fairly huge .gdbinit (hence not copied here) in my home directory.
Now if I want to debug code inside Xcode I get this error:
Failed to load debugging library at:
/Developer/Applications/Xcode.app/Contents/PlugIns/GDBMIDebugging.xcplugin/Contents/Resources/PBGDBIntrospectionSupport.A.dylib
Custom data formatters are disabled.
Error message was:
0x1005c5 "dlopen(/Developer/Applications/Xcode.app/Contents/PlugIns/GDBMIDebugging.xcplugin/Contents/Resources/PBGDBIntrospectionSupport.A.dylib, 16): image not found"
Simply moving out or renaming my .gdbinit does get gdb in Xcode back in a working state but it's obviously a pain.
Any idea as to which settings in gdbinit could cause this error in Xcode ?
Note: if need I can provide a copy of my (long) .gdbinit | 0 | [
2,
489,
43,
4772,
242,
2930,
29,
993,
9375,
121,
16254,
2762,
800,
3726,
3726,
31,
22,
195,
21,
6647,
2329,
13,
9,
263,
43,
4772,
242,
13,
5,
252,
2940,
52,
18225,
235,
6,
19,
51,
213,
16755,
9,
130,
100,
31,
259,
20,
121,
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 you design Controller layer of MVC design pattern in .NET
===
Here are my thoughts: The purpose of using MVC is seperation of concerns and testability of gui logic. View should be able to work with different models and model should be able to work with different views.
<p>I think controller class must implement an interface for mocking/testing reasons and view should call controller methods through this interface. But if we do so, then it becomes difficult to process view elements (textboxes, grids etc.) in controller. So these elements must be known by the controller somehow.
<p>1. Do you expose these gui elements through the interface? Define controller classes as partial classes so that controller can directly process the gui elements (what about the interface then)? What do you do to solve this problem?
<p>2. Basically, should controller implement more than one interface? One for view and another for model layer, to make view/model be able to work with different models/views via controllers?
<p>3. Model layer also should implement an interface for mocking/testing?
How can we achieve our testing, loosely coupling, SoC purposes best? Please share your experience/thoughts. | 0 | [
2,
184,
42,
704,
9919,
5385,
16,
307,
8990,
704,
3732,
19,
13,
9,
2328,
800,
3726,
3726,
235,
50,
51,
3064,
45,
14,
2131,
16,
568,
307,
8990,
25,
10332,
106,
857,
16,
4823,
17,
1289,
4091,
16,
9457,
7085,
9,
1418,
378,
44,
777... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Firefox Sidebar and Document object of DOM
===
There is a webpage loaded in the firefox sidebar and another webpage loaded in the main document. Now, how do I ask access the main document object through the firefox sidebar. An example to do this through Javascript code in the firefox sidebar document to access the main document would be helpful.
Thanks. | 0 | [
2,
535,
18219,
270,
1850,
17,
4492,
3095,
16,
11859,
800,
3726,
3726,
80,
25,
21,
2741,
6486,
8572,
19,
14,
535,
18219,
270,
1850,
17,
226,
2741,
6486,
8572,
19,
14,
407,
4492,
9,
130,
15,
184,
107,
31,
1349,
1381,
14,
407,
4492... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
DLL's using C++ on Linux
===
I have tried to find how to create DLL's on linux using google, but got very confusing information.
Is it possible to write dynamic link libraries on linux? If not, are there other means by which I can call code in another module from several running programs? | 0 | [
2,
13,
43,
211,
22,
18,
568,
272,
20512,
27,
13024,
800,
3726,
3726,
31,
57,
794,
20,
477,
184,
20,
1600,
13,
43,
211,
22,
18,
27,
13024,
568,
8144,
15,
47,
330,
253,
18084,
676,
9,
25,
32,
938,
20,
2757,
7782,
3508,
8649,
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... |
Podcasts about JavaScript programming
===
As a passionate JavaScript developer, I'd like to know if there's any quality Podcasts out there, devoted to JavaScript. (Both video and audio).
I am currently subscribing to:
- <a href="http://developer.yahoo.com/yui/theater/">YUI Theater</a>
- <a href="http://ajaxian.com/by/category/podcasts">Audible Ajax</a> | 4 | [
2,
15124,
18,
88,
8247,
8741,
3143,
800,
3726,
3726,
28,
21,
12637,
8247,
8741,
10058,
15,
31,
22,
43,
101,
20,
143,
100,
80,
22,
18,
186,
2190,
15124,
18,
70,
80,
15,
6856,
20,
8247,
8741,
9,
13,
5,
8110,
763,
17,
4023,
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... |
Open source or free testing solution
===
1. Is there a open source or free suite that can integrate testcases, tests, bugs and possibly the fixes(source code) together. Maintaining the requirements in this system is not a necessity (though, it would be nice to enter a requirement id for each testcase in a custom field). We are a small organization and cannot afford something like HP Quality Center.
2. We have coding skills (Java, SQL), so if it comes to integration of different tools using Java APIs, it should not be a problem. Similarly, a practical solution using export/import of results/data should also be fine (we could automate where possible).
3. Has anybody used PushToTest TestMaker as part of such a solution.
| 0 | [
2,
368,
1267,
54,
551,
4431,
4295,
800,
3726,
3726,
137,
9,
25,
80,
21,
368,
1267,
54,
551,
6160,
30,
92,
18399,
1289,
10325,
18,
15,
4894,
15,
13925,
17,
2879,
14,
6098,
160,
5,
12097,
1797,
6,
429,
9,
8215,
14,
4786,
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... |
Favorite image file format for 2d sprites
===
What is your favorite, lossless image format for games (namely 2d games)? And why?
Some things to take into consideration are size on disk, overhead for converting to a usable format, and features of the format (ie alpha support).
There is no best answer, but be sure to back yours up the best you can! | 0 | [
2,
3839,
1961,
3893,
2595,
26,
172,
43,
27902,
18,
800,
3726,
3726,
98,
25,
154,
3839,
15,
1526,
923,
1961,
2595,
26,
466,
13,
5,
7259,
102,
172,
43,
466,
6,
60,
17,
483,
60,
109,
564,
20,
247,
77,
9888,
50,
1072,
27,
8582,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
.NET: What is the status of the Castle Project?
===
Clicking through to the download-page if see that the last version of the download is **over one year old** and it's also "just" a **Release Candidate** of version 1.0. There are really no news on any development.
Yes, you can find newer versions from the nightly builds, but that's not a real serious option.
Also, the "getting-started" and description-pages are sometimes not even started and some not completed.
What's the deal? Any C# 3.0 features on the way or what? | 0 | [
2,
13,
9,
2328,
45,
98,
25,
14,
1782,
16,
14,
1339,
669,
60,
800,
3726,
3726,
25590,
120,
20,
14,
7121,
8,
6486,
100,
196,
30,
14,
236,
615,
16,
14,
7121,
25,
13,
1409,
2549,
53,
159,
315,
1409,
17,
32,
22,
18,
67,
13,
7,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Targeting both 32bit and 64bit with Visual Studio in same solution/project
===
Greetings.
I have a little dilemma on how to set up my visual studio builds for multi-targeting.
Background: c# .NET v2.0 with p/invoking into 3rd party 32 bit DLL's, SQL compact v3.5 SP1, with a Setup project.
Right now, the platform target is set to x86 so it can be run on Windows x64.
The 3rd party company has just released 64 bit versions of their DLL's and I want to build a dedicated 64bit program.
This raises some questions which I haven't got the answers to yet.
I want to have the exact same code base.
I must build with references to either the 32bit set of DLL's or 64bit DLL's.
(Both 3rd party and SQL Server Compact)
Can this be solved with 2 new sets of configurations (Debug64 and Release64) ?
Must I create 2 separate setup projects(std. visual studio projects, no Wix or any other utility), or can this be solved within the same .msi?
Any ideas and/or recommendations would be welcomed.
/M
| 0 | [
2,
15972,
156,
2512,
3326,
17,
4384,
3326,
29,
3458,
1120,
19,
205,
4295,
118,
21011,
800,
3726,
3726,
13769,
18,
9,
31,
57,
21,
265,
23314,
27,
184,
20,
309,
71,
51,
3458,
1120,
1895,
18,
26,
1889,
8,
3958,
3060,
68,
9,
2395,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Compile-time type based dispatch
===
Following techniques from 'Modern C++ Design', I am implementing a persistence library with various compile-time optimisations. I would like the ability to dispatch a function to a templated member variable if that variable derives from a given class:
template<class T, template <class> class Manager = DefaultManager> class Data
{
private:
T *data_;
public:
void Dispatch()
{
if(SUPERSUBCLASS(Container, T))
{
data_->IKnowThisIsHere();
}
else
{
Manager<T>::SomeGenericFunction(data_);
}
}
}
Where SUPERSUBCLASS is a compile-time macro to determine object inheritance. Of course, this fails in all cases where T does to inherit from Container (or T is an intrinsic type etc etc) because the compiler rightly complains that IKnowThisIsHere() is not a data member, even though this code path will never be followed.
I really need to emulate (or indeed persuade!) having the compiler emit one set of code if T does inherit from Container, and another if it does not. Any suggestions? | 0 | [
2,
26561,
8,
891,
1001,
432,
14226,
800,
3726,
3726,
249,
4212,
37,
13,
22,
11959,
272,
20512,
704,
22,
15,
31,
589,
17333,
21,
28584,
1248,
29,
617,
26561,
8,
891,
19259,
4330,
18,
9,
31,
83,
101,
14,
2165,
20,
14226,
21,
1990,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Including Relavent Boost Libraries with C++ Source (Using Visual Studio)
===
I have a project I'm working on (for school) that I'm digging into the Boost libraries for the solutions. I need some way to distribute the required Boost source code with my application so that it can be compiled without the libraries being installed on the system doing the compiling. (School computers lack just about anything you can mention. The school just installed CVS last year. But they do have VS2005)
Note: I'm using Visual Studio 2005 on Vista. I have Boost 1.34.1 on my system I used the [automatic installer][1]. The documentation I've come across says something about using BCP command but that command doesn't seem to copy anything. (I'm using absolute path to call BCP so I don't end up calling the wrong command.)
[1]:http://www.boostpro.com/products/free | 0 | [
2,
215,
302,
531,
6645,
10419,
8649,
29,
272,
20512,
1267,
13,
5,
12655,
3458,
1120,
6,
800,
3726,
3726,
31,
57,
21,
669,
31,
22,
79,
638,
27,
13,
5,
1106,
116,
6,
30,
31,
22,
79,
11004,
77,
14,
10419,
8649,
26,
14,
6776,
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... |
Benefits of inline functions in C++?
===
What is the advantages/disadvantages of using inline functions in C++? I see that it only increase performance for the code that the compiler output but with today's optimized compilers, fast CPUs, huge memory etc (not like in the 1980< where memory was scares and everything had to fit in 100KB of memory) what advantages do they really have today? | 0 | [
2,
5800,
16,
19,
1143,
3719,
19,
272,
20512,
60,
800,
3726,
3726,
98,
25,
14,
14683,
118,
2906,
1283,
17384,
14465,
16,
568,
19,
1143,
3719,
19,
272,
20512,
60,
31,
196,
30,
32,
104,
1839,
956,
26,
14,
1797,
30,
14,
21486,
5196,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
What are the most useful data structures to know inside out?
===
I'm interested in finding out what people would consider the most useful data structures to know in programming. What data structure do you find yourself using all the time?
Answers to this post should help new programmers interested in finding a useful data structure for their problem. Answers should probably include the data structure, information about it or a relevant link, the situation it is being used in and why it is a good choice for this problem e.g ideal computation complexities, simplicity and understanding etc.
Each answer should be about one data structure only.
Thanks for any pearls of wisdom and experience people can share. | 0 | [
2,
98,
50,
14,
127,
4811,
1054,
3815,
20,
143,
572,
70,
60,
800,
3726,
3726,
31,
22,
79,
3158,
19,
3007,
70,
98,
148,
83,
3563,
14,
127,
4811,
1054,
3815,
20,
143,
19,
3143,
9,
98,
1054,
1411,
107,
42,
477,
2834,
568,
65,
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... |
Unable to access HTTP PUT data in webservice code
===
All,
As part of an application I'm writing I need to have a HTTP PUT webservice which accepts incoming imagedata, which will by analyzed, validated, and added to a local file store.
My issue arises after the size validation as the
> `$_SERVER['CONTENT_LENGTH']`
has a > 0 value, and this value is identical to the test file size, so I can assume that all is going well up to this point _but_ when I try to read the incoming stream data using
> `file_get_contents('php://stdin', 'r');`
I get an empty string. I've also tried using
> `file_get_contents('php://input', 'r');`
And this give me the same result of an empty string.
Any help, suggestions or direction will be appreciated.
NB: I'm using PHP 5.2.6
| 0 | [
2,
2343,
20,
1381,
7775,
442,
1054,
19,
2741,
11449,
1797,
800,
3726,
3726,
65,
15,
28,
141,
16,
40,
3010,
31,
22,
79,
1174,
31,
376,
20,
57,
21,
7775,
442,
2741,
11449,
56,
16548,
17126,
1961,
18768,
15,
56,
129,
34,
19214,
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... |
How to join int[] to a charcter separated string in C#?
===
I have a array of integers: `int [] number = new int[] { 2,3,6,7 };`
What is the easiest way of *converting these in to a single string where the number are separated by a character* (like: `"2,3,4,7"`)?
I'm in C# and .NET 3.5.
| 0 | [
2,
184,
20,
1865,
19,
38,
2558,
500,
20,
21,
4892,
150,
815,
4196,
3724,
19,
272,
5910,
60,
800,
3726,
3726,
31,
57,
21,
7718,
16,
13820,
18,
45,
13,
1,
6391,
20767,
234,
800,
78,
19,
38,
2558,
500,
13,
1,
172,
15,
240,
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... |
Best Java/Swing browser component ?
===
What's the best cross platform Java Swing browser component at least able to play nicely in a swing interface (lightweight component ?) and able to run on MacOSX and Windows ?
Things like : [FlyingSaucer][1], [JDIC][2], maybe others ?
[1]: https://xhtmlrenderer.dev.java.net/
[2]: https://jdic.dev.java.net/ | 0 | [
2,
246,
8247,
118,
18,
3546,
16495,
5912,
13,
60,
800,
3726,
3726,
98,
22,
18,
14,
246,
919,
2452,
8247,
5587,
16495,
5912,
35,
639,
777,
20,
418,
24050,
19,
21,
5587,
6573,
13,
5,
3130,
8696,
5912,
13,
60,
6,
17,
777,
20,
485... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How do I get a stack trace in OCaml?
===
The Objective Caml language will only produce stack traces if you ask for them just right - what are the requirements for both bytecode and native code? | 0 | [
2,
184,
107,
31,
164,
21,
7566,
5565,
19,
13,
14977,
8184,
60,
800,
3726,
3726,
14,
7038,
5373,
255,
816,
129,
104,
2213,
7566,
10738,
100,
42,
1349,
26,
105,
114,
193,
13,
8,
98,
50,
14,
4786,
26,
156,
34,
591,
9375,
17,
1275... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
Which image format is cost effective in terms of network operation for iPhone?
===
I want to display a thumbnail image in a cell of table view controller,this thumbnail image is located at some remote place(URL of address is in XML file) so which format of image is cost effective?
thanks in advance. | 0 | [
2,
56,
1961,
2595,
25,
1516,
3140,
19,
1663,
16,
982,
1453,
26,
21024,
60,
800,
3726,
3726,
31,
259,
20,
3042,
21,
5078,
325,
947,
1961,
19,
21,
1667,
16,
859,
1418,
9919,
15,
1565,
5078,
325,
947,
1961,
25,
335,
35,
109,
5388,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 set a menubar icon on mac osx using wx
===
I could not find any pointers on how to create a menubar icon on OSX using wx. I originally thought that the wxTaskBarIcon class would do, but it actually creates an icon on the Dock. On Windows, wxTaskBarIcon creates a Systray icon and associated menu, and I would think that on mac osx it would create a menubar icon, I guess not. | 0 | [
2,
184,
20,
309,
21,
11379,
1850,
9801,
27,
1572,
13,
759,
396,
568,
619,
396,
800,
3726,
3726,
31,
110,
52,
477,
186,
454,
445,
27,
184,
20,
1600,
21,
11379,
1850,
9801,
27,
13,
759,
396,
568,
619,
396,
9,
31,
912,
289,
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... |
How can I determine that Wndows Installer is performing an upgrade rather than a first time install?
===
I have an install that upgrades a previous version of an app. I'd like skip certain actions when the install is upgrading the previous version. How can I determine if the install is running in upgrade vs. first time instal mode? | 0 | [
2,
184,
92,
31,
3746,
30,
13,
6156,
17779,
18,
16146,
106,
25,
2955,
40,
9483,
864,
119,
21,
64,
85,
16146,
60,
800,
3726,
3726,
31,
57,
40,
16146,
30,
9483,
18,
21,
1158,
615,
16,
40,
4865,
9,
31,
22,
43,
101,
12532,
1200,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
What's a the best small font for eclipse?
===
The default Courier New 10pt is larger than necessary for me. However, using that font at 8pt does not look very good.
Are there better choices for a more readable, very small (e.g., 8pt) font for eclipse? | 0 | [
2,
98,
22,
18,
21,
14,
246,
284,
9978,
26,
11652,
60,
800,
3726,
3726,
14,
12838,
19418,
78,
332,
4417,
25,
1662,
119,
2378,
26,
55,
9,
207,
15,
568,
30,
9978,
35,
469,
4417,
630,
52,
361,
253,
254,
9,
50,
80,
574,
10978,
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... |
Vacation suggestions for a programmer?
===
I just love programming and I keep doing it in my spare time.
I have even taken some classes in fields other than my usual working ones, tools etc. Best so far has been [Big Nerd Ranch][1] where one gets to chill out and code for a week at a resort.
I have also seen this one [www.geekcruises.com][2], old now. But are there more programming related vacations out there?
[1]: http://www.bignerdranch.com/
[2]: http://www.insightcruises.com/top/sql_top.htm | 0 | [
2,
10057,
18389,
26,
21,
17968,
60,
800,
3726,
3726,
31,
114,
339,
3143,
17,
31,
643,
845,
32,
19,
51,
8001,
85,
9,
31,
57,
166,
658,
109,
2684,
19,
2861,
89,
119,
51,
3820,
638,
53,
18,
15,
4672,
2722,
9,
246,
86,
463,
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... |
What is the first thing you do when you install Visual Studio?
===
What is the first thing you do when you install Visual Studio? I'd talking anything customization-wise (so we don't get answers based on 'I create a new project' ;) ).
Got a favorite font? Got a must-have extension you couldn't possibly live without? Have a keyboard shortcut you like to set? I am interested to know of your favorites.
For me, I only change the font to Calibri, I find it is easier to read imo, and I can fit more text on the screen. | 0 | [
2,
98,
25,
14,
64,
584,
42,
107,
76,
42,
16146,
3458,
1120,
60,
800,
3726,
3726,
98,
25,
14,
64,
584,
42,
107,
76,
42,
16146,
3458,
1120,
60,
31,
22,
43,
1582,
602,
5816,
1829,
8,
10474,
13,
5,
656,
95,
221,
22,
38,
164,
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... |
How can i setup LookAndFeel Files in Java ?
===
i need to setup LookAndFeel Files to JDK 1.6
i have two files
- 1- napkinlaf-swingset2.jar
- 2- napkinlaf.jar
how can i setup the files and use it ?
and i want GTK look and feel OR Qt Look and Feel , are they available ? | 0 | [
2,
184,
92,
31,
18161,
361,
290,
16963,
6488,
19,
8247,
13,
60,
800,
3726,
3726,
31,
376,
20,
18161,
361,
290,
16963,
6488,
20,
487,
43,
197,
137,
9,
379,
31,
57,
81,
6488,
13,
8,
137,
8,
20398,
21645,
8,
18,
3546,
3554,
135,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Pitfalls of Object oriented programming
===
Did you ever felt any down side of OOPs as a developer? Do you think over usage of oop concepts could lead to something like over normalized database structures? | 0 | [
2,
4175,
5660,
18,
16,
3095,
13,
6800,
3143,
800,
3726,
3726,
144,
42,
462,
427,
186,
125,
270,
16,
13,
21709,
18,
28,
21,
10058,
60,
107,
42,
277,
84,
7514,
16,
13,
21709,
8700,
110,
672,
20,
301,
101,
84,
1826,
1333,
6018,
3... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
How many lines of debugged code do you produce in a day's work?
===
How many lines of debugged code do you produce in a day's work and what language would that be?
I know some languages are a little more difficult to work with but on average, how many? | 4 | [
2,
184,
151,
1560,
16,
121,
2345,
15186,
1797,
107,
42,
2213,
19,
21,
208,
22,
18,
170,
60,
800,
3726,
3726,
184,
151,
1560,
16,
121,
2345,
15186,
1797,
107,
42,
2213,
19,
21,
208,
22,
18,
170,
17,
98,
816,
83,
30,
44,
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... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 Eclipse behave like Visual Studio
===
I'm doing some Android dev, and I much prefer Visual Studio, but I'll have to use Eclipse for this.
Has anyone made a tool that switches Eclipse to look and behave more like visual studio? I mainly can't stand its clippyesqe suggestions on how I should program (Yes, I know I have not yet used that private field! Thanks Eclipse!), or its incredibly lousy intellisense.
For example, in eclipse, if I don't type "this" first, its intellisense won't realize I want to look for locally scoped members. Also, the TAB to complete VS convention is drilled into my head, and Eclipse is ENTER to complete, I could switch everything by hand but that would take hours, and I was hoping someone had some sort of theme or something that has already done it :)
| 0 | [
2,
544,
11652,
14149,
101,
3458,
1120,
800,
3726,
3726,
31,
22,
79,
845,
109,
13005,
9664,
15,
17,
31,
212,
6369,
3458,
1120,
15,
47,
31,
22,
211,
57,
20,
275,
11652,
26,
48,
9,
63,
1276,
117,
21,
5607,
30,
18114,
11652,
20,
3... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Why is half of my compiled (small) objective-C file a large block of zeroes?
===
I opened up my compiled Hello World Obj-C application in a text editor and, to my surprise, I found about 8 kilobytes of 00 00 00 00 00 00 00 00 ....
Why are these here? Is there a way to clear out these zeroes (which I doubt have *too* much function)?
Obviously it's not so important in *this* file, seeing as it's only 16kB to begin with, but I'd like to know anyway. | 0 | [
2,
483,
25,
519,
16,
51,
9316,
13,
5,
15988,
6,
7038,
8,
150,
3893,
21,
370,
1921,
16,
4606,
160,
60,
800,
3726,
3726,
31,
520,
71,
51,
9316,
10975,
126,
5122,
728,
8,
150,
3010,
19,
21,
1854,
1835,
17,
15,
20,
51,
2624,
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... |
Near Sorting Algorithms - When to use?
===
From time to time I browse the web and look for interesting algorithms and datastructures to put into my bag of tricks. A year ago I came across the [Soft Heap][1] data-structure and learned about near sorting.
The idea behind this is that it's possible to break the O(n log n) barrier of compare based sorts if you can live with the fact that the sort algorithm cheats a bit. You get a almost sorted list but you have to live with some errors as well.
I played around with the algorithms in a test environement but never found a use for them.
So the question: Has anyone ever used near sorting in practice? If so in which kind of applications? Can you think up a use-case where near sorting is the right thing to do?
[1]: http://en.wikipedia.org/wiki/Soft_heap | 0 | [
2,
424,
2058,
68,
15935,
13,
8,
76,
20,
275,
60,
800,
3726,
3726,
37,
85,
20,
85,
31,
10175,
62,
14,
2741,
17,
361,
26,
4883,
15935,
17,
1054,
13971,
18,
20,
442,
77,
51,
1910,
16,
13747,
9,
21,
159,
1464,
31,
281,
464,
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... |
Which you think is the best class design tool for .net?
===
Do you use visual studio's class diagram generator? Or, do you suggest any other better tool?
The main features I'm expecting out of such a tool are:
1. Ability to generate C#/VB.net code
2. Ability to reverse engineer C#/VB.net code
3. Integration with Visual Studio, if possible
4. SVN integration
| 0 | [
2,
56,
42,
277,
25,
14,
246,
718,
704,
5607,
26,
13,
9,
2328,
60,
800,
3726,
3726,
107,
42,
275,
3458,
1120,
22,
18,
718,
14161,
15286,
60,
54,
15,
107,
42,
5601,
186,
89,
574,
5607,
60,
14,
407,
967,
31,
22,
79,
7752,
70,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 Performing ORM for .NET
===
I'm curious if anyone has done any performance comparisons with any or all of the main players in the .NET ORM space. Specifically I'm interested in comparisons between the following:
- Linq to SQL
- NHibernate
- LLBL Gen
- Entity Framework
Though it seems people don't really consider Linq to SQL a true ORM, I am still including it in this list. Some performance metrics would be nice to see.
| 4 | [
2,
246,
2955,
54,
79,
26,
13,
9,
2328,
800,
3726,
3726,
31,
22,
79,
7686,
100,
1276,
63,
677,
186,
956,
6050,
18,
29,
186,
54,
65,
16,
14,
407,
1007,
19,
14,
13,
9,
2328,
54,
79,
726,
9,
3524,
31,
22,
79,
3158,
19,
6050,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Storing a complete graph in a RDBMS
===
I have several types of entities, each with their own fields, which are stored in separate tables. Each record in such a table may be connected to zero or more records in a different table, i.e., linked to records from different entity types. If I go with lookup tables, I get (m(m-1))/2=O(m^2) separate lookup tables that need to be initialized. While still feasible for 6 or 7 different entity types, would it still be relevant for 50+ such types? In particular, a given record would need to have links to most other entity types so theoretically speaking I would be dealing with a nearly-complete, non-directed, n-sided graph.
Can anyone shed some light on how to store this structure in a relational DBMS? (I'm using Postgresql if it matters, but any solutions for other DBMS's would be equally helpful). Thank you for your time!
Yuval | 0 | [
2,
25615,
21,
1279,
7210,
19,
21,
13,
897,
13178,
18,
800,
3726,
3726,
31,
57,
238,
2551,
16,
12549,
15,
206,
29,
66,
258,
2861,
15,
56,
50,
8214,
19,
1725,
7484,
9,
206,
571,
19,
145,
21,
859,
123,
44,
2587,
20,
4606,
54,
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... |
Weblogic add-on to serialize web service calls
===
Is there a prebuilt tool that would integrate with BEA/Oracle Weblogic 10.0 and trace on a database table each call to a web service exposed by the server? | 0 | [
2,
2741,
24268,
3547,
8,
218,
20,
5956,
2952,
2741,
365,
3029,
800,
3726,
3726,
25,
80,
21,
782,
8607,
5607,
30,
83,
18399,
29,
44,
58,
118,
6055,
5615,
2741,
24268,
332,
9,
387,
17,
5565,
27,
21,
6018,
859,
206,
645,
20,
21,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
How should I organize the contents of my CSS file(s)?
===
This question is about organizing the actual CSS directives themselves within a .css file. When developing a new page or set of pages, I usually just add directives by hand to the .css file, trying to refactor when I can. After some time, I have hundreds (or thousands) of lines and it can get difficult to find what I need when tweaking the layout.
Does anyone have advice for how to organize the directives?
- Should I try to organize top-down, mimicking the DOM?
- Should I organize functionally, putting directives for elements that support the same parts of the UI together?
- Should I just sort everything alphabetically by selector?
- Some combination of these approaches?
Also, is there a limit to how much CSS I should keep in one file before it might be a good idea to break it off into separate files? Say, 1000 lines? Or is it always a good idea to keep the whole thing in one place?
| 0 | [
2,
184,
378,
31,
9213,
14,
8478,
16,
51,
272,
18,
18,
3893,
5,
18,
6,
60,
800,
3726,
3726,
48,
1301,
25,
88,
11725,
14,
3463,
272,
18,
18,
15626,
18,
1366,
363,
21,
13,
9,
6824,
18,
3893,
9,
76,
3561,
21,
78,
2478,
54,
309... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
What are the limitations of refactoring?
===
I'm making a study on refactoring limitations on improving existing software architecture and I would be interested to hear your experiences where you have found refactoring to be not enough or still too immature to accomplish your goals. | 0 | [
2,
98,
50,
14,
14070,
16,
302,
17455,
68,
60,
800,
3726,
3726,
31,
22,
79,
544,
21,
949,
27,
302,
17455,
68,
14070,
27,
9273,
3149,
2306,
2607,
17,
31,
83,
44,
3158,
20,
990,
154,
5513,
113,
42,
57,
216,
302,
17455,
68,
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,
0,
0,
0,
0,
0... |
How to trim illegal characters from path and filenames?
===
I need a robust and simple way to remove illegal path and file characters from a simple string. I've used the below code but it doesn't seem to do anything, what am i missing?
using System;
using System.IO;
namespace ConsoleApplication1
{
class Program
{
static void Main(string[] args)
{
string illegal = "\"M<>\"\\a/ry/ h**ad:>> a\\/:*?\"<>| li*tt|le|| la\"mb.?";
illegal = illegal.Trim(Path.GetInvalidFileNameChars());
illegal = illegal.Trim(Path.GetInvalidPathChars());
Console.WriteLine(illegal);
Console.ReadLine();
}
}
}
| 0 | [
2,
184,
20,
8971,
5143,
1766,
37,
2013,
17,
3893,
7259,
18,
60,
800,
3726,
3726,
31,
376,
21,
15313,
17,
1935,
161,
20,
4681,
5143,
2013,
17,
3893,
1766,
37,
21,
1935,
3724,
9,
31,
22,
195,
147,
14,
1021,
1797,
47,
32,
1437,
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... |
form password
===
This is what my browser sent, when logging into some site:
<pre>
POST http://www.some.site/login.php HTTP/1.0
User-Agent: Opera/8.26 (X2000; Linux i686; Z; en)
Host: www.some.site
Accept: text/html, application/xml;q=0.9, application/xhtml+xml, image/png, image/jpeg, image/gif, image/x-xbitmap, */*;q=0.1
Accept-Language: en-US,en;q=0.9
Accept-Charset: iso-8859-1, utf-8, utf-16, *;q=0.1
Accept-Encoding: deflate, gzip, x-gzip, identity, *;q=0
Referer: http://www.some.site/
Proxy-Connection: close
Content-Length: 123
Content-Type: application/x-www-form-urlencoded
lots_of_stuff=here&e2ad811=<b>my_login_name</b>&e327696=<b>my_password</b>&lots_of_stuff=here
</pre>
Can I state that anyone can sniff my login name and password for that site?
Maybe just on my LAN?
<br/>
If so (even only on LAN ) then I'm shocked. I thought using
<pre><input type="password"></pre>
did something more than make all characters look like ' * '
p.s. If it matters I played with netcat (on linux) and made connection<br/>
browser <=> netcat (loged here) <=> proxy <=> remote_site
| 0 | [
2,
505,
20884,
800,
3726,
3726,
48,
25,
98,
51,
16495,
795,
15,
76,
13,
13919,
77,
109,
689,
45,
13,
1,
3515,
1,
678,
7775,
6903,
6483,
9,
3220,
9,
9097,
118,
5567,
108,
9,
26120,
7775,
11698,
9,
387,
4155,
8,
58,
7685,
45,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 rotate and fade background images in and out with javascript/ASP.NET/CSS
===
I need to randomly fade my background images in and out.
It will be a timed function, like once every 5 seconds.
I need to do it with ASP.NET, Javascript, CSS or all three.
Please help me out here guys. Thank you. | 0 | [
2,
184,
20,
21448,
17,
11381,
2395,
3502,
19,
17,
70,
29,
8247,
8741,
118,
472,
306,
9,
2328,
118,
6824,
18,
800,
3726,
3726,
31,
376,
20,
21324,
11381,
51,
2395,
3502,
19,
17,
70,
9,
32,
129,
44,
21,
85,
43,
1990,
15,
101,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
targeting specific frawework version in csc.exe
===
How do you specify a target framework version for the csc.exe c# compiler via command-line invocation (e.g., no .csproj file and not going thru the MSBUILD engine)?
e.g, using the C# 3.0 csc.exe compiler, how do you compile to IL targeting the 2.0 .net framework? | 0 | [
2,
15972,
1903,
8345,
458,
3783,
615,
19,
272,
3862,
9,
1706,
62,
800,
3726,
3726,
184,
107,
42,
19077,
21,
2935,
6596,
615,
26,
14,
272,
3862,
9,
1706,
62,
272,
5910,
21486,
1197,
1202,
8,
1143,
19,
2625,
16893,
13,
5,
62,
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 Fortran faster then C?
===
From time to time I read that Fortran is or can be faster then C for heavy calculations. Is that really true? I must admit that I hardly know Fortran, but the Fortran code I have seen so far did not showed that the language has features that C doesn't have.
If it is true, please tell me why. Please don't tell me what languages or libs are good for number crunching, I don't intend to write an app or lib to do that, I'm just curious. | 0 | [
2,
25,
26,
17685,
4233,
94,
272,
60,
800,
3726,
3726,
37,
85,
20,
85,
31,
1302,
30,
26,
17685,
25,
54,
92,
44,
4233,
94,
272,
26,
1278,
19186,
9,
25,
30,
510,
1151,
60,
31,
491,
5251,
30,
31,
5943,
143,
26,
17685,
15,
47,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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.