unified_texts stringlengths 32 30.1k | OpenStatus_id int64 0 4 | input_ids list | token_type_ids list | attention_mask list |
|---|---|---|---|---|
How do I add a "last" class on the last <li> within a Views-generated list?
===
Title says it all. | 0 | [
2,
184,
107,
31,
3547,
21,
13,
7,
8558,
7,
718,
27,
14,
236,
13,
1,
1210,
1,
363,
21,
4146,
8,
25314,
968,
60,
800,
3726,
3726,
581,
898,
32,
65,
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... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
LocBaml include previous translations
===
Is there a way to combine a previous translation when extracting the csv file from an application?
Or any other tool that could do this job for me?
I can’t really see how could i use locbaml if i had to translate everything from scratch every time i add a new control in my application. | 0 | [
2,
13,
10799,
969,
8184,
468,
1158,
13610,
800,
3726,
3726,
25,
80,
21,
161,
20,
12287,
21,
1158,
4064,
76,
10962,
68,
14,
272,
18,
710,
3893,
37,
40,
3010,
60,
54,
186,
89,
5607,
30,
110,
107,
48,
1205,
26,
55,
60,
31,
92,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
I´m looking for publications about the history of the internet browser? Please help!
===
I´m looking for publications about the history of the internet browser. Papers, articles Blog posts whatever. Cannot find anything on ACM IEEE etc. and my blog search also didn´t reveal anything remarkable. Please help | 0 | [
2,
31,
307,
699,
26,
4411,
88,
14,
447,
16,
14,
2620,
16495,
60,
2247,
448,
187,
800,
3726,
3726,
31,
307,
699,
26,
4411,
88,
14,
447,
16,
14,
2620,
16495,
9,
3747,
15,
3376,
8146,
9868,
2099,
9,
1967,
477,
602,
27,
21,
9095,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Simple database application for Windows
===
I need to build a simple database application for Windows. Main requirements are independence from windows version and installed software. What technologies (language/framework) would you recommend?
| 0 | [
2,
1935,
6018,
3010,
26,
1936,
800,
3726,
3726,
31,
376,
20,
1895,
21,
1935,
6018,
3010,
26,
1936,
9,
407,
4786,
50,
2772,
37,
1936,
615,
17,
4066,
2306,
9,
98,
5740,
13,
5,
7020,
118,
8361,
3783,
6,
83,
42,
12360,
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... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
CruiseControl.NET post-build actions
===
We have CC.NET setup on our ASP.NET app. When we build the project, the ASP.NET app is pre-compiled and copied to a network share, from which a server runs the application.
The server is a bit different from development box'es, and the next server in our staging environment differs even more. The difference is specific config files and so on - so I want to exclude some files - or delete them before the pre-compiled app is copied to a network share.
My config file looks like this:
<project name="Assembly.Web.project">
<triggers>
<intervalTrigger seconds="3600" />
</triggers>
<sourcecontrol type="svn">
<trunkUrl>svn://svn-server/MyApp/Web/Trunk</trunkUrl>
<workingDirectory>C:\build-server\Assembly\Web\TEST-HL</workingDirectory>
<executable>C:\Program Files (x86)\SVN 1.5 bin\svn.exe</executable>
<username>uid</username>
<password>pwd</password>
</sourcecontrol>
<tasks>
<msbuild>
<executable>C:\Windows\Microsoft.NET\Framework64\v3.5\MSBuild.exe</executable>
<workingDirectory>C:\build-server\Assembly\Web\TEST-HL</workingDirectory>
<projectFile>C:\build-server\Assembly\Web\TEST-HL\Web\Web.sln</projectFile>
<buildArgs>/noconsolelogger /p:Configuration=Debug /v:diag</buildArgs>
<targets>Build</targets>
<timeout>900</timeout>
<logger>C:\Program Files\CruiseControl.NET\server\ThoughtWorks.CruiseControl.MsBuild.dll</logger>
</msbuild>
</tasks>
<publishers>
<buildpublisher>
<sourceDir>C:\build-server\Assembly\Web\PrecompiledWeb</sourceDir>
<publishDir>\\test-web01\Web</publishDir>
<useLabelSubDirectory>false</useLabelSubDirectory>
<alwaysPublish>false</alwaysPublish>
</buildpublisher>
</publishers>
</project>
As you can see, I use a buildPublisher to copy the pre-compiled files to the network share. What I want to do here, is either 1) delete certain files before they are copied or 2) replace those files after they have been copied.
I DO NOT want to have some app running watching specific files for change, and then after that replace the files with other ones. I want something to be either done by CC.NET, or triggered by CC.NET.
Can you launch a .bat file with CC.NET? | 0 | [
2,
6581,
12898,
9,
2328,
678,
8,
29361,
3078,
800,
3726,
3726,
95,
57,
8093,
9,
2328,
18161,
27,
318,
28,
306,
9,
2328,
4865,
9,
76,
95,
1895,
14,
669,
15,
14,
28,
306,
9,
2328,
4865,
25,
782,
8,
11103,
49,
1294,
17,
18225,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 use PowerShell to stop and start a clustered "Generic Service"?
===
How do I use PowerShell to stop and start a "Generic Service" as seen in the Microsoft "Cluster Administrator" software? | 0 | [
2,
184,
107,
31,
275,
414,
15984,
20,
747,
17,
799,
21,
7460,
69,
13,
7,
17083,
596,
365,
7,
60,
800,
3726,
3726,
184,
107,
31,
275,
414,
15984,
20,
747,
17,
799,
21,
13,
7,
17083,
596,
365,
7,
28,
541,
19,
14,
7099,
13,
7... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
Programmatically add an application to Windows Firewall
===
I have an application that is installed and updated via ClickOnce. The application downloads files via FTP, and therefore needs to be added as an exception to the windows firewall. Because of the way that ClickOnce works, the path to the EXE changes with every update, so the exception needs to change also. What would be the best way to have the changes made to the firewall so that it's *invisible* to the end user?
(The application is written in C#) | 0 | [
2,
625,
6732,
1326,
3547,
40,
3010,
20,
1936,
535,
6051,
800,
3726,
3726,
31,
57,
40,
3010,
30,
25,
4066,
17,
6372,
1197,
10840,
13120,
9,
14,
3010,
7121,
18,
6488,
1197,
1187,
306,
15,
17,
1793,
2274,
20,
44,
905,
28,
40,
5391,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 anyway to inherit the existing TLD defination for particular JSP Tag.
===
I am planning to extend the basic html input tag provided by Spring to incorporate more features into it. I did similar kind of exercise in past for Struts too. At that point of time I had to create a tld file with the attributes that I introduced plus all the attributes available in the parent tag.
This is bit tiresome and repetitive so the question is that Is there anyway to inherit the existing TLD defination for particular JSP Tag ?
Or any shortcut ?
Thanks in advance. | 0 | [
2,
25,
80,
2774,
20,
17569,
14,
3149,
13,
38,
6252,
121,
5617,
857,
26,
1498,
487,
3401,
3383,
9,
800,
3726,
3726,
31,
589,
2334,
20,
7206,
14,
2125,
13,
15895,
6367,
3383,
1173,
34,
1573,
20,
14710,
91,
967,
77,
32,
9,
31,
14... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
how to workaround a java image scaling bug
===
I've got a java servlet which is hitting this bug when down-scaling images...
http://bugs.sun.com/bugdatabase/view_bug.do?bug_id=5101502
I'm trying to work out the best way to work around it and would appreciate any ideas from the community.
Thanks, Steve | 0 | [
2,
184,
20,
170,
10037,
21,
8247,
1961,
26829,
6256,
800,
3726,
3726,
31,
22,
195,
330,
21,
8247,
13,
10321,
1336,
56,
25,
6687,
48,
6256,
76,
125,
8,
18,
3430,
68,
3502,
9,
9,
9,
7775,
6903,
16254,
18,
9,
7843,
9,
960,
118,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Javascript curry - what are the practical applications?
===
I don't think I've grokked currying yet. I understand what it does, and how to do it. I just can't think of a situation I would use it.
Where are you using currying in javascript (or where are the main libraries using it)? DOM manipulation or general application development examples welcome.
Oh and are there any drawbacks to using it?
Cheers. | 0 | [
2,
8247,
8741,
18239,
13,
8,
98,
50,
14,
5713,
3767,
60,
800,
3726,
3726,
31,
221,
22,
38,
277,
31,
22,
195,
3452,
8033,
69,
18239,
68,
768,
9,
31,
1369,
98,
32,
630,
15,
17,
184,
20,
107,
32,
9,
31,
114,
92,
22,
38,
277,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 OpenGL wrapper for Mono and .Net?
===
This is a follow up to [another question][1].
What is the best OpenGL wrapper usable both under Linux and Windows, with Mono (or .Net)?
I have already evaluated [Tao Framework][2], but I am unimpressed by how the APIs are put together. Any other *better* options?
[1]: http://stackoverflow.com/questions/110814/best-graphic-library-for-netmono
[2]: http://taoframework.com | 4 | [
2,
246,
368,
8430,
28051,
26,
4129,
17,
13,
9,
2328,
60,
800,
3726,
3726,
48,
25,
21,
1740,
71,
20,
636,
14945,
1301,
500,
2558,
165,
500,
9,
98,
25,
14,
246,
368,
8430,
28051,
182,
579,
156,
131,
13024,
17,
1936,
15,
29,
4129... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
using dotnetnuke (dnn) with with subversion.
===
Currently i am developing sites using DNN framework. Currently my development and staging environment is same. Client is vewing same site which I am using for development.
I have started using tortoise svn (subversion) for maintaining versions and backup. I am using file based svn repository for it.
The issue is svn creates .svn folder (hidden) in every folder. This folder and files inside it shows in portal system while file selection and at many different locations like FCKEditor File Browser, Icon selection for module / page, skins selection.
I would like to hide this folder for entire application and it should not show up anywhere. | 0 | [
2,
568,
14123,
2328,
4215,
1048,
13,
5,
43,
9377,
6,
29,
29,
972,
10898,
9,
800,
3726,
3726,
871,
31,
589,
3561,
3259,
568,
13,
43,
9377,
6596,
9,
871,
51,
522,
17,
16824,
2307,
25,
205,
9,
6819,
25,
13,
195,
3546,
205,
689,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
MySQL foreign keys - how to enforce one-to-one across tables?
===
If I have a table in MySQL which represents a base class, and I have a bunch of tables which represent the fields in the derived classes, each of which refers back to the base table with a foreign key, is there any way to get MySQL to enforce the one-to-one relationship between the derived table and the base table, or does this have to be done in code?
Using the following quick 'n' dirty schema as an example, is there any way to get MySQL to ensure that rows in both product_cd and product_dvd cannot share the same product_id? Is there a better way to design the schema to allow the database to enforce this relationship, or is it simply not possible?
CREATE TABLE IF NOT EXISTS `product` (
`product_id` int(10) unsigned NOT NULL auto_increment,
`product_name` varchar(50) NOT NULL,
`description` text NOT NULL,
PRIMARY KEY (`product_id`)
) ENGINE = InnoDB;
CREATE TABLE `product_cd` (
`product_cd_id` INT UNSIGNED NOT NULL AUTO_INCREMENT ,
`product_id` INT UNSIGNED NOT NULL ,
`artist_name` VARCHAR( 50 ) NOT NULL ,
PRIMARY KEY ( `product_cd_id` ) ,
INDEX ( `product_id` )
) ENGINE = InnoDB;
ALTER TABLE `product_cd` ADD FOREIGN KEY ( `product_id` )
REFERENCES `product` (`product_id`)
ON DELETE RESTRICT ON UPDATE RESTRICT ;
CREATE TABLE `product_dvd` (
`product_dvd_id` INT UNSIGNED NOT NULL AUTO_INCREMENT ,
`product_id` INT UNSIGNED NOT NULL ,
`director` VARCHAR( 50 ) NOT NULL ,
PRIMARY KEY ( `product_dvd_id` ) ,
INDEX ( `product_id` )
) ENGINE = InnoDB;
ALTER TABLE `product_dvd` ADD FOREIGN KEY ( `product_id` )
REFERENCES `product` (`product_id`)
ON DELETE RESTRICT ON UPDATE RESTRICT ; | 0 | [
2,
51,
18,
22402,
1228,
5534,
13,
8,
184,
20,
16525,
53,
8,
262,
8,
849,
464,
7484,
60,
800,
3726,
3726,
100,
31,
57,
21,
859,
19,
51,
18,
22402,
56,
4719,
21,
1000,
718,
15,
17,
31,
57,
21,
7653,
16,
7484,
56,
3501,
14,
2... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Class library with support for several persistence strategies
===
I am developing a C++ class library containing domain model classes, and I would like to add support for instantiating these classes from various persistence mechanisms, i.e. databases and file. The user of the class library should be given an interface(?) against which to program a class that can transfer the data from/to the persistence mechanism.
I know of the Data Access Object pattern which seems to work for Java, but I'm not exactly sure how to apply it to C++. Are there other solutions? | 0 | [
2,
718,
1248,
29,
555,
26,
238,
28584,
10272,
800,
3726,
3726,
31,
589,
3561,
21,
272,
20512,
718,
1248,
3503,
4603,
1061,
2684,
15,
17,
31,
83,
101,
20,
3547,
555,
26,
6322,
49,
1880,
158,
2684,
37,
617,
28584,
11626,
15,
31,
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... |
Mount TrueCrypt volume on login in Ubuntu
===
Is it possible to automount a TrueCrypt volume when logging in to Ubuntu 8.04? It's already storing the wireless network keys using the Seahorse password manager. Could TrueCrypt be made to fetch its volume password from the same keyring? Currently this would seem like the most convenient way to store my source code on the USB stick I carry around to boot from. | 0 | [
2,
2149,
1151,
11435,
2310,
27,
6738,
108,
19,
287,
12968,
2473,
800,
3726,
3726,
25,
32,
938,
20,
3108,
9780,
21,
1151,
11435,
2310,
76,
13,
13919,
19,
20,
287,
12968,
2473,
469,
9,
3277,
60,
32,
22,
18,
614,
25615,
14,
10149,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Date to timestamp (PHP)?
===
How do I get timestamp from,for example : 22-09-2008 | 0 | [
2,
1231,
20,
436,
38,
10158,
13,
5,
26120,
6,
60,
800,
3726,
3726,
184,
107,
31,
164,
436,
38,
10158,
37,
15,
1106,
823,
13,
45,
1024,
8,
2545,
8,
2753,
3,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
Performance penalty for working with interfaces in C++?
===
Is there a runtime performance penalty when using interfaces (abstract base classes) in C++? | 0 | [
2,
956,
5530,
26,
638,
29,
6573,
18,
19,
272,
20512,
60,
800,
3726,
3726,
25,
80,
21,
485,
891,
956,
5530,
76,
568,
6573,
18,
13,
5,
2297,
18,
19915,
1000,
2684,
6,
19,
272,
20512,
60,
3,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
insert data from database into word according to the table format in the word
===
now i need to insert some data from the sqlserver into a word,i know how to use bookmark and the office interop api do that but it's slow to call the word process do that and it's coupling between the bookmark define and the code , is it possible to do this without word process start?if not are there any template engine to do this? | 0 | [
2,
14692,
1054,
37,
6018,
77,
833,
496,
20,
14,
859,
2595,
19,
14,
833,
800,
3726,
3726,
130,
31,
376,
20,
14692,
109,
1054,
37,
14,
4444,
255,
10321,
106,
77,
21,
833,
15,
49,
143,
184,
20,
275,
360,
4527,
17,
14,
488,
1480,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Svn ignore versioned on update
===
I have this setup where in my development copy i can commit changes on a certain file to the repository. Then in my production copy, which does checkouts only, i would normally edit this file because this contains references which are environment independent. Is there any way i can ignore this file on the subsequent checkouts/updates without using svn:ignore? More like a --ignore-files /projectroot/config.php or --ignore-files -F ignoredfiles.txt flag. | 0 | [
2,
13,
18,
16578,
7174,
615,
69,
27,
11100,
800,
3726,
3726,
31,
57,
48,
18161,
113,
19,
51,
522,
4344,
31,
92,
9686,
1693,
27,
21,
1200,
3893,
20,
14,
24869,
9,
94,
19,
51,
637,
4344,
15,
56,
630,
2631,
12638,
104,
15,
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... |
How to check if an OLEDB driver is installed on the system?
===
How can I make sure that a certain OLEDB driver is installed when I start my application? I use ADO from Delphi and would like to display a descriptive error message if the driver is missing. The error that's returned from ADO isn't always that user-friendly.
There are probably a nice little function that returns all installed drivers but I haven't found it. | 0 | [
2,
184,
20,
2631,
100,
40,
12116,
9007,
2425,
25,
4066,
27,
14,
329,
60,
800,
3726,
3726,
184,
92,
31,
233,
562,
30,
21,
1200,
12116,
9007,
2425,
25,
4066,
76,
31,
799,
51,
3010,
60,
31,
275,
21,
537,
37,
23030,
17,
83,
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... |
Is there a meaningful correlation between spelling and programming ability?
===
Is there a meaningful correlation between spelling and grammatical ability, and programming ability?
| 0 | [
2,
25,
80,
21,
16912,
16881,
128,
11292,
17,
3143,
2165,
60,
800,
3726,
3726,
25,
80,
21,
16912,
16881,
128,
11292,
17,
24182,
2165,
15,
17,
3143,
2165,
60,
3,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
What does "Optimize Code" option really do in Visual Studio?
===
Name of the option tells something but what Visual Studio compiler really do and what are the real consequences? | 0 | [
2,
98,
630,
13,
7,
25458,
79,
2952,
1797,
7,
4255,
510,
107,
19,
3458,
1120,
60,
800,
3726,
3726,
204,
16,
14,
4255,
2609,
301,
47,
98,
3458,
1120,
21486,
510,
107,
17,
98,
50,
14,
683,
8360,
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... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
commad line building question
===
I'm building a project from command line , using WinCE platform builder , and I need RTTI to be enabled , so that my project works correctly . I tried setting the option RTTI="YES" in the sources and in the makefile of each dir , and I also tried to add it at the end of CDEFINES , but when I try to build the project , I get the D9025 warnings , which says that my "/GR was overriden by /GR-" ( enable RTTI was overriden by don't enable RTTI ) .
My question is , how can I find out where that option is set , so that I can modify it ?
| 0 | [
2,
11951,
1283,
293,
353,
1301,
800,
3726,
3726,
31,
22,
79,
353,
21,
669,
37,
1202,
293,
13,
15,
568,
26818,
2452,
14960,
13,
15,
17,
31,
376,
761,
5249,
20,
44,
9338,
13,
15,
86,
30,
51,
669,
693,
12044,
13,
9,
31,
794,
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... |
Extending ControlCollection in vb.net
===
I want to extend the basic controlcollection in vb.net so i can just add images and text to a self-made control, and then automaticly convert them to pictureboxes and lables.
So I made a class that inherits form ControlCollection, overriding the add method, and add the functionality.
But when i run the example, it gives a NullReferenceException.
Here is the code:
<pre>
Shadows Sub add(ByVal text As String)
Dim LB As New Label
LB.AutoSize = True
LB.Text = text
MyBase.Add(LB) 'Here it gives the exception.
End Sub
</pre>
I searched on google, and someone said that the CreateControlsInstance method needs to be overriden. So i did that, but then it gives InvalidOperationException with een innerException message of NullReferenceException.
Does anyone have an idea how to implement this? | 0 | [
2,
8176,
569,
15015,
872,
19,
13,
20468,
9,
2328,
800,
3726,
3726,
31,
259,
20,
7206,
14,
2125,
569,
15015,
872,
19,
13,
20468,
9,
2328,
86,
31,
92,
114,
3547,
3502,
17,
1854,
20,
21,
1119,
8,
5781,
569,
15,
17,
94,
6715,
102,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 determine the collation of a databsae in SQL 2005?
===
How do you determine the collation of a database in SQL 2005, for instance if you need to perform a case-insensitive search/replace? | 0 | [
2,
184,
107,
31,
3746,
14,
9470,
857,
16,
21,
1054,
4562,
4391,
19,
4444,
255,
812,
60,
800,
3726,
3726,
184,
107,
42,
3746,
14,
9470,
857,
16,
21,
6018,
19,
4444,
255,
812,
15,
26,
4851,
100,
42,
376,
20,
2985,
21,
610,
8,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
Looking for tools to analyze email data
===
I made a write-up about [how to analyze your gmail account data with ruby][1]. Then on SlashDot, someone told me about [mail-trends][2].
Does anyone have other tools to suggest ?
[1]: http://blog.logeek.fr/2008/9/18/analyzing-your-gmail-history
[2]: http://code.google.com/p/mail-trends/ | 4 | [
2,
699,
26,
4672,
20,
16051,
8517,
1054,
800,
3726,
3726,
31,
117,
21,
2757,
8,
576,
88,
636,
1544,
20,
16051,
154,
489,
8079,
2176,
1054,
29,
10811,
500,
2558,
165,
500,
9,
94,
27,
14098,
12527,
15,
737,
470,
55,
88,
636,
8079,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How do you recursively ftp a folder in linux
===
I'm trying to ftp a folder using the command line ftp client, but so far I've only been able to use 'get' to get individual files. | 0 | [
2,
184,
107,
42,
302,
24244,
102,
1187,
306,
21,
19294,
19,
13024,
800,
3726,
3726,
31,
22,
79,
749,
20,
1187,
306,
21,
19294,
568,
14,
1202,
293,
1187,
306,
6819,
15,
47,
86,
463,
31,
22,
195,
104,
74,
777,
20,
275,
13,
22,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
How do I get the image paint/paintComponent generates?
===
I have a quick question. How do I get the image generated by a JComponent.paint or paintComponent?
I have a JComponent which I use as a 'workspace' and where I have overwritten the paintComponent method to my own. The thing is that my workspace JComponent also has children which has their own paintComponent methods.
So when Swing renders my workspace component, it renders the workspace graphics and then its childrens'.
However, I want to get the image my workspace component generates (which includes the workspace graphics and the children's graphics).
How do I do that?
I tried to call the paintComponent/paint-method myself by using my own Graphics, but i just returned a black image. Here is what i tried;
public void paintComponent(Graphics g) {
if (bufferedImage != null) {
g.drawImage(bufferedImage, 0, 0, this);
}
else {
g.setColor(Color.WHITE);
g.fillRect(0, 0, bufferedImage.getWidth(), bufferedImage.getHeight());
}
}
public BufferedImage getImage() {
BufferedImage hello = new BufferedImage(getWidth(), getHeight(), BufferedImage.TYPE_INT_ARGB);
Graphics g = hello.getGraphics();
paintComponent( g );
return hello;
}
Any thoughts or comments are welcome! :)
| 0 | [
2,
184,
107,
31,
164,
14,
1961,
5107,
118,
20578,
11103,
218,
2291,
7920,
18,
60,
800,
3726,
3726,
31,
57,
21,
2231,
1301,
9,
184,
107,
31,
164,
14,
1961,
6756,
34,
21,
487,
11103,
218,
2291,
9,
20578,
54,
5107,
11103,
218,
2291... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Transparent form on the desktop
===
I want to create a c# application with multiple windows that are all transparent with some text on.
The tricky part is making these forms sit on top of the desktop but under the desktop icons. Is this possible? | 0 | [
2,
14862,
505,
27,
14,
17404,
800,
3726,
3726,
31,
259,
20,
1600,
21,
272,
5910,
3010,
29,
1886,
1936,
30,
50,
65,
14862,
29,
109,
1854,
27,
9,
14,
5514,
93,
141,
25,
544,
158,
1997,
2066,
27,
371,
16,
14,
17404,
47,
131,
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,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
How do I perform a case-sensitive search and replace in SQL 2000/2005?
===
In order to perform a case-sensitive search/replace on a table in a SQL 2000/2005 database, you must use the correct collation.
How do you determine whether the default collation for a database is case-sensitive, and if it isn't, how to perform a case-sensitive search/replace? | 0 | [
2,
184,
107,
31,
2985,
21,
610,
8,
19435,
2122,
17,
3934,
19,
4444,
255,
824,
118,
2835,
60,
800,
3726,
3726,
19,
389,
20,
2985,
21,
610,
8,
19435,
2122,
118,
99,
5119,
27,
21,
859,
19,
21,
4444,
255,
824,
118,
2835,
6018,
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... |
Which GUI toolkit would you use for a touchscreen interface?
===
The only experience I have so far with a touchscreen interface was one where everything was custom drawn, and I get the feeling it's not the most efficient way of doing it (even the most basic layout change is hell to make). I know plenty of GUI toolkits intended at keyboard & mouse interfaces, but can you advise something suited for touchscreens? Target platform is Windows, but cross-platform would be nice. | 0 | [
2,
56,
9457,
5607,
13703,
83,
42,
275,
26,
21,
1723,
7187,
6573,
60,
800,
3726,
3726,
14,
104,
1496,
31,
57,
86,
463,
29,
21,
1723,
7187,
6573,
23,
53,
113,
796,
23,
5816,
3160,
15,
17,
31,
164,
14,
1249,
32,
22,
18,
52,
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... |
java.lang.ClassCastException: javax.swing.KeyStroke
===
I'm getting a random unreproducible Error when initializing a JSplitPane in with JDK 1.5.0_08. Note that this does not occur every time, but about 80% of the time:
Exception in thread "AWT-EventQueue-0" java.lang.ClassCastException: javax.swing.KeyStroke
at java.util.TreeMap.compare(TreeMap.java:1093)
at java.util.TreeMap.put(TreeMap.java:465)
at java.util.TreeSet.add(TreeSet.java:210)
at javax.swing.plaf.basic.BasicSplitPaneUI.installDefaults(BasicSplitPaneUI.java:364)
at javax.swing.plaf.basic.BasicSplitPaneUI.installUI(BasicSplitPaneUI.java:300)
at javax.swing.JComponent.setUI(JComponent.java:652)
at javax.swing.JSplitPane.setUI(JSplitPane.java:350)
at javax.swing.JSplitPane.updateUI(JSplitPane.java:378)
at javax.swing.JSplitPane.<init>(JSplitPane.java:332)
at javax.swing.JSplitPane.<init>(JSplitPane.java:287)
...
Thoughts? I've tried cleaning and rebuilding my project so as to minimize the probability of corrupted class files. | 0 | [
2,
8247,
9,
9949,
9,
1898,
6146,
10066,
872,
45,
8247,
396,
9,
18,
3546,
9,
4237,
12962,
800,
3726,
3726,
31,
22,
79,
1017,
21,
5477,
367,
99,
2740,
8484,
3426,
7019,
76,
2104,
3335,
21,
487,
25603,
16660,
19,
29,
487,
43,
197,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 find out what collations are available in SQL 2000/2005
===
If I need to choose a collation mode to work with, how do I know what collations are available? | 0 | [
2,
184,
107,
31,
477,
70,
98,
9470,
7504,
50,
904,
19,
4444,
255,
824,
118,
2835,
800,
3726,
3726,
100,
31,
376,
20,
3538,
21,
9470,
857,
3740,
20,
170,
29,
15,
184,
107,
31,
143,
98,
9470,
7504,
50,
904,
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... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
Is there a DRM scheme that works?
===
We help our clients to manage and publish their media online - images, video, audio, whatever. They always ask my boss whether they can stop users from copying their media, and he asks me, and I always tell him the same thing: no. If the users can view the media, then a sufficiently determined user will always be able to make a copy. But am I right?
I've been asked again today, and I promised my boss I'd ask about it online. So - is there a DRM scheme that will work? One that will stop users making copies without stopping legitimate viewing of the media?
And if there isn't, how do I convince my boss? | 0 | [
2,
25,
80,
21,
744,
79,
4276,
30,
693,
60,
800,
3726,
3726,
95,
448,
318,
7421,
20,
4705,
17,
10824,
66,
941,
2087,
13,
8,
3502,
15,
763,
15,
4023,
15,
2099,
9,
59,
550,
1349,
51,
4054,
1472,
59,
92,
747,
3878,
37,
4344,
68,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Can I return the 'id' field after a LINQ insert?
===
When I enter an object into the DB with Linq-to-SQL can I get the id that I just inserted without making another db call? I am assuming this is pretty easy, I just don't know how.
Thank you. | 0 | [
2,
92,
31,
788,
14,
13,
22,
1340,
22,
575,
75,
21,
6294,
1251,
14692,
60,
800,
3726,
3726,
76,
31,
2830,
40,
3095,
77,
14,
13,
9007,
29,
6294,
1251,
8,
262,
8,
18,
22402,
92,
31,
164,
14,
4924,
30,
31,
114,
14215,
366,
544,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
IPC on Vista (service and application)
===
I am creating an appcation on Vista,which include a service and an application .
(i am a new comer)
In my service i am creating an event and waits for that event.In application i am opening the same event and calling setevent function(problem starts here). In service ,its not getting the setevent notification.i searched in the net and saw something about integrity level.its telling that service and applicaation got differnt integrity level.
So it will be very helpfull if you tell how to do the IPC between a service and an application in Vista
Thanks in advance
Navaneeth
| 0 | [
2,
31,
5779,
27,
13520,
13,
5,
11449,
17,
3010,
6,
800,
3726,
3726,
31,
589,
2936,
40,
4865,
16893,
27,
13520,
15,
2140,
468,
21,
365,
17,
40,
3010,
13,
9,
13,
5,
49,
589,
21,
78,
340,
139,
6,
19,
51,
365,
31,
589,
2936,
4... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Trouble Ticket in Microsoft CRM
===
I'm working on customizing a Microsoft Dynamics CRM (4.0) system for my university as a thesis.
My teacher would like to know if it is possible to implement a ticketing system in the CRM so that the users (not the clients) could generate a trouble ticket. For example if their computer doesn't work properly.
I had a look around the internet and found some software that would handle the ticketing but I couldn't understand if this can be integrated in the CRM
Can anyone help me?
Thanks | 0 | [
2,
2572,
6133,
19,
7099,
6186,
79,
800,
3726,
3726,
31,
22,
79,
638,
27,
5816,
3335,
21,
7099,
12289,
6186,
79,
13,
5,
300,
9,
387,
6,
329,
26,
51,
155,
28,
21,
10452,
9,
51,
2197,
83,
101,
20,
143,
100,
32,
25,
938,
20,
8... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How can I immediately play a sound when another sound ends using XNA/XACT?
===
This question borders between the world of the audio designer and the programmer. While this question might have to be partially answered by that domain of an audio designer, it is sure a problem for the programmer. In our project, we want to loop a sound (background music) while the game timer is greater than one minute left. When this time is hit, we wish to stop the music as authored, **and then immediately continue with ending segment**. I have been looking into XACT, and it seems to have support for different events. Unfortunately the documentation is lacking, and the application is somewhat alien to me as a programmer.
What I am looking to do is something along these lines (different approaches):
1. When the music stops, I want to tie
an event to play another sound
immediately
2. When a marker is
triggered in the music, I want to
play another sound immediately
3. I would also like to know in my application when some of these events happen
The problem is that I haven't been able to find any mechanism to auto-play sound when another sound begins and that I can't find a way to hook up with the events made in the XACT project to C#.
If this can't be done (i.e. XACT/XNA lacks support for these operations), please gather your ideas on how to solve this problem with minimal cross-sound time errors. Preferably I would be able to control as much as possible of this in C# with calls to XNA. | 0 | [
2,
184,
92,
31,
1375,
418,
21,
646,
76,
226,
646,
3451,
568,
993,
325,
118,
396,
5183,
60,
800,
3726,
3726,
48,
1301,
5878,
128,
14,
126,
16,
14,
4023,
4742,
17,
14,
17968,
9,
133,
48,
1301,
530,
57,
20,
44,
5933,
3094,
34,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Test if a Font is installed
===
Is there an easy way (in .Net) to test if a Font is installed on the current machine? | 0 | [
2,
1289,
100,
21,
9978,
25,
4066,
800,
3726,
3726,
25,
80,
40,
2010,
161,
13,
5,
108,
13,
9,
2328,
6,
20,
1289,
100,
21,
9978,
25,
4066,
27,
14,
866,
1940,
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... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
What is the fastest way (in theory at least) to sort a heap?
===
A heap is a list where the following applies:
l[i] <= l[2*i] && l[i] <= [2*i+1]
for `0 <= i < len(list)`
I'm looking for in-place sorting. | 0 | [
2,
98,
25,
14,
7518,
161,
13,
5,
108,
1639,
35,
639,
6,
20,
2058,
21,
15414,
60,
800,
3726,
3726,
21,
15414,
25,
21,
968,
113,
14,
249,
13169,
45,
644,
2558,
49,
500,
13,
1,
3726,
644,
2558,
135,
2483,
49,
500,
279,
1569,
64... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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++ Binary operators order of precedence
===
In what order are the following parameters tested (in C++)?
if (a || b && c)
{
}
I've just seen this code in our application and I hate it, I want to add some brackets to just clarify the ordering. But I don't want to add the brackets until I know I'm adding them in the right place. | 0 | [
2,
272,
20512,
14171,
9475,
389,
16,
24720,
800,
3726,
3726,
19,
98,
389,
50,
14,
249,
12905,
7631,
13,
5,
108,
272,
20512,
6,
60,
100,
13,
5,
58,
13,
1,
334,
279,
1569,
272,
6,
13,
1,
13,
1,
31,
22,
195,
114,
541,
48,
179... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Free supportticket software
===
I am searching for a better alternative to eTicket.
Can you give any advise? | 4 | [
2,
551,
555,
1786,
7572,
2306,
800,
3726,
3726,
31,
589,
5792,
26,
21,
574,
2676,
20,
13,
9329,
7572,
9,
92,
42,
590,
186,
14640,
60,
3,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
Create anonymous object by Reflection in C#
===
Is there any way to create C# 3.0 anonymous object via Reflection at runtime in .NET 3.5? I'd like to support them in my serialization scheme, so I need a way to manipulate them programmatically. | 0 | [
2,
1600,
10364,
3095,
34,
9138,
19,
272,
5910,
800,
3726,
3726,
25,
80,
186,
161,
20,
1600,
272,
5910,
203,
9,
387,
10364,
3095,
1197,
9138,
35,
485,
891,
19,
13,
9,
2328,
203,
9,
264,
60,
31,
22,
43,
101,
20,
555,
105,
19,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How do I get the current size of a matrix stack in OpenGL?
===
How do I get the current size of a matrix stack (GL_MODELVIEW, GL_PROJECTION, GL_TEXTURE) in OpenGL?
I want this so that I can do some error checking to ensure that in certain parts of the code I can check that the matrix stacks have been left in the original condition. | 0 | [
2,
184,
107,
31,
164,
14,
866,
1072,
16,
21,
8187,
7566,
19,
368,
8430,
60,
800,
3726,
3726,
184,
107,
31,
164,
14,
866,
1072,
16,
21,
8187,
7566,
13,
5,
8430,
1,
13998,
4725,
15,
13,
8430,
1,
21011,
872,
15,
13,
8430,
1,
11... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Modal popups - usability
===
What are the cases where you'd use a modal popup ?
Does it interrupt the user's flow, if it all of a sudden opens up in his face ?
Would you avoid modal popups in general ? or when should one be careful of using them ? | 0 | [
2,
13,
20756,
1675,
15699,
13,
8,
182,
4091,
800,
3726,
3726,
98,
50,
14,
1871,
113,
42,
22,
43,
275,
21,
13,
20756,
1675,
576,
13,
60,
630,
32,
15811,
14,
4155,
22,
18,
3312,
15,
100,
32,
65,
16,
21,
4224,
8965,
71,
19,
33,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Dynamic LINQ and Dynamic Lambda expressions?
===
What is the best way of dynamically writing LINQ queries and Lambda expressions?
I am thinking of applications where the end user can design business logic rules, which then must be executed.
I am sorry if this is a newbie question, but it would be great to get best practices out of experience. | 0 | [
2,
7782,
6294,
1251,
17,
7782,
13,
24187,
13832,
60,
800,
3726,
3726,
98,
25,
14,
246,
161,
16,
7782,
1326,
1174,
6294,
1251,
9386,
2829,
17,
13,
24187,
13832,
60,
31,
589,
1440,
16,
3767,
113,
14,
241,
4155,
92,
704,
508,
7085,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Error 1150 genasm.exe(1) : error There was an error finalizing type . Method 'DoParse'
===
oOo a highly exciting build issue. Compact framework occasionally goes funny when building. Usually when messing with xmta files but this is the first time i've seen it go awry in this scenario.
I created a base class with an abstract method. Placed this in one of my core dlls. This was fine. I then, in a "later" .dll inherited from it. Now I get this error:
> Error 1150 genasm.exe(1) : error There
> was an error finalizing type . Method
> 'DoParse' in type
> 'MyComanyName.PlatformName.ProductName.Configuration.ConfigurationParser'
> from assembly
> 'UICore.WindowsCE.asmmeta,
> Version=1.0.3187.17348,
> Culture=neutral, PublicKeyToken=null'
> does not have an
> implementation. UICore
And yes, I have implemented this method in this class. I have also tried a full clean and rebuild and a close and restart VS.
Out of interest, I also have a warning that is "Object not set to instance of object" which is slightly unusual. | 0 | [
2,
7019,
547,
2290,
4380,
472,
79,
9,
1706,
62,
5,
165,
6,
13,
45,
7019,
80,
23,
40,
7019,
426,
3335,
1001,
13,
9,
2109,
13,
22,
537,
3574,
870,
22,
800,
3726,
3726,
635,
4328,
21,
2157,
12028,
1895,
1513,
9,
8285,
6596,
4533,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
What are the possible causes of a CGI::Session::CookieStore::TamperedWithCookie exception in rails
===
I am receiving the expcetion `CGI::Session::CookieStore::TamperedWithCookie` after changing the `config.action_controller.session.secret` setting on an app (as part of preparation to full deployment.
Am I right in assuming that changing the secret while testers have cookies set is the cause of this, and what other cause could there be (both due to secuirty attacks, and coding issues) | 0 | [
2,
98,
50,
14,
938,
4047,
16,
21,
272,
2234,
45,
45,
7202,
5991,
45,
45,
716,
17391,
16828,
45,
45,
4919,
1432,
69,
1410,
716,
17391,
5391,
19,
2240,
18,
800,
3726,
3726,
31,
589,
3396,
14,
13,
6899,
1105,
3309,
13,
1,
150,
22... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Best JavaScript Calendar control
===
Is their any JavaScript Calendar control which can handle the difference Date Time Formats easily? | 4 | [
2,
246,
8247,
8741,
7036,
569,
800,
3726,
3726,
25,
66,
186,
8247,
8741,
7036,
569,
56,
92,
3053,
14,
2841,
1231,
85,
13767,
2351,
60,
3,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
Common Causes of Operating System Crashes
===
This question is for operating system programming folks. I had a theory for a while that operating system crashes were primarily from two factors:
1. direct memory access by applications and the OS simultaneously, where the OS may "collide" with the application's memory access;
2. low-level function access by applications trying to squeeze every ounce of performance from the machine, where again the OS doesn't see what the app is trying to do, and the OS tries to do something that "collides" with the app.
Are either of these even possible? If not, I am interested to learn: what are the most common technical causes (from the perspective of operating system programming) of an operating system crash (not limited to Windows crashes)? I'm looking for an answer not like "too many apps open", but what specifically happens when too many apps are open that causes the crash. | 0 | [
2,
757,
4047,
16,
2455,
329,
21563,
800,
3726,
3726,
48,
1301,
25,
26,
2455,
329,
3143,
14563,
9,
31,
41,
21,
1639,
26,
21,
133,
30,
2455,
329,
21563,
46,
2257,
37,
81,
4776,
45,
137,
9,
1744,
1912,
1381,
34,
3767,
17,
14,
13,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
What is a performant string hashing function that results in a 32 bit integer with low collision rates?
===
I have lots of unrelated named things that I'd like to do quick searches against. An "aardvark" is always an "aardvark" everywhere, so hashing the string and reusing the integer would work well to speed up comparisons. What is a fast string hashing algorithm that will generate small (32 or 16) bit values and have a low collision rate?
I'd like to see an optimized implementation specific to C/C++. | 0 | [
2,
98,
25,
21,
2985,
1830,
3724,
19170,
68,
1990,
30,
1736,
19,
21,
2512,
1142,
13820,
29,
708,
11319,
5332,
60,
800,
3726,
3726,
31,
57,
7503,
16,
17379,
377,
564,
30,
31,
22,
43,
101,
20,
107,
2231,
19994,
149,
9,
40,
13,
7,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Generate docs in automated build
===
Is there any way to generate project docs during automated builds?
I'd like to have a single set of source files (HTML?) with the user manual, and from them generate:
* PDF document
* CHM help
* HTML version of the help
The content would be basically the same in all three formats.
Currently I'm using msbuild and CCNET, but I could change that if needed. | 0 | [
2,
7920,
9765,
18,
19,
14904,
1895,
800,
3726,
3726,
25,
80,
186,
161,
20,
7920,
669,
9765,
18,
112,
14904,
1895,
18,
60,
31,
22,
43,
101,
20,
57,
21,
345,
309,
16,
1267,
6488,
13,
5,
15895,
60,
6,
29,
14,
4155,
5132,
15,
17... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
ASP.NET MVC Preview 5 - Html.Image helper has moved namespace
===
We've just updated ASP.NET from Preview 3 to Preview 5 and we've run into a problem with the `Html.Image` HtmlHelper in our aspx pages.
It seems that `Html.Image` has moved from `System.Web.Mvc` into `Microsoft.Web.Mvc`, and the only way we've found to access the helper now is to add an import statement to every .aspx page that uses it. All the other helpers can be accessed with `using System.Web.Mvc;` in the C# codebehind of a view master page, but this one seems to need an `<@Import Namespace="Microsoft.Web.Mvc">` in every .aspx page.
Does anyone know of a way around this? | 0 | [
2,
28,
306,
9,
2328,
307,
8990,
16121,
331,
13,
8,
13,
15895,
9,
22039,
448,
106,
63,
385,
204,
5582,
800,
3726,
3726,
95,
22,
195,
114,
6372,
28,
306,
9,
2328,
37,
16121,
203,
20,
16121,
331,
17,
95,
22,
195,
485,
77,
21,
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... |
Deploying Django: How do you do it?
===
I have tried following guides like [this one](http://docs.djangoproject.com/en/dev/howto/deployment/modpython/) but it just didnt work for me.
**So my question is this:** What is a good guide for deploying Django, and how do you deploy your Django.
I keep hearing that capastrano is pretty nifty to use, but i have no idea as to how to work it or what it does (apart from automation of deploying code) | 0 | [
2,
17617,
68,
3857,
14541,
45,
184,
107,
42,
107,
32,
60,
800,
3726,
3726,
31,
57,
794,
249,
14838,
101,
636,
1565,
53,
500,
5,
21127,
6903,
13799,
18,
9,
14365,
14541,
21011,
9,
960,
118,
219,
118,
14438,
118,
1544,
262,
118,
1... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Is there a good online introduction/overview to XPath 2.0?
===
Basically I want something I can refer people to that covers the main differences to XPath 1.0 ('for' and 'if' statements and the use of sequences), in a sort of 'bluffers guide' or cheatsheet format. | 0 | [
2,
25,
80,
21,
254,
2087,
3445,
118,
2549,
4725,
20,
993,
8353,
172,
9,
387,
60,
800,
3726,
3726,
11374,
31,
259,
301,
31,
92,
5017,
148,
20,
30,
2937,
14,
407,
4921,
20,
993,
8353,
137,
9,
387,
13,
5,
22,
1106,
22,
17,
13,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Encoding user input for emails
===
On a website if I have a form where the user can input some text and then a page which displays what the user has entered, I know to html encode the values the user has entered to prevent scripting attacks. If the form was sending html emails I presume I would do the same but is there any special cases for emails and will email clients run the any script injected into the email? | 0 | [
2,
19608,
4155,
6367,
26,
8517,
18,
800,
3726,
3726,
27,
21,
2271,
100,
31,
57,
21,
505,
113,
14,
4155,
92,
6367,
109,
1854,
17,
94,
21,
2478,
56,
9412,
98,
14,
4155,
63,
1297,
15,
31,
143,
20,
13,
15895,
20523,
14,
4070,
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... |
"const correctness" in c#
===
I'm a heavy C++ user who dabbles in C# in his spare time. I'm also one of those const-correctness nazis and so not being able to do this easily in C# grates a little.
The point of const-correctness is to be able to provide a view of an instance that can't be altered or deleted by the user. The compiler supports this by pointing out when you break constness from within a const function, or try to use a non-const function of a const object. So without copying the const approach, is there a methodology I can use in C# that has the same ends?
I'm aware of immutability, but that doesn't really carry over to container objects to name but one example. | 0 | [
2,
13,
7,
12124,
38,
4456,
720,
7,
19,
272,
5910,
800,
3726,
3726,
31,
22,
79,
21,
1278,
272,
20512,
4155,
72,
1331,
13784,
18,
19,
272,
5910,
19,
33,
8001,
85,
9,
31,
22,
79,
67,
53,
16,
273,
11608,
38,
8,
25345,
720,
14044... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How does a XAML definition get turned into an object instance?
===
XAML allows you to specify an attribute value using a string that contains curly braces. Here is an example that creates a *Binding* instance and assigns it to the *Text* property of the *TextBox* element.
<TextBox Text="{Binding ElementName=Foo, Path=Bar}"/>
I want to extend XAML so that the developer could enter this as valid...
<TextBox Text="{MyCustomObject Field1=Foo, Field2=Bar}"/>
This would create an instance of my class and set the Field1/Field2 properties as appropriate. Is this possible? If so how do you do it?
If this is possible I have a followup question. Can I take a string *"{Binding ElementName=Foo, Path=Bar}"* and ask the framework to process it and return the Binding instance it specified? This must be done somewhere already to make the above XAML work and so there must be a way to ask for the same thing to be processed.
| 0 | [
2,
184,
630,
21,
13,
6791,
8184,
5465,
164,
412,
77,
40,
3095,
4851,
60,
800,
3726,
3726,
13,
6791,
8184,
2965,
42,
20,
19077,
40,
35,
14755,
1923,
568,
21,
3724,
30,
1588,
21056,
15646,
18,
9,
235,
25,
40,
823,
30,
9695,
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... |
Does CASCADE Delete execute as transaction?
===
I want to perform cascade delete for some tables in my database, but I'm interested in what happens in case there's a failure when deleting something. Will everything rollback? | 0 | [
2,
630,
13542,
27448,
15644,
28,
12799,
60,
800,
3726,
3726,
31,
259,
20,
2985,
13542,
27448,
26,
109,
7484,
19,
51,
6018,
15,
47,
31,
22,
79,
3158,
19,
98,
5531,
19,
610,
80,
22,
18,
21,
2990,
76,
121,
1336,
68,
301,
9,
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,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
Wrap an executable to diagnose it's invocations
===
I have a Windows executable (whoami) which is crashing every so often. It's called from another process to get details about the current user and domain. I'd like to know what parameters are passed when it fails.
Does anyone know of an appropriate way to wrap the process and write it's command line arguments to log while still calling the process?
Say the command is used like this:
'whoami.exe /all'
I'd like a script to exist instead of the whoami.exe (with the same filename) which will write this invocation to log and then pass on the call to the actual process. | 0 | [
2,
8118,
40,
1396,
17194,
5924,
20,
28438,
32,
22,
18,
19,
2625,
16893,
18,
800,
3726,
3726,
31,
57,
21,
1936,
1396,
17194,
5924,
13,
5,
1924,
5448,
6,
56,
25,
14604,
352,
86,
478,
9,
32,
22,
18,
227,
37,
226,
953,
20,
164,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Updating reference to a member variable in use.
===
I got this síngleton cache object and it exposes an IEnumerable property which just returns a private IEnumerable variable.
I have a static method on my singleton object that updates this member variable (that exists on the single 'Instance' instance of this cache object).
Let's say some thread is currently iterating over this IEnumerable variable/property while my cache is updating. I made it so the cache is updating on a new local variable and finally setting the exposed private variable to point to this new local variable.
I know i'm just updating a reference, leaving the other (old) object in memory waiting to be picked up by the GC but my problem is - i'm not 100% sure what happens once i set the new reference? Would the other thread suddenly be iterating over the new object or the old one it got passed through the IEnumerable interface? If it had been a normal reference i'd say 'no'. The calling thread would be operating on the old object, but i'm not sure if this is the case for IEnumerable as well?
Here is the class stripped down:
internal sealed class SektionCache : CacheBase
{
public static readonly SektionCache Instance = new SektionCache();
private static readonly object lockObject = new object();
private static bool isUpdating;
private IEnumerable<Sektion> sektioner;
static SektionCache()
{
UpdateCache();
}
public IEnumerable<Sektion> Sektioner
{
get { return sektioner; }
}
public static void UpdateCache()
{
// SNIP - getting data, locking etc.
Instance.sektioner = newSektioner;
// SNIP
}
} | 0 | [
2,
71,
43,
1880,
2801,
20,
21,
322,
7612,
19,
275,
9,
800,
3726,
3726,
31,
330,
48,
345,
444,
16522,
3095,
17,
32,
13833,
18,
40,
13,
660,
6336,
106,
579,
1354,
56,
114,
4815,
21,
932,
13,
660,
6336,
106,
579,
7612,
9,
31,
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... |
Pointer vs. Reference
===
What would be better practice when giving a function the original variable to work with:
unsigned long x = 4;
void func1(unsigned long& val) {
val = 5;
}
func(x);
or:
void func2(unsigned long* val) {
*val = 5;
}
func2(&x);
IOW: Is there any reason to pick one over another? | 0 | [
2,
454,
106,
4611,
9,
2801,
800,
3726,
3726,
98,
83,
44,
574,
1345,
76,
1438,
21,
1990,
14,
501,
7612,
20,
170,
29,
45,
28839,
175,
993,
800,
268,
73,
11364,
2414,
150,
165,
5,
1020,
13472,
175,
1569,
3347,
6,
13,
1,
3347,
800... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Loading DLL from a /bin directory
===
I have created a web project which references a class library project. When deployed to the local machine the web/classes all work fine but deployed on a ‘shared’ IIS site, the class DLLs exist in the /bin directory, but the web page generates the following error:
**can’t find file** **“Documents and settings/….”**
when trying to access the class DLL.
Is there a special setup to make the web pages look in its /bin directory? | 0 | [
2,
12797,
13,
43,
211,
37,
21,
13,
118,
4772,
16755,
800,
3726,
3726,
31,
57,
679,
21,
2741,
669,
56,
7231,
21,
718,
1248,
669,
9,
76,
6698,
20,
14,
375,
1940,
14,
2741,
118,
1898,
160,
65,
170,
1123,
47,
6698,
27,
21,
13,
1... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How do I handle data which must be persisted in a database, but isn't a proper model, in Ruby on Rails?
===
Imagine a web application written in Ruby on Rails. Part of the state of that application is represented in a piece of data which doesn't fit the description of a model. This state descriptor needs to be persisted in the same database as the models.
Where it differs from a model is that there needs to be only one instance of its class and it doesn't have relationships with other classes.
Has anyone come across anything like this?
| 0 | [
2,
184,
107,
31,
3053,
1054,
56,
491,
44,
22125,
19,
21,
6018,
15,
47,
2532,
22,
38,
21,
4119,
1061,
15,
19,
10811,
27,
2240,
18,
60,
800,
3726,
3726,
4382,
21,
2741,
3010,
642,
19,
10811,
27,
2240,
18,
9,
141,
16,
14,
146,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Where to Store writable data to be shared by all users in a vista installer ?
===
My app is installed via NSIS.
I want the installer to install the program for all users.
I can do this, by installing to the 'program files' directory.
There is a database file (firebird), that all user accounts on the system should share.
If I store this database file in the 'program files' directory it will be read only.
If I store it in the users APPDATA directory they will each have a different copy, when one user adds data the others wont see it.
Option 1 - In my app directory under 'program files' create a 'Data' directory, in my installer make this dir read-writeable by all, that way the user 'program files' virtualisation won't kick in and all users can update the file and see each others changes.
Any other options ? | 0 | [
2,
113,
20,
1718,
20127,
579,
1054,
20,
44,
2592,
34,
65,
3878,
19,
21,
13520,
16146,
106,
13,
60,
800,
3726,
3726,
51,
4865,
25,
4066,
1197,
13,
103,
4557,
9,
31,
259,
14,
16146,
106,
20,
16146,
14,
625,
26,
65,
3878,
9,
31,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How do I read/write as the authenticated user with WebDAV?
===
I've set up DAV in apache2, which works great. The thing is, all read/write operations are done with the apache user's credentials. Instead I want to use the HTTP authenticated user's credentials. If I authenticate as "john", all read and write operations should use the system user john's credentials (from /etc/passwd). [suEXEC][1] seems like overkill since I am not executing anything, but I might be wrong...
Here's the current configuration:
<VirtualHost *:80>
DocumentRoot /var/www/webdav
ServerName webdav.mydomain.com
ServerAdmin webmaster@mydomain.com
<Location "/">
DAV On
AuthType Basic
AuthName "WebDAV Restricted"
AuthUserFile /etc/apache2/extra/webdav-passwords
require valid-user
Options +Indexes
</Location>
DAVLockDB /var/lib/dav/lockdb
ErrorLog /var/log/apache2/webdav-error.log
TransferLog /var/log/apache2/webdav-access.log
</VirtualHost>
[1]: http://httpd.apache.org/docs/2.2/suexec.html | 0 | [
2,
184,
107,
31,
1302,
118,
23716,
28,
14,
14351,
1669,
4155,
29,
2741,
43,
5214,
60,
800,
3726,
3726,
31,
22,
195,
309,
71,
14440,
19,
17140,
135,
15,
56,
693,
374,
9,
14,
584,
25,
15,
65,
1302,
118,
23716,
1311,
50,
677,
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... |
Reverse Engineering C# code using StarUML
===
I am trying to convert my C# code to design (Reverese Engineering) using StarUML. I got the error while performing the Reverse engineering "Error occurred in the process of reverse engineering. message : Catastrophic failure". After the error, the application crashed.
Can u please any one suggest me the solution for this? | 0 | [
2,
7006,
1552,
272,
5910,
1797,
568,
778,
723,
255,
800,
3726,
3726,
31,
589,
749,
20,
8406,
51,
272,
5910,
1797,
20,
704,
13,
5,
99,
2304,
4635,
1552,
6,
568,
778,
723,
255,
9,
31,
330,
14,
7019,
133,
2955,
14,
7006,
1552,
13... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
reinitialize system wide environment variable in linux
===
I just want my apache to register some of my predefined environment so that i can retrieve it using getenv function in php. How can i do this? I tried adding /etc/profile.d/foo.sh with export FOO=/bar/baz using root and restarted apache. | 0 | [
2,
302,
27313,
2952,
329,
1051,
2307,
7612,
19,
13024,
800,
3726,
3726,
31,
114,
259,
51,
17140,
20,
2243,
109,
16,
51,
782,
13439,
2307,
86,
30,
31,
92,
11917,
32,
568,
164,
219,
710,
1990,
19,
13,
26120,
9,
184,
92,
31,
107,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How to list some specific images in some folder on web server?
===
Let me explain:
this is path to this folder: > www.my_site.com/images
And images are created by user_id, and for example, images of user_id = 27 are,
27_1.jpg, 27_2.jpg, 27_3.jpg!
How to list and print images which start with 27_%.jpg?
I hope You have understand me!
PS. I totally beginer in ASP.NET (VB) and please give me detailed information
Here starts my loop
while dbread.Read()
'and then id user_id
dbread('user_id')
NEXT??? | 0 | [
2,
184,
20,
968,
109,
1903,
3502,
19,
109,
19294,
27,
2741,
8128,
60,
800,
3726,
3726,
408,
55,
3271,
45,
48,
25,
2013,
20,
48,
19294,
45,
13,
1,
13,
6483,
9,
915,
1,
9097,
9,
960,
118,
22039,
18,
17,
3502,
50,
679,
34,
4155... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Boost shared_ptr container question
===
Let's say I have a container (std::vector) of pointers used by a multi-threaded application. When adding new pointers to the container, the code is protected using a critical section (boost::mutex). All well and good. The code should be able to return one of these pointers to a thread for processing, but another separate thread could choose to delete one of these pointers, which might still be in use. e.g.:
thread1()
{
foo* p = get_pointer();
...
p->do_something();
}
thread2()
{
foo* p = get_pointer();
...
delete p;
}
So thread2 could delete the pointer whilst thread1 is using it. Nasty.
So instead I want to use a container of Boost shared ptrs. IIRC these pointers will be reference counted, so as long as I return shared ptrs instead of raw pointers, removing one from the container WON'T actually free it until the last use of it goes out of scope. i.e.
std::vector<boost::shared_ptr<foo> > my_vec;
thread1()
{
boost::shared_ptr<foo> sp = my_vec[0];
...
sp->do_something();
}
thread2()
{
boost::shared_ptr<foo> sp = my_vec[0];
...
my_vec.erase(my_vec.begin());
}
In the above example, if thread1 gets the pointer before thread2 calls erase, will the object pointed to still be valid? It won't actually be deleted when thread1 completes?
I think this is how shared_ptrs work but I need to be sure. | 0 | [
2,
10419,
2592,
1,
4417,
139,
12147,
1301,
800,
3726,
3726,
408,
22,
18,
395,
31,
57,
21,
12147,
13,
5,
384,
43,
45,
45,
28033,
6,
16,
454,
445,
147,
34,
21,
1889,
8,
96,
10647,
69,
3010,
9,
76,
4721,
78,
454,
445,
20,
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... |
Thoughts on Design - Core Control Logic and Rendering Layers
===
I just wanted to see if I could have your thoughts on the design of some work I am currently doing.
##Here's the current situation - Basically:
* I am developing a series of controls for our applications.
* Some of these may be used in both WinForms and ASP.NET Web applications.
* I am on a constant endeavor to improve my testing and testability of my code.
##So, here is what I have done:
* Created the core control logic in a class that has no concept of a UI. It simply raises events when things about it change. All data as stored as custom typed objects where it needs to be distinguished from others (e.g. I have a `PagingControl` where it has `SelectedPage` and `PageNumber` items).
* I then created an abstract class to act as the interface for a rendering "engine". This ensures that any custom types used (and possibly added) to the core logic are handled by the engine. Following the above example, it contains an abstract method `RenderSelectedPage`.
* I then created concrete implementations of the abstract rendering engine (e.g. `ConsoleRenderingEngine`, `HtmlRenderingEngine` etc.). This then handled the methods and rendered them to their respective UI's/Outputs as appropriate.
##I found the following pro's and con's to this approach:
###Pro's
* It works. Quite well, its easy to implement a new rendering mechanism, all you do is subclass the abstract engine and render the output (which passes required references to you).
* It's really seperates the UI from the core code, making it **much easier to test**.
* Obviously due to the encapsulation of core/rendering logic, it's quite obvious where problems lie when they appear.
###Con's
* It *can* look confusing/bloated. Even though there is not a massive amount of code in each class, there are 3x classes to get it to render to 1 output (1x core, 1x interface, 1x renderer). However, when creating the WinForms/WebForms controls it also means another two classes (since one needs to sublcass `Control` and the other `AbstractRenderingEngine`).
... OK so that's the only "con" I can really think of, and the main reason for this question ^_^
So,
#What are your thoughts on this "pattern"? How would you change/improve it?
_ _ _
**This question may get updated as more thoughts come to me, or clarity may be requested (I know it's a heavy read!).** | 4 | [
2,
3064,
27,
704,
13,
8,
2884,
569,
7085,
17,
15307,
9124,
800,
3726,
3726,
31,
114,
417,
20,
196,
100,
31,
110,
57,
154,
3064,
27,
14,
704,
16,
109,
170,
31,
589,
871,
845,
9,
6926,
5910,
6836,
22,
18,
14,
866,
1858,
13,
8,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Class method differences in Python
===
What is the difference between the following class methods?
Is it that one is static and the other is not?
Class Test(Object):
def method_one(self):
print "Called method_one"
def method_two():
print "Called method_two"
a_test = Test()
a_test.method_one()
a_test.method_two()
| 0 | [
2,
718,
2109,
4921,
19,
20059,
800,
3726,
3726,
98,
25,
14,
2841,
128,
14,
249,
718,
3195,
60,
25,
32,
30,
53,
25,
12038,
17,
14,
89,
25,
52,
60,
718,
1289,
5,
23793,
6,
45,
6312,
2109,
1,
849,
5,
8411,
6,
45,
4793,
13,
7,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Design Patterns using IQueryable<T>
===
With the introduction of .NET 3.5 and the `IQueryable<T>` interface, new patterns will emerge. While I have seen a number of implementations of the Specification pattern, I have not seen many other patterns using this technology. Rob Conery's Storefront application is another concrete example using `IQueryable<T>` which may lead to some new patterns.
**What patterns have emerged from the useful `IQueryable<T>` interface?** | 0 | [
2,
704,
6282,
568,
13,
5312,
622,
579,
1,
38,
1,
800,
3726,
3726,
29,
14,
3445,
16,
13,
9,
2328,
203,
9,
264,
17,
14,
13,
1,
5312,
622,
579,
1,
38,
1,
6573,
15,
78,
6282,
129,
9437,
9,
133,
31,
57,
541,
21,
234,
16,
6123... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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: array_map on object?
===
I'm trying to write a function that formats every (string) member/variable in an object, for example with a callback function. The variable names are unknown to me, so it must work with objects of all classes.
How can I achieve something similar to `array_map` or `array_walk` with objects? | 0 | [
2,
13,
26120,
45,
7718,
1,
15022,
27,
3095,
60,
800,
3726,
3726,
31,
22,
79,
749,
20,
2757,
21,
1990,
30,
13767,
352,
13,
5,
11130,
6,
322,
118,
8220,
579,
19,
40,
3095,
15,
26,
823,
29,
21,
645,
1958,
1990,
9,
14,
7612,
181... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Solaris Core dump analysis
===
I use pstack to analyze core dump files in Solaris
How else can I analyze the core dump from solaris?
What commands can be used to do this?
What other information will be available from the dump? | 0 | [
2,
4535,
403,
2884,
11424,
2495,
800,
3726,
3726,
31,
275,
351,
25325,
20,
16051,
2884,
11424,
6488,
19,
4535,
403,
184,
962,
92,
31,
16051,
14,
2884,
11424,
37,
4535,
403,
60,
98,
14294,
92,
44,
147,
20,
107,
48,
60,
98,
89,
67... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
Considering object encapsulation, should getters return an immutable property?
===
When a getter returns a property, such as returning a List of other related objects, should that list and it's objects be immutable to prevent code outside of the class, changing the state of those objects, without the main parent object knowing?
For example if a Contact object, has a getDetails getter, which returns a List of ContactDetails objects, then any code calling that getter:
1. can remove ContactDetail objects from that list without the Contact object knowing of it.
2. can change each ContactDetail object without the Contact object knowing of it.
So what should we do here? Should we just thrust the calling code and return easily mutable objects, or go the hard way and make a immutable class for each mutable class? | 0 | [
2,
5154,
3095,
1957,
4666,
18,
11123,
15,
378,
164,
6052,
788,
40,
797,
7903,
579,
1354,
60,
800,
3726,
3726,
76,
21,
164,
815,
4815,
21,
1354,
15,
145,
28,
2485,
21,
968,
16,
89,
1597,
3916,
15,
378,
30,
968,
17,
32,
22,
18,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Difference between managed c++ and c++
===
The topics title is actually my question. And the second question is: When do I use what of these two?
| 0 | [
2,
2841,
128,
1471,
272,
20512,
17,
272,
20512,
800,
3726,
3726,
14,
7569,
581,
25,
1121,
51,
1301,
9,
17,
14,
153,
1301,
25,
45,
76,
107,
31,
275,
98,
16,
158,
81,
60,
3,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
SQL: inner join on alias column
===
Previously I have asked to strip text from a field and convert it to an int, this works successfully. But now I would like to do an INNER JOIN on this new value.
So I have this:
SELECT CONVERT(int, SUBSTRING(accountingTab.id, PATINDEX('%[0-9]%', accountingTab.id), 999)) AS 'memId', userDetails.title, userDetails.lname
FROM accountingTab INNER JOIN
(SELECT id, title, first, last FROM memDetTab) AS userDetails ON memID = userDetails.id
And then I get the Invalid Column Name 'memID' error.
Anybody a suggestion on how I can fix this?
Thanks in advance!
P.s. this naming convention is just as an example to simplify the scenario, in case you were wondering ;-)
| 0 | [
2,
4444,
255,
45,
3754,
1865,
27,
15794,
4698,
800,
3726,
3726,
1343,
31,
57,
411,
20,
4998,
1854,
37,
21,
575,
17,
8406,
32,
20,
40,
19,
38,
15,
48,
693,
3673,
9,
47,
130,
31,
83,
101,
20,
107,
40,
3754,
1865,
27,
48,
78,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Can I uniquely identify a HttpRequest-Client in a DotNet HttpHandler?
===
I've created an <code>IHttpHandler</code> in .NET C# which returns pieces of html to a classic asp page.
The classic asp page communicates with the <code>IHttpHandler</code> through basic http requests using <code>ServerXMLHTTP</code> in vbscript or Ajax Calls in JavaScript.
Now, I need a way to share a variable which I have in vbscript but not in javascript with the .NET application.
The first bit, sharing a variable between classic asp and .net is not a problem as I can just add it onto the http request. Because the variable is not available in javascript however I can't do this in that case.
I had the idea that I could maybe cache the variable in the .NET application and use the cached version for javascript calls. But for this to work I would need a way to uniquely identify the "client" in .NET...
I tried to add <code>System.Web.SessionState.IRequiresSessionState</code> to my HttpHandler and use the SessionId but this didn't work because every single call to the HttpHandler seems to get a new ID.
Am I thinking the right way? What are my options here? | 0 | [
2,
92,
31,
23703,
5808,
21,
7775,
99,
10351,
8,
150,
18513,
38,
19,
21,
14123,
2328,
7775,
3203,
1252,
60,
800,
3726,
3726,
31,
22,
195,
679,
40,
13,
1,
9375,
1,
49,
21127,
3203,
1252,
1,
118,
9375,
1,
19,
13,
9,
2328,
272,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Http Exception generated while validating viewstate
===
I am getting the following error whenever I click on a postbacking control
HttpException (0x80004005): Validation
of viewstate MAC failed. If this
application is hosted by a Web Farm
or cluster, ensure that configuration
specifies the same validationKey and
validation algorithm. AutoGenerate
cannot be used in a cluster.
I am not using a Web Farm or cluster server. I have even tried setting the page property ***EnableViewStateMac*** to false but it changes the error message stating
The state information is invalid for
this page and might be corrupted.
What could possibly be wrong? | 0 | [
2,
7775,
5391,
6756,
133,
7394,
1880,
1418,
3859,
800,
3726,
3726,
31,
589,
1017,
14,
249,
7019,
6634,
31,
10840,
27,
21,
678,
1958,
68,
569,
7775,
10066,
872,
13,
5,
387,
396,
28064,
7114,
264,
6,
45,
27999,
16,
1418,
3859,
1572,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Are there any utilites that will help me refactor CSS
===
I am working with some CSS that is poorly written to say the least. I am not a design/CSS expert, but I at least understand the **C** in CSS. While the built in CSS support inside of VS-2008 is far improved over previous versions, it still doesn't quite do what I am looking for.
I was wondering if anyone knew of a good program or utility that will help me to refactor and clean up my CSS much the way that ReSharper helps you with C#.
Some features that would be nice:
- Examine CSS files and determine ways to extract common styles like font-style, color, etc...
- Possible plugin to VS-2008 would be awesome!
- Examine markup files and make some suggestions on improving the current use of classes and styles. | 0 | [
2,
50,
80,
186,
13,
14255,
6359,
30,
129,
448,
55,
302,
17455,
272,
18,
18,
800,
3726,
3726,
31,
589,
638,
29,
109,
272,
18,
18,
30,
25,
10614,
642,
20,
395,
14,
639,
9,
31,
589,
52,
21,
704,
118,
6824,
18,
5390,
15,
47,
3... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Where can a save confirmation page be hooked into the Django admin? (similar to delete confirmation)
===
I want to emulate the delete confirmation page behavior before saving
certain models in the admin. In my case if I change one object,
certain others should be deleted as they depend upon the object's now
out-of-date state.
I understand where to implement the actual cascaded updates (inside
the parent model's save method), but I don't see a quick way to ask
the user for confirmation (and then rollback if they decide not to
save). I suppose I could implement some weird confirmation logic
directly inside the save method (sort of a two phase save) but that
seems...ugly.
Any thoughts, even general pointers into the django codebase?
Thanks! | 0 | [
2,
113,
92,
21,
2079,
15939,
2478,
44,
14988,
77,
14,
3857,
14541,
21,
43,
2160,
60,
13,
5,
19107,
20,
27448,
15939,
6,
800,
3726,
3726,
31,
259,
20,
23804,
14,
27448,
15939,
2478,
3257,
115,
7599,
1200,
2761,
19,
14,
21,
43,
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... |
Optimize SQL query on large-ish table
===
First of all, this question regards MySQL 3.23.58, so be advised.
I have 2 tables with the following definition:
Table A: id INT (primary), customer_id INT, offlineid INT
Table B: id INT (primary), name VARCHAR(255)
Now, table A contains in the range of 65k+ records, while table B contains ~40 records. In addition to the 2 primary key indexes, there is also an index on the *offlineid* field in table A. There are more fields in each table, but they are not relevant (as I see it, ask if necessary) for this query.
I was first presented with the following query (*query time: ~22 seconds*):
SELECT b.name, COUNT(*) AS orders, COUNT(DISTINCT(a.kundeid)) AS leads
FROM katalogbestilling_katalog a, medie b
WHERE a.offlineid = b.id
GROUP BY b.name
Now, each id in medie is associated with a different name, meaning you could group by id as well as name. A bit of testing back and forth settled me on this (*query time: ~6 seconds*):
SELECT a.name, COUNT(*) AS orders, COUNT(DISTINCT(b.kundeid)) AS leads
FROM medie a
INNER JOIN katalogbestilling_katalog b ON a.id = b.offline
GROUP BY b.offline;
Is there any way to crank it down to "instant" time (max 1 second at worst)? I added the index on offlineid, but besides that and the re-arrangement of the query, I am at a loss for what to do. The EXPLAIN query shows me the query is using fileshort (the original query also used temp tables). All suggestions are welcome! | 0 | [
2,
22864,
4444,
255,
25597,
27,
370,
8,
1595,
859,
800,
3726,
3726,
64,
16,
65,
15,
48,
1301,
14179,
51,
18,
22402,
203,
9,
2001,
9,
4284,
15,
86,
44,
10017,
9,
31,
57,
172,
7484,
29,
14,
249,
5465,
45,
859,
21,
45,
4924,
19... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
What unit-test frameworks would you recommend for J2ME?
===
I'm relatively new to J2ME and about to begin my first serious project. My experience in testing isn't too deep either. I'm looking for a unit test framework for J2ME.
So far I've seen J2MEUnit, but I don't now how well supported it is. I've seen JavaTest Harness but I don't know if it's not an overkill.
Please tell me what framework you suggest with respect to:<br>
* Simplicity of implementing tests<br>
* Supporting community and tools<br>
* Compatibility with application certification processes<br>
* Integration with IDEs (Eclipse, NetBeans)<br>
* Other aspects you find important...
Thanks,
Asaf. | 0 | [
2,
98,
1237,
8,
10543,
6596,
18,
83,
42,
12360,
26,
487,
135,
790,
60,
800,
3726,
3726,
31,
22,
79,
3109,
78,
20,
487,
135,
790,
17,
88,
20,
2348,
51,
64,
2055,
669,
9,
51,
1496,
19,
4431,
2532,
22,
38,
266,
855,
694,
9,
3... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Can i use my WatiN tests to stresstest?
===
In my current project we are testing our ASP.NET GUI using <a href="http://watin.sourceforge.net/">WatiN</a> and <a href="http://www.mbunit.com/">Mbunit</a>.
When I was writing the tests I realized that it would be great if we also could use all of these for stresstesting. Currently we are using <a href="http://grinder.sourceforge.net/">Grinder</a> to stresstest but then we have to script our cases all over again which for many reasons isent that good.
I have been trying to find a tool that can use my existing tests to create load on the site and record stats, but so far i have found noting. Is there such a tool or is there an easy way to create one? | 0 | [
2,
92,
31,
275,
51,
15553,
108,
4894,
20,
5384,
10543,
60,
800,
3726,
3726,
19,
51,
866,
669,
95,
50,
4431,
318,
28,
306,
9,
2328,
9457,
568,
13,
1,
58,
746,
14057,
3726,
7,
21127,
6903,
12801,
108,
9,
12097,
1106,
834,
9,
232... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Monitor running .net apps
===
I have some .net apps running that I need to monitor for example, then MethodA is called in App1, my monitor app should detect this. I have a lot of running apps and the solution proposed here is to recompile all those apps and include a new line in the desired methods that we want to monitor. I want to do this only if there is absolutely no way. So did anybody ever done something like this? Basically, I need to create a new app that when I click a butoon on it, it will tell me: MethodA was called in App1, in real time...
thanks! | 0 | [
2,
7626,
946,
13,
9,
2328,
4865,
18,
800,
3726,
3726,
31,
57,
109,
13,
9,
2328,
4865,
18,
946,
30,
31,
376,
20,
7626,
26,
823,
15,
94,
2109,
58,
25,
227,
19,
4865,
165,
15,
51,
7626,
4865,
378,
9092,
48,
9,
31,
57,
21,
865... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 quickly add tickets in Trac?
===
It's very painful to add multiple tickets to Trac or to have it as your own todo list. That causes people to use their own task management tools so tasks are then spread all around.
Is there any plugin or macro that would quicken the process of adding a ticket?
| 0 | [
2,
184,
20,
976,
3547,
10309,
19,
13,
38,
5797,
60,
800,
3726,
3726,
32,
22,
18,
253,
9383,
20,
3547,
1886,
10309,
20,
13,
38,
5797,
54,
20,
57,
32,
28,
154,
258,
20,
537,
968,
9,
30,
4047,
148,
20,
275,
66,
258,
3005,
1097,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Creating Custom GnuCash Reports with Scheme
===
Are there any resources which show how to create custom GnuCash reports? I don't know the intricacies of Scheme but I do know the basics of Lisp, based on tinkering with Emacs. Is there a site which lays out the API for GnuCash reports, ideally with a little explanation of Scheme as well? | 0 | [
2,
2936,
5816,
26092,
150,
6031,
2813,
29,
4276,
800,
3726,
3726,
50,
80,
186,
2566,
56,
298,
184,
20,
1600,
5816,
26092,
150,
6031,
2813,
60,
31,
221,
22,
38,
143,
14,
19,
38,
13715,
10807,
16,
4276,
47,
31,
107,
143,
14,
2125,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Best way to deal with session timeout in web apps?
===
I am currently building an internal web application used in a factory/warehouse type location. The users will be sharing a single PC between several people, so we need to have a fairly short session timeout to stop people wandering off and leaving the application logged in where someone else can come to the PC and do something under the previous user's username.
The problem with this is a session can timeout while a user is in entering information into a form if they are taking a long time.
How would you deal with this in a user friendly manner? | 0 | [
2,
246,
161,
20,
1183,
29,
3723,
85,
1320,
19,
2741,
4865,
18,
60,
800,
3726,
3726,
31,
589,
871,
353,
40,
3117,
2741,
3010,
147,
19,
21,
3129,
118,
5011,
1682,
1001,
1474,
9,
14,
3878,
129,
44,
6126,
21,
345,
5168,
128,
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... |
Converting MS Access "OLE Objects" back to plain JPEGs - best way?
===
Background: We have an old (but business-critical) SQL Server database with an MS Access ADP front-end; this was originally upsized to SQL Server from a series of Access databases.
This database tracks hazardous materials for our customers, and stores a large number of images. These images are inserted from MS Access, and get put into the database as OLE Objects.
The problems are:
- These are a pain to read out in anything except Access/Office
- There's a MASSIVE storage overhead - ~10GB of images takes up 600+ GB of storage space(!)
My question is this: what way would you recommend to convert these bloated objects back into simple JPEGs? Once we do this we can finally migrate our front-end from Access and onto a simple web-based system, and our backup times will become manageable again!
| 0 | [
2,
19583,
4235,
1381,
13,
7,
6069,
3916,
7,
97,
20,
3748,
487,
20427,
18,
13,
8,
246,
161,
60,
800,
3726,
3726,
2395,
45,
95,
57,
40,
315,
13,
5,
811,
508,
8,
21522,
6,
4444,
255,
8128,
6018,
29,
40,
4235,
1381,
21,
7431,
43... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Abusing XmlReader ReadSubtree()
===
I need to parse a xml file which is practically an image of a really big tree structure, so I'm using the XmlReader class to populate the tree 'on the fly'. Each node is passed just the xml chunk it expects from its parent via the ReadSubtree() function. This has the advantage of not having to worry about when a node has consumed all its children. But now I'm wondering if this is actually a good idea, since there could be thousands of nodes and while reading the .NET source files I've found that a couple (and probably more) new objects are created with every ReadSubtree call, and no caching for reusable objects is made (that I'd seen).
Maybe ReadSubtree() was not thought to be massively used, or maybe I'm just worrying for nothing and I just need to call GC.Collect() after parsing the file...
Hope someone can shed some light on this.
Thanks in advance.
| 0 | [
2,
21,
3822,
68,
23504,
10647,
106,
1302,
7563,
8101,
5,
6,
800,
3726,
3726,
31,
376,
20,
2017,
870,
21,
23504,
3893,
56,
25,
7839,
40,
1961,
16,
21,
510,
580,
1541,
1411,
15,
86,
31,
22,
79,
568,
14,
23504,
10647,
106,
718,
2... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Visual Studio setup problem
===
I've had a *serious* issue with my Visual Studio 2008 setup. I receive the ever-so-useful error 'A problem has been encountered while loading the setup components. Canceling setup.' whenever I try to uninstall, reinstall or repair Visual Studio 2008 (team system version). If I can't resolve this issue I have no choice but to completely wipe my computer and start again which will take all day long! I've recently received very strange errors when trying to build projects regarding components running out of memory (despite having ~2gb physical memory free at the time) which has rendered my current VS install useless.
Note I installed VS2005 shell version using the vs_setup.msi file in the SQL Server folder *after* I had installed VS2008, in order to gain access to the SQL Server 2005 Reporting Services designer in Business Intelligence Development Studio (this is inexplicably unavailable in VS2008).
Does anyone have any solutions to this problem?
**P.S.**: I know this isn't directly related to programming, however I feel this *is* appropriate to SO as it is directly related to my *ability* to program at all! | 0 | [
2,
3458,
1120,
18161,
1448,
800,
3726,
3726,
31,
22,
195,
41,
21,
1637,
29119,
2483,
1513,
29,
51,
3458,
1120,
570,
18161,
9,
31,
2588,
14,
462,
8,
656,
8,
3699,
1566,
7019,
13,
22,
58,
1448,
63,
74,
8208,
133,
12797,
14,
18161,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
HTML Tag ClientID in a .NET Project
===
If I want to manipulate an HTML tag's properties on the server within an aspx page based on a master page i.e.
<a href="#" runat="server" ID="myLink">My Link</a>
For example to give the link a different class depending on the current page i.e.
if (Path.GetFileName(Request.PhysicalPath) == "MyPage")
{
myLink.Attributes.Add("class","active");
}
.NET changes the ID property of the link to something like
<a href="#" ID="ct100-foo-myLink">My Link</a>
Is there any way of stopping this from happening and keeping the original ID?
Thanks in advance | 0 | [
2,
13,
15895,
3383,
6819,
1340,
19,
21,
13,
9,
2328,
669,
800,
3726,
3726,
100,
31,
259,
20,
18468,
40,
13,
15895,
3383,
22,
18,
3704,
27,
14,
8128,
363,
40,
28,
306,
396,
2478,
432,
27,
21,
1129,
2478,
31,
9,
62,
9,
13,
1,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Code review in academia
===
I'm a PhD student in mechanical engineering without an extensive background in computer science. We write code as part of our research, but it's usually high-level (e.g., Matlab) and often rather ad-hoc.
It sounds like code reviews amongst the academics here would be valuable for (a) learning techniques from other people, and (b) spotting inadequacies in your code. (Sometimes I think it's scary that there are papers being published where the theory is instantiated in code that no-one but the author ever looks at!) Should academics have mandatory code reviews with their peers? (Has anyone seen such a thing before?)
More importantly, how long does it take to do an effective code review in this context? It seems hard to justify the extra time when that particular resource is always very scarce. | 0 | [
2,
1797,
1487,
19,
19450,
800,
3726,
3726,
31,
22,
79,
21,
7739,
1209,
19,
4953,
1552,
366,
40,
3386,
2395,
19,
1428,
762,
9,
95,
2757,
1797,
28,
141,
16,
318,
527,
15,
47,
32,
22,
18,
951,
183,
8,
3906,
13,
5,
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,
1,
1,
1,
1,
1,
1,
1... |
Running Trac on Windows?
===
Looking for a guide/tutorial that easily explains how to setup and run trac with subversion on windows. | 0 | [
2,
946,
13,
38,
5797,
27,
1936,
60,
800,
3726,
3726,
699,
26,
21,
3378,
118,
2473,
9819,
192,
30,
2351,
7346,
184,
20,
18161,
17,
485,
13,
38,
5797,
29,
972,
10898,
27,
1936,
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... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
Cannot connect to the configuration database.
===
After rebooting the Windows 2003 Server with the IIS I receive the follow error message **Cannot connect to the configuration database.** in the browser. The error occur on different pages and with different clients. that I think it is a server problem.
What can I do to solve this error? | 0 | [
2,
1967,
6379,
20,
14,
8091,
6018,
9,
800,
3726,
3726,
75,
25312,
68,
14,
1936,
973,
8128,
29,
14,
595,
18,
31,
2588,
14,
1740,
7019,
2802,
13,
1409,
1245,
1270,
6379,
20,
14,
8091,
6018,
9,
1409,
19,
14,
16495,
9,
14,
7019,
3... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Using JET with EMF
===
I need to run JET templates on a EMF model metadata - i.e. the model itself (not data) is input to my JET template.
More practically - I want generate non java code, based on EMF templates.
How I do it?
Thank you | 0 | [
2,
568,
4797,
29,
3579,
410,
800,
3726,
3726,
31,
376,
20,
485,
4797,
22894,
18,
27,
21,
3579,
410,
1061,
28057,
13,
8,
31,
9,
62,
9,
14,
1061,
1145,
13,
5,
1270,
1054,
6,
25,
6367,
20,
51,
4797,
22894,
9,
91,
7839,
13,
8,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Executing JavaScript on page load selectively
===
Mending a bug in our SAP BW web application, I need to call two javascript functions from the web framework library upon page load. The problem is that each of these functions reloads the page as a side-effect. In addition, I don't have access to modify these functions.
Any great ideas on how to execute a piece of code on "real" page load, then another piece of code on the subsequent load caused by this function, and then execute no code the third reload?
My best idea so far it to set a cookie on each go to determine what to run. I don't greatly love this solution. Anything better would be very welcome. And by the way, I do realize loading a page three times is absolutely ridiculous, but that's how we roll with SAP. | 0 | [
2,
25836,
8247,
8741,
27,
2478,
6305,
14092,
102,
800,
3726,
3726,
304,
3258,
21,
6256,
19,
318,
7508,
334,
499,
2741,
3010,
15,
31,
376,
20,
645,
81,
8247,
8741,
3719,
37,
14,
2741,
6596,
1248,
685,
2478,
6305,
9,
14,
1448,
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... |
When does ++ not produce the same results as +1?
===
The following two C# code snippets produce different results (assuming the variable level is used both before and after the recursive call). Why?
public DoStuff(int level)
{
// ...
DoStuff(level++);
// ...
}
,
public DoStuff(int level)
{
// ...
DoStuff(level+1);
// ...
}
| 0 | [
2,
76,
630,
13,
20512,
52,
2213,
14,
205,
1736,
28,
13,
16628,
60,
800,
3726,
3726,
14,
249,
81,
272,
5910,
1797,
13,
29061,
18,
2213,
421,
1736,
13,
5,
9755,
723,
68,
14,
7612,
662,
25,
147,
156,
115,
17,
75,
14,
302,
24244,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Fast word count function in Vim
===
I am trying to display a live word count in the vim statusline. I do this by setting my status line in my .vimrc and inserting a function into it. The idea of this function is to return the number of words in the current buffer. This number is then displayed on the status line. This should work nicely as the statusline is updated at just about every possible opportunity so the count will always remain 'live'.
The problem is that the function I have currently defined is slow and so vim is obviously sluggish when it is used for all but the smallest files; due to this function being executed so frequently.
In summary, does anyone have a clever trick for producing a function that is blazingly fast at calculating the number of words in the current buffer and returning the result? | 0 | [
2,
1512,
833,
2468,
1990,
19,
1790,
79,
800,
3726,
3726,
31,
589,
749,
20,
3042,
21,
515,
833,
2468,
19,
14,
1790,
79,
1782,
1143,
9,
31,
107,
48,
34,
2697,
51,
1782,
293,
19,
51,
13,
9,
1755,
79,
5453,
17,
14692,
68,
21,
19... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.