unified_texts stringlengths 32 30.1k | OpenStatus_id int64 0 4 | input_ids list | token_type_ids list | attention_mask list |
|---|---|---|---|---|
How can I do the equivalent of "SHOW TABLES" in T-SQL?
===
I would like to do a lookup of tables in my SQL Server 2005 Express database based on table name. In MySQL I would use 'SHOW TABLES LIKE "Datasheet%"', but in T-SQL this throws an error (it tries to look for a SHOW stored procedure and fails).
Is this possible, and if so, how? | 0 | [
2,
184,
92,
31,
107,
14,
4602,
16,
13,
7,
9303,
7484,
7,
19,
13,
38,
8,
18,
22402,
60,
800,
3726,
3726,
31,
83,
101,
20,
107,
21,
361,
576,
16,
7484,
19,
51,
4444,
255,
8128,
812,
2999,
6018,
432,
27,
859,
204,
9,
19,
51,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
HTML Help Workshop Crashes on Compiling a CHM
===
Trying to build a CHM using Microsoft HTML Help Workshop. A soon as I click Compile, HTML Help Workshop states:
>An internal error has occurred. An error record has been saved to c:\os.err.
The only contents of the file are:
>((Today's Date & Time))
>Microsoft HTML Help Workshop Version 4.74.8702
>HHA Version 4.74.8702
>htmlproc.cpp(114) : Assertion failure: (pszTmp == m_pCompiler->m_pHtmlMem->psz)
This only occurs for select projects.
What causes this error to occur and how can I fix my project to run through the compiler? | 0 | [
2,
13,
15895,
448,
7873,
21563,
27,
24378,
21,
6193,
79,
800,
3726,
3726,
749,
20,
1895,
21,
6193,
79,
568,
7099,
13,
15895,
448,
7873,
9,
21,
651,
28,
31,
10840,
26561,
15,
13,
15895,
448,
7873,
202,
45,
13,
1,
210,
3117,
7019,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
IMAP: "immediate" delete, without going through Trash folder?
===
I currently filter some message from my inbox with these steps:
select inbox
pick messages
set \Deleted tag
and then repeat the process after selecting Trash.
Is there a more direct way of disposing of these messages? Or is it just the feature of the Mail server that deleting a message puts it in the trash, and deleting from the trash permantently disposes of it? | 0 | [
2,
31,
15022,
45,
13,
7,
1660,
8260,
591,
7,
27448,
15,
366,
228,
120,
10744,
19294,
60,
800,
3726,
3726,
31,
871,
11945,
109,
2802,
37,
51,
19,
5309,
29,
158,
2382,
45,
5407,
19,
5309,
2036,
7561,
309,
13,
1,
24249,
1427,
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,
1,
1,
1,
1,
1,
1,
1,
1... |
Best Practices of Test Driven Development Using C# and RhinoMocks
===
In order to help my team write testable code, I came up with this simple list of best practices for making our C# code base more testable. (Some of the links refer to limitations of Rhino Mocks, a mocking framework for C#, but the rules may apply more generally as well.) Does anyone have any best practices that they follow?
To maximize the testability of code, follow these rules:
1. Write the test first, then the code. Reason: This ensures that you write testable code and that every line of code gets tests written for it.
2. Design classes using dependency injection. Reason: You cannot mock or test what cannot be seen.
3. Separate UI code from its behavior using Model-View-Controller or Model-View-Presenter. Reason: Allows the business logic to be tested while the parts that can't be tested (the UI) is minimized.
4. Do not write static methods or classes. Reason: Static methods are difficult or impossible to isolate and Rhino Mocks is unable to mock them.
5. Program off interfaces, not classes. Reason: Interfaces can be easily mocked using Rhino Mocks and other mocking frameworks.
6. Isolate external dependencies. Reason: Unresolved external dependencies cannot be tested.
7. Mark as virtual the methods you intend to mock. Reason: Rhino Mocks is unable to mock non-virtual methods. | 4 | [
2,
246,
5242,
16,
1289,
5355,
522,
568,
272,
5910,
17,
18642,
79,
5668,
18,
800,
3726,
3726,
19,
389,
20,
448,
51,
173,
2757,
1289,
579,
1797,
15,
31,
281,
71,
29,
48,
1935,
968,
16,
246,
5242,
26,
544,
318,
272,
5910,
1797,
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 is your view on GPGPU?
===
I am wondering what is the key thing that interest you in the GPGPU and of course what is the constraints that you are finding unacceptable.
Comes to mind for me:
- Key interest: the raw power of these things
- Key constraint: the memory model
What's your view? | 0 | [
2,
98,
25,
154,
1418,
27,
10538,
263,
4201,
60,
800,
3726,
3726,
31,
589,
5712,
98,
25,
14,
1246,
584,
30,
1163,
42,
19,
14,
10538,
263,
4201,
17,
16,
674,
98,
25,
14,
16747,
30,
42,
50,
3007,
24667,
9,
1624,
20,
594,
26,
55... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Does Git work in Windows?
===
I work on Linux all the time and I'm clueless about Windows not even having one to try it, is Git nowadays working on Windows? or am I making problems for my Windows-pals by using it? | 0 | [
2,
630,
13,
10404,
170,
19,
1936,
60,
800,
3726,
3726,
31,
170,
27,
13024,
65,
14,
85,
17,
31,
22,
79,
8906,
923,
88,
1936,
52,
166,
452,
53,
20,
1131,
32,
15,
25,
13,
10404,
15694,
638,
27,
1936,
60,
54,
589,
31,
544,
1716,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
What's the best way to manage a large number of tables in MS SQL Server?
===
This question is related to another:
[http://stackoverflow.com/questions/108445/will-having-multiple-filegroups-help-speed-up-my-database][1]
The software we're developing is an analytical tool that uses MS SQL Server 2005 to store relational data. Initial analysis can be slow (since we're processing millions or billions of rows of data), but there are performance requirements on recalling previous analyses quickly, so we "save" results of each analysis.
Our current approach is to save analysis results in a series of "run-specific" tables, and the analysis is complex enough that we might end up with as many as 100 tables per analysis. Usually these tables use up a couple hundred MB per analysis (which is small compared to our hundreds of GB, or sometimes multiple TB, of source data). But overall, disk space is not a problem for us. Each set of tables is specific to one analysis, and in many cases this provides us enormous performance improvements over referring back to the source data.
The approach starts to break down once we accumulate enough saved analysis results -- before we added more robust archive/cleanup capability, our testing database climbed to several *million* tables. But it's not a stretch for us to have more than 100,000 tables, even in production. Microsoft places a pretty enormous theoretical limit on the size of sysobjects (~2 billion), but once our database grows beyond 100,000 or so, simple queries like CREATE TABLE and DROP TABLE can slow down dramatically.
We have some room to debate our approach, but I think that might be tough to do without more context, so instead I want to ask the question more generally: if we're forced to create so many tables, what's the best approach for managing them? Multiple filegroups? Multiple schemas/owners? Multiple databases?
Another note: I'm not thrilled about the idea of "simply throwing hardware at the problem" (i.e. adding RAM, CPU power, disk speed). But we won't rule it out either, especially if (for example) someone can tell us definitively what effect adding RAM or using multiple filegroups will have on managing a large system catalog.
[1]: http://stackoverflow.com/questions/108445/will-having-multiple-filegroups-help-speed-up-my-database | 0 | [
2,
98,
22,
18,
14,
246,
161,
20,
4705,
21,
370,
234,
16,
7484,
19,
4235,
4444,
255,
8128,
60,
800,
3726,
3726,
48,
1301,
25,
1597,
20,
226,
45,
636,
21127,
6903,
25325,
2549,
9990,
9,
960,
118,
24652,
18,
118,
17767,
26399,
118,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
fastest c++ file compression library available?
===
I have a need to find the best library to compress in memory data.
I am currently using zlib but I am wondering if there is a better compression library; better in terms of performance and memory footprint.
It should be able to handle multiple files in the same archive.
I am looking for a C++ library. | 4 | [
2,
7518,
272,
20512,
3893,
14864,
1248,
904,
60,
800,
3726,
3726,
31,
57,
21,
376,
20,
477,
14,
246,
1248,
20,
26060,
19,
1912,
1054,
9,
31,
589,
871,
568,
2052,
8326,
47,
31,
589,
5712,
100,
80,
25,
21,
574,
14864,
1248,
73,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Mysql results in PHP - arrays or objects?
===
Been using PHP/MySQL for a little while now, and I'm wondering if there are any specific advantages (performance or otherwise) to using mysql\_fetch\_object() vs mysql\_fetch\_assoc() / mysql\_fetch\_array().
| 0 | [
2,
51,
18,
22402,
1736,
19,
13,
26120,
13,
8,
7718,
18,
54,
3916,
60,
800,
3726,
3726,
74,
568,
13,
26120,
118,
915,
18,
22402,
26,
21,
265,
133,
130,
15,
17,
31,
22,
79,
5712,
100,
80,
50,
186,
1903,
14683,
13,
5,
22528,
54... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 standard asp.net validators work with Ajax and update panel?
===
I am having issues with validators not firing (No expected error messages showing) when using Page.Validate() from code behind. The validators are placed inside an Ajax updatepanel.
It seems there are downloadable Ajax versions of the validators. I am not sure if I need these or if VS 2008 SP1 has them already. When the form is posted through a button, the validators work but they don't when I do a Page.Validate() on demand. | 0 | [
2,
107,
1236,
28,
306,
9,
2328,
7394,
9922,
170,
29,
20624,
17,
11100,
4113,
60,
800,
3726,
3726,
31,
589,
452,
1549,
29,
7394,
9922,
52,
7139,
13,
5,
251,
1727,
7019,
7561,
3187,
6,
76,
568,
2478,
9,
18506,
8209,
5,
6,
37,
17... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How to do a rolling restart of a cluster of mongrels
===
Anybody know a nice way to restart a mongrel cluster via capistrano in a "rolling" style, eg, one mongrel at a time. Would be great to have a bit of wait time in there as well for each, to let the mongrel load the rails app up as well.
I've done some searching, and haven't found too much, so looking for help before I dive into the mongrel_cluster gem myself.
Thanks! | 0 | [
2,
184,
20,
107,
21,
3929,
22767,
16,
21,
7460,
16,
21028,
7256,
18,
800,
3726,
3726,
11181,
143,
21,
2210,
161,
20,
22767,
21,
21028,
7256,
7460,
1197,
2605,
702,
17555,
19,
21,
13,
7,
8694,
68,
7,
1034,
15,
12369,
15,
53,
2102... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Visual Studio 2008 Documentation
===
I've installed the MSDN Library for Visual Studio 2008 SP1, however, dynamic help in Visual Studio still spawns the RTM Document Explorer. Anyone know how to change it to the SP1 version? | 0 | [
2,
3458,
1120,
570,
13945,
800,
3726,
3726,
31,
22,
195,
4066,
14,
4235,
43,
103,
1248,
26,
3458,
1120,
570,
3782,
165,
15,
207,
15,
7782,
448,
19,
3458,
1120,
174,
13,
22860,
18,
14,
13,
5256,
79,
4492,
8520,
9,
1276,
143,
184,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
How would you allow users to edit attachments in a web application?
===
We have created a web application, using ASP.NET, that allows users to upload documents and attach them to business entities, like customers, contacts and so on.
The application runs on the intranet and all files are uploaded through the web application into a shared folder on the server.
I would like, right from the web page, for the user to **open** the actual file, **edit** it and then **save** the changes back to the original location. This is a **piece of cake** in a Windows environment, I'm just wondering what, if any, is the best way to handle this in a web environment?
The files are usually Word documents, Excel documents and images. | 0 | [
2,
184,
83,
42,
1655,
3878,
20,
9392,
14575,
18,
19,
21,
2741,
3010,
60,
800,
3726,
3726,
95,
57,
679,
21,
2741,
3010,
15,
568,
28,
306,
9,
2328,
15,
30,
2965,
3878,
20,
71,
8294,
4374,
17,
19514,
105,
20,
508,
12549,
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... |
Sort Object in PHP
===
What is an elegant way to sort objects in PHP? I would love to accomplish something similar to this.
$sortedObjectArary = sort($unsortedObjectArray, $Object->weight);
Basically specify the array I want to sort as well as the field I want to sort on. I looked into multidimensional array sorting and there might be something useful there, but I don't see anything elegant or obvious. | 0 | [
2,
2058,
3095,
19,
13,
26120,
800,
3726,
3726,
98,
25,
40,
11614,
161,
20,
2058,
3916,
19,
13,
26120,
60,
31,
83,
339,
20,
14570,
301,
835,
20,
48,
9,
5579,
22843,
69,
23793,
512,
1857,
800,
2058,
5,
4403,
1020,
22843,
69,
23793... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Simplest SOAP example using Javascript
===
What is the simplest SOAP example using Javascript?
To be as useful as possible, the answer should:
- Be functional (in other words actually work)
- Send at least one parameter that can be set elsewhere in the code
- Process at least one result value that can be read elsewhere in the code
- Work with most modern browser versions
- Be as clear and as short as possible, without using an external library
| 0 | [
2,
24384,
6447,
823,
568,
8247,
8741,
800,
3726,
3726,
98,
25,
14,
24384,
6447,
823,
568,
8247,
8741,
60,
20,
44,
28,
4811,
28,
938,
15,
14,
1623,
378,
45,
13,
8,
44,
7652,
13,
5,
108,
89,
715,
1121,
170,
6,
13,
8,
2660,
35,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Does anyone know of any cross platform GUI log viewers for Ruby On Rails
===
I'm tired of using:
tail -f development.log
To keep track of my rails logs. Instead I would like something that displays the info in a grid and allows my to sort, filter and look at stack traces per log message.
Does anyone know of a GUI tool for displaying rails logs. Ideally I would like a standalone app (not something in Netbeans or Eclipse)
| 0 | [
2,
630,
1276,
143,
16,
186,
919,
2452,
9457,
6738,
6311,
26,
10811,
27,
2240,
18,
800,
3726,
3726,
31,
22,
79,
4117,
16,
568,
45,
3424,
13,
8,
410,
522,
9,
5567,
20,
643,
792,
16,
51,
2240,
18,
18893,
9,
700,
31,
83,
101,
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... |
Is there any way to use XmlSiteMapProvider within WinForm/Console/VSTest application?
===
I wonder whether there is a workaround for using the standard XmlSiteMapProvider within a non asp.net application, like WinForm/Console or, in my case, VS Unit Test one.
The following code fails, because it cannot create a path to the .sitemap file inside a private GetConfigDocument method.
XmlSiteMapProvider provider = new XmlSiteMapProvider();
NameValueCollection providerAttributes = new NameValueCollection();
providerAttributes.Add("siteMapFile", "Web.sitemap");
provider.Initialize("XmlSiteMapReader", providerAttributes);
provider.BuildSiteMap();
I feel the right solution is to write another provider. | 0 | [
2,
25,
80,
186,
161,
20,
275,
23504,
9097,
15022,
26735,
139,
363,
628,
4190,
118,
12124,
6069,
118,
710,
18,
10543,
3010,
60,
800,
3726,
3726,
31,
2666,
1472,
80,
25,
21,
170,
10037,
26,
568,
14,
1236,
23504,
9097,
15022,
26735,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
intra-process coordination in mod_perl under the worker MPM
===
I need to do some simple timezone calculation in mod_perl. DateTime isn't an option. What I need to do is easily accomplished by setting $ENV{TZ} and using localtime and POSIX::mktime, but under a threaded MPM, I'd need to make sure only one thread at a time was mucking with the environment. (I'm not concerned about other uses of localtime, etc.)
How can I use a mutex or other locking strategy to serialize (in the non-marshalling sense) access to the environment? The [docs](http://perl.apache.org/docs/2.0/api/APR/ThreadMutex.html) I've looked at don't explain well enough how I would create a mutex for just this use. Maybe there's something I'm just not getting about how you create mutexes in general. | 0 | [
2,
14369,
8,
16835,
13209,
19,
7226,
1,
1432,
255,
131,
14,
7444,
4628,
79,
800,
3726,
3726,
31,
376,
20,
107,
109,
1935,
85,
11661,
19644,
19,
7226,
1,
1432,
255,
9,
1231,
891,
2532,
22,
38,
40,
4255,
9,
98,
31,
376,
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... |
How do I deploy a managed stored procedure without using Visual Studio?
===
Everything I have read says that when making a managed stored procedure, to right click in Visual Studio and choose deploy. That works fine, but what if I want to deploy it outside of Visual Studio to a number of different locations? I tried creating the assembly with the dll the project built in SQL, and while it did add the assembly, it did not create the procedures out of the assembly. Has anyone figured out how to do this in SQL directly, without using Visual Studio? | 0 | [
2,
184,
107,
31,
17617,
21,
1471,
8214,
7004,
366,
568,
3458,
1120,
60,
800,
3726,
3726,
796,
31,
57,
1302,
898,
30,
76,
544,
21,
1471,
8214,
7004,
15,
20,
193,
10840,
19,
3458,
1120,
17,
3538,
17617,
9,
30,
693,
1123,
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... |
What is the best way to manage Time in a Java application?
===
So I'm using hibernate and working with an application that manages time.
What is the best way to deal with times in a 24 hour clock?
I do not need to worry about TimeZone issues at the beginning of this application but it would be best to ensure that this functionality is built in at the beginning.
I'm using hibernate as well, just as an fyi | 0 | [
2,
98,
25,
14,
246,
161,
20,
4705,
85,
19,
21,
8247,
3010,
60,
800,
3726,
3726,
86,
31,
22,
79,
568,
4148,
2102,
8820,
17,
638,
29,
40,
3010,
30,
9118,
85,
9,
98,
25,
14,
246,
161,
20,
1183,
29,
436,
19,
21,
937,
1671,
422... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Removing the "Categories" field from an Issue Tracking list in SharePoint
===
When I create an Issue Tracking list in SharePoint, I am unable to remove the Categories choice field that it adds by default as part of the Issue content type. I looked in the list definition but I can't find anything explicit about not allowing the column to be deleted. Does anybody know why the Delete button isn't showing up? Is there a way to delete this field? | 0 | [
2,
9096,
14,
13,
7,
14375,
1596,
7,
575,
37,
40,
1513,
10353,
968,
19,
1891,
3132,
800,
3726,
3726,
76,
31,
1600,
40,
1513,
10353,
968,
19,
1891,
3132,
15,
31,
589,
2343,
20,
4681,
14,
6422,
1837,
575,
30,
32,
10621,
34,
12838,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Handling undelivered emails in webapp
===
We have typical bussiness webapp that allows our users send e-mails with offerings to their clients. We set user e-mail in FROM field so the client can replay directly to te user. The problem is that because of SMTP protocol undeliverd e-mail notification is returned to our e-mail adress(the address of the account we send e-mails from).
Do you know elegant way to handle this undelivered emails? I mean the easiest way to let the sender know that his mail was not delivered. | 0 | [
2,
7988,
367,
29731,
69,
8517,
18,
19,
2741,
7753,
800,
3726,
3726,
95,
57,
3874,
1683,
18,
8776,
2741,
7753,
30,
2965,
318,
3878,
2660,
13,
62,
8,
8079,
18,
29,
18904,
20,
66,
7421,
9,
95,
309,
4155,
13,
62,
8,
8079,
19,
37,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
IsolationLevel.RepeatableRead to prevent duplicates
===
I'm working on an application that is supposed to create products (like shipping insurance policies) when PayPal Instant Payment Notifications are received. Unfortunately, PayPal sometimes sends duplicate notifications. Furthermore, there is another third-party that is performing web-service updates simultaneously when they get updates from PayPal as well.
Here is a basic diagram of the database tables involved.
// table "package"
// columns packageID, policyID, other data...
//
// table "insurancepolicy"
// columns policyID, coverageAmount, other data...
Here is a basic diagram of what I want to do:
using (SqlConnection conn = new SqlConnection(...))
{
sqlTransaction sqlTrans = conn.BeginTransaction(IsolationLevel.RepeatableRead);
// Calls a stored procedure that checks if the foreign key in the transaction table has a value.
if (PackageDB.HasInsurancePolicy(packageID, conn))
{
sqlTrans.Commit();
return false;
}
// Insert row in foreign table.
int policyID = InsurancePolicyDB.Insert(coverageAmount, conn);
if (policyID <= 0)
{
sqlTrans.Rollback();
return false;
}
// Assign foreign key to parent table. If this fails, roll back everything.
bool assigned = PackageDB.AssignPolicyID(packageID, policyID, conn);
if (!assigned)
{
sqlTrans.Rollback();
return false;
}
}
If there are two (or more) threads (or processes or applications) doing this at the same time, I want the first thread to lock the "package" row while it has no policyID, until the policy is created and the policyID is assigned to the package table. Then the lock would be released after the policyID is assigned to the package table. It is my hope that the other thread which is calling this same code will pause when it reads the package row to make sure it doesn't have a policyID first. When the first transaction's lock is released, it is my hope that the second transaction will see the policyID is there and therefore return without inserting any rows into the policy table.
Note: Because of the CRUD database design, each the stored procedures involved either Read (select), Create (insert), or Update.
Is this the right use of RepeatableRead transaction isolation?
Thanks.
| 0 | [
2,
13300,
3906,
9,
99,
7081,
5924,
10647,
20,
2501,
19429,
18,
800,
3726,
3726,
31,
22,
79,
638,
27,
40,
3010,
30,
25,
2293,
20,
1600,
1985,
13,
5,
1403,
7405,
4225,
4845,
6,
76,
1372,
6720,
6322,
7582,
52,
4634,
18,
50,
420,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
To Update blindly or to Update Where?
===
I have a table that holds information about cities in a game, you can build one building each turn and this is recorded with the value "usedBuilding".
Each turn I will run a script that alters usedBuilding to 0, the question is, which of the following two ways is faster and does it actually matter which way is used?
UPDATE cities SET usedBuilding = 0;
UPDATE cities SET usedBuilding = 0 WHERE usedBuilding = 1; | 0 | [
2,
20,
11100,
4631,
102,
54,
20,
11100,
113,
60,
800,
3726,
3726,
31,
57,
21,
859,
30,
2763,
676,
88,
1920,
19,
21,
250,
15,
42,
92,
1895,
53,
353,
206,
805,
17,
48,
25,
801,
29,
14,
1923,
13,
7,
8795,
11783,
7,
9,
206,
80... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Is it worth it to use Wap to have cellular webpage?
===
Is it worth it to develop [WAP][1] webpage for cellular since now cellular have browser that is really better than before?
I have a PHP website and I would like to increase the use of portable device to use it. Is it worth it to implement.
[1]: http://en.wikipedia.org/wiki/WAP_Push#WAP_Push | 0 | [
2,
25,
32,
2715,
32,
20,
275,
3142,
306,
20,
57,
14844,
2741,
6486,
60,
800,
3726,
3726,
25,
32,
2715,
32,
20,
2803,
636,
1608,
306,
500,
2558,
165,
500,
2741,
6486,
26,
14844,
179,
130,
14844,
57,
16495,
30,
25,
510,
574,
119,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
game programming
===
what libraries can i use for motion and blending in game programming in c++? how to comiple functions of fblend in devcpp? | 0 | [
2,
250,
3143,
800,
3726,
3726,
98,
8649,
92,
31,
275,
26,
2422,
17,
25359,
19,
250,
3143,
19,
272,
20512,
60,
184,
20,
13,
960,
49,
5106,
3719,
16,
398,
2854,
706,
19,
121,
8990,
3421,
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... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
.NET Generic Method Question
===
I'm trying to grasp the concept of .NET Generics and actually use them in my own code but I keep running into a problem.
Can someone try to explain to me why the following setup does not compile?
public class ClassA
{
ClassB b = new ClassB();
public void MethodA<T>(IRepo<T> repo) where T : ITypeEntity
{
b.MethodB(repo);
}
}
public class ClassB
{
IRepo<ITypeEntity> repo;
public void MethodB(IRepo<ITypeEntity> repo)
{
this.repo = repo;
}
}
I get the following error:
cannot convert from IRepo<'T> to IRepo<'ITypeEntity>
MethodA gets called with a IRepo<'DetailType> object parameter where DetailType inherits from ITypeEntity.
I keep thinking that this should compile as I'm constraining T within MethodA to be of type ITypeEntity.
Any thoughts or feedback would be extremely helpful.
Thanks. | 0 | [
2,
13,
9,
2328,
12733,
2109,
1301,
800,
3726,
3726,
31,
22,
79,
749,
20,
10677,
14,
2420,
16,
13,
9,
2328,
12733,
18,
17,
1121,
275,
105,
19,
51,
258,
1797,
47,
31,
643,
946,
77,
21,
1448,
9,
92,
737,
1131,
20,
3271,
20,
55,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 convert an "object" into a function in JavaScript?
===
JavaScript allows functions to be treated as objects--you can add a property to a function. How do you do the reverse, and add a function to an object?
This works:
var foo = function() { return 1; };
foo.baz = "qqqq";
// foo() == 1
// foo.baz == "qqqq"
This doesn't:
var bar = { baz: "qqqq" };
bar = function() { return 1; }; // overwrites! | 0 | [
2,
184,
20,
8406,
40,
13,
7,
23793,
7,
77,
21,
1990,
19,
8247,
8741,
60,
800,
3726,
3726,
8247,
8741,
2965,
3719,
20,
44,
4789,
28,
3916,
8,
8,
245,
92,
3547,
21,
1354,
20,
21,
1990,
9,
184,
107,
42,
107,
14,
7006,
15,
17,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
A way of casting a base type to a derived type
===
I'm not sure if this is a strange thing to do or not, or if it is some how code smell...but I was wondering if there was a way (some sort of oop pattern would be nice) to "cast" a base type to a form of its derived type. I know this makes little sense as the derived type will have additional functionality that the parent doesn't offer which is in its self not fundamentally sound. But is there some way to do this? Here is a code example to so I can better explain what I"m asking.
public class SomeBaseClass {
public string GetBaseClassName {get;set;}
public bool BooleanEvaluator {get;set;}
}
public class SomeDerivedClass : SomeBaseClass {
public void Insert(SqlConnection connection) {
...random connection stuff
cmd.Parameters["IsItTrue"].Value = this.BooleanEvalutar;
...
}
}
public static void Main(object[] args) {
SomeBaseClass class = new SomeBaseClass();
SomeDerivedClass derClass = (SomeDerivedClass)class;
derClass.Insert(new sqlConnection);
}
I know this seems goofy but is there any way to accomplish something of this sort?
| 0 | [
2,
21,
161,
16,
9087,
21,
1000,
1001,
20,
21,
3981,
1001,
800,
3726,
3726,
31,
22,
79,
52,
562,
100,
48,
25,
21,
2578,
584,
20,
107,
54,
52,
15,
54,
100,
32,
25,
109,
184,
1797,
3408,
9,
9,
9,
811,
31,
23,
5712,
100,
80,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Reuse MVC arhitecture; Have two layers of UI : ASP.NET MVC and .NET Winforms
===
Although my question might seem abstract I hope it's not. Suppose I develop an application, an ASP.NET MVC site and later I am tasked to build an Winforms client for this application how much and how can I reuse from the existing application?
I defined the models, I defined controllers and views. They all work well.
Now the boss comes asking for a Winforms client and I am hoping I can reuse the models and the controllers (provided I put them in different assemblies) and not reuse just the views (ASPX views).
Can this be done? How? | 0 | [
2,
302,
3699,
307,
8990,
13,
512,
1822,
9568,
6418,
73,
57,
81,
9124,
16,
13,
5661,
13,
45,
28,
306,
9,
2328,
307,
8990,
17,
13,
9,
2328,
628,
4190,
18,
800,
3726,
3726,
419,
51,
1301,
530,
2260,
8502,
31,
1376,
32,
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... |
What is the best way to run asynchronous jobs in a Rails application?
===
I know there are several plugins that do asynchronous processing. Which one is the best one and why?
The ones I know about are:
- [BackgrounDRb][1]
[1]: http://backgroundrb.rubyforge.org/ | 0 | [
2,
98,
25,
14,
246,
161,
20,
485,
21,
16023,
1291,
4844,
19,
21,
2240,
18,
3010,
60,
800,
3726,
3726,
31,
143,
80,
50,
238,
10922,
108,
18,
30,
107,
21,
16023,
1291,
5511,
9,
56,
53,
25,
14,
246,
53,
17,
483,
60,
14,
53,
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 is the best Ruby tutorial online?
===
Please share the link to **ONE** Ruby tutorial that you think deserves the title. If you have information about the intended target audience's skills, please include it in your answer as well. This will help readers choose an appropriate tutorial. | 0 | [
2,
98,
25,
14,
246,
10811,
29724,
2087,
60,
800,
3726,
3726,
2247,
1891,
14,
3508,
20,
13,
1409,
849,
1409,
10811,
29724,
30,
42,
277,
19829,
14,
581,
9,
100,
42,
57,
676,
88,
14,
2081,
2935,
2663,
22,
18,
3207,
15,
2247,
468,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
Shell script to recursively browse a directory and replace a string
===
I need to recursively search directories and replace a string (say http://development:port/URI) with another (say http://production:port/URI) in all the files where ever it's found. Can anyone help?
It would be much better if that script can print out the files that it modified and takes the search/replace patterns as input parameters.
Regards.
| 0 | [
2,
3593,
3884,
20,
302,
24244,
102,
10175,
62,
21,
16755,
17,
3934,
21,
3724,
800,
3726,
3726,
31,
376,
20,
302,
24244,
102,
2122,
559,
1596,
17,
3934,
21,
3724,
13,
5,
6366,
7775,
6903,
26119,
45,
1993,
118,
3594,
6,
29,
226,
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... |
Editing Embdedded Powerpoint from Excel VBA
===
I have an embedded Powerpoint presentation in an Excel workbook. How can I edit this (open, copy slides, add data to slides, close) using VBA? | 0 | [
2,
9510,
11911,
7424,
7424,
414,
3132,
37,
20700,
566,
969,
800,
3726,
3726,
31,
57,
40,
12138,
414,
3132,
6364,
19,
40,
20700,
170,
5199,
9,
184,
92,
31,
9392,
48,
13,
5,
10157,
15,
4344,
18066,
15,
3547,
1054,
20,
18066,
15,
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,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
How would you generate default user profile pictures?
===
I've been admiring StackOverflow's default quilt-like profile pictures (which I notice are also on the [Fail Blog][1]) and am curious what program both are using to generate them.
But what I really want to know is: **If you were to design the system to create default profile pictures, how would you do it?**
I'm looking for ideas on what algorithm you'd use, as well as things like how you would related the image to the user, be it related to their username, or some portrayal of their progress (ie the image gets more complex, or larger, as they gain reputation).
[1]: http://failblog.org/ | 0 | [
2,
184,
83,
42,
7920,
12838,
4155,
5296,
3104,
60,
800,
3726,
3726,
31,
22,
195,
74,
26041,
7566,
2549,
9990,
22,
18,
12838,
20577,
8,
1403,
5296,
3104,
13,
5,
2140,
31,
3551,
50,
67,
27,
14,
636,
24910,
8146,
500,
2558,
165,
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... |
How to share host VPN connection with VM instances in Hyper-V?
===
I'm running my workstation on Server 2008 and a few servers in Hyper-V VM's on that server. I connect to my corporate LAN using VPN from the main OS (the host) but my VM's aren't seeing the servers in the corporate LAN. Internet and local access to my home network work fine. Each of the VMs has one virtual network adapter.
What should I try to make it work?
Maybe I need to provide more details, please ask if needed.
| 2 | [
2,
184,
20,
1891,
2015,
13,
10924,
103,
2760,
29,
13,
20147,
13946,
19,
5443,
8,
710,
60,
800,
3726,
3726,
31,
22,
79,
946,
51,
170,
10839,
27,
8128,
570,
17,
21,
310,
17595,
19,
5443,
8,
710,
13,
20147,
22,
18,
27,
30,
8128,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
When do transactions start when using (restful) rails
===
Is it the case that the entire restful verb is under a single all encompassing transaction? That is to say, if I raise a Error in the validation or callbacks at any point in the handling of a UPDATE, DELETE, or CREATE operation, is every database operation that I may have performed in previous callbacks also rolled back? Succinctly, does raising a Error on any callback or validation make it such that no change at all occurs in the database for that verb action? | 0 | [
2,
76,
107,
13147,
799,
76,
568,
13,
5,
11466,
1566,
6,
2240,
18,
800,
3726,
3726,
25,
32,
14,
610,
30,
14,
1078,
760,
1566,
9504,
25,
131,
21,
345,
65,
13,
22022,
12799,
60,
30,
25,
20,
395,
15,
100,
31,
3972,
21,
7019,
19,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How to get GCC to use more than two SIMD registers when using intrinsics?
===
I am writing some code and trying to speed it up using SIMD intrinsics SSE2/3. My code is of such nature that I need to load some data into an XMM register and act on it many times. When I'm looking at the assembler code generated, it seems that GCC keeps flushing the data back to the memory, in order to reload something else in XMM0 and XMM1. I am compiling for x86-64 so I have 15 registers. Why is GCC using only two and what can I do to ask it to use more? Is there any way that I can "pin" some value in a register? I added the "register" keyword to my variable definition, but the generated assembly code is identical. | 0 | [
2,
184,
20,
164,
489,
3384,
20,
275,
91,
119,
81,
4861,
43,
2243,
18,
76,
568,
22892,
18,
60,
800,
3726,
3726,
31,
589,
1174,
109,
1797,
17,
749,
20,
1362,
32,
71,
568,
4861,
43,
22892,
18,
13,
9557,
9298,
240,
9,
51,
1797,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Using .Net, how can I determine if a type is a Numeric ValueType?
===
Title says it all...
But here's an example:
Dim desiredType as Type
if IsNumeric(desiredType) then ... | 0 | [
2,
568,
13,
9,
2328,
15,
184,
92,
31,
3746,
100,
21,
1001,
25,
21,
15764,
596,
1923,
4474,
60,
800,
3726,
3726,
581,
898,
32,
65,
9,
9,
9,
47,
235,
22,
18,
40,
823,
45,
5937,
9264,
4474,
28,
1001,
100,
25,
6336,
14744,
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,
0,
0,
0,
0,
0,
0... |
Is there a Max function in SQL Server that takes two values like Math.Max in .NET?
===
I want to write a query like this:
SELECT o.OrderId, MAX(o.NegotiatedPrice, o.SuggestedPrice)
FROM Order o
But this isn't how the MAX function works, right? It is an aggregate function so it expects a single parameter and then returns the MAX of all rows. Does anyone know how to do it my way? | 0 | [
2,
25,
80,
21,
2049,
1990,
19,
4444,
255,
8128,
30,
1384,
81,
4070,
101,
5057,
9,
8304,
19,
13,
9,
2328,
60,
800,
3726,
3726,
31,
259,
20,
2757,
21,
25597,
101,
48,
45,
5407,
635,
9,
7861,
1340,
15,
2049,
5,
111,
9,
556,
759... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Why does Hibernate seem to be designed for short lived sessions?
===
I know this is a subjective question, but why does Hibernate seem to be designed for short lived sessions? Generally in my apps I create DAOs to abstract my data layer, but since I can't predict how the entity objects are going to be used some of its collections are lazy loaded, or I should say fail to load once the session is closed.
Why did they not design it so that it would automatically re-open the session, or have sessions always stay open? | 0 | [
2,
483,
630,
4148,
2102,
8820,
2260,
20,
44,
1006,
26,
502,
1269,
5763,
60,
800,
3726,
3726,
31,
143,
48,
25,
21,
22835,
1301,
15,
47,
483,
630,
4148,
2102,
8820,
2260,
20,
44,
1006,
26,
502,
1269,
5763,
60,
1469,
19,
51,
4865,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 pre-size an array in Lua?
===
I've got a Lua program that seems to be slower than it ought to be. I suspect the issue is that I'm adding values to an associative array one at a time and the table has to allocate new memory each time.
There did seem to be a table.setn function, but it fails under Lua 5.1.3:
stdin:1: 'setn' is obsolete
stack traceback:
[C]: in function 'setn'
stdin:1: in main chunk
[C]: ?
I gather from the Google searching I've done that this function was depreciated in Lua 5.1, but I can't find what (if anything) replaced the functionality.
Do you know how to pre-size a table in Lua?
Alternatively, is there some other way to avoid memory allocation when you add an object to a table? | 0 | [
2,
184,
107,
42,
782,
8,
10454,
40,
7718,
19,
1612,
58,
60,
800,
3726,
3726,
31,
22,
195,
330,
21,
1612,
58,
625,
30,
2206,
20,
44,
14085,
119,
32,
11869,
20,
44,
9,
31,
7551,
14,
1513,
25,
30,
31,
22,
79,
4721,
4070,
20,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
.net - How do you Register a startup script?
===
I have limited experience with .net. My app throws an error this.dateTimeFormat is undefined which I tracked down to a known ajax bug. The workaround posted said to:
"Register the following as a startup script:"
Sys.CultureInfo.prototype._getAbbrMonthIndex = function(value)
{
if (!this._upperAbbrMonths) {
this._upperAbbrMonths = this._toUpperArray(this.dateTimeFormat.AbbreviatedMonthNames);
}
return Array.indexOf(this._upperAbbrMonths, this._toUpper(value));
};
So how do I do this? Do I add the script to the bottom of my aspx file? | 0 | [
2,
13,
9,
2328,
13,
8,
184,
107,
42,
2243,
21,
20205,
3884,
60,
800,
3726,
3726,
31,
57,
1317,
1496,
29,
13,
9,
2328,
9,
51,
4865,
13566,
40,
7019,
48,
9,
8209,
891,
23588,
25,
367,
13439,
56,
31,
15535,
125,
20,
21,
167,
20... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Asynchronous PHP calls?
===
Is there a way to PHP make asynchronous http calls? I don't care about the response, I just want to do something like `file_get_contents()`, but not wait on the request to finish before executing the rest of my code. This would be super useful for setting off "events" of a sort in my application, or triggering long processes.
Any ideas? | 0 | [
2,
21,
16023,
1291,
13,
26120,
3029,
60,
800,
3726,
3726,
25,
80,
21,
161,
20,
13,
26120,
233,
21,
16023,
1291,
7775,
3029,
60,
31,
221,
22,
38,
781,
88,
14,
1627,
15,
31,
114,
259,
20,
107,
301,
101,
13,
1,
16877,
1,
3060,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
SQL Server Adapter for Rails
===
Trying to find the sqlserver adapter for rails on windows.
I have tried getting it from (without luck):
gem install activerecord-sqlserver-adapter --source=http://gems.rubyonrails.org
Where else can I get this gem? | 0 | [
2,
4444,
255,
8128,
9924,
106,
26,
2240,
18,
800,
3726,
3726,
749,
20,
477,
14,
4444,
255,
10321,
106,
9924,
106,
26,
2240,
18,
27,
1936,
9,
31,
57,
794,
1017,
32,
37,
13,
5,
14506,
5419,
6,
45,
8551,
16146,
1348,
14953,
8,
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... |
.net COM+ object that returns IDataReader
===
I've created a .net class derived from ServicedComponent and registered it with COM+. The interface that this component implements has a method that returns an IDataReader. When I call the serviced component from my client application everything works I can call the method that returns the IDataReader no problem but as soon as I call a method on the object I get the exception:
"System.Runtime.Remoting.RemotingException : This remoting proxy has no channel sink which means either the server has no registered server channels that are listening, or this application has no suitable client channel to talk to the server."
I hacked my code a fair bit and realized that it would work if I created my own implementation of IDataReader that was serializable (has the Serializable attribute). If the implementation derives from MarshalByRefObject it fails.
So, is it possible to return standard .net objects by reference from COM+ ServicedComponents and if so what do I need to do to achieve it?
| 0 | [
2,
13,
9,
2328,
13,
960,
2430,
3095,
30,
4815,
31,
18768,
10647,
106,
800,
3726,
3726,
31,
22,
195,
679,
21,
13,
9,
2328,
718,
3981,
37,
365,
43,
11103,
218,
2291,
17,
3801,
32,
29,
13,
960,
2430,
9,
14,
6573,
30,
48,
5912,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 books or other resources do you suggest for bootsrapping a small software company?
===
I'm looking for books or other resources that would help me bootstrap a small software company.
If you have any recommendations, please post it. If someone else has posted it already, please upvote your favorites.
| 4 | [
2,
98,
964,
54,
89,
2566,
107,
42,
5601,
26,
5894,
525,
5574,
21,
284,
2306,
237,
60,
800,
3726,
3726,
31,
22,
79,
699,
26,
964,
54,
89,
2566,
30,
83,
448,
55,
5894,
16514,
21,
284,
2306,
237,
9,
100,
42,
57,
186,
12121,
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... |
DLL information
===
How exactly do dlls work? There seems to be an awful lot of them, but I don't know what they are or how they work.
So, what's the deal with them? | 0 | [
2,
13,
43,
211,
676,
800,
3726,
3726,
184,
1890,
107,
13,
43,
211,
18,
170,
60,
80,
2206,
20,
44,
40,
9021,
865,
16,
105,
15,
47,
31,
221,
22,
38,
143,
98,
59,
50,
54,
184,
59,
170,
9,
86,
15,
98,
22,
18,
14,
1183,
29,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
Java equals(): to reflect or not to reflect
===
This question is specifically related to overriding the equals() method for objects with a large number of fields. First off, let me say that this large object cannot be broken down into multiple components without violating OO principles, so telling me "no class should have more than x fields" won't help.
Moving on, the problem came to fruition when I forgot to check one of the fields for equality. Therefore, my equals method was incorrect. Then I thought to use reflection:
Field[] fields = this.getClass().getDeclaredFields();
boolean foundMismatch = false;
for (int i = 0; i < fields.length; ++i) {
Field field = fields[i];
try {
Object objValue = field.get(obj) == null ? "" : field.get(obj);
Object thisValue = field.get(this) == null ? "" : field.get(this);
if (!thisValue.equals(objValue))
return false;
}
} catch (IllegalAccessException ex) {
LOG.info(ex);
}
} return true;
The purpose of this post isn't necessarily to refactor the code (this isn't even the code I am using), but instead to get input on whether or not this is a good idea.
Pros:
If a new field is added, it is automatically included<br>
The method is much more terse than 30 if statements
Cons:
If a new field is added, it is automatically included, sometimes this is undesirable<br>
Performance: This has to be slower, I don't feel the need to break out a profiler<br>
Whitelisting certain fields to ignore in the comparison is a little ugly<br>
Any thoughts? | 0 | [
2,
8247,
2747,
18,
5,
6,
45,
20,
6907,
54,
52,
20,
6907,
800,
3726,
3726,
48,
1301,
25,
3524,
1597,
20,
84,
5175,
68,
14,
2747,
18,
5,
6,
2109,
26,
3916,
29,
21,
370,
234,
16,
2861,
9,
64,
168,
15,
408,
55,
395,
30,
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... |
compression library for c and php
===
To save network traffic I'd like to compress my data. The only trick is that I the client is a c application and the server is php. I'm looking for an open source compression library that's available for both c and php.
I guess I could write an external c application to decompress my data, but I'm trying to avoid spawning extra processes on the server.
If you know of any, please post it!
| 0 | [
2,
14864,
1248,
26,
272,
17,
13,
26120,
800,
3726,
3726,
20,
2079,
982,
2227,
31,
22,
43,
101,
20,
26060,
51,
1054,
9,
14,
104,
5514,
25,
30,
31,
14,
6819,
25,
21,
272,
3010,
17,
14,
8128,
25,
13,
26120,
9,
31,
22,
79,
699,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Osmotic communication -vs- closed-off offices?
===
What are people's experiences with osmotic communication (as recommended by Alastair Cockburn as part of [Crystal Clear][1]) as opposed to giving developers individual offices with doors (as recommended by lots of people; for instance, [Joel Spolsky][2]. Joel comes back to this [here][3] )
Has anyone found the learning-by-osmosis approach to work well? Cockburn suggests a "cone of silence" to allow lead developers to get work done without distractions, but his idea of that being 6pm to 2am isn't always practical. I can see the advantage of osmotic learning for the people doing the learning, but on the other end of things it makes it difficult to get any work done on tough problems where you need concentration.
Do people doing this find that it's actually a win overall for the whole team, even though some people get less work done? Is anyone deliberately doing this, or is it just an accident of cubicle design when it happens?
[1]: http://alistair.cockburn.us/index.php/Osmotic_communication+osmotic+communication
[2]: http://www.joelonsoftware.com/articles/fog0000000068.html
[3]: http://www.joelonsoftware.com/items/2005/10/16.html | 0 | [
2,
13,
759,
79,
9440,
3291,
13,
8,
710,
18,
8,
827,
8,
1299,
3642,
60,
800,
3726,
3726,
98,
50,
148,
22,
18,
5513,
29,
13,
759,
79,
9440,
3291,
13,
5,
472,
5773,
34,
21,
8558,
2642,
5528,
4249,
28,
141,
16,
636,
25905,
1207,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 should I use Perl instead of Python?
===
See also [the opposite question](http://stackoverflow.com/questions/124602/why-should-i-use-python-instead-of-perl). And keep it civil! | 4 | [
2,
483,
378,
31,
275,
416,
255,
700,
16,
20059,
60,
800,
3726,
3726,
196,
67,
636,
124,
2794,
1301,
500,
5,
21127,
6903,
25325,
2549,
9990,
9,
960,
118,
24652,
18,
118,
918,
17107,
9298,
2256,
8,
14941,
8,
49,
8,
3699,
8,
6448,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
"SELECT * FROM users WHERE in IN ( )" == FAIL
===
I have a function that I use called sqlf(), it emulates prepared statements. For instance I can do things like:
<pre>
$sql = sqlf("SELECT * FROM Users WHERE name= :1 AND email= :2",'Big "John"','bj@example.com') ;
</pre>
For various reasons, I cannot use prepared statements, but I would like to emulate them. The problem that I run into is with queries like
<pre>
$sql = sqlf("SELECT * FROM Users WHERE id IN (:1)",array(1,2,3) );
</pre>
My code works, but it fails with empty arrays, e.g. the following throws a mysql error:
<pre>
SELECT * FROM Users WHERE id IN ();
</pre>
Does anyone have any suggestions? How should I translate and empty array into sql that can be injected into an IN clause? Substituting NULL will not work.
| 0 | [
2,
13,
7,
18,
16964,
1637,
37,
3878,
113,
19,
19,
13,
5,
13,
6,
7,
800,
3726,
7476,
800,
3726,
3726,
31,
57,
21,
1990,
30,
31,
275,
227,
4444,
9641,
5,
6,
15,
32,
23804,
18,
3268,
9015,
9,
26,
4851,
31,
92,
107,
564,
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... |
iterate over classes ie. beans for asp.net
===
Lets say I have a class that stores user information complete with getters and setters, and it is populated with data from an XML file. How would I iterate over all of the instances of that class like you would do with java beans and tag libraries? | 0 | [
2,
32,
106,
1373,
84,
2684,
13,
660,
9,
14685,
26,
28,
306,
9,
2328,
800,
3726,
3726,
6884,
395,
31,
57,
21,
718,
30,
4134,
4155,
676,
1279,
29,
164,
6052,
17,
309,
6052,
15,
17,
32,
25,
11111,
29,
1054,
37,
40,
23504,
3893,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 fast can you code?
===
I haven't done any pair programming nor really watched people code. I was wondering how fast most programmers code. I know there's huge differences in terms of language expressiveness (I've programmed in Lisp), but thought I could still infer something if there are enough replies.
Even for supposedly simple problems (meaning I pretty much have the whole algorithm and important implementation details in my head before I code), I rarely go over 200 lines of C#/Java (including blank lines) in a work day (8 hours). Much of the time is spent looking up documentation, debugging, and testing...and I haven't even learned unit testing yet.
A little background: I'm still in college and the above was based on my internship experience. It was ASP.NET development (in a not exactly complex domain). | 0 | [
2,
184,
1512,
92,
42,
1797,
60,
800,
3726,
3726,
31,
2933,
22,
38,
677,
186,
2146,
3143,
2127,
510,
1634,
148,
1797,
9,
31,
23,
5712,
184,
1512,
127,
17968,
18,
1797,
9,
31,
143,
80,
22,
18,
2329,
4921,
19,
1663,
16,
816,
2509... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Computing pseudo-inverse of a matrix in C++
===
I'm looking to compute the Moore-Penrose pseudo-inverse of a matrix in C++, can someone point me to a library implementation or a numerical recipe?
Thanks! | 0 | [
2,
10626,
8452,
8,
108,
9453,
16,
21,
8187,
19,
272,
20512,
800,
3726,
3726,
31,
22,
79,
699,
20,
23909,
14,
3763,
8,
3014,
10639,
8452,
8,
108,
9453,
16,
21,
8187,
19,
272,
20512,
15,
92,
737,
454,
55,
20,
21,
1248,
6123,
54,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 do I generate an array of pairwise distances in Ruby?
===
Say I have an array that represents a set of points:
x = [2, 5, 8, 33, 58]
How do I generate an array of all the pairwise distances? I'm looking for a map function instead of a loop if at all possible.
Thanks!
| 0 | [
2,
184,
107,
31,
7920,
40,
7718,
16,
2146,
10474,
15731,
19,
10811,
60,
800,
3726,
3726,
395,
31,
57,
40,
7718,
30,
4719,
21,
309,
16,
819,
45,
993,
800,
636,
135,
15,
331,
15,
469,
15,
3534,
15,
7216,
500,
184,
107,
31,
7920,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 Give a Textbox Focus in Silverlight?
===
In my Silverlight application, I can't seem to bring focus to a TextBox control. On the recommendation of various posts, I've set the IsTabStop property to True and I'm using TextBox.Focus(). Though the UserControl_Loaded event is firing, the TextBox control isn't getting focus. I've included my very simple code below. What am I missing? Thanks.
***Page.xaml***
<UserControl x:Class="TextboxFocusTest.Page"
xmlns="http://schemas.microsoft.com/winfx/2006/xaml/presentation"
xmlns:x="http://schemas.microsoft.com/winfx/2006/xaml"
Loaded="UserControl_Loaded"
Width="400" Height="300">
<Grid x:Name="LayoutRoot" Background="White">
<StackPanel Width="150" VerticalAlignment="Center">
<TextBox x:Name="RegularTextBox" IsTabStop="True" />
</StackPanel>
</Grid>
</UserControl>
***Page.xaml.cs***
using System.Windows;
using System.Windows.Controls;
namespace PasswordTextboxTest
{
public partial class Page : UserControl
{
public Page()
{
InitializeComponent();
}
private void UserControl_Loaded(object sender, RoutedEventArgs e)
{
RegularTextBox.Focus();
}
}
}
| 0 | [
2,
184,
107,
31,
590,
21,
1854,
5309,
1776,
19,
1172,
3130,
60,
800,
3726,
3726,
19,
51,
1172,
3130,
3010,
15,
31,
92,
22,
38,
2260,
20,
1499,
1776,
20,
21,
1854,
5309,
569,
9,
27,
14,
14066,
16,
617,
9868,
15,
31,
22,
195,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Have you integrated Mantis and Subversion?
===
I do mostly Windows development. We use [Mantis][1] and [Subversion][2] for our development but they aren't integrated together, in fact they are on different servers.
I did a little googling about integrating the two together and came across [this post][3]. It looked interesting.
I was wondering if anyone is doing this or has done this and what your experience has been. If you've got a different solution, I'd be interested in knowing that too!
Thanks!
[1]: http://www.mantisbt.org/
[2]: http://subversion.tigris.org/
[3]: http://alt-tag.com/blog/archives/2006/11/integrating-mantis-and-subversion/ | 0 | [
2,
57,
42,
5547,
169,
3409,
17,
972,
10898,
60,
800,
3726,
3726,
31,
107,
1555,
1936,
522,
9,
95,
275,
636,
177,
3409,
500,
2558,
165,
500,
17,
636,
7563,
10898,
500,
2558,
135,
500,
26,
318,
522,
47,
59,
4847,
22,
38,
5547,
4... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Should I learn/play with Perl 6?
===
Perl 6 has been under development for over 8 years now, and (as ever) there seems to be no end in sight. However, it has had a reasonable implementation for some time, Pugs, and even has multiple implementations now.
When I last took a look at Perl 6 a few years ago, it seemed to me that there were lots of interesting ideas, but that everything was either changing or unspecified. As a result, I ended up picking up Haskell instead -- having been inspired by Pugs.
My current favorite languages are Perl (5) and Haskell, and I would only be doing this for side projects of my own. Is it worth playing around with Perl 6 now, or will I still be hitting a moving target that's also sometimes broken? Are the new ideas and syntaxes truly exciting? | 4 | [
2,
378,
31,
2484,
118,
5438,
29,
416,
255,
400,
60,
800,
3726,
3726,
416,
255,
400,
63,
74,
131,
522,
26,
84,
469,
122,
130,
15,
17,
13,
5,
472,
462,
6,
80,
2206,
20,
44,
90,
241,
19,
2064,
9,
207,
15,
32,
63,
41,
21,
99... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Learning how to use Subversion
===
This is probably a really stupid newbie-sounding question to you developer type people, but I'm at a loss :( I've been trying to learn how to use Subversion for keeping the history of my code, but I'm finding it pretty confusing. I read the 'book' that comes with Subversion, but I didn't find it all that helpful. I'm using Windows, and I downloaded the TortoiseSVN GUI for it.
All I really want to know how to do is to create a new project, put a file in it (any old file), and then update that file, just so I can see how it works. I created a 'repository' (in svn_repository/test), and if anyone could tell me how I'm supposed to go about creating a new file/putting a file in it, and then updating that file I'd be really happy :) Knowing my luck it'll be something as simple as "drag and drop the file into the directory". Apologies for asking such a stupid question!
Also if anyone could tell me how to go about making it work with Zend Studio, that would be extra awesome-points. Thanks! | 0 | [
2,
2477,
184,
20,
275,
972,
10898,
800,
3726,
3726,
48,
25,
910,
21,
510,
3553,
78,
5893,
8,
8489,
68,
1301,
20,
42,
10058,
1001,
148,
15,
47,
31,
22,
79,
35,
21,
1526,
13,
45,
5,
31,
22,
195,
74,
749,
20,
2484,
184,
20,
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... |
Picking a random element from a set
===
How do I pick a random element from a set?
I'm particularly interested in picking a random element from a
HashSet or a LinkedHashSet, in Java.
Solutions for other languages are also welcome. | 0 | [
2,
7833,
21,
5477,
4520,
37,
21,
309,
800,
3726,
3726,
184,
107,
31,
2036,
21,
5477,
4520,
37,
21,
309,
60,
31,
22,
79,
1653,
3158,
19,
7833,
21,
5477,
4520,
37,
21,
19170,
3554,
54,
21,
4727,
25436,
3554,
15,
19,
8247,
9,
677... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
How can you find available ldap servers from a computer in the same network, but different domain?
===
My company has code that integrates with activedirectory/LDAP for centralized userid/password login. Currently, the configuration page can only show the LDAP server linked to the Exchange domain the current computer is on. I'd like to list all available LDAP servers, similar to when you go to Windows Explorer and view 'Microsoft Windows Network'. As of now, I've been unable to get this information through LDAP or through other means. | 0 | [
2,
184,
92,
42,
477,
904,
644,
20472,
17595,
37,
21,
1428,
19,
14,
205,
982,
15,
47,
421,
4603,
60,
800,
3726,
3726,
51,
237,
63,
1797,
30,
18399,
18,
29,
1348,
10197,
93,
118,
255,
20472,
26,
25176,
275,
5175,
118,
6201,
9587,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Can you have custom client-side javascript Validation for standard ASP.NET Web Form Validators?
===
Can you have custom client-side javascript Validation for standard ASP.NET Web Form Validators?
For instance use a asp:RequiredFieldValidator leave the server side code alone but implement your own client notification using jQuery to highlight the field or background color for example. | 0 | [
2,
92,
42,
57,
5816,
6819,
8,
1416,
8247,
8741,
27999,
26,
1236,
28,
306,
9,
2328,
2741,
505,
7394,
9922,
60,
800,
3726,
3726,
92,
42,
57,
5816,
6819,
8,
1416,
8247,
8741,
27999,
26,
1236,
28,
306,
9,
2328,
2741,
505,
7394,
9922... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How do you get extra path information to not be treated as part of the servlet class name in Tomcat
===
I am having an issue where Tomcat is treating extra path information as part of the class name. This is breaking a bunch of RESTFul functionality in our webapp (we use extra path info rather than ?name=value pairs for crawler friendly links), and appears to have been introduced (it was working correctly before) when adding explicit mappings and removing the 'Invoker' servlet that we used to use to serve our servlets. For example consider the following link:
http://mydomain.com/servlet/MyServlet/param1/param2/param3
'MyServlet' used to be called correctly, and '/param1/param2/param3' was returned by getPathInfo() on the HttpServletRequest.
Now, it appears that Tomcat is trying to load MyServlet/param1/param2/param3 as the class
[23/Sep/2008:16:44:23 -0700] "GET /servlet/MyServlet/param1/param2/param3 HTTP/1.0" 404
Here is the way they are defined and mapped in the web.xml, and just hitting
http://mydomain.com/servlet/MyServlet works fine.
<servlet>
<servlet-name>MyServlet</servlet-name>
<servlet-class>com.myclass.etcetera.MyServlet</servlet-class>
</servlet>
<servlet-mapping>
<servlet-name>MyServlet</servlet-name>
<url-pattern>/servlet/MyServlet</url-pattern>
</servlet-mapping>
| 0 | [
2,
184,
107,
42,
164,
2230,
2013,
676,
20,
52,
44,
4789,
28,
141,
16,
14,
13,
10321,
1336,
718,
204,
19,
2067,
5782,
800,
3726,
3726,
31,
589,
452,
40,
1513,
113,
2067,
5782,
25,
13749,
2230,
2013,
676,
28,
141,
16,
14,
718,
2... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
What is the intended use of the DEFAULT section in config files used by ConfigParser?
===
I've used ConfigParser for quite a while for simple configs. One thing that's bugged me for a long time is the DEFAULT section. I'm not really sure what's an appropriate use. I've read the documentation, but I would really like to see some clever examples of its use and how it affects other sections in the file (something that really illustrates the kind of things that are possible). | 0 | [
2,
98,
25,
14,
2081,
275,
16,
14,
12838,
1050,
19,
13,
14093,
2816,
6488,
147,
34,
13,
14093,
2816,
3574,
4104,
60,
800,
3726,
3726,
31,
22,
195,
147,
13,
14093,
2816,
3574,
4104,
26,
1450,
21,
133,
26,
1935,
13,
14093,
2816,
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... |
Web Services or Custom Protocol?
===
I have no experience with web services. Historically I've built client-server systems using proprietary communication protocols (even they happen to be XML). I just spent a few hours looking over Axis2 and it sent a shudder down my spine. The learning curve of WS scares me, and seeing all that XML surround so little functionality makes me wonder if it's worth the trouble.
How do you decide whether you need to use Web Services or a custom communication protocol? What are the advantages/disadvantages of each approach and what use-cases are they best suited for? | 0 | [
2,
2741,
687,
54,
5816,
8494,
60,
800,
3726,
3726,
31,
57,
90,
1496,
29,
2741,
687,
9,
6246,
31,
22,
195,
392,
6819,
8,
10321,
106,
1242,
568,
18856,
3291,
19957,
13,
5,
4943,
59,
2384,
20,
44,
23504,
6,
9,
31,
114,
1111,
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... |
LINQ to XML Newbie Question
===
Greetings!
I'm working on wrapping my head around LINQ. If I had some XML such as this loaded into an XDocument object:
<Root>
<GroupA>
<Item attrib1="aaa" attrib2="000" />
</GroupA>
<GroupB>
<Item attrib1="bbb" attrib2="111" />
<Item attrib1="ccc" attrib2="222" />
<Item attrib1="ddd" attrib2="333" />
</GroupB>
<GroupC>
<Item attrib1="eee" attrib2="444" />
<Item attrib1="fff" attrib2="555" />
</GroupC>
</Root>
What would a query look like to retrieve the names of the group nodes? For example, I'd like a query to return:
GroupA
GroupB
GroupC
Thanks. | 0 | [
2,
6294,
1251,
20,
23504,
78,
5893,
1301,
800,
3726,
3726,
13769,
18,
187,
31,
22,
79,
638,
27,
13437,
51,
157,
140,
6294,
1251,
9,
100,
31,
41,
109,
23504,
145,
28,
48,
8572,
77,
40,
993,
28132,
3095,
45,
13,
1,
14032,
1,
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... |
Breaking event cycles in GUIs
===
When writing GUIs, I've frequently come over the following problem: Assume you have a model and a controller. The controller has a widget `W` that is used to show a property `X` of the model.
Because the model might be changed from outside the controller (there might be other controllers using the same model, undo operations etc), the controller listens to changes on the model. The controller also listens to events on the widget `W` and updates the property `X` accordingly.
Now, the following happens:
1. the value in `W` is changed
2. an event is generated, the handler in the **controller** is invoked
3. the **controller** sets the new value for `X` in the **model**
4. the **model** emits events because it has been changed
5. the **controller** receives a change event from the **model**
6. the **controller** gets the value of `X` and sets it in the widget
7. goto 1.
There are several possible solutions for that:
1. Modify the controller to set a flag when the model is updated, and not react to any events from the model if this flag is set.
2. Disconnect the controller temporarily (or tell the model not to send any events for some time)
3. Freeze any updates from the widget
In the past, I usually went for option 1., because it's the simplest thing. It has the drawback of cluttering your classes with flags, but the other methods have their drawbacks, too.
Just for the record, I've had this problem with several GUI toolkits, including GTK+, Qt and SWT, so I think it's pretty toolkit-agnostic.
Any best practices? Or is the architecture I use simply wrong?
| 0 | [
2,
3892,
807,
14763,
19,
9457,
18,
800,
3726,
3726,
76,
1174,
9457,
18,
15,
31,
22,
195,
3086,
340,
84,
14,
249,
1448,
45,
7158,
42,
57,
21,
1061,
17,
21,
9919,
9,
14,
9919,
63,
21,
4807,
43,
3060,
13,
1,
499,
1,
30,
25,
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... |
Max length of send() data param on XMLHttpRequest Post
===
Is there a documented max to the length of the string data you can use in the send method of an XMLHttpRequest for the major browser implementations?
I am running into an issue with a JavaScript XMLHttpRequest Post failing in FireFox 3 when the data is over approx 3k. I was assuming the Post would behave the same as a conventional Form Post.
The W3C docs mention the data param of the send method is a DOMString but I am not sure how the major browsers implement that.
Here is a simplified version of my JavaScript, if bigText is over about 3k it fails, otherwise it works...
var xhReq = createXMLHttpRequest();
function createXMLHttpRequest() {
try { return new ActiveXObject("Msxml2.XMLHTTP"); } catch (e) {}
try { return new ActiveXObject("Microsoft.XMLHTTP"); } catch (e) {}
try { return new XMLHttpRequest(); } catch(e) {}
alert("XMLHttpRequest not supported");
return null;
}
function mySubmit(id, bigText) {
var url = "SubmitPost.cfm";
var params = "id=" + id + "&bigtext=" + encodeURI(bigText);
xhReq.open("POST", url, true);
//Send the header information along with the request
xhReq.setRequestHeader("Content-type", "application/x-www-form-urlencoded");
xhReq.setRequestHeader("Content-length", params.length);
xhReq.setRequestHeader("Connection", "close");
xhReq.onreadystatechange = onPostSubmit;
xhReq.send(params);
}
function onPostSubmit() {
if (xhReq.readyState==4 || xhReq.readyState=="complete")
{
if (xhReq.status != 200)
{
alert('BadStatus');
return;
}
}
} | 0 | [
2,
2049,
1476,
16,
2660,
5,
6,
1054,
2258,
79,
27,
23504,
21127,
99,
10351,
678,
800,
3726,
3726,
25,
80,
21,
8926,
2049,
20,
14,
1476,
16,
14,
3724,
1054,
42,
92,
275,
19,
14,
2660,
2109,
16,
40,
23504,
21127,
99,
10351,
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... |
Sniffing network traffic for signs of viruses/spyware
===
How can I connect a system to a network and sniff for virus/spyware related traffic? I'd like to plug in a network cable, fire up an appropriate tool sand have it scan the data for any signs of problems. I don't expect this to find everything, and this is not to prevent initial infection but to help determine if there is anything trying to actively infect other system/causing network problems.
Running a regular network sniffer and manually looking through the results is no good unless the traffic is really obvious,but I havn't been able to find any tool to scan a network data stream automatically.
| 0 | [
2,
15312,
68,
982,
2227,
26,
4832,
16,
6231,
160,
118,
18,
6448,
5011,
800,
3726,
3726,
184,
92,
31,
6379,
21,
329,
20,
21,
982,
17,
15312,
26,
6231,
118,
18,
6448,
5011,
1597,
2227,
60,
31,
22,
43,
101,
20,
10922,
19,
21,
982... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Are Mutexes needed in javascript?
===
I have seen this link: [Implementing Mutual Exclusion in JavaScript][1].
On the other hand, I have read that there are no threads in javascript, but what exactly does that mean?
When events occur, where in the code can they interrupt?
And if there are no threads in JS, do I need to use mutexes in JS or not?
Specifically, I am wondering about the effects of using functions called by `setTimeout()` and `XmlHttpRequest`'s `onreadystatechange` on globally accessible variables.
[1]: http://www.developer.com/lang/jscript/article.php/3592016 | 0 | [
2,
50,
20562,
13012,
18,
851,
19,
8247,
8741,
60,
800,
3726,
3726,
31,
57,
541,
48,
3508,
45,
636,
8983,
413,
1130,
68,
7643,
16232,
19,
8247,
8741,
500,
2558,
165,
500,
9,
27,
14,
89,
224,
15,
31,
57,
1302,
30,
80,
50,
90,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 do you use to deploy your Web Applications?
===
We're looking to automate our deployment of Web Applications, particularly when going from local development to a remote server.
Our current stack is LAMP remotely, MAMP locally, but I'm interested in general what people are using for this task regardless of their environment? | 4 | [
2,
98,
107,
42,
275,
20,
17617,
154,
2741,
3767,
60,
800,
3726,
3726,
95,
22,
99,
699,
20,
3108,
5281,
318,
10475,
16,
2741,
3767,
15,
1653,
76,
228,
37,
375,
522,
20,
21,
5388,
8128,
9,
318,
866,
7566,
25,
6792,
23288,
15,
12... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
GetPrivateProfileString Oddity
===
I was just tinkering around with calling GetPrivateProfileString and GetPrivateProfileSection in kernel32 from .NET and came across something odd I don't understand.
Let's start with this encantation:
Private Declare Unicode Function GetPrivateProfileString Lib "kernel32" Alias "GetPrivateProfileStringW" ( _
ByVal lpApplicationName As String, _
ByVal lpKeyName As String, _
ByVal lpDefault As String, _
ByVal lpReturnedString() As Char, _
ByVal nSize As Int32, _
ByVal lpFileName As String) As Int32
If I pass an lpApplicationName (section), no lpKeyName and no lpDefault, I should get all of the keys for that section, and indeed I do: 50% of the time.
If the ini file has the lpApplicationName starting on the first line, the buffer returns nothing. If lpApplicationName stats on the second line in the file, it returns the expected values.
At first I though it was a matter of using the W version and Unicode in the Declare, but changing those seems to have no effect.
What am I missing? | 0 | [
2,
164,
20181,
14503,
11130,
4210,
856,
800,
3726,
3726,
31,
23,
114,
25438,
68,
140,
29,
2555,
164,
20181,
14503,
11130,
17,
164,
20181,
14503,
10579,
19,
17007,
3125,
37,
13,
9,
2328,
17,
281,
464,
301,
4210,
31,
221,
22,
38,
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... |
Could not load type from assembly error
===
I have written the following simple test in trying to learn Castle Windsor's Fluent Interface:
using NUnit.Framework;
using Castle.Windsor;
using System.Collections;
using Castle.MicroKernel.Registration;
namespace WindsorSample {
public class MyComponent : IMyComponent {
public MyComponent(int start_at) {
this.Value = start_at;
}
public int Value { get; private set; }
}
public interface IMyComponent {
int Value { get; }
}
[TestFixture]
public class ConcreteImplFixture {
[Test]
public void ResolvingConcreteImplShouldInitialiseValue() {
IWindsorContainer container = new WindsorContainer();
container.Register(Component.For<IMyComponent>().ImplementedBy<MyComponent>().Parameters(Parameter.ForKey("start_at").Eq("1")));
IMyComponent resolvedComp = container.Resolve<IMyComponent>();
Assert.AreEqual(resolvedComp.Value, 1);
}
}
}
When I execute the test through TestDriven.NET I get the following error:
System.TypeLoadException : Could not load type 'Castle.MicroKernel.Registration.IRegistration' from assembly 'Castle.MicroKernel, Version=1.0.3.0, Culture=neutral, PublicKeyToken=407dd0808d44fbdc'.
at WindsorSample.ConcreteImplFixture.ResolvingConcreteImplShouldInitialiseValue()
When I execute the test through the NUnit GUI I get:
WindsorSample.ConcreteImplFixture.ResolvingConcreteImplShouldInitialiseValue:
System.IO.FileNotFoundException : Could not load file or assembly 'Castle.Windsor, Version=1.0.3.0, Culture=neutral, PublicKeyToken=407dd0808d44fbdc' or one of its dependencies. The system cannot find the file specified.
If I open the Assembly that I am referencing in Reflector I can see its information is:
Castle.MicroKernel, Version=1.0.3.0, Culture=neutral, PublicKeyToken=407dd0808d44fbdc
and that it definitely contains **Castle.MicroKernel.Registration.IRegistration**
What could be going on? | 0 | [
2,
110,
52,
6305,
1001,
37,
1475,
7019,
800,
3726,
3726,
31,
57,
642,
14,
249,
1935,
1289,
19,
749,
20,
2484,
1339,
10784,
22,
18,
19252,
6573,
45,
568,
10210,
242,
9,
8361,
3783,
73,
568,
1339,
9,
7809,
18,
248,
73,
568,
329,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Flags in a database rows, best practices.
===
I am asking this out of a curiosity. Basically my question is when you have a database which needs a row entry to have things which act like flags, what is the best practice? A good example of this would be the badges on stack overflow, or the operating system field in bugzilla. Any subset of the flags may be set for a given entry.
Usually, I do c and c++ work, so my gut reaction is to use an unsigned integer field as a set of bits which can be flipped... But i know that isn't a good solution for several reasons. The most obvious of which is saleability, there will be a hard upper limit on how many flags I can have.
I can also think of a couple of other solutions which scale better but would have performance issues because they would require multiple selects to get all the information.
So, what is the "right" way to do this? | 0 | [
2,
9318,
19,
21,
6018,
11295,
15,
246,
5242,
9,
800,
3726,
3726,
31,
589,
3379,
48,
70,
16,
21,
11581,
9,
11374,
51,
1301,
25,
76,
42,
57,
21,
6018,
56,
2274,
21,
3131,
2792,
20,
57,
564,
56,
601,
101,
9318,
15,
98,
25,
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... |
OpenGL still best for non-games ?
===
With the debacle of openGL 3.0, is openGl still the natural choice for engineering style 3D apps (cad/GIS)?
Is Direct3D only best if you need advanced vertex shaders?
Are there scenegraph libraries for Direct3D?
If this is going to be the year of Linux desktop is moving to Direct3D a good idea?
Or is Tim Sweeney right (http://arstechnica.com/articles/paedia/gpu-sweeney-interview.ars) and both are going to become irrelavant
| 0 | [
2,
368,
8430,
174,
246,
26,
538,
8,
16648,
13,
60,
800,
3726,
3726,
29,
14,
121,
969,
5615,
16,
368,
8430,
203,
9,
387,
15,
25,
368,
8430,
174,
14,
1112,
1837,
26,
1552,
1034,
203,
43,
4865,
18,
13,
5,
13489,
118,
12469,
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 select an <img> element programmatically using JavaScript?
===
I have an `<img>` in an HTML document that I would like to highlight as though the user had highlighted it using the mouse. Is there a way to do that using JavaScript?
I only need it to work in Mozilla, but any and all information is welcome. | 0 | [
2,
184,
92,
31,
5407,
40,
13,
1,
1660,
263,
1,
4520,
625,
6732,
1326,
568,
8247,
8741,
60,
800,
3726,
3726,
31,
57,
40,
13,
1,
1660,
263,
1,
19,
40,
13,
15895,
4492,
30,
31,
83,
101,
20,
14373,
28,
362,
14,
4155,
41,
12528,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 prevent a class from being allocated via the 'new' operator? (I'd like to ensure my RAII class is always allocated on the stack.)
===
I'd like to ensure my RAII class is always allocated on the stack.
How do I prevent a class from being allocated via the 'new' operator?
| 0 | [
2,
184,
107,
31,
2501,
21,
718,
37,
142,
11685,
1197,
14,
13,
22,
2681,
22,
6022,
60,
13,
5,
49,
22,
43,
101,
20,
4062,
51,
6623,
49,
718,
25,
550,
11685,
27,
14,
7566,
9,
6,
800,
3726,
3726,
31,
22,
43,
101,
20,
4062,
51,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Options for Dynamic content in ASP.Net
===
What choices do I have for creating stateful dynamic content in an ASP.Net web site?
Here's my scenario. I have a site that has multiple, nested content regions. The top level are actions tied to a functional area "Catalog", "Subscriptions", "Settings".
When you click on the functional action, I want to dynamically add content specific to that action. For example, when Catalog is clicked, I want to display a tree with the catalog folders & files, and a region to the right for details.
When a user clicks on the tree, I want a context sensitive details to load in the deails region (like properties or options to manage the files).
<hr>
I started with UserControls. They worked fine as long as I kept loading everything into the page, and never let one disappear. As soon as one disappeared, ViewState for the page blew up because the view state tree was invalid.
(I didn't want to keep loading stuff into my page because I don't want the responses to be too huge)
So, my next approach was to replace my dynamic regions with IFrames. Then instead of instantiating a UserControl, I would just change the source on my IFrame. Since the contents of the IFrames were independant pages I didn't run into any ViewState problems.
But, I'm concerned that IFrames might be a bad design choice, but don't fully understand why. The site is not public, so search engines aren't a concern.
<hr>
So, finally to my question.
What are my options for this scenario? If I choose an Ajax Solution (jQuery), will I have to maintain my own ViewState? Are there any other considerations I should take into account? | 0 | [
2,
6368,
26,
7782,
2331,
19,
28,
306,
9,
2328,
800,
3726,
3726,
98,
10978,
107,
31,
57,
26,
2936,
146,
1566,
7782,
2331,
19,
40,
28,
306,
9,
2328,
2741,
689,
60,
235,
22,
18,
51,
12705,
9,
31,
57,
21,
689,
30,
63,
1886,
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... |
XML Schema validation tool?
===
At the office we are currently writing an application that will generate XML files against a schema that we were given. We have the schema in an .XSD file.
Are there tool or libraries that we can use for automated testing to check that the generated XML matches the schema?
We would prefer free tools that are appropriate for commercial use although we won't be bundling the schema checker so it only needs to be usable by devs during development.
Our development language is C++ if that makes any difference, although I don't think it should as we could generate the xml file and then do validation by calling a separate program in the test.
Thanks! | 0 | [
2,
23504,
23874,
27999,
5607,
60,
800,
3726,
3726,
35,
14,
488,
95,
50,
871,
1174,
40,
3010,
30,
129,
7920,
23504,
6488,
149,
21,
23874,
30,
95,
46,
504,
9,
95,
57,
14,
23874,
19,
40,
13,
9,
396,
18,
43,
3893,
9,
50,
80,
560... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How does the .doc format work?
===
I recently learned about the basic structure of the .docx file (it's a specially structured zip archive). However, docx is not formated like a doc.
How does a doc file work? What is the file format, structure, etc? | 0 | [
2,
184,
630,
14,
13,
9,
13799,
2595,
170,
60,
800,
3726,
3726,
31,
1989,
2691,
88,
14,
2125,
1411,
16,
14,
13,
9,
13799,
396,
3893,
13,
5,
242,
22,
18,
21,
13444,
17784,
12133,
9250,
6,
9,
207,
15,
9765,
396,
25,
52,
2595,
6... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
What is Castle Windsor, and why should I care?
===
I'm a long-time Windows developer, having cut my teeth on win32 and early COM. I've been working with .Net since 2001, so I'm pretty fluent in C# and the CLR. I'd never heard of Castle Windsor until I started participating in Stack Overflow. I've read the Castle Windsor "Getting Started" guide, but it's not clicking.
Teach this old dog new tricks, and tell me why I should be integrating Castle Windsor into my enterprise apps. | 0 | [
2,
98,
25,
1339,
10784,
15,
17,
483,
378,
31,
781,
60,
800,
3726,
3726,
31,
22,
79,
21,
175,
8,
891,
1936,
10058,
15,
452,
1077,
51,
2355,
27,
628,
3125,
17,
274,
13,
960,
9,
31,
22,
195,
74,
638,
29,
13,
9,
2328,
179,
108... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Access Intranet via SSL using WebBrowser Winforms Control
===
I have a .Net 2.0 app that is used internally and we want to use the WebBrowser control to access some Web resources. We want to add encryption to these sites using SSL using self signed certificates.
My question is if there is way to disable all the warnings about the SSL keys coming from an untrusted source? I would like to avoid to have to install the keys in each of the workstations running the app.
Any other suggestions on how to do this are welcome. | 0 | [
2,
1381,
14369,
2328,
1197,
13,
18,
18,
255,
568,
10192,
5417,
4104,
628,
4190,
18,
569,
800,
3726,
3726,
31,
57,
21,
13,
9,
2328,
172,
9,
387,
4865,
30,
25,
147,
17739,
17,
95,
259,
20,
275,
14,
10192,
5417,
4104,
569,
20,
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 to get the application executable name in Windows (C++ Win32 or C++/CLI)?
===
I need to change the functionality of an application based on the executable name. Nothing huge, just changing strings that are displayed and some internal identifiers. The application is written in a mixture of native and .Net C++ code.
Two ways that I have looked at are to parse the GetCommandLine() function in Win32 and stuffing around with the AppDomain and other things in .Net. However using GetCommandLine won't always work as when run from the debugger the command line is empty. And the .Net AppDomain stuff seems to require a lot of stuffing around.
So what is the nicest/simplest/most efficient way of determining the executable name in C++/CLI? (I'm kind of hoping that I've just missed something simple that is available in .Net.) | 0 | [
2,
184,
20,
164,
14,
3010,
1396,
17194,
5924,
204,
19,
1936,
13,
5,
150,
20512,
628,
3125,
54,
272,
20512,
118,
150,
1210,
6,
60,
800,
3726,
3726,
31,
376,
20,
753,
14,
18548,
16,
40,
3010,
432,
27,
14,
1396,
17194,
5924,
204,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
XMLDocument.Load(url) through a proxy
===
I have a bit of code that basically reads an XML document using the XMLDocument.Load(uri) method which works fine, but doesn't work so well if the call is made through a proxy.
I was wondering if anyone knew of a way to make this call (or achieve the same effect) through a proxy? | 0 | [
2,
23504,
28132,
9,
8294,
5,
911,
255,
6,
120,
21,
27188,
800,
3726,
3726,
31,
57,
21,
1142,
16,
1797,
30,
11374,
11137,
40,
23504,
4492,
568,
14,
23504,
28132,
9,
8294,
5,
3594,
6,
2109,
56,
693,
1123,
15,
47,
1437,
22,
38,
1... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How do I make an Ajax.Autocompleter perform a request without typing?
===
I'm using scriptaculous's Ajax.Autocompleter for a search with different filters.
http://github.com/madrobby/scriptaculous/wikis/ajax-autocompleter
The filters are requiring me to pass data into the autocompleter dynamically, which I've successfully learned to do from the following link.
http://www.simpltry.com/2007/01/30/ajaxautocompleter-dynamic-parameters/
Now, I have multiple filters and one search box. How do I get the autocompleter to make the request *without* typing into the input, but by clicking a new filter?
Here's a use case to clarify. The page loads, there are multiple filters (just links with onclicks), and one input field with the autocompleter attached. I type a query and the autocompleter request is performed. Then, I click on a different filter, and I'd like another request to be performed with the same query, but different filter.
Or more succinctly, how do I make the autocompleter perform the request *when I want*, instead of depending on typing to trigger it?
| 0 | [
2,
184,
107,
31,
233,
40,
20624,
9,
18042,
15990,
139,
2985,
21,
3772,
366,
25266,
60,
800,
3726,
3726,
31,
22,
79,
568,
3884,
1738,
22717,
22,
18,
20624,
9,
18042,
15990,
139,
26,
21,
2122,
29,
421,
21062,
9,
7775,
6903,
10404,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
dTrace scripts and tools
===
I've recently began using dTrace and have noticed just how awesome it is. Its the perfect tool for profiling without placing the burden on programmers to set up hundreds of probes in their applications.
I've found some nice one liner and sample scripts here and there, but I was wondering about what scripts, tools and links others might want to share.
| 0 | [
2,
13,
43,
38,
7367,
17505,
17,
4672,
800,
3726,
3726,
31,
22,
195,
1989,
260,
568,
13,
43,
38,
7367,
17,
57,
2711,
114,
184,
13706,
32,
25,
9,
82,
14,
2107,
5607,
26,
8721,
49,
802,
366,
5861,
14,
9505,
27,
17968,
18,
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... |
glob() - sort by date
===
I'm trying to display an array of files in order of date (last modified).
I have done this buy looping through the array and sorting it into another array, but is there an easier (more efficient) way to do this? | 0 | [
2,
19060,
5,
6,
13,
8,
2058,
34,
1231,
800,
3726,
3726,
31,
22,
79,
749,
20,
3042,
40,
7718,
16,
6488,
19,
389,
16,
1231,
13,
5,
8558,
5372,
6,
9,
31,
57,
677,
48,
3034,
5293,
68,
120,
14,
7718,
17,
2058,
68,
32,
77,
226,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
existance map in c++
===
I want something like an std::map, but I only want to see if the item exists or not, I don't actually need a key AND value. What should I use? | 0 | [
2,
3182,
2416,
2942,
19,
272,
20512,
800,
3726,
3726,
31,
259,
301,
101,
40,
354,
43,
45,
45,
15022,
15,
47,
31,
104,
259,
20,
196,
100,
14,
9101,
5636,
54,
52,
15,
31,
221,
22,
38,
1121,
376,
21,
1246,
17,
1923,
9,
98,
378,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
Getting logged on user's name with or without domain in Windows
===
Is there a direct API to get the currently logged in user's name with the domain? So, it would return something like "domain\user" when a machine is on the domain, but at the same time it would return "user" when the machine is not on the domain? If there's not, what's the best way to get this information?
I noticed there's a LookupAccountName function - would that be the right direction to take?
Thanks in advance! | 0 | [
2,
1017,
13,
19287,
27,
4155,
22,
18,
204,
29,
54,
366,
4603,
19,
1936,
800,
3726,
3726,
25,
80,
21,
1744,
21,
2159,
20,
164,
14,
871,
13,
19287,
19,
4155,
22,
18,
204,
29,
14,
4603,
60,
86,
15,
32,
83,
788,
301,
101,
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... |
Lower than low level common bsd sockets
===
How do you do low low level sockets in C, example: actually sending a SYN. | 0 | [
2,
987,
119,
708,
662,
757,
334,
18,
43,
18482,
18,
800,
3726,
3726,
184,
107,
42,
107,
708,
708,
662,
18482,
18,
19,
272,
15,
823,
45,
1121,
4907,
21,
6063,
9,
3,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
Best Google Chart library for .NET?
===
The [Google Charts API](http://code.google.com/apis/chart/) offers a super-simple URL-based interface for visualizing data, and it's free for most uses. For example
http://chart.apis.google.com/chart?cht=p3&chd=t:60,40&chs=250x100&chl=Hello|World
gives you
![alt text][1]
Any recommendations out there for a good .NET library that wraps this? I've played with a couple of things out there and haven't been that impressed.
In my mind the perfect library would
1. Consist of a single DLL
2. Abstract the full functionality of the API, not just a subset
3. Be databindable
4. Be available declaratively (e.g.
<gchart:barchart runat=server ... />
5. Be available programmatically (e.g. allow me to add properties, datasets, etc. and then extract a URL string)
Dim MyChart as New BarChart()
MyChart.Datatables.Add(...)
...
Return MyChart.Url
Is anything like that out there?
[1]: http://chart.apis.google.com/chart?cht=p3&chd=t:60,40&chs=250x100&chl=Hello|World | 0 | [
2,
246,
8144,
1795,
1248,
26,
13,
9,
2328,
60,
800,
3726,
3726,
14,
636,
16111,
4875,
5158,
21,
2159,
500,
5,
21127,
6903,
9375,
9,
16111,
4875,
9,
960,
118,
58,
8954,
118,
5433,
38,
118,
6,
2486,
21,
1026,
8,
24629,
287,
6362,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
WIndows Forms textbox that has line numbers?
===
I'm looking for a free winforms component for an application I'm writing. I basicly need a textbox that contains line numbers in a side column. Being able to tabulate data within it would be a major plus too.
Does anyone know of a premade component that could do this? | 0 | [
2,
1936,
1997,
1854,
5309,
30,
63,
293,
2116,
60,
800,
3726,
3726,
31,
22,
79,
699,
26,
21,
551,
628,
4190,
18,
5912,
26,
40,
3010,
31,
22,
79,
1174,
9,
31,
2125,
102,
376,
21,
1854,
5309,
30,
1588,
293,
2116,
19,
21,
270,
4... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Switching to a Standing Desk
===
At work I have a standard desk (4 legs, flat surface, you get the picture). For a while now I've been thinking about converting to a standing desk. What would be the best way to go about this on a limited budget? Are there some good laptop/keyboard stands I could place on my existing desk? Which ones are the best?
I'm trying to avoid requesting a whole new desk, and keeping things as simple as possible. | 2 | [
2,
13027,
20,
21,
1288,
2911,
800,
3726,
3726,
35,
170,
31,
57,
21,
1236,
2911,
13,
5,
300,
1711,
15,
1844,
1490,
15,
42,
164,
14,
2151,
6,
9,
26,
21,
133,
130,
31,
22,
195,
74,
1440,
88,
19583,
20,
21,
1288,
2911,
9,
98,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Beginner looking for beautiful and instructional Python code
===
As a complete beginner with no programming experience, I am trying to find beautiful Python code to study and play with. Please answer by pointing to a website, a book or some software project.
I have the following criterias:
* complete code listings (working, hackable code)
* beautiful code (highly readable, simple but effective)
* instructional for the beginner (yes, hand-holding is needed)
I've tried learning how to program for too long now, never gotten to the point where the rubber hits the road. My main agenda is best spelled out by <a href="http://nat.org/blog/?p=773">Nat Friedman's "How to become a hacker</a>".
I'm aware of O'Reilly's "Beautiful Code", but think of it as too advanced and confusing for a beginner. | 0 | [
2,
26931,
699,
26,
1632,
17,
25565,
20059,
1797,
800,
3726,
3726,
28,
21,
1279,
26931,
29,
90,
3143,
1496,
15,
31,
589,
749,
20,
477,
1632,
20059,
1797,
20,
949,
17,
418,
29,
9,
2247,
1623,
34,
6832,
20,
21,
2271,
15,
21,
360,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Install PHP on XP / IIS 5.1?
===
I am trying to install PHP onto my development box (XP SP3 / IIS 5.1) I've got PHP 5.2.6 stable downloaded (the MSI installer package) and I am getting an error "Cannot find httpd.conf". After that the install seems to breeze by quickly (more quickly than I would have expected) and when I try to execute a simple PHP script from my localhost test directory that I created, I get a slew of missing DLL errors. I have seen posts out there which indicate that its possible and has been done. I dont see any bug reports for this MSI at PHP.NET support. Any ideas? | 0 | [
2,
16146,
13,
26120,
27,
23045,
13,
118,
595,
18,
331,
9,
165,
60,
800,
3726,
3726,
31,
589,
749,
20,
16146,
13,
26120,
1204,
51,
522,
1649,
13,
5,
396,
306,
3782,
240,
13,
118,
595,
18,
331,
9,
165,
6,
31,
22,
195,
330,
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... |
Exceptional Project Management Moment
===
I am yet to see one of those "Exceptional Project Management" moments in my career as a developer.<p>
I know there wont be one straight answer,but Here is my question:How do you spot such a thing?<p>
(I worked in many projects where project managers were just monitoring the health of a project, more of status reporting kind of thing.Please share if you have experienced any great moment,where a project manager completely understood a development-issue,better if it is technical, and saved a project.)
Thanks | 2 | [
2,
12961,
669,
1097,
688,
800,
3726,
3726,
31,
589,
768,
20,
196,
53,
16,
273,
13,
7,
10066,
872,
192,
669,
1097,
7,
4365,
19,
51,
545,
28,
21,
10058,
9,
1,
306,
1,
31,
143,
80,
7290,
44,
53,
1599,
1623,
15,
811,
235,
25,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Sending SVN commits to an RSS feed
===
So my favourite web tool, [Subtlety](http://subtlety.errtheblog.com), was recently discontinued, which means that I no longer have easy access to the commit logs of various SVN projects that I follow. Are there any other tools that easily pump out an RSS feed of commits for a public SVN repo? | 0 | [
2,
4907,
13,
18,
16578,
9686,
18,
20,
40,
13,
1224,
18,
4063,
800,
3726,
3726,
86,
51,
7740,
2741,
5607,
15,
636,
7563,
5866,
1084,
500,
5,
21127,
6903,
7563,
5866,
1084,
9,
106,
139,
124,
220,
5567,
9,
960,
6,
15,
23,
1989,
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... |
What is the easiest, most concise way to make selected attributes in an instance be readonly?
===
In Python, I want to make **selected** instance attributes of a class be readonly to code outside of the class. I want there to be no way outside code can alter the attribute, except indirectly by invoking methods on the instance. I want the syntax to be concise. What is the best way? (I give my current best answer below...) | 0 | [
2,
98,
25,
14,
27237,
15,
127,
29455,
161,
20,
233,
1704,
13422,
19,
40,
4851,
44,
1302,
4965,
60,
800,
3726,
3726,
19,
20059,
15,
31,
259,
20,
233,
13,
1409,
18,
7138,
1409,
4851,
13422,
16,
21,
718,
44,
1302,
4965,
20,
1797,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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.