unified_texts stringlengths 32 30.1k | OpenStatus_id int64 0 4 | input_ids list | token_type_ids list | attention_mask list |
|---|---|---|---|---|
How can I redirect the output of the executed batch file to a text control, like the CEdit in Visual C++?
===
I want to execute a certain batch file and redirect its console output to a text control in visual basic or redirect the console output at the same time the logs/echo are showing. | 0 | [
2,
184,
92,
31,
302,
14706,
14,
5196,
16,
14,
5557,
13064,
3893,
20,
21,
1854,
569,
15,
101,
14,
13,
11014,
242,
19,
3458,
272,
20512,
60,
800,
3726,
3726,
31,
259,
20,
15644,
21,
1200,
13064,
3893,
17,
302,
14706,
82,
8650,
519... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Looking for a bug tracking/task management tool...
===
Im looking for a free/open source bug tracking tool that doesn't require a database. Any Recommendations? Thanks in advance.
RWendi | 2 | [
2,
699,
26,
21,
6256,
10353,
118,
38,
20310,
1097,
5607,
9,
9,
9,
800,
3726,
3726,
797,
699,
26,
21,
551,
118,
10157,
1267,
6256,
10353,
5607,
30,
1437,
22,
38,
4077,
21,
6018,
9,
186,
12121,
60,
3669,
19,
3612,
9,
761,
458,
9... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
How do I deploy registry keys and values using Wix3?
===
If I want to create the following registry key:
*HKEY_LOCAL_MACHINE\SYSTEM\CurrentControlSet\Services\Eventlog\Application\MyApp*
With the following string value:
*EventMessageFile : C:\Path\To\File.dll*
How do I define this in my Wix 3 WXS file? Examples of what the XML should look like much appreciated. | 0 | [
2,
184,
107,
31,
17617,
18269,
5534,
17,
4070,
568,
4807,
396,
240,
60,
800,
3726,
3726,
100,
31,
259,
20,
1600,
14,
249,
18269,
1246,
45,
1637,
252,
4237,
1,
15580,
1,
20442,
1,
10724,
1,
17657,
12898,
3554,
1,
11449,
18,
1,
49... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How to stop right click dead-locking Visual Studio 2008
===
I have a very serious problem with Visual Studio 2008.
Occasionally when I right-click (for go to definition, set next statement etc) when I'm debugging, Visual Studio will just dead-lock and go into not responding mode.
Has anyone had the same problem? Does anyone know how to solve it? | 0 | [
2,
184,
20,
747,
193,
10840,
828,
8,
3966,
68,
3458,
1120,
570,
800,
3726,
3726,
31,
57,
21,
253,
2055,
1448,
29,
3458,
1120,
570,
9,
4533,
76,
31,
193,
8,
150,
10129,
13,
5,
1106,
162,
20,
5465,
15,
309,
328,
3331,
2722,
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... |
SWD files in Flash Player 9
===
Does anybody have any pointers to what SWD files are in Flash 9, why Flash Player wants to download them sometimes, how to make ones, how to make use of them? Didn't manage to dig anything useful myself yet. | 0 | [
2,
8783,
43,
6488,
19,
4433,
517,
561,
800,
3726,
3726,
630,
11181,
57,
186,
454,
445,
20,
98,
8783,
43,
6488,
50,
19,
4433,
561,
15,
483,
4433,
517,
2846,
20,
7121,
105,
1030,
15,
184,
20,
233,
53,
18,
15,
184,
20,
233,
275,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
PHP and MS Access: Number of Records returned by SELECT query
===
I am running following PHP code to interact with a MS Access database.
$odbc_con = new COM("ADODB.Connection");
$constr = "DRIVER={Microsoft Access Driver (*.mdb)}; DBQ=" . $db_path . ";";
$odbc_con -> open($constr);
$rs_select = $odbc_con -> execute ("SELECT * FROM Main");
Using ($rs_select -> RecordCount) gives -1 though the query is returning non-zero records.
(a) What can be the reason?
(b) Is there any way out?
I have also tried using `count($rs_select -> GetRows())`. This satisfies the need but looks inefficient as it will involve copying of all the records into an array first. | 0 | [
2,
13,
26120,
17,
4235,
1381,
45,
234,
16,
742,
587,
34,
5407,
25597,
800,
3726,
3726,
31,
589,
946,
249,
13,
26120,
1797,
20,
10001,
29,
21,
4235,
1381,
6018,
9,
5579,
5648,
7229,
1,
1126,
800,
78,
13,
960,
5,
7,
5672,
9007,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Java: Eclipse - Diff Trace
===
I've got two versions of a project with a JUnit test. Looking at the diff of the files there's no obvious reason to this, but the test passes on one project but not on the other.
For a while now I've wondered if there was a program that would record a trace through the whole program when it runs and save it to a file. This would be really handy for this exact example where I want a trace through both tests and then I want to diff them together.
Can anyone point me in the direction of a program that might be able to do this, or a way that I could diff the two program's flows?
Cheers | 0 | [
2,
8247,
45,
11652,
13,
8,
20811,
5565,
800,
3726,
3726,
31,
22,
195,
330,
81,
3281,
16,
21,
669,
29,
21,
7446,
242,
1289,
9,
699,
35,
14,
20811,
16,
14,
6488,
80,
22,
18,
90,
4674,
1215,
20,
48,
15,
47,
14,
1289,
3789,
27,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 a list as tuples in python
===
I could swear I've seen the function (or method) that takes a list, like this [3,7,19] and makes it into iterable list of tuples, like so: [ (0,3),(1,7),(2,19) ] to use it instead of
for i in range(len(name_of_list)):
name_of_list[i]=something
but I can't remember the name and "iterate list" in Google gets nothing.
| 0 | [
2,
32,
106,
1373,
21,
968,
28,
2289,
18534,
19,
20059,
800,
3726,
3726,
31,
110,
6688,
31,
22,
195,
541,
14,
1990,
13,
5,
248,
2109,
6,
30,
1384,
21,
968,
15,
101,
48,
636,
240,
15,
465,
15,
1433,
500,
17,
1364,
32,
77,
32,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Unit Testing of .NET Add-In for Microsoft Office
===
Has anyone got any suggestions for unit testing a Managed Application Add-In for Office? I'm using NUnit but I had the same issues with MSTest.
The problem is that there is a .NET assembly loaded inside the Office application (in my case, Word) and I need a reference to that instance of the .NET assembly. I can't just instantiate the object because it wouldn't then have an instance of Word to do things to.
Now, I can use the Application.COMAddIns("Name of addin").Object interface to get a reference, but that gets me a COM object that is returned through the RequestComAddInAutomationService. My solution so far is that for that object to have proxy methods for every method in the real .NET object that I want to test (all set under conditional-compilation so they disappear in the released version).
The COM object (a <ComVisibleAttribute(True)> VB.NET class) actually has a reference to the instance of the real add-in, but I tried just returning that to NUnit and I got a nice p/Invoke error:
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.
at System.Runtime.Remoting.Proxies.RemotingProxy.InternalInvoke(IMethodCallMessage reqMcmMsg, Boolean useDispatchMessage, Int32 callType)
at System.Runtime.Remoting.Proxies.RemotingProxy.Invoke(IMessage reqMsg)
at System.Runtime.Remoting.Proxies.RealProxy.PrivateInvoke(MessageData& msgData, Int32 type)
I tried making the main add-in COM visible and the error changes:
System.InvalidOperationException : Operation is not valid due to the current state of the object.
at System.RuntimeType.ForwardCallToInvokeMember(String memberName, BindingFlags flags, Object target, Int32[] aWrapperTypes, MessageData& msgData)
While I have a work-around, it's messy and puts lots of test code in the real project instead of the test project - which isn't really the way NUnit is meant to work.
| 0 | [
2,
1237,
4431,
16,
13,
9,
2328,
3547,
8,
108,
26,
7099,
488,
800,
3726,
3726,
63,
1276,
330,
186,
18389,
26,
1237,
4431,
21,
1471,
3010,
3547,
8,
108,
26,
488,
60,
31,
22,
79,
568,
10210,
242,
47,
31,
41,
14,
205,
1549,
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,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How can I get <asp:menu> working in Safari??
===
On the safari browser, the standard <asp:Menu> doesn't render well at all. How can this be fixed? | 0 | [
2,
184,
92,
31,
164,
13,
1,
472,
306,
45,
755,
291,
1,
638,
19,
25055,
60,
60,
800,
3726,
3726,
27,
14,
25055,
16495,
15,
14,
1236,
13,
1,
472,
306,
45,
755,
291,
1,
1437,
22,
38,
16535,
134,
35,
65,
9,
184,
92,
48,
44,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
What is your .NET logging framework of choice?
===
There are many Logging frameworks for .NET, from simple Debug.WriteLine and Trace to Log4Net, Logging application block, NLOg and others.
Which one do you use or recommend, and why?
Also, which one would you recommend to NOT use, and why? | 4 | [
2,
98,
25,
154,
13,
9,
2328,
13,
13919,
6596,
16,
1837,
60,
800,
3726,
3726,
80,
50,
151,
13,
13919,
6596,
18,
26,
13,
9,
2328,
15,
37,
1935,
121,
16254,
9,
23716,
1143,
17,
5565,
20,
6738,
300,
2328,
15,
13,
13919,
3010,
1921... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Custom painting Windows Forms Scrollbar?
===
I know how to do custom drawing of a standalone Windows Forms ScrollBar because there are plenty of examples at places like codeproject.com. But how do you custom draw the scrollbars in controls you do not create yourself? For example a Panel can show scrollbars but how would I ensure that the scrollbars it shows are custom drawn?
Or maybe this is not possible and I would need to create my own version of a Panel so that they use my own custom drawing scrollbars? | 0 | [
2,
5816,
2469,
1936,
1997,
12159,
1850,
60,
800,
3726,
3726,
31,
143,
184,
20,
107,
5816,
3533,
16,
21,
26986,
1936,
1997,
12159,
1850,
185,
80,
50,
7062,
16,
3770,
35,
1489,
101,
1797,
21011,
9,
960,
9,
47,
184,
107,
42,
5816,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Firefox 2 displays fonts larger than specified in CSS
===
I have a webpage where Firefox 2 displays the font certain, really specific elements, larger than than what I specified in the CSS.
When I look at the affected element (mostly `td` elements as far as I can tell) with Firebug, I see that the font size is inherited from the `body` (11px, so its not a relative size). No styles overwrite this font size, anywhere. When I toggle the _Show computed style_ option, the font size is displayed as 16px, Firefox's default.
It seems that the `td` does not inherit the font size properly. Obviously, I could specify a more specific CSS selector targeting the `td` (which in fact works) but I can't find any documented behavior of Firefox not inheriting the font size properly. It only happens in just a few tables, but completely unrelated to each other. | 0 | [
2,
535,
18219,
172,
9412,
9978,
18,
1662,
119,
9931,
19,
272,
18,
18,
800,
3726,
3726,
31,
57,
21,
2741,
6486,
113,
535,
18219,
172,
9412,
14,
9978,
1200,
15,
510,
1903,
2065,
15,
1662,
119,
119,
98,
31,
9931,
19,
14,
272,
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... |
How to replace a file in a msi installer?
===
I want to replace a single file inside a msi. How to do it? | 0 | [
2,
184,
20,
3934,
21,
3893,
19,
21,
4235,
49,
16146,
106,
60,
800,
3726,
3726,
31,
259,
20,
3934,
21,
345,
3893,
572,
21,
4235,
49,
9,
184,
20,
107,
32,
60,
3,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
How to do Automated UI testing for Flash
===
I have an actionscript 2 application that I'd like to write automated UI testing for.
For example I'd like to simulate a mouse click on a button and validate that a movie-clip is displayed at the right position and in the right color... Basically, UI testing.
What are the best tools available or what is the desired approach?
In JavaScript there is the selenium framework which does a nice job. Any similar tool for flash? | 0 | [
2,
184,
20,
107,
14904,
13,
5661,
4431,
26,
4433,
800,
3726,
3726,
31,
57,
40,
1028,
8741,
172,
3010,
30,
31,
22,
43,
101,
20,
2757,
14904,
13,
5661,
4431,
26,
9,
26,
823,
31,
22,
43,
101,
20,
24969,
21,
7567,
10840,
27,
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... |
Displaying Tiff files in SSRS reports.
===
I have a requirement to be be able to embed scanned tiff images into some SSRS reports.
When I design a report in VS2005 and add an image control the tiff image displays perfectly however when I build it. I get the warning :
Warning 2 [rsInvalidMIMEType] The value of the MIMEType property for the image ‘image1’ is “image/tiff”, which is not a valid MIMEType. c:\SSRSStuff\TestReport.rdl 0 0
and instead of an image i get the little red x.
Has anybody overcome this issue?
| 0 | [
2,
17418,
13,
38,
6021,
6488,
19,
22118,
18,
2813,
9,
800,
3726,
3726,
31,
57,
21,
8981,
20,
44,
44,
777,
20,
11911,
69,
12752,
13,
38,
6021,
3502,
77,
109,
22118,
18,
2813,
9,
76,
31,
704,
21,
1330,
19,
4611,
2835,
17,
3547,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 attach a MSSQL 2000 database with only an MDF file.
===
I have an old server with a defunct evaluation version of SQL 2000 on it (from 2006), and two databases which were sitting on it.
For some unknown reason, the LDF log files are missing. Presumed deleted.
I have the mdf files (and in one case an ndf file too) for the databases which used to exist on that server, and I am trying to get them up and running on another SQL 2000 box I have sitting around.
`sp_attach_db` complains that the logfile is missing, and will not attach the database. Attempts to fool it by using a logfile from a database with the same name failed miserably. `sp_attach_single_file_db` will not work either. The mdf files have obviously not been cleanly detached.
How do I get the databases attached and readable? | 0 | [
2,
184,
107,
31,
19514,
21,
4235,
18,
22402,
824,
6018,
29,
104,
40,
307,
8736,
3893,
9,
800,
3726,
3726,
31,
57,
40,
315,
8128,
29,
21,
16250,
8670,
615,
16,
4444,
255,
824,
27,
32,
13,
5,
2665,
592,
6,
15,
17,
81,
6018,
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 strategies do you use to minimise the effects of context-switching in your job?
===
Working in an environment with both development and support aspects, sometimes it can be very difficult to switch back and forth between tasks - usually on totally different systems.
I personally make notes as I'm working on stuff in the mind-mapping tool, [Freemind][1]. I find this does minimise the effects of context-switching - I can quite quickly pick up where I left off - but I'd be interested to see what everyone else does.
[1]: http://freemind.sourceforge.net/wiki/index.php/Main_Page | 0 | [
2,
98,
10272,
107,
42,
275,
20,
4236,
79,
2628,
14,
2292,
16,
4141,
8,
18,
15915,
68,
19,
154,
1205,
60,
800,
3726,
3726,
638,
19,
40,
2307,
29,
156,
522,
17,
555,
4842,
15,
1030,
32,
92,
44,
253,
1956,
20,
5521,
97,
17,
588... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Installing a font on a client machine
===
I'm using Visual Studio 2008 and the built-in installation tools for a C# client application. How can I use this installer to install a font on the client machine (if it's not already there)? | 0 | [
2,
25429,
21,
9978,
27,
21,
6819,
1940,
800,
3726,
3726,
31,
22,
79,
568,
3458,
1120,
570,
17,
14,
392,
8,
108,
7758,
4672,
26,
21,
272,
5910,
6819,
3010,
9,
184,
92,
31,
275,
48,
16146,
106,
20,
16146,
21,
9978,
27,
14,
6819,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
Importing contacts from the top webmail services
===
Is anyone familiar with a service or open-source scripts that can import contacts from Gmail, Yahoo mail, AOL, Hotmail and other prominent webmail services? (Not plaxo, it has a problem in IE7)
| 4 | [
2,
9010,
68,
11894,
37,
14,
371,
2741,
8079,
687,
800,
3726,
3726,
25,
1276,
3694,
29,
21,
365,
54,
368,
8,
12097,
17505,
30,
92,
9010,
11894,
37,
489,
8079,
15,
23553,
4216,
15,
21,
1823,
15,
1047,
8079,
17,
89,
2357,
2741,
807... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
Accessing the windows admin shares when not connected to a network
===
I'm finding that I can't access the admin shares on an XP64 box when there's no network connection. Trying to browse to \\localhost\c$ fails (although obviously browsing c: works).
Reason for the question is that the nant build script for our application uses this format to copy files from one local directory to another, and it's failing when I'm trying to use my laptop on the train. (The same problem occurs if I unplug the network cable from my desktop and build). The whole build only uses local resources so should be possible with no network to connect to.
Any ideas?
Thanks | 0 | [
2,
1381,
68,
14,
1936,
21,
43,
2160,
5945,
76,
52,
2587,
20,
21,
982,
800,
3726,
3726,
31,
22,
79,
3007,
30,
31,
92,
22,
38,
1381,
14,
21,
43,
2160,
5945,
27,
40,
23045,
3470,
1649,
76,
80,
22,
18,
90,
982,
2760,
9,
749,
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 "Fountain Development Model"?
===
It is mentioned on the [Systems Development Life Cycle page on Wikipedia][1]:
> To manage this, a number of system development life cycle (SDLC) models have been created: waterfall, fountain, spiral, build and fix, rapid prototyping, incremental, and synchronize and stabilize.
I found a few things on Google, but I felt that they were vague and they just didn't click for me. Perhaps an explanation from someone here might be more clear.
[1]: http://en.wikipedia.org/wiki/Systems_Development_Life_Cycle | 0 | [
2,
98,
25,
14,
13,
7,
4120,
20613,
108,
522,
1061,
7,
60,
800,
3726,
3726,
32,
25,
2211,
27,
14,
636,
10724,
18,
522,
201,
4150,
2478,
27,
20169,
500,
2558,
165,
500,
45,
13,
1,
20,
4705,
48,
15,
21,
234,
16,
329,
522,
201,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 windows application, can it be compressed into a single .exe?
===
Not to familiar with .net desktop applications (using vs.net 2005), is it possible to have the entire application run from a single .exe file?
| 0 | [
2,
13,
9,
2328,
1936,
3010,
15,
92,
32,
44,
18472,
77,
21,
345,
13,
9,
1706,
62,
60,
800,
3726,
3726,
52,
20,
3694,
29,
13,
9,
2328,
17404,
3767,
13,
5,
12655,
4611,
9,
2328,
812,
6,
15,
25,
32,
938,
20,
57,
14,
1078,
3010... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
Open Source Reporting Engines
===
As a followup to [this question][1] can anyone give me pointers to free/open-source report engines? I'd prefer something that I can use in C++ but I'm sure almost anything could be made to work with C++ given enough time and effort. I gather there's one in [BIRT][2] but are there others available? This would be part of the open source software stack to replace MS Access with a free (as in freedom)/open alternative. Oh and because it came up with that other question, everything being contained in one file is not an important criteria in this particular case.
[1]: http://stackoverflow.com/questions/29044/good-free-alternative-to-ms-access
[2]: http://www.eclipse.org/birt/phoenix/ | 0 | [
2,
368,
1267,
6670,
4016,
800,
3726,
3726,
28,
21,
1740,
576,
20,
636,
1565,
1301,
500,
2558,
165,
500,
92,
1276,
590,
55,
454,
445,
20,
551,
118,
10157,
8,
12097,
1330,
4016,
60,
31,
22,
43,
6369,
301,
30,
31,
92,
275,
19,
27... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Passing JS function to applet for as event listener
===
Is it possible to pass a function/callback from javascript to a java applet?
For example i have an applet with a button that when pressed it will call the passed js callback
function onCommand() {alert('Button pressed from applet');}
applet.onCommand(onCommand);
| 0 | [
2,
2848,
487,
18,
1990,
20,
4037,
38,
26,
28,
807,
21772,
800,
3726,
3726,
25,
32,
938,
20,
1477,
21,
1990,
118,
9200,
1958,
37,
8247,
8741,
20,
21,
8247,
4037,
38,
60,
26,
823,
31,
57,
40,
4037,
38,
29,
21,
5167,
30,
76,
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,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
.Net Menustrip background colour range
===
I need to put a control to the right of my MenuStrip. The MenuStrip fades in colour away from the BackColor on the left hand side to something whiter on the right, and ideally I would like to make my small control blend in by having the same backColor as the menustrip has on that side. Does anyone know how that colour is computed?
Worst case, can you recomment a tiny app for sampling colours off the screen? | 0 | [
2,
13,
9,
2328,
11379,
19992,
2395,
4609,
978,
800,
3726,
3726,
31,
376,
20,
442,
21,
569,
20,
14,
193,
16,
51,
11379,
19992,
9,
14,
11379,
19992,
11381,
18,
19,
4609,
229,
37,
14,
97,
11282,
27,
14,
225,
224,
270,
20,
301,
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... |
Oracle Datadiff
===
(Oracle) I have to return all records from last 12 months. How to do that in PL/SQL?
EDIT: Sorry, I forgot to explain, I do have a column of DATA type | 0 | [
2,
15759,
1054,
43,
6021,
800,
3726,
3726,
13,
5,
6055,
5615,
6,
31,
57,
20,
788,
65,
742,
37,
236,
390,
818,
9,
184,
20,
107,
30,
19,
12443,
118,
18,
22402,
60,
9392,
45,
1875,
15,
31,
9564,
20,
3271,
15,
31,
107,
57,
21,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
What is your favorite misconception about Lisp?
===
Please respond with **one by one**.
If you explain why it is not true then try to avoid general statements and provide particular examples.
| 0 | [
2,
98,
25,
154,
3839,
2462,
27724,
872,
88,
2093,
3401,
60,
800,
3726,
3726,
2247,
4590,
29,
13,
1409,
849,
34,
53,
1409,
9,
100,
42,
3271,
483,
32,
25,
52,
1151,
94,
1131,
20,
2658,
297,
9015,
17,
1181,
1498,
3770,
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... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
Opensource Implementation of the Alias Method
===
I am doing a project at the moment, and in the interest of code reuse, I went looking for a library that can perform some probabilistic accept/reject of an item:
i.e., there are three people (a, b c), and each of them have a probability P{i} of getting an item, where p{a} denotes the probability of a. These probabilities are calculated at run time, and cannot be hardcoded.
What I wanted to do is to generate one random number (for an item), and calculate who gets that item based on their probability of getting it. The alias method (http://books.google.com/books?pg=PA133&dq=alias+method+walker&ei=D4ORR8ncFYuWtgOslpVE&sig=TjEThBUa4odbGJmjyF4daF1AKF4&id=ERSSDBDcYOIC&output=html) outlined here explained how, but I wanted to see if there is a ready made implementation so I wouldn't have to write it up. | 0 | [
2,
368,
12097,
6123,
16,
14,
15794,
2109,
800,
3726,
3726,
31,
589,
845,
21,
669,
35,
14,
688,
15,
17,
19,
14,
1163,
16,
1797,
302,
3699,
15,
31,
296,
699,
26,
21,
1248,
30,
92,
2985,
109,
895,
220,
24715,
1786,
3440,
118,
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... |
What is a good source for geometic algorithms?
===
I am looking for any good sources for geometric algorithms specifically;
The simple stuff like when two lines cross and so on is easy enough (and easy to find), but I would like to find somewhere with algorithms for the more tricky things, such as finding the shape formed by expanding a given polygon by some amount; fast algorithms for shapes with curved sides, etc.
Any good tips? Thanks! | 0 | [
2,
98,
25,
21,
254,
1267,
26,
6389,
79,
9329,
15935,
60,
800,
3726,
3726,
31,
589,
699,
26,
186,
254,
2662,
26,
13958,
15935,
3524,
73,
14,
1935,
3217,
101,
76,
81,
1560,
919,
17,
86,
27,
25,
2010,
511,
13,
5,
290,
2010,
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... |
Why does maven 2 try to download dependencies that I've already have ?
===
When I launch the "mvn install" command, maven tries sometimes to download dependencies that maven have already downloaded.
That's expected for SNAPSHOT but why does maven do that for others JAR ?
I know I can avoid that behavior by "-o" flag but I just wonder.
| 0 | [
2,
483,
630,
1216,
3124,
172,
1131,
20,
7121,
29411,
30,
31,
22,
195,
614,
57,
13,
60,
800,
3726,
3726,
76,
31,
3394,
14,
13,
7,
79,
16578,
16146,
7,
1202,
15,
1216,
3124,
3919,
1030,
20,
7121,
29411,
30,
1216,
3124,
57,
614,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Unable to close OledbDataReader to Sybase Database in VB.NET
===
I don't seem to be able to close the OledbDataReader object after reading data from it. Here is the relevant code -
Dim conSyBase As New OleDb.OleDbConnection("Provider=Sybase.ASEOLEDBProvider.2;Server Name=xx.xx.xx.xx;Server Port Address=5000;Initial Catalog=xxxxxxxxxx;User ID=xxxxxxxx;Password=xxxxxxxxx;")
conSyBase.Open()
Dim cmdSyBase As New OleDb.OleDbCommand("MySQLStatement", conSyBase)
Dim drSyBase As OleDb.OleDbDataReader = cmdSyBase.ExecuteReader
Try
While drSyBase.Read
/*Do some stuff with the data here */
End While
Catch ex As Exception
NotifyError(ex, "Read failed.")
End Try
drSyBase.Close() /* CODE HANGS HERE */
conSyBase.Close()
drSyBase.Dispose()
cmdSyBase.Dispose()
conSyBase.Dispose()
The console application just hangs at the point at which I try to close the reader. Opening and closing a connection is not a problem, therefore does anyone have any ideas for what may be causing this? | 0 | [
2,
2343,
20,
543,
12116,
9007,
18768,
10647,
106,
20,
10315,
8436,
6018,
19,
13,
20468,
9,
2328,
800,
3726,
3726,
31,
221,
22,
38,
2260,
20,
44,
777,
20,
543,
14,
12116,
9007,
18768,
10647,
106,
3095,
75,
1876,
1054,
37,
32,
9,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Algorithm for counting the number of unique colors in an image
===
Looking for one that is fast enough and still graceful with memory. | 0 | [
2,
9083,
26,
11195,
14,
234,
16,
2619,
5268,
19,
40,
1961,
800,
3726,
3726,
699,
26,
53,
30,
25,
1512,
511,
17,
174,
22609,
29,
1912,
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,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
Reserve low memory (pre OS)
===
**Background:** I need to reserve an amount of memory below 0xA0000 prior to my operating system starts. To do this I change the [0040:0013][1] (or 0x413) word which is the amount of low memory available in KiB.
However, Windows and other operating systems use [E820h/INT15h][2] to query the memory layout and some BIOS:es doesn't reflect 0x413 changes to the E820h/INT15h BIOS function. Therefore I also hook the E820h function if needed.
**Question:** Is there another way to reserve low memory prior to the OS? Or any other way of changing the E820h/INT15h results other than hooking INT15h (by poking EBDA perhaps?)
[1]: http://bioscentral.com/misc/bda.htm
[2]: http://www.uruk.org/orig-grub/mem64mb.html | 0 | [
2,
2126,
708,
1912,
13,
5,
3515,
13,
759,
6,
800,
3726,
3726,
13,
1409,
1958,
8810,
45,
1409,
31,
376,
20,
2126,
40,
2006,
16,
1912,
1021,
713,
6791,
21903,
1313,
20,
51,
2455,
329,
3244,
9,
20,
107,
48,
31,
753,
14,
636,
2032... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 SOA service discovery (UDDI) work in practice?
===
I'm just reading up on SOA and the service registry / UDDI get mentioned regularly. It sounds nice but how is used in reality?
- Is the registry meant to decouple a logical service from its' physical implementation (port, url etc)?
- Is the registry meant to be browsed by a human looking for an interesting service to play with?
- Would it be 'wrong' to hard-wire an
application
to the services it uses? | 0 | [
2,
184,
630,
86,
58,
365,
4291,
13,
5,
3192,
1115,
6,
170,
19,
1345,
60,
800,
3726,
3726,
31,
22,
79,
114,
1876,
71,
27,
86,
58,
17,
14,
365,
18269,
13,
118,
13,
3192,
1115,
164,
2211,
4217,
9,
32,
2795,
2210,
47,
184,
25,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How accurate can I expect the time to be from a stratum 0 NTP server on the same subnet on ethernet?
===
I have an application that depends on gpsd and ntpd to accurately set the system time on a linux machine.
gpsd is fed NMEA + PPS
The application is punping ~25MB per second over the network and I think the loading on the system is causing jitter in the time somehow. (loaded PCI express bus causing irregular interrupt latency)
I have another machine that is not loaded at all that I could setup to read the GPS and act as an NTP server for the loaded machine. (the loaded machine would be getting startum 1 ???)
**How accurate can I expect the time to be from a stratum 0 NTP server on the same subnet on Ethernet?**
I hope this is not too off topic, I am sure sometime someone else will be happy the answer is documented here. ;-) | 0 | [
2,
184,
8137,
92,
31,
4186,
14,
85,
20,
44,
37,
21,
5428,
5633,
713,
13,
2877,
306,
8128,
27,
14,
205,
972,
2328,
27,
27820,
60,
800,
3726,
3726,
31,
57,
40,
3010,
30,
9597,
27,
18298,
43,
17,
13,
2877,
9251,
20,
16353,
309,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How to make wget handle an HTTP response with the 100 (Continue) status?
===
I am trying to POST a HTML (contained in a file) to a URL using [Wget][1] like this:
wget -O- --debug
--header=Content-Type:text/html
--post-file=index.html
http://localhost/www/encoder.ashx
The URL to which the HTML is being posted is a Web application end-point implemented using ASP.NET. The server replies with a [100 (Continue)][2] response and Wget simply stops dead in its tracks rather than continuing with the *real* response that *should* follow next.
**Can Wget be somehow told to hanlde a 100 (Continue) response or is this some well-known limitation of the tool?**
Notes:
- I noticed that Wget never sends
the `Expect: 100-Continue` header so
technically the server should not be
issuing a 100 (Continue) response.
- [cURL][3] on the other hand had no problem.
It send an `Expect: 100-Continue` header
and continued with 100 (Continue) response
on to the real one.
For more information, here is the full debug trace of the transaction from the invocation shown above:
Setting --post-file (postfile) to index.html
Setting --header (header) to Content-Type:text/html
DEBUG output created by Wget 1.10 on Windows.
--13:29:17-- http://localhost/www/encoder.ashx
=> `-'
Resolving localhost... seconds 0.00, 127.0.0.1
Caching localhost => 127.0.0.1
Connecting to localhost|127.0.0.1|:80... seconds 0.00, connected.
Created socket 296.
Releasing 0x01621a10 (new refcount 1).
---request begin---
POST /www/encoder.ashx HTTP/1.0
User-Agent: Wget/1.10
Accept: */*
Host: localhost
Connection: Keep-Alive
Content-Type: text/html
Content-Length: 30984
---request end---
[writing POST file index.html ... done]
HTTP request sent, awaiting response...
---response begin---
HTTP/1.1 100 Continue
Server: ASP.NET Development Server/9.0.0.0
Date: Wed, 24 Sep 2008 11:29:17 GMT
Content-Length: 0
---response end---
100 Continue
Closed fd 296
13:29:17 ERROR 100: Continue.
[1]: http://www.gnu.org/software/wget/
[2]: http://www.w3.org/Protocols/rfc2616/rfc2616-sec10.html#sec10.1.1
[3]: http://curl.haxx.se/ | 0 | [
2,
184,
20,
233,
619,
3060,
3053,
40,
7775,
1627,
29,
14,
808,
13,
5,
13391,
4185,
6,
1782,
60,
800,
3726,
3726,
31,
589,
749,
20,
678,
21,
13,
15895,
13,
5,
28578,
19,
21,
3893,
6,
20,
21,
287,
6362,
568,
636,
499,
3060,
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... |
Immutable Styles in Silverlight 2
===
Anyone found a good pattern for getting around immutable styles in Silverlight 2? | 0 | [
2,
797,
7903,
579,
6443,
19,
1172,
3130,
172,
800,
3726,
3726,
1276,
216,
21,
254,
3732,
26,
1017,
140,
797,
7903,
579,
6443,
19,
1172,
3130,
172,
60,
3,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
Is it possible to send and store a Type reference in VB6/VBA?
===
I'm working on a VB6 application and I would like to send a Type as a reference and store it in another form. Is this possible?
Sending it is no problem, I just use the ByRef keyword:
public Sub SetStopToEdit(ByRef currentStop As StopType)
But when I try to use Set to store `currentStop` in the recieving module I get the "Object required" error when running the program:
Private stopToEdit As StopTypeModule.StopType
' ... Lots of code
Set stopToEdit = currentStop
Is it possible to store the sent reference or do I have to turn StopType into an class? | 0 | [
2,
25,
32,
938,
20,
2660,
17,
1718,
21,
1001,
2801,
19,
13,
20468,
12626,
710,
969,
60,
800,
3726,
3726,
31,
22,
79,
638,
27,
21,
13,
20468,
379,
3010,
17,
31,
83,
101,
20,
2660,
21,
1001,
28,
21,
2801,
17,
1718,
32,
19,
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... |
How to avoid storing credentials to connect to Oracle with JDBC?
===
Is it possible to setup a JDBC connection to Oracle without providing username/password information in a configuration file (or in any other standard readable location)?
Typically applications have a configuration file that contains setup parameters to connect to a database. Some DBAs have problems with the fact that usernames and passwords are in clear text in config files.
I don't think this is possible with Oracle and JDBC, but I need some confirmation...
A possible compromise is to encrypt the password in the config file and decrypt it before setting up the connection. Of course, the decryption key should not be in the same config file. This will only solve accidental opening of the config file by unauthorized users. | 0 | [
2,
184,
20,
2658,
25615,
5059,
43,
10107,
18,
20,
6379,
20,
15759,
29,
487,
43,
7229,
60,
800,
3726,
3726,
25,
32,
938,
20,
18161,
21,
487,
43,
7229,
2760,
20,
15759,
366,
2674,
4155,
7259,
118,
6201,
9587,
676,
19,
21,
8091,
38... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
What is the one most important reason projects fail when done by external systems integrators?
===
Our company is engaging an external Systems Integrator to develop its new mission critical system. I was hoping to compile the likely reasons it will fail so that we can anticipate these and safe guard against them. | 4 | [
2,
98,
25,
14,
53,
127,
681,
1215,
2314,
7476,
76,
677,
34,
4886,
1242,
13,
12370,
9922,
60,
800,
3726,
3726,
318,
237,
25,
13116,
40,
4886,
1242,
13,
12370,
3457,
20,
2803,
82,
78,
1408,
2507,
329,
9,
31,
23,
3935,
20,
26561,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Prisoner's Dilemma Algorithm
===
After watching The Dark Knight I became rather enthralled with the concept of the Prisoner's Dilemma. There *must* be an algorithm that that maximizes one's own gain given a situation.
For those that find this foreign: http://en.wikipedia.org/wiki/Prisoner%27s_dilemma
Very, very interesting stuff. | 0 | [
2,
6566,
22,
18,
23314,
9083,
800,
3726,
3726,
75,
1953,
14,
659,
3222,
31,
178,
864,
1957,
11631,
211,
69,
29,
14,
2420,
16,
14,
6566,
22,
18,
23314,
9,
80,
1637,
3605,
38,
2483,
44,
40,
9083,
30,
30,
23952,
18,
53,
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... |
How can i move an object drawn in device context python
===
I have drawn an image in the device context using python, and i want to move it somothly/animate either vertically or horizontally? What algorithm should i use?
Where can i get info for this kind of tasks in python?
| 0 | [
2,
184,
92,
31,
780,
40,
3095,
3160,
19,
3646,
4141,
20059,
800,
3726,
3726,
31,
57,
3160,
40,
1961,
19,
14,
3646,
4141,
568,
20059,
15,
17,
31,
259,
20,
780,
32,
86,
1293,
96,
102,
118,
3443,
5281,
694,
23300,
54,
25658,
60,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
What good tools are available to create online help for .net applications?
===
I have a winforms application that presently ships with a chm file for context-sensitive help documentation (not API docs), created using MS HTML Help Workshop.
I'd like to move to online documentation (don't have to ship it with the product, can update it easily, etc). What tools are recommended for this sort of thing, and what are their pros and cons?
I'd like to be able to do the following:
- host the help files on my webserver
- provide context-sensitive help
- have reasonable-looking navigation/TOC for the help
- host different versions of the help for different major versions of the application
- easily edit the help. Something like a wiki would be nice, preferably with good wysiwyg editor.
- easily create a PDF manual from the help files
I guess I can most of this with HTML Help Workshop and a bit of work, but if there's better tools out there I'd like to know. | 0 | [
2,
98,
254,
4672,
50,
904,
20,
1600,
2087,
448,
26,
13,
9,
2328,
3767,
60,
800,
3726,
3726,
31,
57,
21,
628,
4190,
18,
3010,
30,
14431,
2034,
29,
21,
6193,
79,
3893,
26,
4141,
8,
19435,
448,
13945,
13,
5,
1270,
21,
2159,
9765,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Compilation fails randomly: "cannot open program database"
===
During a long compilation with Visual Studio 2005 (version 8.0.50727.762) I sometimes get the following error in several files in some project:
`fatal error C1033: cannot open program database 'v:\temp\apprtctest\win32\release\vc80.pdb'`
(The file mentioned is either vc80.pdb or vc80.idb in the project's temp dir.)
The next build of the same project succeeds. There is no other Visual Studio open that might access the same files.
This is a serious problem because it makes nightly compilation impossible. | 0 | [
2,
4868,
13614,
21324,
45,
13,
7,
1245,
1270,
368,
625,
6018,
7,
800,
3726,
3726,
112,
21,
175,
4868,
29,
3458,
1120,
812,
13,
5,
10898,
469,
9,
387,
9,
264,
2984,
2567,
9,
4436,
135,
6,
31,
1030,
164,
14,
249,
7019,
19,
238,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Examples of Recursive functions
===
Can anybody suggest programming examples that illustrate recursive functions? There are the usual old horses such as ***Fibonacci series*** and ***Towers of Hanoi***, but anything besides them would be fun. | 0 | [
2,
3770,
16,
302,
24244,
3719,
800,
3726,
3726,
92,
11181,
5601,
3143,
3770,
30,
15620,
302,
24244,
3719,
60,
80,
50,
14,
3820,
315,
3837,
145,
28,
8980,
1707,
5566,
17177,
231,
2483,
1409,
17,
8980,
17183,
18,
16,
26822,
2483,
1409... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
Qt Jambi: QAbstractListModel not displaying in QListView
===
I've created an implementation of the QAbstractListModel class in Qt Jambi 4.4 and am finding that using the model with a QListView results in nothing being displayed, however using the model with a QTableView displays the data correctly.
I'm experienced with C# but have only been using Qt Jambi for a couple of days now.
Below is my implementation of QAbstractListModel
public class FooListModel extends QAbstractListModel
{
private List<Foo> _data = new Vector<Foo>();
public FooListModel(List<Foo> data)
{
if (data == null)
{
return;
}
for (Foo foo : data)
{
_data.add(Foo);
}
reset();
}
public Object data(QModelIndex index, int role)
{
if (index.row() < 0 || index.row() >= _data.size())
{
return new QVariant();
}
Foo foo = _data.get(index.row());
if (foo == null)
{
return new QVariant();
}
return foo;
}
public int rowCount(QModelIndex parent)
{
return _data.size();
}
}
And here is how I set the model:
Foo foo = new Foo();
foo.setName("Foo!");
List<Foo> data = new Vector<Foo>();
data.add(foo);
FooListModel fooListModel = new FooListModel(data);
ui.fooListView.setModel(fooListModel);
ui.fooTableView.setModel(fooListModel);
Can anyone see what I'm doing wrong? I'd like to think it was a problem with my implementation because, as everyone says, select ain't broken!
Thanks for your time... | 0 | [
2,
2593,
38,
487,
9150,
45,
7234,
4562,
19915,
5739,
13998,
52,
17418,
19,
2593,
5739,
4725,
800,
3726,
3726,
31,
22,
195,
679,
40,
6123,
16,
14,
7234,
4562,
19915,
5739,
13998,
718,
19,
2593,
38,
487,
9150,
268,
9,
300,
17,
589,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How to force a web browser NOT to cache images
===
## Background ##
I am writing and using a very simple CGI-based (Perl) content management tool for two pro-bono websites. It provides the website administrator with HTML forms for events where they fill the fields (date, place, title, description, links, etc.) and save it. On that form I allow the administrator to upload an image related to the event. On the HTML page displaying the form, I am also showing a preview of the picture uploaded (HTML img tag).
## The Problem ##
The problem happens when the administrator wants to change the picture. He would just have to hit the "browse" button, pick a new picture and press ok. And this works fine.
Once the image is uploaded, my back-end CGI handles the upload and reloads the form properly.
The problem is that the image shown **does not** gets refreshed. The old image is still shown, even though the database holds the right image. I have narrowed it down to the fact that the IMAGE IS CACHED in the web browser. If the administrator hits the Firefox/Explorer/Safari RELOAD button, everything gets refreshed fine and the new image just appears.
## My Solution - Not Working ##
I am trying to control the cache by writing a HTTP Expires instruction with a date very far in the past.
Expires: Mon, 15 Sep 2003 1:00:00 GMT
Remember that I am on the administrative side and I don't really care if the pages takes a little longer to load because they are always expired.
But, this does not work either.
## Notes ##
When uploading an image, its filename is not kept in the database. It is renamed as **Image.jpg** (to simply things out when using it). When replacing the existing image with a new one, the name doesn't change either. Just the content of the image file changes.
The webserver is provided by the hosting service/ISP. It uses Apache.
## Question ##
Is there a way to force the web browser to NOT cache things from this page, not even images?
I am juggling with the option to actually "save the filename" with the database. This way, if the image is changed the src of the IMG tag will also change. However, this requires a lot of changes throughout the site and I rather not do it if I have a better solution. Also, this will still not work if the new image uploaded has the same name (say the image is photoshopped a bit and re-uploaded).
| 0 | [
2,
184,
20,
558,
21,
2741,
16495,
52,
20,
16522,
3502,
800,
3726,
3726,
6926,
5910,
2395,
6926,
5910,
31,
589,
1174,
17,
568,
21,
253,
1935,
272,
2234,
8,
1281,
13,
5,
1432,
255,
6,
2331,
1097,
5607,
26,
81,
895,
8,
1192,
251,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
C++ union in C#
===
I'm translating a library written in C++ to C#, and the keyword 'union' exists once. In a struct.
What's the correct way of translating it into C#? And what does it do? It looks something like this;
struct Foo {
float bar;
union {
int killroy;
float fubar;
} as;
} | 0 | [
2,
272,
20512,
667,
19,
272,
5910,
800,
3726,
3726,
31,
22,
79,
25237,
21,
1248,
642,
19,
272,
20512,
20,
272,
5910,
15,
17,
14,
1246,
9587,
13,
22,
17162,
22,
5636,
382,
9,
19,
21,
13,
10346,
9,
98,
22,
18,
14,
4456,
161,
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... |
Checking for code changes in all imported python modules.
===
Almost every Python web framework has a simple server that runs a wsgi application and automatically reloads the imported modules every time the source gets changed. I know I can look at the code and see how it's done, but that may take some time and I'm asking just out of curiosity. Does anyone have any idea how this is implemented? | 0 | [
2,
9886,
26,
1797,
1693,
19,
65,
11808,
20059,
17113,
9,
800,
3726,
3726,
557,
352,
20059,
2741,
6596,
63,
21,
1935,
8128,
30,
1461,
21,
619,
18,
2234,
3010,
17,
7499,
27339,
18,
14,
11808,
17113,
352,
85,
14,
1267,
3049,
1015,
9,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Would you consider switching from LISP development to F#?
===
Please give me your best reasons why you are moving from LISP to F# for your main development. The reason why I'm asking this is that both LISP and F# are flexible multi paradigm languages, but LISP has a long history where F# is a newcomer. Are there any good reasons to make the switch? | 0 | [
2,
83,
42,
3563,
13027,
37,
2093,
3401,
522,
20,
398,
5910,
60,
800,
3726,
3726,
2247,
590,
55,
154,
246,
2932,
483,
42,
50,
1219,
37,
2093,
3401,
20,
398,
5910,
26,
154,
407,
522,
9,
14,
1215,
483,
31,
22,
79,
3379,
48,
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... |
Best MySQL Server Monitoring Tool
===
I'd like some opinions about the best mysql monitoring tool available. I've tried [MySQL Enterprise Monitor][1], and it is great for me except it's impossible to get MySQL sell something - I'm ok to pay even if I find the pricing and bundling it with MySQL Enterprise only unreasonable.
I am also looking at [MONyog MySQL Monitor][2] now, gonna give it a try soon. Just wanna get some expert advice/field experience.
[1]: http://www.mysql.com/products/enterprise/advisors.html
[2]: http://www.webyog.com/en/monyog_feature_list.php | 4 | [
2,
246,
51,
18,
22402,
8128,
8984,
5607,
800,
3726,
3726,
31,
22,
43,
101,
109,
11900,
88,
14,
246,
51,
18,
22402,
8984,
5607,
904,
9,
31,
22,
195,
794,
636,
915,
18,
22402,
6002,
7626,
500,
2558,
165,
500,
15,
17,
32,
25,
374... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Find two consecutive rows
===
I'm trying to write a query that will pull back the two most recent rows from the Bill table where the Estimated flag is true. The catch is that these need to be consecutive bills.
To put it shortly, I need to enter a row in another table if a Bill has been estimated for the last two bill cycles.
I'd like to do this without a cursor, if possible, since I am working with a sizable amount of data and this has to run fairly often. | 0 | [
2,
477,
81,
4195,
11295,
800,
3726,
3726,
31,
22,
79,
749,
20,
2757,
21,
25597,
30,
129,
2201,
97,
14,
81,
127,
1764,
11295,
37,
14,
1071,
859,
113,
14,
2744,
3157,
25,
1151,
9,
14,
2949,
25,
30,
158,
376,
20,
44,
4195,
8958,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Is there a style guide for GUI's somewhere?
===
I'm looking for a style guide to unify Windows applications. I'd like it to contain stuff like "Always put dialog result buttons 5 pixels from the edge of the window"
I know Visual Studio helps me with this but I'm Delphi 7 at the moment (yeah I know). | 0 | [
2,
25,
80,
21,
1034,
3378,
26,
9457,
22,
18,
3493,
60,
800,
3726,
3726,
31,
22,
79,
699,
26,
21,
1034,
3378,
20,
367,
8612,
1936,
3767,
9,
31,
22,
43,
101,
32,
20,
3717,
3217,
101,
13,
7,
21284,
442,
28223,
829,
12861,
331,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Java: Invalid Keystore format Error
===
Does anyone know how to solve this java error?
java.io.IOException: Invalid keystore format
I get it when I try and access the certificate store from the Java option in control panels. It's stopping me load applets that require elevated privileges.
[Error Image][1]
Thanks for any help
[1]: http://img72.imageshack.us/my.php?image=javaerrorxq7.jpg | 0 | [
2,
8247,
45,
16671,
1246,
16828,
2595,
7019,
800,
3726,
3726,
630,
1276,
143,
184,
20,
8402,
48,
8247,
7019,
60,
8247,
9,
1963,
9,
1963,
10066,
872,
45,
16671,
1246,
16828,
2595,
31,
164,
32,
76,
31,
1131,
17,
1381,
14,
6259,
1718... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Ruby on Rails - Tests
===
I'm confused about what the various testing applainces in Ruby on Rail are for. I have been using the framework for about 6 months but I've never understood the testing part of it. The only testing I've used is JUnit3 in Java and that only briefly.
Everything I've read about it just shows testing validations. Shouldn't the validations in rails just work? It seems more like testing the framework than testing the your code. Why would you need to test validations?
Furthermore, the tests seem super fragile to any change in your code. So if you change anything in your models, you have to change your tests and fixtures to match. Doesn't this violate the DRY principle?
Third, writing test code seems to take alot of time. Is that normal? Wouldn't it just be faster to refresh my browser and see if it worked? I already have to play with my application just to see if it flows correctly and make sure my CSS hasn't exploded. Why wouldn't manual testing be enough?
I've asked these questions before and I haven't gotten more than "automated testing is automated". I am smart enough to figure out the advantages of automating a task. My problem is that costs of writing tests seem absurdly high compared to the benefits. That said, any detailed response is welcome because I probably missed a benefit or two. | 0 | [
2,
10811,
27,
2240,
18,
13,
8,
4894,
800,
3726,
3726,
31,
22,
79,
4230,
88,
98,
14,
617,
4431,
4865,
10792,
5052,
19,
10811,
27,
2240,
50,
26,
9,
31,
57,
74,
568,
14,
6596,
26,
88,
400,
818,
47,
31,
22,
195,
243,
4014,
14,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
What should I know about Git before I start using it?
===
I have used "traditional" version control systems to maintain source code repositories on past projects. I am starting a new project with a distributed team and I can see advantages to using a distributed system. Given that I understand SourceSafe, CVS, and Subversion; what suggestions do you have for a Git newbie? | 0 | [
2,
98,
378,
31,
143,
88,
13,
10404,
115,
31,
799,
568,
32,
60,
800,
3726,
3726,
31,
57,
147,
13,
7,
14781,
7,
615,
569,
1242,
20,
4027,
1267,
1797,
302,
14882,
262,
2829,
27,
640,
2314,
9,
31,
589,
1422,
21,
78,
669,
29,
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... |
Pattern for trying different methods when exception is thrown
===
Here's a question to expose my lack of experience: I have a method **DoSomething()** which throws an exception if it doesn't manage to do it cleanly. If it fails, I try the less accurate method **DoSomethingApproximately()** several times in the hope that it will find a sufficiently good solution; if this also fails I finally call **DoSomethingInaccurateButGuaranteedToWork()**. All three are methods belonging to this object.
Two questions: first, is this (admittedly ugly) pattern acceptable, or is there a more elegant way?
Second, what is the best way to keep track of how many times I have called **DoSomethingApproximately()**, given that it is likely to throw an exception? I am currently keeping a variable iNoOfAttempts in the object, and nesting try blocks... this is horrible and I am ashamed.
| 0 | [
2,
3732,
26,
749,
421,
3195,
76,
5391,
25,
6027,
800,
3726,
3726,
235,
22,
18,
21,
1301,
20,
13833,
51,
1792,
16,
1496,
45,
31,
57,
21,
2109,
13,
1409,
537,
9099,
5,
6,
1409,
56,
13566,
40,
5391,
100,
32,
1437,
22,
38,
4705,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 solve "An attempt to attach an auto-named database for file..." SQL error?
===
I've got a local .mdf SQL database file that I am using for an integration testing project. Everything works fine on the initial machine I created the project, database, etc. on, but when I try to run the project on another machine I get the following:
*System.Data.SqlClient.SqlException : A connection was successfully established with the server, but then an error occurred during the login process. (provider: Shared Memory Provider, error: 0 - No process is on the other end of the pipe.)*
I figure while I am investigating this problem I would also ask the community here to see if someone has already overcome this.
The exception occurs when I instantiate the new data context. I am using LINQ-to-SQL.
m_TransLogDataContext = new TransLogDataContext ();
Let me know if any additional info is needed. Thanks. | 0 | [
2,
184,
20,
8402,
13,
7,
210,
1735,
20,
19514,
40,
3108,
8,
11482,
6018,
26,
3893,
9,
9,
9,
7,
4444,
255,
7019,
60,
800,
3726,
3726,
31,
22,
195,
330,
21,
375,
13,
9,
79,
8736,
4444,
255,
6018,
3893,
30,
31,
589,
568,
26,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How do I set the UI language in vim?
===
I saw [this][1] on reddit, and it reminded me of one of my vim gripes: It shows the UI in *German*. Damn you, vim! I want *English*, but since my OS is set up in German (the standard at our office), I guess vim is actually trying to be helpfull.
What magic incantations must I perform to get vim to switch the UI language? I have tried googling on various occasions, but can't seem to find an answer (No, Google, you're my friend \*pat\*, \*pat\*, but I allready know how to change the syntax highlighting, thank you!)...
[1]: http://www.gnegg.ch/2008/09/automatic-language-detection/ | 0 | [
2,
184,
107,
31,
309,
14,
13,
5661,
816,
19,
1790,
79,
60,
800,
3726,
3726,
31,
441,
636,
1565,
500,
2558,
165,
500,
27,
402,
43,
242,
15,
17,
32,
6041,
55,
16,
53,
16,
51,
1790,
79,
4466,
160,
45,
32,
1285,
14,
13,
5661,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Use custom objects as the source for Microsoft Reports (.rdlc)
===
In some instances, I prefer working with custom objects instead of strongly typed datasets and data rows. However, it seems like Microsoft Reporting (included with VS2005) requires strongly typed datasets.
Is there a way to use my custom objects to design and populate reports? | 0 | [
2,
275,
5816,
3916,
28,
14,
1267,
26,
7099,
2813,
13,
5,
9,
897,
6109,
6,
800,
3726,
3726,
19,
109,
13946,
15,
31,
6369,
638,
29,
5816,
3916,
700,
16,
5020,
1001,
43,
1054,
3554,
18,
17,
1054,
11295,
9,
207,
15,
32,
2206,
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... |
How can I debug a C# COM assembly when it's being called from a native win32 application?
===
I'm developing a C# assembly which is to be called via COM from a Delphi 7 (iow, native win32, not .net) application.
So far, it seems to work. I've exported a TLB file, imported that into my Delphi project, and I can create my C# object and call its functions.
So that's great, but soon I'm going to **really** want to use Visual Studio to debug the C# code while it's running. Set breakpoints, step through code, all that stuff.
I've tried breaking in the Delphi code after the COM object is created, then looking for a process for VS to attach to, but I can't find one.
Is there a way to set VS2008 up to do this? I'd prefer to just be able to hit f5 and have VS start the Delphi executable, wait for the C# code to be called, and then attach itself to it.. But I could live with manually attaching to a process, I suppose.
Just please don't tell me I have to make do with MessageBox.Show etc. | 0 | [
2,
184,
92,
31,
121,
16254,
21,
272,
5910,
13,
960,
1475,
76,
32,
22,
18,
142,
227,
37,
21,
1275,
628,
3125,
3010,
60,
800,
3726,
3726,
31,
22,
79,
3561,
21,
272,
5910,
1475,
56,
25,
20,
44,
227,
1197,
13,
960,
37,
21,
23030... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 design for lookup-and-possibly-change method
===
I am designing a class that stores (caches) a set of data. I want to lookup a value, if the class contains the value then use it and modify a property of the class. I am concerned about the design of the public interface.
Here is how the class is going to be used:
<pre>
ClassItem *pClassItem = myClass.Lookup(value);
if (pClassItem)
{ // item is found in class so modify and use it
pClassItem->SetAttribute(something);
... // use myClass
}
else
{ // value doesn't exist in the class so add it
myClass.Add(value, something);
}
</pre>
However I don't want to have to expose ClassItem to this client (ClassItem is an implementation detail of MyClass).
To get round that the following could be considered:
<pre>
bool found = myClass.Lookup(value);
if (found)
{ // item is found in class so modify and use it
myClass.ModifyAttribute(value, something);
... // use myClass
}
else
{ // value doesn't exist in the class so add it
myClass.Add(value, something);
}
</pre>
However this is inefficient as Modify will have to do the lookup again. This would suggest a lookupAndModify type of method:
<pre>
bool found = myClass.LookupAndModify(value, something);
if (found)
{ // item is found in class
... // use myClass
}
else
{ // value doesn't exist in the class so add it
myClass.Add(value, something);
}
</pre>
But rolling LookupAndModify into one method seems like very poor design. It also only modifies if value is found and so the name is not only cumbersome but misleading as well.
Is there another better design that gets round this issue? Any design patterns for this (I couldn't find anything through google)? | 0 | [
2,
246,
704,
26,
361,
576,
8,
290,
8,
21628,
8,
16229,
2109,
800,
3726,
3726,
31,
589,
15026,
21,
718,
30,
4134,
13,
5,
793,
5370,
6,
21,
309,
16,
1054,
9,
31,
259,
20,
361,
576,
21,
1923,
15,
100,
14,
718,
1588,
14,
1923,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 disable updating a form in WinForms ?
===
During a complicated update I might prefer to display all the changes at once. I know there is a method that allows me to do this, but I can't find it. Please help. | 0 | [
2,
184,
107,
31,
1460,
579,
71,
43,
1880,
21,
505,
19,
628,
4190,
18,
13,
60,
800,
3726,
3726,
112,
21,
8343,
11100,
31,
530,
6369,
20,
3042,
65,
14,
1693,
35,
382,
9,
31,
143,
80,
25,
21,
2109,
30,
2965,
55,
20,
107,
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,
0,
0,
0,
0... |
Educational usages of acceleration sensors
===
I'm working in a higher school in Austria and I'm currently evaluation how acceleration sensors can be used to deepen fundamental understandings (physics, mathematics, electronics, software engineering, project management, user interface [iPhone]...) and achive better motivation of the students (for example by giving a far milestone like an autopilot).
However this doesn't seem to be a widely used idea; acceleration sensors are used somewhere at universities for different projects and are included in some modern hardware or gadgets (iPhone).
I'd like to know if there is somebody who knows about educational projects that use these sensors in any kind of subject?
thanks | 0 | [
2,
3076,
7514,
18,
16,
17661,
15529,
800,
3726,
3726,
31,
22,
79,
638,
19,
21,
1184,
116,
19,
3848,
17,
31,
22,
79,
871,
8670,
184,
17661,
15529,
92,
44,
147,
20,
855,
219,
6377,
3260,
18,
13,
5,
10100,
8354,
15,
4264,
15,
795... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 a gwt-ext window not resize when its content resizes?
===
I've run *setHeight(600)* on a [Window][1], that's it's initial size. I've also went ahead and done *setAutoScroll(true)*.
When the content of the window resizes, the window itself resizes. What I want is for the window to stay fixed in size, and when the content grows larger, add scrollbars.
I can get this if I resize the window manually, then let the content grow or shrink.
[1]: http://gwt-ext.com/docs/2.0.4/com/gwtext/client/widgets/Window.html | 0 | [
2,
184,
107,
31,
233,
21,
14094,
38,
8,
1706,
38,
1463,
52,
302,
10454,
76,
82,
2331,
10719,
13569,
60,
800,
3726,
3726,
31,
22,
195,
485,
1637,
18,
6268,
7748,
5,
7664,
6,
2483,
27,
21,
636,
27508,
500,
2558,
165,
500,
15,
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... |
Data Comparison
===
We have a SQL Server table containing Company Name, Address, and Contact name (among others).
We regularly receive data files from outside sources that require us to match up against this table. Unfortunately, the data is slightly different since it is coming from a completely different system. For example, we have "123 E. Main St." and we receive "123 East Main Street". Another example, we have "Acme, LLC" and the file contains "Acme Inc.". Another is, we have "Ed Smith" and they have "Edward Smith"
We have a legacy system that utilizes some rather intricate and CPU intensive methods for handling these matches. Some involve pure SQL and others involve VBA code in an Access database. The current system is good but not perfect and is cumbersome and difficult to maintain
The management here wants to expand its use. The developers who will inherit the support of the system want to replace it with a more agile solution that requires less maintenance.
Is there a commonly accepted way for dealing with this kind of data matching?
| 0 | [
2,
1054,
6050,
800,
3726,
3726,
95,
57,
21,
4444,
255,
8128,
859,
3503,
237,
204,
15,
3218,
15,
17,
2203,
204,
13,
5,
21068,
654,
6,
9,
95,
4217,
2588,
1054,
6488,
37,
719,
2662,
30,
4077,
182,
20,
730,
71,
149,
48,
859,
9,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Visual Studio 2005 - Refactor multiple attributes in same time?
===
I use the right button>Refactor>Encapsultate field to have my accessor every time. The problem is when I create new class, I can have more than 10 attributes and it's long to do 1 by 1 every accessor. Is there a faster way to create them?
Thank you for your time. | 0 | [
2,
3458,
1120,
812,
13,
8,
302,
17455,
1886,
13422,
19,
205,
85,
60,
800,
3726,
3726,
31,
275,
14,
193,
5167,
1,
99,
17455,
1,
219,
4666,
18,
10368,
1373,
575,
20,
57,
51,
1381,
248,
352,
85,
9,
14,
1448,
25,
76,
31,
1600,
7... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
What is the equivalent of the SQLite datetime function in PostgreSQL?
===
The question is pretty self-explanatory. I'm looking for a PostgreSQL equivalent to the [SQLite datetime function][1].
[1]: http://www.sqlite.org/cvstrac/wiki?p=DateAndTimeFunctions | 0 | [
2,
98,
25,
14,
4602,
16,
14,
4444,
10601,
1231,
891,
1990,
19,
678,
6879,
18,
22402,
60,
800,
3726,
3726,
14,
1301,
25,
1772,
1119,
8,
6899,
1804,
7496,
9,
31,
22,
79,
699,
26,
21,
678,
6879,
18,
22402,
4602,
20,
14,
636,
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... |
Organizing the source code base when mixing two or more langauges (like Java and C++)
===
I ran into a problem a few days ago when I had to introduce C++ files into a Java project. It started with a need to measure the CPU usage of the Java process and it was decided that the way to go was to use JNI to call out to a native library (a shared library on a Unix machine) written in C. The problem was to find an appropriate place to put the C files in the source repository (incidentally Clearcase) which consists of only Java files.
I thought of a couple of alternatives:
(a) Create a separate directory for putting the C files (specifically, one .h file and one .c file) at the top of the source base like:
/vobs/myproduct/javasrc
/vobs/myproduct/cppsrc
I didn't like this because I have only two C files and it seemed very odd to split the source base at the language level like this. Had substantial portions of the project been written more or less equally in C++ and Java, this could be okay.
(b) Put the C files into the Java package that uses it.
I have the calling Java classes in /vobs/myproduct/com/mycompany/myproduct/util/ and the C files also go in there.
I didn't like this either because I think the C files just don't belong in the Java package.
Has anybody solved a problem like this before? Generally, what's a good strategy to follow when organizing codebase that mixes two or more languages?
| 0 | [
2,
11725,
14,
1267,
1797,
1000,
76,
5826,
81,
54,
91,
6178,
27229,
18,
13,
5,
1403,
8247,
17,
272,
20512,
6,
800,
3726,
3726,
31,
717,
77,
21,
1448,
21,
310,
509,
1464,
76,
31,
41,
20,
8500,
272,
20512,
6488,
77,
21,
8247,
669... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
PHP object caching
===
In ASPNET, I grew to love the Application and Cache stores. They're awesome. For the uninitiated, you can just throw your data-logic objects into them, and hey-presto, you only need query the database once for a bit of data.
By far one of the best ASPNET features, IMO.
I've since ditched Windows for Linux, and therefore PHP, Python and Ruby for webdev. I use PHP most because I dev several open source projects, all using PHP.
Needless to say, I've explored what PHP has to offer in terms of caching data-objects. So far I've played with:
1. Serializing to file (a pretty slow/expensive process)
2. Writing the data to file as JSON/XML/plaintext/etc (even slower for read ops)
3. Writing the data to file as pure PHP (the fastest read, but quite a convoluted write op)
I should stress now that I'm looking for a solution that doesn't rely on a third party app (eg memcached) as the apps are installed in all sorts of scenarios, most of which don't have install rights (eg: a cheap shared hosting account).
So back to what I'm doing now, **is persisting to file secure?** `Rule 1` in production server security has always been disable file-writing, but I really don't see any way PHP *could* cache if it couldn't write. Are there any tips and/or tricks to boost the security?
**Is there another persist-to-file method that I'm forgetting?**
**Are there any better methods of caching in "limited" environments?** | 0 | [
2,
13,
26120,
3095,
1658,
7192,
800,
3726,
3726,
19,
28,
306,
2328,
15,
31,
1642,
20,
339,
14,
3010,
17,
16522,
4134,
9,
59,
22,
99,
13706,
9,
26,
14,
367,
108,
8793,
1669,
15,
42,
92,
114,
3814,
154,
1054,
8,
24268,
3916,
77,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How can I ensure a dialog will be modal when opened from an IE BHO?
===
I have an Internet Explorer Browser Helper Object (BHO), written in c#, and in various places I open forms as modal dialogs. Sometimes this works but in some cases it doesn't. The case that I can replicate at present is where IE is running javascript to open other child windows... I guess it's getting a bit confused somewhere....
The problem is that when I call:
(new MyForm(someParam)).ShowDialog();
the form is not modal, so I can click on the IE window and it gets focus. Since IE is in the middle of running my code it doesn't refresh and therefore to the user it appears that IE is hanging.
Is there a way of ensuring that the form will be opened as modal, ie that it's not possible for the form to be hidden behind IE windows.
(I'm using IE7.)
NB: this is a similar question to [this post][1] although that's using java. I guess the solution is around correctly passing in the IWin32Window of the IE window, so I'm looking into that.
[1]: http://stackoverflow.com/questions/73000/modal-dialogs-in-ie-gets-hidden-behind-ie-if-user-clicks-on-ie-pane | 0 | [
2,
184,
92,
31,
4062,
21,
28223,
129,
44,
13,
20756,
76,
520,
37,
40,
13,
660,
334,
1807,
60,
800,
3726,
3726,
31,
57,
40,
2620,
8520,
16495,
448,
106,
3095,
13,
5,
220,
1807,
6,
15,
642,
19,
272,
5910,
15,
17,
19,
617,
1489... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 make the AssemblyInfo version of a C# .NET program propagate to the Explorer Properties window?
===
It seems like if you compile a Visual Studio solution and have a version # in your AssemblyInfo.cs file, that should propagate to say, the Windows Explorer properties dialog. This way, someone could simply right click on the *.exe and click 'properties' to see the version #. Is there a special setting in Visual Studio to make this happen?
 | 0 | [
2,
184,
92,
31,
233,
14,
1475,
108,
4120,
615,
16,
21,
272,
5910,
13,
9,
2328,
625,
24618,
20,
14,
8520,
3704,
1463,
60,
800,
3726,
3726,
32,
2206,
101,
100,
42,
26561,
21,
3458,
1120,
4295,
17,
57,
21,
615,
6926,
19,
154,
147... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Log4Net/C# - Disable default logging
===
I am using log4net in a C# project, in the production environment, I want to disable all the logging, but when some fatal
error occures it should log all the previous 512 messages in to a file.I have successfully configured this, and it is working fine. It logs the messages in to a file when some fatal error occures.
But when I run it from Visual Studio, I can see all the log messages are written to the Output window, regardless of whether it is a Fatal or not. (I cant see these messages when I run from the Windows Explorer - my application is a WinForm exe and there is no Console window to see the output)
Is there any way to disable this logging? I need my logs only in file, that too when some fatal error occures.
<?xml version="1.0" encoding="utf-8" ?>
<configuration>
<log4net debug="false">
<appender name="RollingFileAppender" type="log4net.Appender.RollingFileAppender">
<file value="log.txt" />
<appendToFile value="true" />
<rollingStyle value="Size" />
<maxSizeRollBackups value="10" />
<maximumFileSize value="1MB" />
<staticLogFileName value="true" />
<layout type="log4net.Layout.PatternLayout">
<conversionPattern value="%date [%thread] %-5level %logger [%property{NDC}] - %message%newline" />
</layout>
</appender>
<appender name="BufferingForwardingAppender" type="log4net.Appender.BufferingForwardingAppender" >
<bufferSize value="512" />
<lossy value="true" />
<evaluator type="log4net.Core.LevelEvaluator">
<threshold value="FATAL"/>
</evaluator>
<appender-ref ref="RollingFileAppender" />
</appender>
<root>
<level value="DEBUG" />
<appender-ref ref="BufferingForwardingAppender" />
</root>
</log4net>
</configuration>
And this is how I configure it in the static initializer of Windows Forms.
static Window1()
{
Stream vStream = typeof(Window1).Assembly.GetManifestResourceStream("TestLogNet.log4net.config");
XmlConfigurator.Configure(vStream);
BasicConfigurator.Configure();
}
And I have the logger object initialized in the constructor of WinForm
logger = LogManager.GetLogger(typeof(Window1));
Please help,
[language - C#,
.NET Framework - 3.5,
Visual Studio 2008,
log4net 1.2.10,
project type - WinForms]
| 0 | [
2,
6738,
300,
2328,
118,
150,
5910,
13,
8,
1460,
579,
12838,
13,
13919,
800,
3726,
3726,
31,
589,
568,
6738,
300,
2328,
19,
21,
272,
5910,
669,
15,
19,
14,
637,
2307,
15,
31,
259,
20,
1460,
579,
65,
14,
13,
13919,
15,
47,
76,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
UI During Custom Installer Action
===
What is the correct way to display UI during a custom installer action?
I would like my UI to be modal on the install dialog, or alternatively, I'd like a way to display text/progress from my custom action in the installer dislog.
The installer is a VS2005 setup project and the custom action is a C# Installer-derived class. | 0 | [
2,
13,
5661,
112,
5816,
16146,
106,
1028,
800,
3726,
3726,
98,
25,
14,
4456,
161,
20,
3042,
13,
5661,
112,
21,
5816,
16146,
106,
1028,
60,
31,
83,
101,
51,
13,
5661,
20,
44,
13,
20756,
27,
14,
16146,
28223,
15,
54,
16785,
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... |
Is there a good lightweight multiplatform C++ timer queue?
===
What I'm looking for is a simple timer queue possibly with an external timing source and a poll method (in this way it will be multi-platform). Each enqueued message could be an object implementing a simple interface with a virtual onTimer() method. | 0 | [
2,
25,
80,
21,
254,
13613,
1889,
27035,
272,
20512,
85,
139,
22521,
60,
800,
3726,
3726,
98,
31,
22,
79,
699,
26,
25,
21,
1935,
85,
139,
22521,
2879,
29,
40,
4886,
11812,
1267,
17,
21,
4994,
2109,
13,
5,
108,
48,
161,
32,
129,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Is there a good description of the "system call" mechanism used in OSes?
===
I am looking for a good primer or technical description of the **System Call** mechanism that is used by operating systems to transition from user space to the kernel to invoke functions such as "open", "read", "write", etc...
Is there anything other than the [Wikipedia][1] entry?
Websites, pdfs, books, source code, all are welcome :)
[1]: http://en.wikipedia.org/wiki/System_call | 0 | [
2,
25,
80,
21,
254,
5318,
16,
14,
13,
7,
10724,
645,
7,
6534,
147,
19,
13,
6641,
18,
60,
800,
3726,
3726,
31,
589,
699,
26,
21,
254,
1621,
139,
54,
2447,
5318,
16,
14,
13,
1409,
10724,
645,
1409,
6534,
30,
25,
147,
34,
2455,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
ORM: Handwritten schema or auto-generated?
===
Should I use a hand-written schema for my projected developed in a high-level language (such as Python, Ruby) or should I let my ORM solution auto-generate it?
Eventually I will need to migrate without destroying all the data. It's okay to be tied to a specific RDBMS but it would be nice if features such as constraints and procedures could be supported somehow. | 0 | [
2,
54,
79,
45,
224,
6390,
23874,
54,
3108,
8,
25314,
60,
800,
3726,
3726,
378,
31,
275,
21,
224,
8,
6390,
23874,
26,
51,
12454,
885,
19,
21,
183,
8,
3906,
816,
13,
5,
4289,
28,
20059,
15,
10811,
6,
54,
378,
31,
408,
51,
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... |
XML vs Text for Non-web development applications
===
I do alot of systems programming where my apps have no chance of being used to communicate over the web or viewed through a browser. But, there has been some push by management to use XML. For example, if I want to keep a time log I could use a text file like this:
command date time project<br>
in 2008/09/23 08:00:00 PROJ1<br>
change 2008/09/23 09:00:00 PROJ2<br>
out 2008/09/23 12:00:00 PROJ2<br>
in 2008/09/23 01:00:00 PROJ3<br>
out 2008/09/23 05:00:00 PROJ3<br>
The XML would look something like this:<br>
`<timelog>`
`<timecommand cmd=in date=2008/09/23 time=8:00:00 proj=PROJ1/>`<br>
...<br>
`<timecommand cmd=out date=2008/09/23 time=5:00:00 proj=PROJ3/>`<br>
`</timelog>`
Some of the initial advantages of the text version that I see is that it is easily readable and parsable with regex. What are the advantages to using XML in this case? | 0 | [
2,
23504,
4611,
1854,
26,
538,
8,
14113,
522,
3767,
800,
3726,
3726,
31,
107,
21,
5639,
16,
1242,
3143,
113,
51,
4865,
18,
57,
90,
1504,
16,
142,
147,
20,
8709,
84,
14,
2741,
54,
6084,
120,
21,
16495,
9,
47,
15,
80,
63,
74,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Spring.net + Nhibernate Integration Tests Pass When They Should Not
===
I'm using Spring.net with NHiberante (HibernateTemplate) to implement my DAO's.
I also have some integration tests, that extend from 'AbstractTransactionalDbProviderSpringContextTests '.
DI is working fine, and all test pass BUT sometimes they pass **even when they shouldn't**.
For example if my hbm.xml files have an error like this:
`<class name="Confluence.Domain.User" table="THIS TABLE DOES NOT EXIST">`
The tests fails, but if the error is like this one:
` <many-to-many
class="Confluence.Domain.User"
column="THIS COLUMN DOES NOT EXIST"/>`
the tests pass silently hiding the bug.
I'm testing it using SetComplete() and checking the DB for the changes, but I think the whole idea of this kind of tests is not to do so.
Can anyone tell me how to fix this issue?
Thank you very much!
| 0 | [
2,
1573,
9,
2328,
2754,
12109,
15191,
8820,
8078,
4894,
1477,
76,
59,
378,
52,
800,
3726,
3726,
31,
22,
79,
568,
1573,
9,
2328,
29,
12109,
15191,
4760,
13,
5,
8630,
106,
8820,
9577,
6554,
6,
20,
8713,
51,
13,
17104,
22,
18,
9,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How to read console output in j2me cellphones? Where does System.out.println() go?
===
When writing j2me applications for cellphones, using `System.out.println()` prints on the console if using an emulator. However, when the code is deployed on a cellphone, where does the console output go?
If it is impossible to see this in the untethered cellphone, is there a way to see it if the cellphone is still connected to the deploying PC [via USB] ?
Thanks | 0 | [
2,
184,
20,
1302,
8650,
5196,
19,
487,
135,
790,
1667,
7709,
18,
60,
113,
630,
329,
9,
1320,
9,
10299,
16600,
5,
6,
162,
60,
800,
3726,
3726,
76,
1174,
487,
135,
790,
3767,
26,
1667,
7709,
18,
15,
568,
13,
1,
10724,
9,
1320,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
What's a good compression library for Java?
===
I need to compress portions of our application's network traffic for performance. I presume this means I need to stay away from some of the newer algorithms like bzip2, which I think I have heard is slower. | 0 | [
2,
98,
22,
18,
21,
254,
14864,
1248,
26,
8247,
60,
800,
3726,
3726,
31,
376,
20,
26060,
9125,
16,
318,
3010,
22,
18,
982,
2227,
26,
956,
9,
31,
29294,
48,
1108,
31,
376,
20,
1179,
229,
37,
109,
16,
14,
12372,
15935,
101,
334,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
Returning an 'any kind of input iterator' instead of a vector::iterator or a list::iterator
===
Suppose I want to implement in C++ a data-structure to store oriented graphs. Arcs will be stored in Nodes thanks to STL containers. I'd like users to be able to iterate over the arcs of a node, in an STL-like way.
The issue I have is that I don't want to expose in the Node class (that will actually be an abstract base class) which STL container I will actually use in the concrete class. I therefore don't want to have my methods return std::list<Arc*>::iterator or std::vector<Arc*>::iterator...
I tried this:
class Arc;
typedef std::iterator<std::random_access_iterator_tag, Arc*> ArcIterator; // Wrong!
class Node {
public:
ArcIterator incomingArcsBegin() const {
return _incomingArcs.begin();
}
private:
std::vector<Arc*> _incomingArcs;
};
But this is not correct because a vector::const_iterator can't be used to create an ArcIterator. So what can be this ArcIterator?
I found this paper about [Custom Iterators for the STL](http://www.oonumerics.org/tmpw00/becker.html) but it did not help. I must be a bit heavy today... ;) | 0 | [
2,
2485,
40,
13,
22,
6001,
825,
16,
6367,
32,
106,
3457,
22,
700,
16,
21,
7497,
45,
45,
242,
106,
3457,
54,
21,
968,
45,
45,
242,
106,
3457,
800,
3726,
3726,
5787,
31,
259,
20,
8713,
19,
272,
20512,
21,
1054,
8,
13971,
20,
1... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How to check my byte flag?
===
I use a byte to store some flag like : 10101010 and I would like to know how to verify that a specific bit is at 1 or 0. | 0 | [
2,
184,
20,
2631,
51,
34,
591,
3157,
60,
800,
3726,
3726,
31,
275,
21,
34,
591,
20,
1718,
109,
3157,
101,
13,
45,
332,
1036,
1036,
1036,
17,
31,
83,
101,
20,
143,
184,
20,
21012,
30,
21,
1903,
1142,
25,
35,
137,
54,
713,
9,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
Comparing cold-start to warm start
===
Our application takes significantly more time to launch after a reboot (cold start) than if it was already opened once (warm start).
Most (if not all) the difference seems to come from loading DLLs, when the DLLs' are in cached memory pages they load much faster. We tried using [ClearMem](http://mypchell.com/content/view/40/1/) to simulate rebooting (since its much less time consuming than actually rebooting) and got mixed results, on some machines it seemed to simulate a reboot very consistently and in some not.
To sum up my questions are:
1. Have you experienced differences in launch time between cold and warm starts?
2. How have you delt with such differences?
3. Do you know of a way to dependably simulate a reboot?
| 0 | [
2,
15047,
1191,
8,
13680,
20,
2059,
799,
800,
3726,
3726,
318,
3010,
1384,
5085,
91,
85,
20,
3394,
75,
21,
25312,
13,
5,
15056,
799,
6,
119,
100,
32,
23,
614,
520,
382,
13,
5,
1885,
79,
799,
6,
9,
127,
13,
5,
821,
52,
65,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Why is it not a good idea to use SOAP for communicating with the front end (ie web browser)?
===
Why is it not a good idea to use SOAP for communicating with the front end? For example, a web browser using JavaScript. | 0 | [
2,
483,
25,
32,
52,
21,
254,
882,
20,
275,
6447,
26,
23284,
29,
14,
431,
241,
13,
5,
660,
2741,
16495,
6,
60,
800,
3726,
3726,
483,
25,
32,
52,
21,
254,
882,
20,
275,
6447,
26,
23284,
29,
14,
431,
241,
60,
26,
823,
15,
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,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
Put text on the clipboard with FireFox, Safari and Chrome
===
In Internet Explorer I can use the clipboardData object to access the clipboard. How can I do that in FireFox, Safari and/or Chrome? | 0 | [
2,
442,
1854,
27,
14,
12229,
2806,
29,
535,
18219,
15,
25055,
17,
13,
12985,
800,
3726,
3726,
19,
2620,
8520,
31,
92,
275,
14,
12229,
2806,
18768,
3095,
20,
1381,
14,
12229,
2806,
9,
184,
92,
31,
107,
30,
19,
535,
18219,
15,
250... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
How to UAC elevate a COM component with .NET
===
I've found an [article][1] on how to elevate a COM object written in C++ by calling CoCreateInstanceAsAdmin. But what I have not been able to find or do, is a way to implement a component of my .NET (c#) application as a COM object and then call into that object to execute the tasks which need UAC elevation. MSDN documents this as the [admin COM object model][2].
I am aware that it is possible and quite easy to launch the application (or another app) as an administrator, to execute the tasks in a separate process (see for instance the [post from Daniel Moth][3], but what I am looking for is a way to do everything from within the same, un-elevated .NET executable.
[1]: http://chrison.net/UACElevationInManagedCodeStartingElevatedCOMComponents.aspx
[2]: http://msdn.microsoft.com/en-us/library/bb756990.aspx
[3]: http://www.danielmoth.com/Blog/2006/12/launch-elevated-and-modal-too.html | 0 | [
2,
184,
20,
287,
1738,
29890,
21,
13,
960,
5912,
29,
13,
9,
2328,
800,
3726,
3726,
31,
22,
195,
216,
40,
636,
20360,
500,
2558,
165,
500,
27,
184,
20,
29890,
21,
13,
960,
3095,
642,
19,
272,
20512,
34,
2555,
326,
6037,
1373,
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... |
Find out number of capture groups in python regexp
===
Is there a way to determine how many capture groups there are in a given regexp?
I would like to be able to do the follwing:
def groups(regexp, s):
""" Returns the first result of re.findall, or an empty default
>>> groups(r'(\d)(\d)(\d)', '123')
('1', '2', '3')
>>> groups(r'(\d)(\d)(\d)', 'abc')
('', '', '')
"""
import re
l = re.findall(regexp, string)
if len(l) > 0:
return l[0]
return ('',) * num_of_groups(regexp)
This is useful in some situations, but I don't know how to implement `num_of_groups`. (Currently I just work around it). | 0 | [
2,
477,
70,
234,
16,
3683,
1170,
19,
20059,
7953,
6899,
800,
3726,
3726,
25,
80,
21,
161,
20,
3746,
184,
151,
3683,
1170,
80,
50,
19,
21,
504,
7953,
6899,
60,
31,
83,
101,
20,
44,
777,
20,
107,
14,
4310,
211,
3546,
45,
6312,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 .NET Framework 3.5 SP1 require restart?
===
We have a production machine and are trying to slowly introduce some 3.0 and up features on our web application. 3.5 is installed but I would like to upgrade to SP1, I would just like to know if it requires a restart of the machine in the end so I can schedule some down time.
Thanks! | 0 | [
2,
630,
13,
9,
2328,
6596,
203,
9,
264,
3782,
165,
4077,
22767,
60,
800,
3726,
3726,
95,
57,
21,
637,
1940,
17,
50,
749,
20,
1447,
8500,
109,
203,
9,
387,
17,
71,
967,
27,
318,
2741,
3010,
9,
203,
9,
264,
25,
4066,
47,
31,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
GridView Row to Object Type
===
In ASP.NET, if I databind a gridview with a array of objects lets say <foo>, how can I retrieve and use foo(index) when the user selects the row?
i.e.
dim fooArr() as foo;
gv1.datasource = fooArr;
gv1.databind();
On Row Select
Private Sub gv1_RowCommand(ByVal sender As Object, ByVal e As System.Web.UI.WebControls.GridViewCommandEventArgs) Handles gv1.RowCommand
If e.CommandName = "Select" Then
'get and use foo(index)
End If
End Sub
| 0 | [
2,
7354,
4725,
3131,
20,
3095,
1001,
800,
3726,
3726,
19,
28,
306,
9,
2328,
15,
100,
31,
1054,
4772,
43,
21,
7354,
4725,
29,
21,
7718,
16,
3916,
6884,
395,
13,
1,
4120,
111,
1,
15,
184,
92,
31,
11917,
17,
275,
4310,
111,
5,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
What is the preferred method of commenting javascript objects & methods
===
I'm used to atlas where the preferred (from what I know) method is to use xml comments such as:
/// <summary>
/// Method to calculate distance between two points
/// </summary>
///
/// <param name="pointA">First point</param>
/// <param name="pointB">Second point</param>
///
function calculatePointDistance(pointA, pointB) { ... }
Recently I've been looking into other 3rd party javascript libraries and I see syntax like:
/*
* some comment here
* another comment here
* ...
*/
function blahblah() { ... }
As a bonus, please let me know if there are any API generators for JavaScript that could read the 'preferred' commenting style. | 0 | [
2,
98,
25,
14,
5981,
2109,
16,
17797,
8247,
8741,
3916,
279,
3195,
800,
3726,
3726,
31,
22,
79,
147,
20,
11986,
113,
14,
5981,
13,
5,
2665,
98,
31,
143,
6,
2109,
25,
20,
275,
23504,
7534,
145,
28,
45,
12894,
118,
13,
1,
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... |
So, who should daemonize? The script or the caller?
===
I'm always wondering who should do it. In <a href="http://ruby-lang.org/">Ruby</a>, we have the <a href="http://daemons.rubyforge.org/">Daemons</a> library which allows Ruby scripts to daemonize themselves. And then, looking at <a href="http://god.rubyforge.org/">God</a> (a process monitoring tool, similar to <a href="http://www.tildeslash.com/monit/">monit</a>) page, I see that God can daemonize processes.
Any definitive answer out there? | 0 | [
2,
86,
15,
72,
378,
13127,
2952,
60,
14,
3884,
54,
14,
21326,
60,
800,
3726,
3726,
31,
22,
79,
550,
5712,
72,
378,
107,
32,
9,
19,
13,
1,
58,
746,
14057,
3726,
7,
21127,
6903,
1820,
779,
8,
9949,
9,
5583,
118,
7,
1,
1820,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 Convert integer to binary string
===
I was wondering if there was an easy way in SQL to convert an integer to its binary representation and then store it as a varchar.
For example 5 would be converted to "101" and stored as a varchar. | 0 | [
2,
4444,
255,
8128,
8406,
13820,
20,
14171,
3724,
800,
3726,
3726,
31,
23,
5712,
100,
80,
23,
40,
2010,
161,
19,
4444,
255,
20,
8406,
40,
13820,
20,
82,
14171,
5442,
17,
94,
1718,
32,
28,
21,
4033,
5433,
9,
26,
823,
331,
83,
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,
0,
0,
0,
0... |
How to test for object existence in Firebird SQL?
===
I need to test whether various types of database objects exist in a given database, and I don't know how to formulate these tests in Firebird SQL. Each test has the form "Does object of type *X* with name *Y* exist?". For example, I need to test whether a table with a given name exists. The object types I need to test are:
- Table
- View
- Domain
- Trigger
- Procedure
- Exception
- Generate
- UDF
- Role
One can find how to query for a given table on the Internet, but the other types are more difficult to find ... | 0 | [
2,
184,
20,
1289,
26,
3095,
3012,
19,
535,
8490,
4444,
255,
60,
800,
3726,
3726,
31,
376,
20,
1289,
1472,
617,
2551,
16,
6018,
3916,
3182,
19,
21,
504,
6018,
15,
17,
31,
221,
22,
38,
143,
184,
20,
3729,
591,
158,
4894,
19,
535... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Resolve Windows device path to drive letter
===
How do you resolve an NT style device path, e.g. \Device\CdRom0, to is logical drive letter, e.g. G:\ ?
Thanks in advance. | 0 | [
2,
9854,
1936,
3646,
2013,
20,
1493,
1748,
800,
3726,
3726,
184,
107,
42,
9854,
40,
13,
2877,
1034,
3646,
2013,
15,
13,
62,
9,
263,
9,
13,
1,
546,
18507,
1,
6324,
8541,
387,
15,
20,
25,
11545,
1493,
1748,
15,
13,
62,
9,
263,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
Sample Code for R?
===
Does anyone know a good online resource for example of R code?
The programs do not have to be written for illustrative purposes, I am really just looking for some places where a bunch of R code has been written to give me a sense of the syntax and capabilities of the language? | 4 | [
2,
5717,
1797,
26,
761,
60,
800,
3726,
3726,
630,
1276,
143,
21,
254,
2087,
6577,
26,
823,
16,
761,
1797,
60,
14,
1726,
107,
52,
57,
20,
44,
642,
26,
13,
13898,
1939,
6142,
4612,
15,
31,
589,
510,
114,
699,
26,
109,
1489,
113,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 Determining differences in two lists of data.
===
This is an exercise for the CS guys to shine with the theory.
Imagine you have 2 lists. Folders, URLs, Files, it really doesn't matter.
What is AN algorithm to calculate the added and the removed?
**Notice**: If there are many ways to solve this problem, please post one per answer so it can be analysed and voted up.
| 0 | [
2,
184,
20,
13521,
4921,
19,
81,
7227,
16,
1054,
9,
800,
3726,
3726,
48,
25,
40,
5935,
26,
14,
272,
18,
2776,
20,
11662,
29,
14,
1639,
9,
4382,
42,
57,
172,
7227,
9,
19294,
18,
15,
13,
911,
7532,
15,
6488,
15,
32,
510,
1437,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Slow insert with MS SQL
===
I have someting like this in my code (.Net 2.0, MS SQL)
SqlConnection connection = new SqlConnection(@"Data Source=localhost;Initial
Catalog=TrafficDB;Integrated Security=True");
connection.Open();
SqlCommand cmdInsert = connection.CreateCommand();
SqlTransaction sqlTran = connection.BeginTransaction();
cmdInsert.Transaction = sqlTran;
cmdInsert.CommandText =
@"INSERT INTO tbTrafficLogTTL" +
"(Year, Month, Day, Hour, Minute, Second, ...) " +
"VALUES " +
"(@Year, @Month, @Day, @Hour, @Minute, @Second, ...) ";
cmdInsert.Parameters.Add("@Year", SqlDbType.SmallInt);
cmdInsert.Parameters.Add("@Month", SqlDbType.TinyInt);
cmdInsert.Parameters.Add("@Day", SqlDbType.TinyInt);
cmdInsert.Parameters.Add("@Hour", SqlDbType.TinyInt);
cmdInsert.Parameters.Add("@Minute", SqlDbType.TinyInt);
cmdInsert.Parameters.Add("@Second", SqlDbType.TinyInt);
// more fields here
cmdInsert.Prepare();
Stream stream = new FileStream(fileName, FileMode.Open, FileAccess.Read);
StreamReader reader = new StreamReader(stream);
char[] delimeter = new char[] {' '};
String[] records;
while (!reader.EndOfStream)
{
records = reader.ReadLine().Split(delimeter, StringSplitOptions.None);
cmdInsert.Parameters["@Year"].Value = Int32.Parse(records[0].Substring(0, 4));
cmdInsert.Parameters["@Month"].Value = Int32.Parse(records[0].Substring(5, 2));
cmdInsert.Parameters["@Day"].Value = Int32.Parse(records[0].Substring(8, 2));
cmdInsert.Parameters["@Hour"].Value = Int32.Parse(records[1].Substring(0, 2));
cmdInsert.Parameters["@Minute"].Value = Int32.Parse(records[1].Substring(3, 2));
cmdInsert.Parameters["@Second"].Value = Int32.Parse(records[1].Substring(6, 2));
// more here
cmdInsert.ExecuteNonQuery()
}
sqlTran.Commit();
connection.Close();
With *cmdInsert.ExecuteNonQuery()* commneted out this codes executes in less than 2 sec. With SQL execution it takes 1 minute. There are around 0.5 milion records. Table is emptied before.
Any idea what is done wrong ? I come from Delphi world so I am kind of newbe
| 0 | [
2,
2276,
14692,
29,
4235,
4444,
255,
800,
3726,
3726,
31,
57,
109,
1203,
101,
48,
19,
51,
1797,
13,
5,
9,
2328,
172,
9,
387,
15,
4235,
4444,
255,
6,
4444,
255,
25996,
872,
2760,
800,
78,
4444,
255,
25996,
872,
5,
1,
7,
18768,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 check if index exists on a table field in mysql
===
I've needed to Google this a couple times, so I'm sharing my Q/A. | 0 | [
2,
184,
107,
31,
2631,
100,
4348,
5636,
27,
21,
859,
575,
19,
51,
18,
22402,
800,
3726,
3726,
31,
22,
195,
851,
20,
8144,
48,
21,
1335,
436,
15,
86,
31,
22,
79,
6126,
51,
2593,
118,
58,
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... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.