unified_texts stringlengths 32 30.1k | OpenStatus_id int64 0 4 | input_ids list | token_type_ids list | attention_mask list |
|---|---|---|---|---|
Convert BSTR to int
===
Does any one know how can I convert a BSTR to an int in VC++ 2008
Thanks in advance. | 0 | [
2,
8406,
334,
9729,
20,
19,
38,
800,
3726,
3726,
630,
186,
53,
143,
184,
92,
31,
8406,
21,
334,
9729,
20,
40,
19,
38,
19,
13,
8990,
20512,
570,
3669,
19,
3612,
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... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
Creating a random ordered list from an ordered list.
===
I have an application that takes the quality results for a manufacturing process and
creates graphs both to show Pareto charts of the bad, and also to show production throughput.
To automate the task of testing these statistical procedures I would like to deterministically be able to add records into the database and have the quality tech go to certain graphs and compare to a known good graph. But, I also would like to simulate the results so they would go into the database as if a user was running through the testing process.
One idea I have had is to fill a list with i number good, j number bad1, k number bad 2, etc. And then somehow randomly sort the list before insertion into the database.
So, my question, is there a standard algorithm to take a sorted list of values and create a randomly sorted list?
| 0 | [
2,
2936,
21,
5477,
1905,
968,
37,
40,
1905,
968,
9,
800,
3726,
3726,
31,
57,
40,
3010,
30,
1384,
14,
2190,
1736,
26,
21,
4587,
953,
17,
9695,
7210,
18,
156,
20,
298,
21367,
262,
5158,
16,
14,
896,
15,
17,
67,
20,
298,
637,
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... |
Developers productivity measurement
===
Could someone point to some online resources about how to track developers productivity (tools, article and so on) or point to some article where it's debated that productivity of developers can be really measured?
I've found some document and presentations from an old Gartner group CD but they are pretty old (2005), maybe in the years passes something has improved.
| 2 | [
2,
10168,
18211,
11688,
800,
3726,
3726,
110,
737,
454,
20,
109,
2087,
2566,
88,
184,
20,
792,
10168,
18211,
13,
5,
20799,
18,
15,
2002,
17,
86,
27,
6,
54,
454,
20,
109,
2002,
113,
32,
22,
18,
17881,
30,
18211,
16,
10168,
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... |
Whats the BEST way to setup a library to support links into precompiled Software for multiple platforms, compilation options.
===
I'm maintaining a library that contains compiled objects that need to be linked into
a 3rd party executable. sometimes the executable has been compiled for Solaris, sometimes as a 32bit Linux Application, sometimes its a 64bit linux application.
What I'd love to do is pass one "path" to the library, and have the application then automatically pick up the right flavor of the library.
It'd be OK if it only worked on linux, so that I could just define the path in terms of the OS.
this particular case is for a library of PLI/VPI functions I want to link into a verilog simulator.
What I have now is
root/path/${MYPLILIB_VER}/rootname/${MYPLIFLAVOR}/plilib.so
where flavor is one of
solaris linux linux64
The flavor depends on the os, and if Linux, if running on a 64bit platform, it also depends on which version 32/64bit of the program I am running.
I'm looking for a better way..
| 0 | [
2,
98,
18,
14,
246,
161,
20,
18161,
21,
1248,
20,
555,
6271,
77,
782,
11103,
49,
1294,
2306,
26,
1886,
6843,
15,
4868,
6368,
9,
800,
3726,
3726,
31,
22,
79,
8215,
21,
1248,
30,
1588,
9316,
3916,
30,
376,
20,
44,
4727,
77,
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... |
My SQL Server 2000 Transaction Log Size Seems Small
===
I'm wondering why my transaction log would only be 2 MB on my 40 GB database when I have recovery mode set to full and unlimited file growth set on the transaction log. Any ideas? | 0 | [
2,
51,
4444,
255,
8128,
824,
12799,
6738,
1072,
2206,
284,
800,
3726,
3726,
31,
22,
79,
5712,
483,
51,
12799,
6738,
83,
104,
44,
172,
14023,
27,
51,
1417,
14857,
6018,
76,
31,
57,
6550,
3740,
309,
20,
503,
17,
17222,
3893,
2232,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 redirect a file download using Grails?
===
I'm currently writing a website that allows people to download Excel and text files. Is there a way to redirect to a different page when they click, so that we run javascript and do analytics (i.e. keep download count)? Currently, nothing prevents the user from simply right-clicking and saving. | 0 | [
2,
184,
107,
31,
302,
14706,
21,
3893,
7121,
568,
489,
7301,
18,
60,
800,
3726,
3726,
31,
22,
79,
871,
1174,
21,
2271,
30,
2965,
148,
20,
7121,
20700,
17,
1854,
6488,
9,
25,
80,
21,
161,
20,
302,
14706,
20,
21,
421,
2478,
76,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
JPA and inheritance
===
I have a some JPA entities that inherit from one another and uses discriminator to determine what class to be created (untested as of yet).
@Entity(name="switches")
@DiscriminatorColumn(name="type")
@DiscriminatorValue(value="500")
public class DmsSwitch extends Switch implements Serializable {}
@MappedSuperclass
public abstract class Switch implements ISwitch {}
@Entity(name="switch_accounts")
public class SwitchAccounts implements Serializable {
@ManyToOne()
@JoinColumn(name="switch_id")
DmsSwitch _switch;
}
So in the SwitchAccounts class I would like to use the base class Switch because I don't know which object will be created until runtime. How can I achieve this? | 0 | [
2,
487,
1060,
17,
13852,
800,
3726,
3726,
31,
57,
21,
109,
487,
1060,
12549,
30,
17569,
37,
53,
226,
17,
2027,
3626,
928,
28607,
20,
3746,
98,
718,
20,
44,
679,
13,
5,
1020,
22372,
28,
16,
768,
6,
9,
13,
1,
2291,
856,
5,
725... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 more efficient way of making pagination in Hibernate than executing select and count queries?
===
Usually pagination queries look like this. Is there a better way instead of making two almost equal methods, one of which executing "select *..." and the other one "count *..."?
public List<Cat> findCats(String name, int offset, int limit) {
Query q = session.createQuery("from Cat where name=:name");
q.setString("name", name);
if (offset > 0) {
q.setFirstResult(offset);
}
if (limit > 0) {
q.setMaxResults(limit);
}
return q.list();
}
public Long countCats(String name) {
Query q = session.createQuery("select count(*) from Cat where name=:name");
q.setString("name", name);
return (Long) q.uniqueResult();
} | 0 | [
2,
25,
80,
21,
91,
8243,
161,
16,
544,
19006,
108,
857,
19,
4148,
2102,
8820,
119,
25836,
5407,
17,
2468,
9386,
2829,
60,
800,
3726,
3726,
951,
19006,
108,
857,
9386,
2829,
361,
101,
48,
9,
25,
80,
21,
574,
161,
700,
16,
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... |
SQL Server Service Broker Issue & Tutorials
===
I've been looking into implementing an external activator in SQL Server Express 2005, and I added the queues, services, contracts, and event notifications to the database. I also added a trigger to send a message to the target queue. Everything parses, runs, and the trigger is firing. However, when I select from the target queue, or use a quick T-SQL script to receive from the queue, nothing is there.
I'm wondering:
1. How is that even possible? Are the messages being auto-received?
2. Is there any way to check while sending a message if it arrived correctly?
3. Is there a better way to run a process on the server asynchronously after a trigger is fired?
As an aside, good tutorial material for the Service Broker is hard to find. If anyone has any resources, please let me know. Right now, I'm reading a book from our companies' online resource but even that is a pain to filter through.
Thanks,
_William_ | 0 | [
2,
4444,
255,
8128,
365,
14930,
1513,
279,
29724,
18,
800,
3726,
3726,
31,
22,
195,
74,
699,
77,
17333,
40,
4886,
13,
19516,
3457,
19,
4444,
255,
8128,
2999,
812,
15,
17,
31,
905,
14,
22521,
18,
15,
687,
15,
8712,
15,
17,
807,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Django: How do I create a generic url routing to views?
===
I have a pretty standard django app, and am wondering how to set the url routing so that I don't have to explicitly map each url to a view.
For example, let's say that I have the following views: `Project, Links, Profile, Contact`. I'd rather not have my `urlpatterns` look like this:
(r'^Project/$', 'mysite.app.views.project'),
(r'^Links/$', 'mysite.app.views.project'),
(r'^Profile/$', 'mysite.app.views.project'),
(r'^Contact/$', 'mysite.app.views.project'),
And so on. In [Pylons][1], it would be as simple as:
map.connect(':controller/:action/:id')
And it would automatically grab the right controller and function. Is there something similar in Django?
[1]: http://www.pylonshq.com | 0 | [
2,
3857,
14541,
45,
184,
107,
31,
1600,
21,
12733,
287,
6362,
19880,
20,
4146,
60,
800,
3726,
3726,
31,
57,
21,
1772,
1236,
3857,
14541,
4865,
15,
17,
589,
5712,
184,
20,
309,
14,
287,
6362,
19880,
86,
30,
31,
221,
22,
38,
57,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Best Flash Audio/Video + Interactivity server?
===
I'm looking for suggestions on Flash realtime servers. Currently, we use a combination of Moock's [Unity][1] and [Red5][2], but there are a couple problems. First, we are moving to AS3, and Unity only supports AS2. Secondly, Red5 is pretty flaky for us, we'd prefer something more stable. We can't use the official Flash Media Server, it's a bit out of our price range (starts at [$4,500][3] for a single license).
So far, I've found two servers that look like they would meet my needs, [ElectroServer][4] and [Wowza Media Server][5]. Does anyone have any experience with these, or have any other servers to suggest? The main features I'm looking for:
1. Stable
2. AS3 support in client libraries
3. Can extend server-side (with Java or other languages)
4. Supports real time audio/video from flash clients (eg webcams)
5. (not required, but very helpful) Some method of communicating when all traffic except HTTP or HTTPS is blocked. Eg RTMPT (tunnels RTMP over HTTP) support or similar.
6. Reasonable performance, I'd like to get at least a couple hundred users connected without killing a server.
[1]: http://www.moock.org/unity/
[2]: http://osflash.org/red5
[3]: http://www.adobe.com/products/flashmediaserver/compare/
[4]: http://www.electro-server.com/overview.aspx
[5]: http://www.wowzamedia.com/products.html | 0 | [
2,
246,
4433,
4023,
118,
14785,
2754,
1480,
19348,
8128,
60,
800,
3726,
3726,
31,
22,
79,
699,
26,
18389,
27,
4433,
683,
891,
17595,
9,
871,
15,
95,
275,
21,
3733,
16,
1873,
5668,
22,
18,
636,
1020,
856,
500,
2558,
165,
500,
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... |
What would be Linux equivalent of GetProcessIoCounters?
===
Here's a link to Windows documentation: <http://msdn.microsoft.com/en-us/library/ms683218(VS.85).aspx>.
Basically I would like to get similar data, but on Linux. If not all is possible, then at least some parts. | 0 | [
2,
98,
83,
44,
13024,
4602,
16,
164,
16835,
1963,
24416,
18,
60,
800,
3726,
3726,
235,
22,
18,
21,
3508,
20,
1936,
13945,
45,
13,
1,
21127,
6903,
79,
18,
43,
103,
9,
22019,
12980,
9,
960,
118,
219,
8,
267,
118,
1210,
2559,
622... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Time math in Delphi
===
I have a pretty unusual problem (for me). I am writing an application that will allow a user to change their system time forward or back either by explicit date (change my date to 6/3/1955) or by increment using buttons (go forward 1 month).
I'm writing this to help some of my users test some software that requires jumps like this in order to simulate real world usage of a billing system.
Changing the time in Delphi is of course very easy:
SetDateTime(2008,05,21,16,07,21,00);
But I'm not sure if Delphi (2006) has any built in helpers for date math, which is one of my least favorite things :)
Any suggestions for the best way to handle this? I'd prefer to stay native as the winapi datetime calls suck.
Thanks! | 0 | [
2,
85,
5057,
19,
23030,
800,
3726,
3726,
31,
57,
21,
1772,
4706,
1448,
13,
5,
1106,
55,
6,
9,
31,
589,
1174,
40,
3010,
30,
129,
1655,
21,
4155,
20,
753,
66,
329,
85,
917,
54,
97,
694,
34,
14990,
1231,
13,
5,
16229,
51,
1231,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 do bi-directional communication with a custom USB device?
===
I'm planning to build a USB device that has buttons that some software needs to respond to, and indicators that the software needs to control. I'm new to USB, so I'm looking for any pointers that will get me started. | 0 | [
2,
184,
92,
31,
107,
1732,
8,
19393,
3291,
29,
21,
5816,
182,
220,
3646,
60,
800,
3726,
3726,
31,
22,
79,
2334,
20,
1895,
21,
182,
220,
3646,
30,
63,
12861,
30,
109,
2306,
2274,
20,
4590,
20,
15,
17,
13310,
18,
30,
14,
2306,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
PEAR Channels - Setting up your own?
===
I am looking for instructions on how to setup a PEAR channel for our project so that we can deploy it with the pear installer. I have Googled for a while and cannot find any straightforward information. I followed [this tutorial][1] for a while, but I am having a hell of a time getting this to work. Does anyone know how to do this? Is there a simpler way?
[1]: http://greg.chiaraquartet.net/archives/123-Setting-up-your-own-PEAR-channel-with-Chiara_PEAR_Server-the-official-way.html | 0 | [
2,
16619,
6328,
13,
8,
2697,
71,
154,
258,
60,
800,
3726,
3726,
31,
589,
699,
26,
7650,
27,
184,
20,
18161,
21,
16619,
1318,
26,
318,
669,
86,
30,
95,
92,
17617,
32,
29,
14,
16619,
16146,
106,
9,
31,
57,
8144,
43,
26,
21,
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... |
Project management certifications (if any) & their usefulness in the software development world
===
I helped an M.B.A. pal of mine prepare for her PMP certification ([wikipedia/pmp][1]). Many of the topics covered during that process seemed like they could be useful in a dev. environment (if high-level).
**Are there certifications for software project management that are highly sought-after?**
*Contributions from hiring managers would be especially helpful!*
[1]: http://en.wikipedia.org/wiki/Project_Management_Professional | 0 | [
2,
669,
1097,
10439,
18,
13,
5,
821,
186,
6,
279,
66,
4811,
720,
19,
14,
2306,
522,
126,
800,
3726,
3726,
31,
1456,
40,
307,
9,
220,
9,
58,
9,
4370,
16,
1114,
5723,
26,
36,
351,
2554,
10439,
13,
5,
2558,
17375,
26132,
118,
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... |
Other than for LINQ queries, how do you use anonymous types in C#?
===
I've been trying to get up to speed on some of the newer features in C# and one of them that I haven't had occasion to use is anonymous types.
I understand the usage as it pertains to LINQ queries and I looked at [this SO post][1] which asked a similar question. Most of the examples I've seen on the net are related to LINQ queries, which is cool. I saw some somewhat contrived examples too but not really anything where I saw a lot of value.
Do you have a novel use for anonymous types where you think it really provides you some utility?
[1]: http://stackoverflow.com/questions/48668/how-should-anonymous-types-be-used-in-c | 0 | [
2,
89,
119,
26,
6294,
1251,
9386,
2829,
15,
184,
107,
42,
275,
10364,
2551,
19,
272,
5910,
60,
800,
3726,
3726,
31,
22,
195,
74,
749,
20,
164,
71,
20,
1362,
27,
109,
16,
14,
12372,
967,
19,
272,
5910,
17,
53,
16,
105,
30,
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... |
Initializing cherrypy.session early
===
I love CherryPy's API for sessions, except for one detail. Instead of saying `cherrypy.session["spam"]` I'd like to be able to just say `session["spam"]`.
Unfortunately, I can't simply have a global `from cherrypy import session` in one of my modules, because the `cherrypy.session` object isn't created until the first time a page request is made. Is there some way to get CherryPy to initialize its session object immediately instead of on the first page request?
I have two ugly alternatives if the answer is no:
First, I can do something like this
def import_session():
global session
while not hasattr(cherrypy, "session"):
sleep(0.1)
session = cherrypy.session
Thread(target=import_session).start()
This feels like a big kludge, but I really hate writing `cherrypy.session["spam"]` every time, so to me it's worth it.
My second solution is to do something like
class SessionKludge:
def __getitem__(self, name):
return cherrypy.session[name]
def __setitem__(self, name, val):
cherrypy.session[name] = val
session = SessionKludge()
but this feels like an even bigger kludge and I'd need to do more work to implement the other dictionary functions such as `.get`
So I'd definitely prefer a simple way to initialize the object myself. Does anyone know how to do this? | 0 | [
2,
2104,
3335,
9257,
6448,
9,
7202,
5991,
274,
800,
3726,
3726,
31,
339,
9257,
6448,
22,
18,
21,
2159,
26,
5763,
15,
1613,
26,
53,
6110,
9,
700,
16,
1148,
13,
1,
23656,
6448,
9,
7202,
5991,
2558,
7,
3401,
765,
7,
500,
1,
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... |
public variables vs private variables with accessors
===
Has anyone else seen people do this:
<code>private string _name;public string Name{ get { return _name; } set { _name = value; }}</code>
I understand using accessors if you are going to exercise some sort of control over how it gets set or perform some sort of function on it when there is a get. But if you are just going to do this, why not just make the variable public to begin with? Am I missing something? | 0 | [
2,
317,
12157,
4611,
932,
12157,
29,
1381,
248,
18,
800,
3726,
3726,
63,
1276,
962,
541,
148,
107,
48,
45,
13,
1,
9375,
1,
20181,
3724,
13,
1,
7259,
73,
12259,
3724,
204,
1,
164,
13,
1,
788,
13,
1,
7259,
73,
13,
1,
309,
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... |
does .net application run on Linux ?
===
does .net application run on linux ? is there any free/paid interop lib available ? | 0 | [
2,
630,
13,
9,
2328,
3010,
485,
27,
13024,
13,
60,
800,
3726,
3726,
630,
13,
9,
2328,
3010,
485,
27,
13024,
13,
60,
25,
80,
186,
551,
118,
19731,
1480,
2594,
13,
8326,
904,
13,
60,
3,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
Regular expression for parsing name value pairs
===
Can someone provide a regular expression for parsing name/value pairs from a string? The pairs are separated by commas, and the value can optionally be enclosed in quotes. For example:
AssemblyName=foo.dll,ClassName="SomeClass",Parameters="Some,Parameters" | 0 | [
2,
1290,
1803,
26,
2017,
18,
68,
204,
1923,
7473,
800,
3726,
3726,
92,
737,
1181,
21,
1290,
1803,
26,
2017,
18,
68,
204,
118,
15165,
7473,
37,
21,
3724,
60,
14,
7473,
50,
4196,
34,
11951,
472,
15,
17,
14,
1923,
92,
12832,
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... |
Change name of file sent to client?
===
I have a webpage that pulls information from a database, converts it to .csv format, and writes the file to the HTTPResponse.
string csv = GetCSV();
Response.Clear();
Response.ContentType = "text/csv";
Response.Write(csv);
This works fine, and the file is sent to the client with no problems. However, when the file is sent to the client, the name of the current page is used, instead of a more friendly name (like "data.csv").
![alt text][1]
[1]: http://ktrauberman.files.wordpress.com/2008/10/exportcsv.gif
My question is, how can I change the name of the file that is written to the output stream without writing the file to disk and redirecting the client to the file's url? | 0 | [
2,
753,
204,
16,
3893,
795,
20,
6819,
60,
800,
3726,
3726,
31,
57,
21,
2741,
6486,
30,
8071,
676,
37,
21,
6018,
15,
8406,
18,
32,
20,
13,
9,
6824,
710,
2595,
15,
17,
6215,
14,
3893,
20,
14,
7775,
99,
18,
8782,
870,
9,
3724,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Double-click double-insert resolutions?
===
A team member has run into an issue with an old in-house system where a user double-clicking on a link on a web page can cause two requests to be sent from the browser resulting in two database inserts of the same record in a race condition; the last one to run fails with a primary key violation. Several solutions and hacks have been proposed and discussed:
1. Use Javascript on the web page to mitigate the second click by disabling the link on the first click. This is a quick and easy way to reduce the occurrences of the problem, but not entirely eliminate it.
2. Wrap the request execution on the sever side in a transaction. This has been deemed too expensive of an operation due to server load and lock levels on the table in question.
3. Catch the primary key exception thrown by the failed insert, identify it as such, and eat it. This has the disadvantages of (a) vendor lock-in, having to know the nuances of the database-specific exceptions, and (b) potentially not logging/dealing with legitimate database failures.
4. An extension of #3 by attempting to update the record if the insert fails and checking the result of the update to ensure it returns 1 record affected.
Are the other options that haven't been considered? Are there pros and cons of the options presented that were overlooked? Which is the lesser of all evils? | 0 | [
2,
1494,
8,
150,
10129,
1494,
8,
108,
18,
6767,
4302,
18,
60,
800,
3726,
3726,
21,
173,
322,
63,
485,
77,
40,
1513,
29,
40,
315,
19,
8,
1682,
329,
113,
21,
4155,
1494,
8,
150,
10129,
68,
27,
21,
3508,
27,
21,
2741,
2478,
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... |
How do I make Ruby Gems installations on Windows use MinGW for making and compiling?
===
Trying to update some gems on a Windows machine and I continually get this error output for gems that do not have pre-compiled binaries:
Provided configuration options:
--with-opt-dir
--without-opt-dir
--with-opt-include
--without-opt-include=${opt-dir}/include
--with-opt-lib
--without-opt-lib=${opt-dir}/lib
--with-make-prog
--srcdir=.
--curdir
--ruby=c:/server/ruby/bin/ruby
These are configuration options that are provided to the extconf.rb ruby file during the installation of the gem.
I have installed MinGW so I should have everything I need to install, make and compile these gems. However, I do not know how to change the configuration for RubyGems so that when extconf.rb is called it includes the appropriate options pointing to the MinGW include directory. | 0 | [
2,
184,
107,
31,
233,
10811,
8551,
18,
16885,
27,
1936,
275,
12069,
499,
26,
544,
17,
24378,
60,
800,
3726,
3726,
749,
20,
11100,
109,
8551,
18,
27,
21,
1936,
1940,
17,
31,
16609,
164,
48,
7019,
5196,
26,
8551,
18,
30,
107,
52,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
What you don't like in agile development?
===
What you don't like (or even hate) in agile development? I mean SCRUM, XP or any other light process. | 0 | [
2,
98,
42,
221,
22,
38,
101,
19,
27475,
522,
60,
800,
3726,
3726,
98,
42,
221,
22,
38,
101,
13,
5,
248,
166,
3223,
6,
19,
27475,
522,
60,
31,
884,
26562,
15,
23045,
54,
186,
89,
471,
953,
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... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
Pass a PHP string to a Javascript variable (including escaping newlines)
===
What is the easiest way to encode a PHP string for output to a Javascript variable?
I have a PHP string which includes quotes and newlines. I need the contents of this string to be put into a Javascipt variable.
Normally, I would just construct my Javascript in a PHP file, ala:
<script>
var myvar = "<?php echo $myVarValue;?>";
</script>
However, this doesn't work when $myVarValue contains quotes or newlines. | 0 | [
2,
1477,
21,
13,
26120,
3724,
20,
21,
8247,
8741,
7612,
13,
5,
3970,
14700,
78,
7939,
6,
800,
3726,
3726,
98,
25,
14,
27237,
161,
20,
20523,
21,
13,
26120,
3724,
26,
5196,
20,
21,
8247,
8741,
7612,
60,
31,
57,
21,
13,
26120,
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... |
Is it possible to have separate SQLite databases within the same Django project?
===
I was considering creating a separate SQLite database for certain apps on a Django project.<br>
However, I did not want to use direct SQLite access if possible.
Django-style ORM access to these database would be ideal.<br>
Is this possible?
Thank you. | 0 | [
2,
25,
32,
938,
20,
57,
1725,
4444,
10601,
6018,
18,
363,
14,
205,
3857,
14541,
669,
60,
800,
3726,
3726,
31,
23,
5154,
2936,
21,
1725,
4444,
10601,
6018,
26,
1200,
4865,
18,
27,
21,
3857,
14541,
669,
9,
1,
5145,
1,
207,
15,
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... |
Unresolved External Symbol Errors switching from build library to exe or dll
===
I am building an application as a library, but to make sure I can get the output that I'd like, I switched it over to produce an exe. As soon as I did, I got several errors about unresolved external symbols.
At first I thought that I didn't have a path set to the 3rd party library that I was referencing, so I added the folder to my path variable and even added it to my include, references, and source files, just to make sure I had all the paths.
I still get the error:
> error LNK2019: unresolved external
> symbol "__declspec(dllimport) public:
> static void
> __cdecl xercesc_2_8::XMLPlatformUtils::Initialize(char
> const * const,char const *
> const,class xercesc_2_8::PanicHandler
> * const,class xercesc_2_8::MemoryManager *
> const,bool)"
> (__imp_?Initialize@XMLPlatformUtils@xercesc_2_8@@SAXQBD0QAVPanicHandler@2@QAVMemoryManager@2@_N@Z)
> referenced in function "void __cdecl
> xsd::cxx::xml::initialize(void)"
> (?initialize@xml@cxx@xsd@@YAXXZ)
The reason that I'm asking it here is because in Visual Studio, when I built it as a library, I didn't get these errors, but as a dll and exe, I do.
Anybody have any thoughts? | 0 | [
2,
367,
99,
5594,
4763,
4886,
4678,
11908,
13027,
37,
1895,
1248,
20,
1396,
62,
54,
13,
43,
211,
800,
3726,
3726,
31,
589,
353,
40,
3010,
28,
21,
1248,
15,
47,
20,
233,
562,
31,
92,
164,
14,
5196,
30,
31,
22,
43,
101,
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... |
ASP.NET: How to access an IFRAME from the codebehind file?
===
i'm trying to set attributes for an IFRAME html control from the code-behind aspx.cs file.
i came across a [post][1] that says you can use FindControl to find the non-asp controls using:
The aspx file contains:
<iframe id="contentPanel1" runat="server" />
and then the code-behind file contains:
protected void Page_Load(object sender, EventArgs e)
{
HtmlControl contentPanel1 = (HtmlControl)this.FindControl("contentPanel1");
if (contentPanel1 != null)
contentPanel1.Attributes["src"] = "http://www.stackoverflow.com";
}
Except that it's not finding the control, contentPanel1 is null.
[1]: http://geekswithblogs.net/ranganh/archive/2005/04/25/37635.aspx | 0 | [
2,
28,
306,
9,
2328,
45,
184,
20,
1381,
40,
31,
8361,
37,
14,
1797,
24878,
3893,
60,
800,
3726,
3726,
31,
22,
79,
749,
20,
309,
13422,
26,
40,
31,
8361,
13,
15895,
569,
37,
14,
1797,
8,
24878,
28,
306,
396,
9,
6824,
3893,
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... |
Connect PHP to SQL Server Compact Edition
===
Is it possible to connect PHP to a SQL Server Compact Edition database? What would be the best driver? | 0 | [
2,
6379,
13,
26120,
20,
4444,
255,
8128,
8285,
1322,
800,
3726,
3726,
25,
32,
938,
20,
6379,
13,
26120,
20,
21,
4444,
255,
8128,
8285,
1322,
6018,
60,
98,
83,
44,
14,
246,
2425,
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... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
How do I use an arbitrary string as a lock in C++?
===
Let's say I have a multithreaded C++ program that handles requests in the form of a function call to `handleRequest(string key)`. Each call to `handleRequest` occurs in a separate thread, and there are an arbitrarily large number of possible values for `key`.
I want the following behavior:
* Simultaneous calls to `handleRequest(key)` are serialized when they have the same value for `key`.
* Global serialization is minimized.
The body of `handleRequest` might look like this:
void handleRequest(string key) {
KeyLock lock(key);
// Handle the request.
}
<b>Question:</b> How would I implement `KeyLock` to get the required behavior?
A naive implementation might start off like this:
KeyLock::KeyLock(string key) {
global_lock->Lock();
internal_lock_ = global_key_map[key];
if (internal_lock_ == NULL) {
internal_lock_ = new Lock();
global_key_map[key] = internal_lock_;
}
global_lock->Unlock();
internal_lock_->Lock();
}
KeyLock::~KeyLock() {
internal_lock_->Unlock();
// Remove internal_lock_ from global_key_map iff no other threads are waiting for it.
}
...but that requires a global lock at the beginning and end of each request, and the creation of a separate `Lock` object for each request. If contention is high between calls to `handleRequest`, that might not be a problem, but it could impose a lot of overhead if contention is low. | 0 | [
2,
184,
107,
31,
275,
40,
17237,
3724,
28,
21,
3991,
19,
272,
20512,
60,
800,
3726,
3726,
408,
22,
18,
395,
31,
57,
21,
1889,
96,
10647,
69,
272,
20512,
625,
30,
3053,
18,
12279,
19,
14,
505,
16,
21,
1990,
645,
20,
13,
1,
32... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Can you write GPL software using CPL libraries?
===
The specific case I'm thinking about is writing Clojure programs that are GPLed. I've seen cases where GPLed software was using incompatible licenses (Erlang's, which is like MPL) just by adding an exception to the license agreements. Is that possible with the CPL? | 0 | [
2,
92,
42,
2757,
489,
5727,
2306,
568,
272,
5727,
8649,
60,
800,
3726,
3726,
14,
1903,
610,
31,
22,
79,
1440,
88,
25,
1174,
7383,
2142,
99,
1726,
30,
50,
10538,
1294,
9,
31,
22,
195,
541,
1871,
113,
10538,
1294,
2306,
23,
568,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 build and install P4Python for Mac OS X?
===
I've been unable to build [P4Python][1] for an Intel Mac OS X 10.5.5.
These are my steps:
1. I downloaded p4python.tgz (from
[http://filehost.perforce.com/perforce/r07.3/tools/][2]) and expanded
it into "P4Python-2007.3".
2. I downloaded p4api.tar (from
[http://filehost.perforce.com/perforce/r07.3/bin.macosx104x86/][3])
and expanded it into "p4api-2007.3.143793".
3. I placed "p4api-2007.3.143793" into "P4Python-2007.3" and edited
setup.cfg to set "p4_api=./p4api-2007.3.143793".
4. I added the line 'extra_link_args = ["-framework", "Carbon"]' to
setup.py after:
elif unameOut[0] == "Darwin":
unix = "MACOSX"
release = "104"
platform = self.architecture(unameOut[4])
5. I ran `python setup.py build` and got:
$ python setup.py build
API Release 2007.3
running build
running build_py
running build_ext
building 'P4API' extension
gcc -fno-strict-aliasing -Wno-long-double -no-cpp-precomp -mno-fused-madd -DNDEBUG -g -O3 -Wall -Wstrict-prototypes -DID_OS="MACOSX104X86" -DID_REL="2007.3" -DID_PATCH="151416" -DID_API="2007.3" -DID_Y="2008" -DID_M="04" -DID_D="09" -I./p4api-2007.3.143793 -I./p4api-2007.3.143793/include/p4 -I/build/toolchain/mac32/python-2.4.3/include/python2.4 -c P4API.cpp -o build/temp.darwin-9.5.0-i386-2.4/P4API.o -DOS_MACOSX -DOS_MACOSX104 -DOS_MACOSXX86 -DOS_MACOSX104X86
cc1plus: warning: command line option "-Wstrict-prototypes" is valid for C/ObjC but not for C++
P4API.cpp: In function âint P4Adapter_init(P4Adapter*, PyObject*, PyObject*)â:
P4API.cpp:105: error: âPy_ssize_tâ was not declared in this scope
P4API.cpp:105: error: expected `;' before âposâ
P4API.cpp:107: error: âposâ was not declared in this scope
P4API.cpp: In function âPyObject* P4Adapter_run(P4Adapter*, PyObject*)â:
P4API.cpp:177: error: âPy_ssize_tâ was not declared in this scope
P4API.cpp:177: error: expected `;' before âiâ
P4API.cpp:177: error: âiâ was not declared in this scope
error: command 'gcc' failed with exit status 1
`which gcc` returns /usr/bin/gcc and `gcc -v` returns:
Using built-in specs.
Target: i686-apple-darwin9
Configured with: /var/tmp/gcc/gcc-5465~16/src/configure
--disable-checking -enable-werror --prefix=/usr --mandir=/share/man
--enable-languages=c,objc,c++,obj-c++
--program-transform-name=/^[cg][^.-]*$/s/$/-4.0/
--with-gxx-include-dir=/include/c++/4.0.0 --with-slibdir=/usr/lib
--build=i686-apple-darwin9 --with-arch=apple --with-tune=generic
--host=i686-apple-darwin9 --target=i686-apple-darwin9
Thread model: posix
gcc version 4.0.1 (Apple Inc. build 5465)
`python -V` returns Python 2.4.3.
[1]: http://www.perforce.com/perforce/loadsupp.html#api
[2]: http://filehost.perforce.com/perforce/r07.3/tools/
[3]: http://filehost.perforce.com/perforce/r07.3/bin.macosx104x86/
| 0 | [
2,
184,
107,
31,
1895,
17,
16146,
351,
300,
6448,
11570,
26,
1572,
13,
759,
993,
60,
800,
3726,
3726,
31,
22,
195,
74,
2343,
20,
1895,
636,
306,
300,
6448,
11570,
500,
2558,
165,
500,
26,
40,
14635,
1572,
13,
759,
993,
332,
9,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How do I show an embedded excel file in a WebPage?
===
I want to allow an Excel report to be viewed embedded in a WebPage... is there a way?
- I don't want to use an ActiveX, or OWC (Office Web Components), I just want to open an existing file from the internet explorer application.
- I don't want users to download and then open it.
Using an iframe wouldn't be a problem, but my preliminary tests weren't successful
Any ideas? Is it at all possible? | 0 | [
2,
184,
107,
31,
298,
40,
12138,
20700,
3893,
19,
21,
2741,
6486,
60,
800,
3726,
3726,
31,
259,
20,
1655,
40,
20700,
1330,
20,
44,
6084,
12138,
19,
21,
2741,
6486,
9,
9,
9,
25,
80,
21,
161,
60,
13,
8,
31,
221,
22,
38,
259,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
When do you use an IDE?
===
I know that some people swear against using a language-specific IDE ever (vim/emacs or die! type stuff) and that some people are really uncomfortable with coding/compiling in the terminal at all, so my question has the following parts.
- When do you switch from one to the other
- Is it even necessary to know both? If not, which should you know?
- Lightweight or Heavyweight IDEs? (just code highlighting or every feature you could imagine)
- What IDE do you recommend in general, and why?
Feel free to answer all, some, or none.
| 0 | [
2,
76,
107,
42,
275,
40,
13,
3448,
60,
800,
3726,
3726,
31,
143,
30,
109,
148,
6688,
149,
568,
21,
816,
8,
9219,
13,
3448,
462,
13,
5,
1755,
79,
118,
62,
6893,
18,
54,
1327,
187,
1001,
3217,
6,
17,
30,
109,
148,
50,
510,
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... |
Will Learning C++ Help for Building Fast/No-Additional-Requirements Desktop Applications?
===
Will learning C++ help me build native applications with good speed? Will it help me as a programmer, and what are the other benefits?
The reason why I want to learn C++ is because I'm disappointed with the UI performances of applications built on top of JVM and .NET. They feel slow, and start slow too. Of course, a really bad programmer can create a slower and sluggish application using C++ too, but I'm not considering that case.
One of my favorite Windows utility application is [Launchy][1]. And in the Readme.pdf file, the author of the program wrote this:
> 0.6 This is the first C++ release. As I became frustrated with C#’s large
> .NET framework requirements and users
> lack of desire to install it, I
> decided to switch back to the faster
> language.
I totally agree with the author of Launchy about the .NET framework requirement or even a JRE requirement for desktop applications. Let alone the specific version of them. And some of the best and my favorite desktop applications don't need .NET or Java to run. They just run after installing. Are they mostly built using C++? Is C++ the only option for good and fast GUI based applications?
And, I'm also very interested in hearing the other benefits of learning C++.
[1]: http://launchy.net/ | 4 | [
2,
129,
2477,
272,
20512,
448,
26,
353,
1512,
118,
251,
8,
14854,
9861,
192,
8,
99,
3003,
99,
6601,
17404,
3767,
60,
800,
3726,
3726,
129,
2477,
272,
20512,
448,
55,
1895,
1275,
3767,
29,
254,
1362,
60,
129,
32,
448,
55,
28,
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... |
How to enforce locking workstation when leaving? Is this important?
===
Within your organization, is every developer required to lock his workstation when leaving it?
What do you see a risks when workstations are left unlocked, and how do you think such risks are important compared to "over-wire" (network hacking) security risks?
What policies do you think are most efficient to enforce locking the workstations? (The policies might be either something "technical", like a domain group security settings for screen-savers to be locking, or a "social", like applying some penalties to those who do not lock, or encouraging [Goating][1]?)
[1]: http://www.codinghorror.com/blog/archives/000997.html
| 0 | [
2,
184,
20,
16525,
17538,
170,
10839,
76,
1107,
60,
25,
48,
681,
60,
800,
3726,
3726,
363,
154,
1165,
15,
25,
352,
10058,
1390,
20,
3991,
33,
170,
10839,
76,
1107,
32,
60,
98,
107,
42,
196,
21,
12176,
76,
170,
10839,
18,
50,
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... |
C# .Net exe doesn't close when PC is restarted, keeping the machine from restarting
===
We have a SmartClient built in C# that stubornly remains open when the PC its running on is being restarted. This halts the restart process unless the user first closes the SmartClient or there is some other manual intervention.
This is causing problems when the infrastructure team remotely installs new software that requires a machine reboot.
Any ideas for getting the SmartClient app to recognize the shutdown/restart event from Windows and gracefully kill itself? | 0 | [
2,
272,
5910,
13,
9,
2328,
1396,
62,
1437,
22,
38,
543,
76,
5168,
25,
27440,
15,
2882,
14,
1940,
37,
22767,
68,
800,
3726,
3726,
95,
57,
21,
3978,
150,
18513,
38,
392,
19,
272,
5910,
30,
12519,
381,
102,
1678,
368,
76,
14,
516... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 identify the minimal set of parameters describing a data set
===
I have a bunch of regression test data. Each test is just a list of messages (associative arrays), mapping message field names to values. There's a lot of repetition within this data.
For example
test1 = [
{ sender => 'client', msg => '123', arg => '900', foo => 'bar', ... },
{ sender => 'server', msg => '456', arg => '800', foo => 'bar', ... },
{ sender => 'client', msg => '789', arg => '900', foo => 'bar', ... },
]
I would like to represent the field data (as a minimal-depth decision tree?) so that each message can be programatically regenerated using a minimal number of parameters. For example, in the above
- foo is always 'bar', so I don't need to mention it
- sender and client are correlated, so I only need to mention one or the other
- and msg is different each time
So I would like to be able to regenerate these messages with a program along the lines of
write_msg( 'client', '123' )
write_msg( 'server', '456' )
write_msg( 'client', '789' )
where the write_msg function would be composed of nested if statements or subfunction calls using the parameters.
Based on my original data, how can I determine the 'most important' set of parameters, i.e. the ones that will let me recreate my data set using the smallest number of arguments?
| 0 | [
2,
184,
20,
5808,
14,
8663,
309,
16,
12905,
7153,
21,
1054,
309,
800,
3726,
3726,
31,
57,
21,
7653,
16,
27369,
1289,
1054,
9,
206,
1289,
25,
114,
21,
968,
16,
7561,
13,
5,
19842,
1892,
3366,
7718,
18,
6,
15,
13305,
2802,
575,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Improving MonoRail
===
We know it's lacking documentation but what other parts would you like to see improved? | 0 | [
2,
9273,
4129,
7301,
800,
3726,
3726,
95,
143,
32,
22,
18,
11690,
13945,
47,
98,
89,
1341,
83,
42,
101,
20,
196,
3999,
60,
3,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
Eclipse's Crtl+click in Visual Stdio?
===
After working for a few days with Eclipse Java I totally got addicted to pressing Ctrl and clicking on an identifier to go to its definition. Since then I've been looking for a way to achieve this in Visual Studio as well.
I realize VS has right-click->Got to definition, and that F12 does the same. Also that Visual Assist does something similar with Alt+G. Yet none of these are as perfect as Ctrl+click.
I've actually tried my luck for a few hours trying to write a VS plugin to do it but didn't get anywhere in the time frame I thought reasonable for this.
Does anyone know how this could be achieved? A ready plugin? A macro of some kind? | 0 | [
2,
11652,
22,
18,
6186,
7786,
2430,
150,
10129,
19,
3458,
354,
6921,
60,
800,
3726,
3726,
75,
638,
26,
21,
310,
509,
29,
11652,
8247,
31,
5139,
330,
16906,
69,
20,
7196,
13,
4812,
6362,
17,
25590,
27,
40,
25570,
20,
162,
20,
82,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
What is the best way to partition large tables in SQL Server?
===
In a recent project the "lead" developer designed a database schema where "larger" tables would be split across two seperate databases with a view on the main database which unioned the two seperate database-tables together. The main database is what the application was driven off of so these tables looked and felt like ordinary tables (except some quirkly things around updating). This seemed like a HUGE performance problem. We do see problems with performance around these tables but nothing to make him change his mind about his design. Just wondering what is the best way to do this, or if it is even worth doing? | 0 | [
2,
98,
25,
14,
246,
161,
20,
10711,
370,
7484,
19,
4444,
255,
8128,
60,
800,
3726,
3726,
19,
21,
1764,
669,
14,
13,
7,
11846,
7,
10058,
1006,
21,
6018,
23874,
113,
13,
7,
11312,
139,
7,
7484,
83,
44,
2132,
464,
81,
10332,
106,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 Memory Usage
===
I find that quite often Visual studio memory usage will average ~150-300 Mb of RAM. As a developer who very often needs to run with multiple instances of Visual studio open. Are there any performance tricks to optimize the ammount of memory that VS uses.
I am running VS 2005 with one add-in (TFS)
| 0 | [
2,
3458,
1120,
1912,
7514,
800,
3726,
3726,
31,
477,
30,
1450,
478,
3458,
1120,
1912,
7514,
129,
862,
13,
1,
9839,
8,
6571,
14023,
16,
2843,
9,
28,
21,
10058,
72,
253,
478,
2274,
20,
485,
29,
1886,
13946,
16,
3458,
1120,
368,
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... |
Templated delegates
===
I have the following piece of code pattern:
void M1(string s, string v)
{
try
{
// Do some work
}
catch(Exception ex)
{
// Encapsulate and rethrow exception
}
}
The only difference is that the return type and the number and types of parameters to the methods can vary.
I want to create a generic / templated method that handles all of the code except for the "Do some work" part, how can it be achieved. | 0 | [
2,
22894,
43,
10845,
800,
3726,
3726,
31,
57,
14,
249,
1855,
16,
1797,
3732,
45,
11364,
307,
165,
5,
11130,
13,
18,
15,
3724,
566,
6,
13,
1,
1131,
13,
1,
12894,
107,
109,
170,
13,
1,
2949,
5,
10066,
872,
1396,
6,
13,
1,
1289... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 typeof(myType).TypeHandle use reflection?
===
see title. | 0 | [
2,
630,
1001,
1041,
5,
915,
4474,
6,
9,
4474,
3203,
413,
275,
9138,
60,
800,
3726,
3726,
196,
581,
9,
3,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
Capturing method state using Reflection
===
Is there a way to use .NET reflection to capture the values of all parameters/local variables? | 0 | [
2,
12859,
2109,
146,
568,
9138,
800,
3726,
3726,
25,
80,
21,
161,
20,
275,
13,
9,
2328,
9138,
20,
3683,
14,
4070,
16,
65,
12905,
118,
15580,
12157,
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... | [
1,
1,
1,
1,
1,
1,
1,
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... |
Xml Schema XSD TotalDigits vs. MaxInclusive
===
I have run across an XML Schema with the following definition.
<xs:simpleType name="ClassRankType">
<xs:restriction base="xs:integer">
<xs:totalDigits value="4"/>
<xs:minInclusive value="1"/>
<xs:maxInclusive value="9999"/>
</xs:restriction>
</xs:simpleType>
However, it seems to me that totalDigits is redundant. I am somewhat new to XML Schema, and want to make sure I'm not missing something.
What is the actual behavior of totalDigits vs. maxInclusive, and can totalDigits always be represented with a combination of minInclusive and MaxInclusive? How does totalDigits affect negative numbers?
| 0 | [
2,
23504,
23874,
993,
18,
43,
600,
23904,
18,
4611,
9,
2049,
108,
150,
28332,
800,
3726,
3726,
31,
57,
485,
464,
40,
23504,
23874,
29,
14,
249,
5465,
9,
13,
1,
396,
18,
45,
24629,
4474,
204,
3726,
7,
1898,
23083,
4474,
7,
1,
1... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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++ alternatives to void* pointers (that isn't templates)
===
So, we have a need to create a relatively generic container type object. It also happens to encapsulate some business related logic. However, we need to store essentially arbitrary data in this container - everything from primitive data types to complex classes.
Thus, one would immediately jump to the idea of a template class and be done with it. However, I have noticed C++ polymorphism and templates do not play well together. Being that there is some complex logic that we are going to have to work, I would rather just stick with either templates OR polymorphism, and not try to fight C++ by making it do both.
Finally, given that I want to do one or the other, I would prefer polymorphism. I find it much easier to represent constraints like "this container contains Comparable types" - a la java.
Bringing me to the topic of question: At the most abstract, I imagine that I could have a "Container" pure virtual interface that has something akin to "push(void* data) and pop(void* data)" (for the record, I am not actually trying to implement a stack).
However, I don't really like void* at the top level, not to mention the signature is going to change every time I want to add a constraint to the type of data a concrete container can work with.
Summarizing: We have relatively complex containers that have various ways to retrieve elements. We want to be able to vary the constraints on the elements that can go into the containers. Elements should work with multiple kinds of containers (so long as they meet the constraints of that particular container).
So - should I drop my love for Java type interfaces and go with templates? Should I use void* and statically cast everything? Or should I go with an empty class definition "Element" that declares nothing and use that as my top level class in the "Element" hierarchy?
One of the reasons why I love stack overflow is that many of the responses provide some interesting insight on other approaches that I hadn't not have even considered. So thank you in advance for your insights and comments. | 0 | [
2,
272,
20512,
2676,
18,
20,
11364,
2483,
454,
445,
13,
5,
887,
2532,
22,
38,
22894,
18,
6,
800,
3726,
3726,
86,
15,
95,
57,
21,
376,
20,
1600,
21,
3109,
12733,
12147,
1001,
3095,
9,
32,
67,
5531,
20,
1957,
4666,
18,
12383,
10... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How do you get a directory listing sorted by creation date in python?
===
What is the best way to get a list of all files in a directory, sorted by date [created | modified], using python?
| 0 | [
2,
184,
107,
42,
164,
21,
16755,
9554,
22554,
34,
2502,
1231,
19,
20059,
60,
800,
3726,
3726,
98,
25,
14,
246,
161,
20,
164,
21,
968,
16,
65,
6488,
19,
21,
16755,
15,
22554,
34,
1231,
636,
18475,
13,
1,
5372,
500,
15,
568,
200... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
Tcp/Ip Socket connections in .NET
===
For my current project, I need to request XML data over a tcp/ip socket connection. For this, I am using the TcpClient class:
Dim client As New TcpClient()
client.Connect(server, port)
Dim stream As NetworkStream = client.GetStream()
stream.Write(request)
stream.Read(buffer, 0, buffer.length)
// Output buffer and return results...
Now this works fine and dandy for small responses. However, when I start receiving larger blocks of data, it appears that the data gets pushed over the socket connection in bursts. When this happens, the stream.Read call only reads the first burst, and thus I miss out on the rest of the response.
What's the best way to handle this issue? Initially I tried to just loop until I had a valid XML document, but I found that in between stream.Read calls the underlying stream would sometimes get shut down and I would miss out on the last portion of the data.
| 0 | [
2,
13,
38,
7439,
118,
4307,
18482,
6760,
19,
13,
9,
2328,
800,
3726,
3726,
26,
51,
866,
669,
15,
31,
376,
20,
3772,
23504,
1054,
84,
21,
13,
38,
7439,
118,
4307,
18482,
2760,
9,
26,
48,
15,
31,
589,
568,
14,
13,
6668,
5779,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Why does subversion chown/recreate files on checkin?
===
I have a personal wiki that I take notes on. The wiki's pages are in a subversion working copy directory, "pages", and I set their permissions to 664, owned by www-data:www-data. My username is in the "www-data" group, so I can checkin and mess with the pages manually.
For a while, I had an issue because every time I ran a checkin, I would no longer be able to change the wiki files through my web interface! I solved the issue by flipping the setgid bit on the "pages" directory, but I'm still confused as to why this happened in the first place:
Every time I check something into subversion, it appears as if svn deletes it and recreates it. Why? Does this behavior support some functionality that I'm not aware of? Is there a way to change it?
Thanks! | 0 | [
2,
483,
630,
972,
10898,
13,
12071,
103,
118,
99,
6037,
1373,
6488,
27,
2631,
108,
60,
800,
3726,
3726,
31,
57,
21,
1319,
13,
17375,
30,
31,
247,
2434,
27,
9,
14,
13,
17375,
22,
18,
4434,
50,
19,
21,
972,
10898,
638,
4344,
167... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 add a shortcut key to Eclipse 3.2 Java plug-in to build the current project?
===
One of the few annoying things about the Eclipse Java plug-in is the absence of a keyboard shortcut to build the project associated with the current resource. Anyone know how to go about it? | 0 | [
2,
184,
107,
31,
3547,
21,
502,
4118,
1246,
20,
11652,
203,
9,
135,
8247,
10922,
8,
108,
20,
1895,
14,
866,
669,
60,
800,
3726,
3726,
53,
16,
14,
310,
17610,
564,
88,
14,
11652,
8247,
10922,
8,
108,
25,
14,
5315,
16,
21,
8896,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
what is the best reporting service from crystal report and sql server reporting service ? why ?
===
Can any one tell me from crystal report and SSRS (Sql Server Reporting Service) which one is better to use ? | 0 | [
2,
98,
25,
14,
246,
6670,
365,
37,
4282,
1330,
17,
4444,
255,
8128,
6670,
365,
13,
60,
483,
13,
60,
800,
3726,
3726,
92,
186,
53,
494,
55,
37,
4282,
1330,
17,
22118,
18,
13,
5,
18,
22402,
8128,
6670,
365,
6,
56,
53,
25,
574,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
F# and Scala comparison
===
Could someone describe what are the differences between those two languages? Other that they target different VM of course ;) | 0 | [
2,
398,
5910,
17,
25975,
6050,
800,
3726,
3726,
110,
737,
4996,
98,
50,
14,
4921,
128,
273,
81,
2556,
60,
89,
30,
59,
2935,
421,
13,
20147,
16,
674,
13,
73,
6,
3,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
RTTI in Delphy
===
I'm trying to parse objects to XML in Delphy, so I read about calling the objet's ClassInfo method to get its RTTI info.
The thing is, this apparently only works for TPersistent objects. Otherwise, I have to specifically add a compiler directive {$M+} to the source code for the compiler to generate RTTI info.
So I happily added the directive, only to find that, even if it did return something from the ClassInfo call (it used to return nil), now I cannot retrieve the class' properties, fields or methods from it. It's like it created the object empty.
Any idea what am I missing here? Thanks! | 0 | [
2,
761,
5249,
19,
1506,
8174,
800,
3726,
3726,
31,
22,
79,
749,
20,
2017,
870,
3916,
20,
23504,
19,
1506,
8174,
15,
86,
31,
1302,
88,
2555,
14,
5122,
10307,
22,
18,
718,
108,
4120,
2109,
20,
164,
82,
761,
5249,
15404,
9,
14,
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... |
How do you add a link that will add an event to your iPhone calenadar from safari?
===
This seems like it should be simple but after a couple hours of googleing I have not figured it out. I know I can add iCal links using ICS files, but this does not work on the iPhone.
BTW, when I say iPhone I would like it to work on the touch also. Anyone have any luck with this? | 0 | [
2,
184,
107,
42,
3547,
21,
3508,
30,
129,
3547,
40,
807,
20,
154,
21024,
17355,
325,
2542,
37,
25055,
60,
800,
3726,
3726,
48,
2206,
101,
32,
378,
44,
1935,
47,
75,
21,
1335,
974,
16,
8144,
68,
31,
57,
52,
5700,
32,
70,
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... |
How do you post to an Iframe?
===
How do you post data to an iframe? | 0 | [
2,
184,
107,
42,
678,
20,
40,
31,
8361,
60,
800,
3726,
3726,
184,
107,
42,
678,
1054,
20,
40,
31,
8361,
60,
3,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
What's the difference between ASP.Net MVC Routing and the new ASP.Net DynamicData Site routing?
===
I've only started playing with both ASP.Net MVC and the new-to-VS2008 Dynamic Data Website Templates. I note that they both use routing in their URL handling, and I'm given to understand that because of routing, ASP.Net MVC won't work under IIS6. However my DynamicData site works just fine on IIS6.
I've had to temporarily abandon my exploration of ASP.Net MVC for an upcoming project due to the IIS7 requirement, and I'm wondering what the essential difference between the 2 is under the hood, i.e. what makes DynamicData sites work on IIS6 and MVC not? | 0 | [
2,
98,
22,
18,
14,
2841,
128,
28,
306,
9,
2328,
307,
8990,
19880,
17,
14,
78,
28,
306,
9,
2328,
7782,
18768,
689,
19880,
60,
800,
3726,
3726,
31,
22,
195,
104,
373,
791,
29,
156,
28,
306,
9,
2328,
307,
8990,
17,
14,
78,
8,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
What's your #1 way to be careful with a live database?
===
For my customer I occasionally do work in their live database in order to fix a problem they have created for themselves, or in order to fix bad data that my product's bugs created. Much like Unix root access, it's just dangerous. What lessons should I learn ahead of time?
What is the #1 thing you do to be careful about operating on live data? | 0 | [
2,
98,
22,
18,
154,
4253,
161,
20,
44,
5186,
29,
21,
515,
6018,
60,
800,
3726,
3726,
26,
51,
7705,
31,
4533,
107,
170,
19,
66,
515,
6018,
19,
389,
20,
6098,
21,
1448,
59,
57,
679,
26,
1366,
15,
54,
19,
389,
20,
6098,
896,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Unauthorized Sharepoint WSDL from Coldfusion 8
===
How do I solve the error:
"Unable to read WSDL from URL: https://workflowtest.site.edu/_vti_bin/Lists.asmx?WSDL.
Error: 401 Unauthorized."
The code making the call is:<br />
<cfinvoke username="username" password="password" webservice="https://workflowtest.liberty.edu/_vti_bin/Lists.asmx?WSDL" method="GetList" listName="{CB02EB71-392E-4906-B512-8EC002F72436}">
The impression I get is that coldfusion doesn't like being made to authenticate to get the WSDL.
Full stack trace:<br />
coldfusion.xml.rpc.XmlRpcServiceImpl$CantFindWSDLException: Unable to read WSDL from URL: https://workflowtest.liberty.edu/_vti_bin/Lists.asmx?WSDL.
at coldfusion.xml.rpc.XmlRpcServiceImpl.retrieveWSDL(XmlRpcServiceImpl.java:709)
at coldfusion.xml.rpc.XmlRpcServiceImpl.access$000(XmlRpcServiceImpl.java:53)
at coldfusion.xml.rpc.XmlRpcServiceImpl$1.run(XmlRpcServiceImpl.java:239)
at java.security.AccessController.doPrivileged(Native Method)
at coldfusion.xml.rpc.XmlRpcServiceImpl.registerWebService(XmlRpcServiceImpl.java:232)
at coldfusion.xml.rpc.XmlRpcServiceImpl.getWebService(XmlRpcServiceImpl.java:496)
at coldfusion.xml.rpc.XmlRpcServiceImpl.getWebServiceProxy(XmlRpcServiceImpl.java:450)
at coldfusion.tagext.lang.InvokeTag.doEndTag(InvokeTag.java:413)
at coldfusion.runtime.CfJspPage._emptyTcfTag(CfJspPage.java:2662)
at cftonytest2ecfm1787185330.runPage(/var/www/webroot/tonytest.cfm:16)
at coldfusion.runtime.CfJspPage.invoke(CfJspPage.java:196)
at coldfusion.tagext.lang.IncludeTag.doStartTag(IncludeTag.java:370)
at coldfusion.filter.CfincludeFilter.invoke(CfincludeFilter.java:65)
at coldfusion.filter.ApplicationFilter.invoke(ApplicationFilter.java:279)
at coldfusion.filter.RequestMonitorFilter.invoke(RequestMonitorFilter.java:48)
at coldfusion.filter.MonitoringFilter.invoke(MonitoringFilter.java:40)
at coldfusion.filter.PathFilter.invoke(PathFilter.java:86)
at coldfusion.filter.ExceptionFilter.invoke(ExceptionFilter.java:70)
at coldfusion.filter.BrowserDebugFilter.invoke(BrowserDebugFilter.java:74)
at coldfusion.filter.ClientScopePersistenceFilter.invoke(ClientScopePersistenceFilter.java:28)
at coldfusion.filter.BrowserFilter.invoke(BrowserFilter.java:38)
at coldfusion.filter.NoCacheFilter.invoke(NoCacheFilter.java:46)
at coldfusion.filter.GlobalsFilter.invoke(GlobalsFilter.java:38)
at coldfusion.filter.DatasourceFilter.invoke(DatasourceFilter.java:22)
at coldfusion.CfmServlet.service(CfmServlet.java:175)
at coldfusion.bootstrap.BootstrapServlet.service(BootstrapServlet.java:89)
at jrun.servlet.FilterChain.doFilter(FilterChain.java:86)
at coldfusion.monitor.event.MonitoringServletFilter.doFilter(MonitoringServletFilter.java:42)
at coldfusion.bootstrap.BootstrapFilter.doFilter(BootstrapFilter.java:46)
at jrun.servlet.FilterChain.doFilter(FilterChain.java:94)
at jrun.servlet.FilterChain.service(FilterChain.java:101)
at jrun.servlet.ServletInvoker.invoke(ServletInvoker.java:106)
at jrun.servlet.JRunInvokerChain.invokeNext(JRunInvokerChain.java:42)
at jrun.servlet.JRunRequestDispatcher.invoke(JRunRequestDispatcher.java:286)
at jrun.servlet.ServletEngineService.dispatch(ServletEngineService.java:543)
at jrun.servlet.jrpp.JRunProxyService.invokeRunnable(JRunProxyService.java:203)
at jrunx.scheduler.ThreadPool$DownstreamMetrics.invokeRunnable(ThreadPool.java:320)
at jrunx.scheduler.ThreadPool$ThreadThrottle.invokeRunnable(ThreadPool.java:428)
at jrunx.scheduler.ThreadPool$UpstreamMetrics.invokeRunnable(ThreadPool.java:266)
at jrunx.scheduler.WorkerThread.run(WorkerThread.java:66)
| 0 | [
2,
25881,
1891,
3132,
619,
18,
8643,
37,
1191,
9818,
469,
800,
3726,
3726,
184,
107,
31,
8402,
14,
7019,
45,
13,
7,
1020,
579,
20,
1302,
619,
18,
8643,
37,
287,
6362,
45,
7775,
18,
6903,
3783,
9990,
10543,
9,
9097,
9,
69,
291,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 Free Professional Looking UML Tool?
===
I like the look of the Visual Studio Class Designers, but it doesn't give me the flexibility of designing before I implement the code.
Also, I'd like to show interfaces, inheritance, and aggregation lines between classes and properties as well.
I am on the lookout for a free tool to help me diagram some of the projects that I do on the side. I'd like to provide professional looking diagrams to place on my blog.
Any ideas? Remember... free is the key! | 0 | [
2,
246,
551,
736,
699,
13,
723,
255,
5607,
60,
800,
3726,
3726,
31,
101,
14,
361,
16,
14,
3458,
1120,
718,
12760,
15,
47,
32,
1437,
22,
38,
590,
55,
14,
19401,
16,
15026,
115,
31,
8713,
14,
1797,
9,
67,
15,
31,
22,
43,
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... |
Win32_LogicalDisk fails for floppies.
===
Using an idea from Bob King idea I wrote the following method.
It works great on CD's, removable drives, regular drives.
However for a floppy it always return "Not Available". Any ideas?
public static void TestFloppy( char driveLetter ) {
using( var searcher = new ManagementObjectSearcher( @"SELECT * FROM Win32_LogicalDisk WHERE DeviceID = '" + driveLetter + ":'" ) )
using( var logicalDisks = searcher.Get() ) {
foreach( ManagementObject logicalDisk in logicalDisks ) {
var fs = logicalDisk[ "FreeSpace" ];
Console.WriteLine( "FreeSpace = " + ( fs ?? "Not Available" ) );
logicalDisk.Dispose();
}
}
} | 0 | [
2,
628,
3125,
1,
14126,
2906,
197,
13614,
26,
9319,
3421,
1596,
9,
800,
3726,
3726,
568,
40,
882,
37,
1909,
437,
882,
31,
738,
14,
249,
2109,
9,
32,
693,
374,
27,
1745,
22,
18,
15,
302,
15146,
579,
10396,
15,
1290,
10396,
9,
2... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Handling Managed Delegates in Unmanaged code
===
I know I can get this to technically work but I'd like to implement the cleanest possible solution. Here's the situation:
I have a managed library which wraps an unmanaged C-style library. The C-style library functionality I'm currently wrapping does some processing involving a list of strings. The library's client code can provide a delegate, such that during the list processing, if an "invalid" scenario is encountered, the library can callback to the client via this delegate and allow them to choose the strategy to use (throw an exception, replace the invalid characters, etc.)
What I'd ideally like to have is all of the managed C++ isolated in one function, and then be able to call a separate function which takes only unmanaged parameters so that all of the native C++ and unmanaged code is isolated at that one point. Providing the callback mechanism to this unmanaged code is proving to be the sticking point for me. | 0 | [
2,
7988,
1471,
10845,
19,
367,
177,
8030,
1797,
800,
3726,
3726,
31,
143,
31,
92,
164,
48,
20,
12345,
170,
47,
31,
22,
43,
101,
20,
8713,
14,
2745,
1430,
938,
4295,
9,
235,
22,
18,
14,
1858,
45,
31,
57,
21,
1471,
1248,
56,
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... |
Where are some good resources for learning the new features of perl 5.10?
===
I didn't realize until recently that perl 5.10 had significant new features and I was wondering if anyone could give me some good resources for learning about those. I searched for them on Google and all I found was some slides and a quick overview. Some of the features (to me at least) would be nice if they had more explanation.
Any links would be appreciated.
-fREW | 0 | [
2,
113,
50,
109,
254,
2566,
26,
2477,
14,
78,
967,
16,
416,
255,
331,
9,
1036,
60,
800,
3726,
3726,
31,
223,
22,
38,
4007,
163,
1989,
30,
416,
255,
331,
9,
1036,
41,
1505,
78,
967,
17,
31,
23,
5712,
100,
1276,
110,
590,
55,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
A Question of Greedy vs. Negated Character Classes in Regex
===
I have a very large file that looks like this (see below). I have two basic choices of regex to use on it (I know there may be others but I'm really trying to compare Greedy and Negated Char Class) methods.
ftp: [^\D]{1,}
ftp: (\d)+
Now + is greedy which forces backtracking but the Negated Char Class require a char-by-char comparison. Which is more efficient? Assume the file is very-very large so minute differences in processor usage will become exaggerated due to the length of the file.
Now that you've answered that, What if my Negated Char Class was very large, say 18 different characters? Would that change your answer?
Thanks.
> ftp: 1117 bytes
ftp: 5696 bytes
> ftp: 3207 bytes
ftp: 5696 bytes
> ftp: 7200 bytes | 0 | [
2,
21,
1301,
16,
23833,
4611,
9,
9574,
1669,
925,
2684,
19,
7953,
1706,
800,
3726,
3726,
31,
57,
21,
253,
370,
3893,
30,
1879,
101,
48,
13,
5,
1798,
1021,
6,
9,
31,
57,
81,
2125,
10978,
16,
7953,
1706,
20,
275,
27,
32,
13,
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... |
RESTifying URLs
===
At work here, we have a box serving XML feeds to business partners. Requests for our feeds are customized by specifying query string parameters and values. Some of these parameters are required, but many are not.
For example, we've require all requests to specify a GUID to identify the partner, and a request can either be for a "get latest" or "search" action:
For a search: <i>http://services.null.ext/?id=[GUID]&q=[Search Keywords]</i><br/>
Latest data in category: <i>http://services.null.ext/?id=[GUID]&category=[ID]</i>
Structuring a RESTful URL scheme for these parameters is easy:
Search: <i>http://services.null.ext/[GUID]/search/[Keywords]</i><br/>
Latest: <i>http://services.null.ext/[GUID]/latest/category/[ID]</i>
But what how should we handle the dozen or so optional parameters we have, with few dozen possible values? Many of these are mutually exclusively, and many are required in combinations.
Very quickly, the number of possible paths becomes overwhelmingly complex.
What are some recommended practices for how to map URLs with complex query strings to friendlier /REST/ful/paths? | 0 | [
2,
760,
10874,
13,
911,
7532,
800,
3726,
3726,
35,
170,
235,
15,
95,
57,
21,
1649,
1799,
23504,
17058,
20,
508,
4724,
9,
12279,
26,
318,
17058,
50,
28779,
34,
19077,
68,
25597,
3724,
12905,
17,
4070,
9,
109,
16,
158,
12905,
50,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Python - How do I convert "an OS-level handle to an open file" to a file object?
===
[tempfile.mkstemp()][1] returns "a tuple containing an OS-level handle to an open file (as would be returned by os.open()) and the absolute pathname of that file, in that order." How do I convert that OS-level handle to a file object?
The [documentation for os.open()][2] states:
> To wrap a file descriptor in a "file
> object", use fdopen().
So I tried:
>>> import tempfile
>>> tup = tempfile.mkstemp()
>>> import os
>>> f = os.fdopen(tup[0])
>>> f.write('foo\n')
Traceback (most recent call last):
File "<stdin>", line 1, in ?
IOError: [Errno 9] Bad file descriptor
[1]: http://www.python.org/doc/2.5.2/lib/module-tempfile.html
[2]: http://www.python.org/doc/2.5.2/lib/os-fd-ops.html | 0 | [
2,
20059,
13,
8,
184,
107,
31,
8406,
13,
7,
210,
13,
759,
8,
3906,
3053,
20,
40,
368,
3893,
7,
20,
21,
3893,
3095,
60,
800,
3726,
3726,
636,
9577,
16877,
9,
79,
4020,
9577,
5,
6,
500,
2558,
165,
500,
4815,
13,
7,
58,
2289,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Best Practices for Performing Sequential Operations
===
What is the best way to perform a couple of tasks together and if one task fails the next tasks should not be completed? I know if it were the database operations then I should have used Transactions but I am talking about different types of operations like the following:
All tasks must pass:
SendEmail
ArchiveReportsInDatabase
CreateAFile
In the above scenario all the tasks must pass or else the whole batch operation must be aborted.
| 0 | [
2,
246,
5242,
26,
2955,
1353,
5495,
10107,
1311,
800,
3726,
3726,
98,
25,
14,
246,
161,
20,
2985,
21,
1335,
16,
8674,
429,
17,
100,
53,
3005,
13614,
14,
328,
8674,
378,
52,
44,
1066,
60,
31,
143,
100,
32,
46,
14,
6018,
1311,
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... |
Call Web Services Using Ajax or Silverlight? Which is more performant?
===
I'm building an ASP.NET AJAX application that uses JavaScript to call web services to get its data, and also uses Silverlights Isolated Storage to cache the data on the client machine. Ultimately once the data is downloaded it is passed to JavaScript which displays in on the page using the HTML DOM.
What I'm trying to figure out is, does it make sense for me to make these Web Service calls in Silverlight then pass the data to JavaScript once it's loaded? Also, Silverlight will be saving the data to disk using Isolated Storage whether I call the Web Services with JavaScript or Silverlight. If I call the Web Services with JavaScript, the data will be passed to Silverlight to cache.
I've done some prototyping both ways, and I'm finding the performance to pretty much be the same either way. Also, one of the kickers that is pointing me towards using Silverlight for the whole client-side data access layer, is I need to have timers periodically check for updated data and download it to the cache so the JavaScript can loading when it needs to.
Has anyone done anything similar to this? If so, what are your experiences relating to performance with either the JavaScript or Silverlight method described? | 0 | [
2,
645,
2741,
687,
568,
20624,
54,
1172,
3130,
60,
56,
25,
91,
2985,
1830,
60,
800,
3726,
3726,
31,
22,
79,
353,
40,
28,
306,
9,
2328,
20624,
3010,
30,
2027,
8247,
8741,
20,
645,
2741,
687,
20,
164,
82,
1054,
15,
17,
67,
2027,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Where to learn ActionScript 3.0?
===
I was just informed that I need to learn Actionscript for a project. I don't even have flash on my machine yet and I need to give a presentation on tuesday on how we will be building this.
Sooo, its time for a little cramming, where can I study up on some actionscript? | 0 | [
2,
113,
20,
2484,
1028,
8741,
203,
9,
387,
60,
800,
3726,
3726,
31,
23,
114,
5855,
30,
31,
376,
20,
2484,
1028,
8741,
26,
21,
669,
9,
31,
221,
22,
38,
166,
57,
4433,
27,
51,
1940,
768,
17,
31,
376,
20,
590,
21,
6364,
27,
9... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How do I concatinate files in a subdirectory with Unix find execute and cat into a single file?
===
I can do this:
$ find .
.
./b
./b/foo
./c
./c/foo
And this:
$ find . -type f -exec cat {} \;
This is in b.
This is in c.
But not this:
$ find . -type f -exec cat > out.txt {} \;
Why not?
| 0 | [
2,
184,
107,
31,
1065,
5782,
17939,
6488,
19,
21,
972,
10197,
93,
29,
22540,
477,
15644,
17,
2008,
77,
21,
345,
3893,
60,
800,
3726,
3726,
31,
92,
107,
48,
45,
5579,
477,
13,
9,
13,
9,
13,
9,
118,
220,
13,
9,
118,
220,
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... |
Framework to host web services on a basic hosted web server
===
Can anyone recommend a framework or basic technology to use to host a web service on a basic hosted web server?
I have data in a mySQL database that will be accessed by the web service. | 0 | [
2,
6596,
20,
2015,
2741,
687,
27,
21,
2125,
2812,
2741,
8128,
800,
3726,
3726,
92,
1276,
12360,
21,
6596,
54,
2125,
1099,
20,
275,
20,
2015,
21,
2741,
365,
27,
21,
2125,
2812,
2741,
8128,
60,
31,
57,
1054,
19,
21,
51,
18,
22402,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
Bad habits of your Scrum Master
===
Scrum is quite popular dev.process these days and often Project Manager suddenly got new title (Scrum Master). However it should be not just a new title, but new habits and new paradigm. What are the bad habits of your Scrum master? | 0 | [
2,
896,
16760,
16,
154,
26562,
1129,
800,
3726,
3726,
26562,
25,
1450,
844,
9664,
9,
16835,
158,
509,
17,
478,
669,
1382,
1605,
330,
78,
581,
13,
5,
18,
25241,
1129,
6,
9,
207,
32,
378,
44,
52,
114,
21,
78,
581,
15,
47,
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,
0,
0... |
What is the command line syntax to delete files in Perforce?
===
I am creating some build scripts that interact with Perforce and I would like to mark for delete a few files. What exactly is the P4 syntax using the command line? | 0 | [
2,
98,
25,
14,
1202,
293,
22649,
20,
27448,
6488,
19,
416,
8774,
60,
800,
3726,
3726,
31,
589,
2936,
109,
1895,
17505,
30,
10001,
29,
416,
8774,
17,
31,
83,
101,
20,
943,
26,
27448,
21,
310,
6488,
9,
98,
1890,
25,
14,
351,
300... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
Programmatically triggering events in Javascript for IE
===
When an Event is triggered by a user in IE, it is set to the `window.event` object. The only way to see what triggered the event is by accessing the `window.event` object (as far as I know)
This causes a problem in ASP.NET validators if an event is triggered programmatically, like when triggering an event through jQuery. In this case, the `window.event` object stores the last user-triggered event.
When the `onchange` event is fired programmatically for a text box that has an ASP.NET validator attached to it, the validation breaks because it is looking at the element that fired last event, which is not the element the validator is for.
Does anyone know a way around this? It seems like a problem that is solvable, but from looking online, most people just find ways to ignore the problem instead of solving it.
---
**To explain what I'm doing specifically:**
I'm using a jQuery time picker plugin on a text box that also has 2 ASP.NET validators associated with it. When the time is changed, I'm using an update panel to post back to the server to do some things dynamically, so I need the onchange event to fire in order to trigger the postback for that text box.
The jQuery time picker operates by creating a hidden unordered list that is made visible when the text box is clicked. When one of the list items is clicked, the "change" event is fired programmatically for the text box through jQuery's `change()` method.
Because the trigger for the event was a list item, IE sees the *list item* as the source of the event, not the text box, like it should.
I'm not too concerned with this ASP.NET validator working as soon as the text box is changed, I just need the change event to be processed so my postback event is called for the text box. The problem is that the validator throws an exception in IE which stops any event from being triggered.
Firefox (and I assume other browsers) don't have this issue. Only IE due to the different event model. Has anyone encountered this and seen how to fix it?
---
I've found this problem reported several other places, but they offer no solutions:
- [jQuery's forum, with the jQuery UI Datepicker and an ASP.NET Validator][1]
- [ASP.NET forums, bug with ValidatorOnChange() function][2]
[1]: http://groups.google.com/group/jquery-en/browse_thread/thread/a8902f2774edc05a/d119026f561ca528?lnk=raot
[2]: http://forums.asp.net/t/1326208.aspx | 0 | [
2,
625,
6732,
1326,
7286,
68,
963,
19,
8247,
8741,
26,
13,
660,
800,
3726,
3726,
76,
40,
807,
25,
15164,
34,
21,
4155,
19,
13,
660,
15,
32,
25,
309,
20,
14,
13,
1,
27508,
9,
4943,
38,
1,
3095,
9,
14,
104,
161,
20,
196,
98,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Can you get a Windows (AD) username in PHP?
===
I have a PHP web application on an intranet that can extract the IP and host name of the current user on that page, but I was wondering if there is a way to get/extract their Active Directory/Windows username as well. Is this possible? | 0 | [
2,
92,
42,
164,
21,
1936,
13,
5,
1283,
6,
4155,
7259,
19,
13,
26120,
60,
800,
3726,
3726,
31,
57,
21,
13,
26120,
2741,
3010,
27,
40,
14369,
2328,
30,
92,
10962,
14,
15735,
17,
2015,
204,
16,
14,
866,
4155,
27,
30,
2478,
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... |
Escaping a String from getting regex parsed in Java
===
In Java, suppose I have a String variable S, and I want to search for it inside of another String T, like so:
if (T.contains(S)) ...
But now suppose S may have unsavory characters in it. For instance, let S = "[hi". The left square bracket is going to cause the regex to fail. Is there a function I can call to escape S so that this doesn't happen? In this particular case, I would like it to be transformed to "\\[hi".
| 0 | [
2,
14700,
21,
3724,
37,
1017,
7953,
1706,
2017,
18,
69,
19,
8247,
800,
3726,
3726,
19,
8247,
15,
5787,
31,
57,
21,
3724,
7612,
13,
18,
15,
17,
31,
259,
20,
2122,
26,
32,
572,
16,
226,
3724,
13,
38,
15,
101,
86,
45,
100,
13,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How much professional liability insurance should I get?
===
I am starting a small contracting business and was wondering: how much professional liability insurance I should get? I would appreciate advice on this, especially if from someone with personal experience.
**Note**: to those who may wish to close this as not-programming related, please bear in mind that issues of personal startup are of interest to programmers, just as the kind of mouse or chair a programmer uses are of interest. So I believe this is a valid question. | 2 | [
2,
184,
212,
736,
15086,
4225,
378,
31,
164,
60,
800,
3726,
3726,
31,
589,
1422,
21,
284,
1305,
68,
508,
17,
23,
5712,
45,
184,
212,
736,
15086,
4225,
31,
378,
164,
60,
31,
83,
8831,
4978,
27,
48,
15,
1118,
100,
37,
737,
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... |
What are the best steps to start programming with TDD with C#?
===
I want to start working with TDD but I don't know really where to start. We coding with .NET (C#/ASP.NET). | 0 | [
2,
98,
50,
14,
246,
2382,
20,
799,
3143,
29,
15596,
43,
29,
272,
5910,
60,
800,
3726,
3726,
31,
259,
20,
799,
638,
29,
15596,
43,
47,
31,
221,
22,
38,
143,
510,
113,
20,
799,
9,
95,
13,
15458,
29,
13,
9,
2328,
13,
5,
150,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
get the currently logged-in windows user in Access VB
===
I found this via google: [http://www.mvps.org/access/api/api0008.htm][1] is this the best way to do it?
[1]: http://www.mvps.org/access/api/api0008.htm | 0 | [
2,
164,
14,
871,
13,
19287,
8,
108,
1936,
4155,
19,
1381,
13,
20468,
800,
3726,
3726,
31,
216,
48,
1197,
8144,
45,
636,
21127,
6903,
6483,
9,
79,
10924,
18,
9,
5583,
118,
20604,
118,
2552,
49,
118,
2552,
49,
3993,
457,
9,
9020,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Is there a way to script a table's data (temp tables too) in MS SQL 2000?
===
Given a table or a temp table, I'd like to run a procedure that will output a SQL script (i.e. a bunch of INSERT statements) that would populate the table. Is this possible in MS SQL Server 2000?
Thanks! | 0 | [
2,
25,
80,
21,
161,
20,
3884,
21,
859,
22,
18,
1054,
13,
5,
9577,
7484,
266,
6,
19,
4235,
4444,
255,
824,
60,
800,
3726,
3726,
504,
21,
859,
54,
21,
13,
9577,
859,
15,
31,
22,
43,
101,
20,
485,
21,
7004,
30,
129,
5196,
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... |
How to write acceptance tests
===
How would you go about introducing acceptance tests into a team using the .NET framework? What tools are available for this purpose?
Thanks! | 0 | [
2,
184,
20,
2757,
10156,
4894,
800,
3726,
3726,
184,
83,
42,
162,
88,
11442,
10156,
4894,
77,
21,
173,
568,
14,
13,
9,
2328,
6596,
60,
98,
4672,
50,
904,
26,
48,
2131,
60,
3669,
187,
3,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
How do I get back a 2 digit representation of a number in SQL 2000
===
I have a table on SQL2000 with a numeric column and I need the select to return a 01, 02, 03...
It currently returns 1,2,3,...10,11...
Thanks. | 0 | [
2,
184,
107,
31,
164,
97,
21,
172,
15611,
5442,
16,
21,
234,
19,
4444,
255,
824,
800,
3726,
3726,
31,
57,
21,
859,
27,
4444,
255,
3050,
29,
21,
15764,
596,
4698,
17,
31,
376,
14,
5407,
20,
788,
21,
13,
3026,
15,
13,
3564,
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... |
Recommended books on Desktop Application development using MVC
===
I'm looking for recommendations on books about MVC on the desktop. If they use Java, that is a bonus.
Some background:
I'm writing a desktop application in Java. It's an audio application that has a number of views and a central model called a Library with playlists, effects lists and a folder structure to organize them. In this application I'd like to have menus, context-menus and drag and drop support for various user actions. I've been struggling with how to achieve this using MVC.
I started with all the logic/controllers in the main class but have started to separate them out into their own classes. Now I need to start using listeners and observers to handle messages between the views and the controller. This led to me creating a number of interfaces and looping through my listeners in several places to fire off various messages. But that loop code keeps getting repeated (not DRY), so I'm assuming that now I should create different types of Event classes, create those events in my views and use a single method within the view to fire it off to the various listeners. | 0 | [
2,
5773,
964,
27,
17404,
3010,
522,
568,
307,
8990,
800,
3726,
3726,
31,
22,
79,
699,
26,
12121,
27,
964,
88,
307,
8990,
27,
14,
17404,
9,
100,
59,
275,
8247,
15,
30,
25,
21,
5708,
9,
109,
2395,
45,
31,
22,
79,
1174,
21,
174... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Time Travel functions in postgresql
===
Can anyone recommend for/against the time-travel functions in postgresql's contrib/spi module? Is there an example available anywhere?
Tnx | 0 | [
2,
85,
1773,
3719,
19,
678,
6879,
18,
22402,
800,
3726,
3726,
92,
1276,
12360,
26,
118,
24559,
14,
85,
8,
21629,
3719,
19,
678,
6879,
18,
22402,
22,
18,
1065,
38,
17980,
118,
18,
2159,
12613,
60,
25,
80,
40,
823,
904,
4922,
60,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
Populating a PHP array: check for index first?
===
If I'm deep in a nest of loops I'm wondering which of these is more efficient:
if (!isset($array[$key])) $array[$key] = $val;
or
$array[$key] = $val;
The second form is much more desirable as far as readable code goes. In reality the names are longer and the array is multidimensional. So the first form ends up looking pretty gnarly in my program.
But I'm wondering if the second form might be slower. Since the code is in the most-executed function in the program, I'd like to use the faster form.
I started writing this question yesterday and realized that the best answer was, "move the code out of the loop". Tried that, but I ended up discovering that, outside the loop, there doesn't seem to be a graceful way to get the information I need to properly formulate "$val". | 0 | [
2,
1675,
10038,
21,
13,
26120,
7718,
45,
2631,
26,
4348,
64,
60,
800,
3726,
3726,
100,
31,
22,
79,
855,
19,
21,
5618,
16,
19661,
31,
22,
79,
5712,
56,
16,
158,
25,
91,
8243,
45,
100,
13,
5,
187,
11001,
38,
5,
4403,
8576,
93,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 measure all the queries that flow through your software?
===
In one of his [blog articles][1], the proprietor of this web site posed this question to the reader, "You're automatically measuring all the queries that flow through your software, right?"
How do you do this? Every line of code that makes a query against the database is followed by a line of code that increments a counter? Or, are there tools that sit between your app and the DB and do this for you?
[1]: http://www.codinghorror.com/blog/archives/001152.html | 0 | [
2,
184,
107,
42,
4058,
65,
14,
9386,
2829,
30,
3312,
120,
154,
2306,
60,
800,
3726,
3726,
19,
53,
16,
33,
636,
220,
5567,
3376,
500,
2558,
165,
500,
15,
14,
19654,
16,
48,
2741,
689,
15760,
48,
1301,
20,
14,
7765,
15,
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... |
How do you specify a particular JRE for a Browser applet?
===
I have an third-party applet that requires JRE v1.5_12 to work correctly. THe user is installing JRE v1.6.07 or better. It used to be with 1.5 and below, that I could have multiple JRE's on the machine and specify which one to use - but with 1.6 that apepars to be broken. How do I tell the browser I want to use v1.5_12 instead of the latest one installed? | 0 | [
2,
184,
107,
42,
19077,
21,
1498,
487,
99,
26,
21,
16495,
4037,
38,
60,
800,
3726,
3726,
31,
57,
40,
422,
8,
9635,
4037,
38,
30,
4781,
487,
99,
566,
165,
9,
264,
1,
918,
20,
170,
12044,
9,
14,
4155,
25,
25429,
487,
99,
566,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Questions when moving from MbUnit to MsTest
===
Our team is looking to switch from using mbunit to mstest, but there appears to be some disconnect between the two.
Does anyone know how to simulate the CombinatorialTest and Factory attributes from mbunit when using mstest?
I think that is our only stumbling block before doing the switch. | 0 | [
2,
2346,
76,
1219,
37,
14023,
15464,
20,
4235,
10543,
800,
3726,
3726,
318,
173,
25,
699,
20,
5521,
37,
568,
14023,
15464,
20,
4235,
10543,
15,
47,
80,
1780,
20,
44,
109,
29363,
128,
14,
81,
9,
630,
1276,
143,
184,
20,
24969,
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... |
Generate table relationship diagram from existing schema (SQL Server)
===
Is there a tool around that would produce a diagram showing existing tables and their relationships given a connection to a database or by any other means?
This is for SQL Server 2008 Express Edition. | 0 | [
2,
7920,
859,
1429,
14161,
37,
3149,
23874,
13,
5,
18,
22402,
8128,
6,
800,
3726,
3726,
25,
80,
21,
5607,
140,
30,
83,
2213,
21,
14161,
3187,
3149,
7484,
17,
66,
5833,
504,
21,
2760,
20,
21,
6018,
54,
34,
186,
89,
1108,
60,
48... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0... |
Now that Python 2.6 is out, what modules should every programmer know about?
===
A lot of useful features in Python are somewhat "hidden" inside modules. Named tuples (new in [Python 2.6][1]), for instance, are found in the [collections][2] module.
The [Library Documentation page][3] will give you all the modules in the language, but newcomers to Python are likely to find themselves saying "Oh, I didn't know I could have done it *this way* using Python!" unless the important features in the language are pointed out by the experienced developers.
[1]: http://docs.python.org/whatsnew/2.6.html
[2]: http://docs.python.org/library/collections.html
[3]: http://docs.python.org/library/ | 0 | [
2,
130,
30,
20059,
172,
9,
379,
25,
70,
15,
98,
17113,
378,
352,
17968,
143,
88,
60,
800,
3726,
3726,
21,
865,
16,
4811,
967,
19,
20059,
50,
4131,
13,
7,
1822,
43,
817,
7,
572,
17113,
9,
377,
2289,
18534,
13,
5,
2681,
19,
63... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
What are your favorite string encapsulation classes?
===
.NET has System.Uri for Uris and System.IO.FileInfo for file paths. What other useful string encapsulation classes exist?
| 0 | [
2,
98,
50,
154,
3839,
3724,
1957,
4666,
18,
11123,
2684,
60,
800,
3726,
3726,
13,
9,
2328,
63,
329,
9,
3594,
26,
13,
3594,
18,
17,
329,
9,
1963,
9,
16877,
108,
4120,
26,
3893,
12074,
9,
98,
89,
4811,
3724,
1957,
4666,
18,
1112... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
How do you set a default value for a MySQL Datetime column?
===
How do you set a default value for a MySQL Datetime column?
In SQL Server it's getdate(), what is the equivalant for MySQL? I'm using 5.x if that is a factor. | 0 | [
2,
184,
107,
42,
309,
21,
12838,
1923,
26,
21,
51,
18,
22402,
1231,
891,
4698,
60,
800,
3726,
3726,
184,
107,
42,
309,
21,
12838,
1923,
26,
21,
51,
18,
22402,
1231,
891,
4698,
60,
19,
4444,
255,
8128,
32,
22,
18,
164,
8209,
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... |
Rendering order in Firefox
===
I am building the diagram component in JS. It has two layers rendered separately: foreground and background. In order to determine the required size of the background:
1. render the foreground
2. measure the height of the result
3. render the foreground and the
background together
In code it looks like this:
var foreground = renderForegroundIntoString();
parentDiv.innerHTML = foreground;
var height = parentDiv.children[0].clientHeight;
var background = renderBackgroundIntoString(height);
parentDiv.innerHTML = foreground + background;
Using IE7, this is a piece of cake. However, Firefox2 is not really willing to render the parentDiv.innerHTML right away, therefore I cannot read out the foreground height.
Could someone enlighten me on when does Firefox execute the rendering and how can I delay my background generation till foreground rendering is completed, or any alternative way to determine the height of my foreground elements?
| 0 | [
2,
15307,
389,
19,
535,
18219,
800,
3726,
3726,
31,
589,
353,
14,
14161,
5912,
19,
487,
18,
9,
32,
63,
81,
9124,
10877,
10714,
45,
26,
62,
8810,
17,
2395,
9,
19,
389,
20,
3746,
14,
1390,
1072,
16,
14,
2395,
45,
137,
9,
16535,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 create a cold fusion web service client that uses ws-security?
===
I've exposed several web services in our product using java and WS-Security. One of our customers wants to consume the web service using Coldfusion. Does coldfusion support ws-security? Can I get around it by writing a java client and using that in coldfusion?
(I don't know much about coldfusion). | 0 | [
2,
184,
107,
31,
1600,
21,
1191,
11117,
2741,
365,
6819,
30,
2027,
619,
18,
8,
17749,
60,
800,
3726,
3726,
31,
22,
195,
5043,
238,
2741,
687,
19,
318,
2374,
568,
8247,
17,
619,
18,
8,
17749,
9,
53,
16,
318,
5279,
2846,
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... |
What to use for membership in ASP.NET
===
I'm not very experienced at using ASP.NET, but I've used built in membership providers for simple WebForms application, and I found them PITA when trying to extend the way they work (add/remove few fields and redo controls accordingly).
Now I'm preparing for MVC (ASP.NET MVC or Monorail based) project, and I'm thinking - is there a better way to handle users? Have them log in/log out, keep certain parts of the site available to certain users (like logged in users, or something similar to "share this with friends" feature of many social networking sites, where you can designate users that have access to certain things.
How best to acheave this in the way that will scale well? | 0 | [
2,
98,
20,
275,
26,
4363,
19,
28,
306,
9,
2328,
800,
3726,
3726,
31,
22,
79,
52,
253,
3882,
35,
568,
28,
306,
9,
2328,
15,
47,
31,
22,
195,
147,
392,
19,
4363,
13488,
26,
1935,
2741,
4190,
18,
3010,
15,
17,
31,
216,
105,
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... |
Using Database entries to dynamically create a visio diagram
===
Is this possible?
We have a Configuration Management Database that stores information such as our servers, what datacentre they're stored in, applications that reside on them, as well as interfaces that send data from one application to another.
We would like to use Visio to connect to our SQL 2005 database, and automatically generate a flow diagram that details these dependancies and relationships.
So again - is this possible? If so, does anyone know of some documentation that details how to do this?
| 0 | [
2,
568,
6018,
11399,
20,
7782,
1326,
1600,
21,
9060,
1963,
14161,
800,
3726,
3726,
25,
48,
938,
60,
95,
57,
21,
8091,
1097,
6018,
30,
4134,
676,
145,
28,
318,
17595,
15,
98,
1054,
20830,
59,
22,
99,
8214,
19,
15,
3767,
30,
14670... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Database Design: A proper table design for large number of column values.
===
I wish to perform an experiment many different times. After every trial, I am left with a "large" set of output statistics -- let's say, 1000. I would like to store the outputs of my experiments in a table, but what's the best way...?
### Option 1
Have a table with 1000 columns. Seems like a bad idea. What if the number of statistics one day exceeds the maximum number of columns?
### Option 2
Have a table with three columns. Let's say, ID, StatisticType, and StatisticValue. That way, you can have as many statistics as you want. However, reading a single experiments statistics becomes more complicated. Moreover, what if different statistics are different data types??
Any suggestions? | 0 | [
2,
6018,
704,
45,
21,
4119,
859,
704,
26,
370,
234,
16,
4698,
4070,
9,
800,
3726,
3726,
31,
2536,
20,
2985,
40,
5737,
151,
421,
436,
9,
75,
352,
2178,
15,
31,
589,
225,
29,
21,
13,
7,
11312,
7,
309,
16,
5196,
5818,
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... |
How should I convert Java code to C# code?
===
I'm porting a Java library to C#. I'm using Visual Studio 2008, so I don't have the discontinued Microsoft Java Language Conversion Assistant program (JLCA).
My approach is to create a new solution with a similar project structure to the Java library, and to then copy the java code into a c# file and convert it to valid c# line-by-line. Considering that I find Java easy to read, the subtle differences in the two languages have surprised me.
Some things are easy to port (namespaces, inheritance etc.) but some things have been unexpectedly different, such as visibility of private members in nested classes, overriding virtual methods and the behaviour of built-in types. I don't fully understand these things and I'm sure there are lots of other differences I haven't seen yet.
I've got a long way to go on this project. What rules-of-thumb I can apply during this conversion to manage the language differences correctly? | 0 | [
2,
184,
378,
31,
8406,
8247,
1797,
20,
272,
5910,
1797,
60,
800,
3726,
3726,
31,
22,
79,
1295,
68,
21,
8247,
1248,
20,
272,
5910,
9,
31,
22,
79,
568,
3458,
1120,
570,
15,
86,
31,
221,
22,
38,
57,
14,
8921,
7099,
8247,
816,
6... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Color scaling function
===
I am trying to visualize some values on a form. They range from 0 to 200 and I would like the ones around 0 be green and turn bright red as they go to 200.
Basically the function should return color based on the value inputted. Any ideas ?
| 0 | [
2,
1665,
26829,
1990,
800,
3726,
3726,
31,
589,
749,
20,
3458,
2952,
109,
4070,
27,
21,
505,
9,
59,
978,
37,
713,
20,
2327,
17,
31,
83,
101,
14,
53,
18,
140,
713,
44,
647,
17,
805,
2673,
402,
28,
59,
162,
20,
2327,
9,
11374,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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.