unified_texts stringlengths 32 30.1k | OpenStatus_id int64 0 4 | input_ids list | token_type_ids list | attention_mask list |
|---|---|---|---|---|
Patterns for Multithreaded Network Server in C#
===
Are there any templates/patterns/guides I can follow for designing a multithreaded server? I can't find anything terribly useful online through my google searches.
My program will start a thread to listen for connections using TcpListener.
Every client connection will be handled by it's own IClientHandler thread. The server will wrap the clientHandler.HandleClient in a delegate, call BeginInvoke, and then quit caring about it.
I also need to be able to cleanly shutdown the listening thread, which is something I'm not finding a lot of exampes of online.
I'm assuming some mix of lock/AutoResetEvents/threading magic combined with the async BeginAceptTcpClient and EndAcceptTcpClient will get me there, but when it comes to networking code, to me it's all been done. So I have to believe there's just some pattern out there I can follow and not get totally confused by the myriad multithreaded corner cases I can never seem to get perfect.
Thanks. | 0 | [
2,
6282,
26,
1889,
96,
10647,
69,
982,
8128,
19,
272,
5910,
800,
3726,
3726,
50,
80,
186,
22894,
18,
118,
5972,
8766,
18,
118,
17599,
18,
31,
92,
1740,
26,
15026,
21,
1889,
96,
10647,
69,
8128,
60,
31,
92,
22,
38,
477,
602,
19... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How can I limit the maximum number of running processes within Microsoft Windows?
===
I'm looking for a way to limit the maximum number of running processes in Windows Server 2003.
Is there a registry key somewhere that controls it?
If so, which one is it? | 0 | [
2,
184,
92,
31,
4496,
14,
2979,
234,
16,
946,
5102,
363,
7099,
1936,
60,
800,
3726,
3726,
31,
22,
79,
699,
26,
21,
161,
20,
4496,
14,
2979,
234,
16,
946,
5102,
19,
1936,
8128,
973,
9,
25,
80,
21,
18269,
1246,
3493,
30,
8671,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
PowerShell functions return behavior
===
I am seeing some rather weird behavior with PowerShell, it looks like custom functions might need a "parenthesis wrapper" to evaluate as you might expect them. Given a simple PowerShell function:
function Return-True { return $true }
and then some sample code to invoke it:
PS C:\> Return-True
True
PS C:\> Return-True -eq $false
True
PS C:\> (Return-True) -eq $false
False
Ideas? Comments?
| 0 | [
2,
414,
15984,
3719,
788,
3257,
800,
3726,
3726,
31,
589,
2078,
109,
864,
5455,
3257,
29,
414,
15984,
15,
32,
1879,
101,
5816,
3719,
530,
376,
21,
13,
7,
18908,
438,
4557,
28051,
7,
20,
13,
15599,
28,
42,
530,
4186,
105,
9,
504,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
sane backup strategy for webapps
===
I'm doing a webapp and need a backup plan. Here's what I've got so far:
- nightly encrypted backup of the SQL database to Amazon S3 and my external drive (incremental if possible, not overly familiar with PostgreSQL yet, but that's another thread)
- nightly backup of my Mercurial repo (which includes Apache configs, deploy scripts, etc) to S3 (w/ local backups via Time Machine)
Should I add anything else, or will this cover it? For a gauge of how critical the data is/would be, it's a project management app along the lines of Basecamp. | 0 | [
2,
523,
62,
10119,
4427,
26,
2741,
7753,
18,
800,
3726,
3726,
31,
22,
79,
845,
21,
2741,
7753,
17,
376,
21,
10119,
944,
9,
235,
22,
18,
98,
31,
22,
195,
330,
86,
463,
45,
13,
8,
343,
102,
29403,
10119,
16,
14,
4444,
255,
601... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Can I commit only parts of my code using SVN or Mercurial?
===
I use Tortoise SVN usuallly, but I have been looking into Mercurial since it is a distributed revision control system.
What I am looking for, in both systems, is a tool that let me pick only parts of a file and commit them. If I want to do this now, I have to copy to a temp version of the file and keep only the changes I want to commit in the current version, and then copy the temp version to the current version again after committing. It's just such a hassle and the program should be able to do this for me.
I heard Git supports this, please let me know if this is correct. | 0 | [
2,
92,
31,
9686,
104,
1341,
16,
51,
1797,
568,
13,
18,
16578,
54,
9046,
3594,
192,
60,
800,
3726,
3726,
31,
275,
25691,
13,
18,
16578,
3820,
211,
93,
15,
47,
31,
57,
74,
699,
77,
9046,
3594,
192,
179,
32,
25,
21,
4387,
11323,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
In ASP.Net, can we create an application with it's own Web.Config and Forms Authentication section inside another application using Forms Authentication?
===
I have an application that uses Forms Authentication to authenticate one type of user. There is a section in this application that needs to be authenticated for another type of user using a different table in the database. The problem happens if the second type of user's session times out, she is taken to the login page defined in the Forms Authentication section of the main Web.Config instead of the login page for the second type of user. I am looking for solutions to this problem. One idea is to create an application in IIS for the section and create a Web.Config for the folder and add another Forms Authentication section. In my experiments, it seems this doesn't work. Am I missing something obvious? Any insights? | 0 | [
2,
19,
28,
306,
9,
2328,
15,
92,
95,
1600,
40,
3010,
29,
32,
22,
18,
258,
2741,
9,
14093,
2816,
17,
1997,
27963,
1050,
572,
226,
3010,
568,
1997,
27963,
60,
800,
3726,
3726,
31,
57,
40,
3010,
30,
2027,
1997,
27963,
20,
14351,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Best way to determine whether a XML attribute exists in Flex
===
I have a XML response from an HTTPService call with the e4x result format.
<pre>
<code>
<?xml version="1.0" encoding="utf-8"?>
<Validation Error="Invalid Username/Password Combination" />
</code>
</pre>
I have tried:
<pre>
<code>
private function callback(event:ResultEvent):void {
if(event.result..@Error) {
// error attr present
}
else {
// error attr not present
}
}
</code>
</pre>
This does not seem to work (it always thinks that the error attribute exits) what is the best way to do this? thanks.
<b>EDIT:</b> I have also tried to compare the attribute to null and an empty string without such success... | 0 | [
2,
246,
161,
20,
3746,
1472,
21,
23504,
35,
14755,
5636,
19,
14409,
800,
3726,
3726,
31,
57,
21,
23504,
1627,
37,
40,
7775,
11449,
645,
29,
14,
13,
62,
300,
396,
829,
2595,
9,
13,
1,
3515,
1,
13,
1,
9375,
1,
279,
255,
38,
73... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Best Books for Learning Java 6?
===
What are the Best Books for Learning Java 6?
Regads,
Phani | 4 | [
2,
246,
964,
26,
2477,
8247,
400,
60,
800,
3726,
3726,
98,
50,
14,
246,
964,
26,
2477,
8247,
400,
60,
7953,
1283,
18,
15,
13,
9944,
49,
3,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
AVI Animations for GUI
===
I need to get some AVI animations for use with the Borland VCL TAnimate component, to display during operations such as 'online update', 'burning cd' and a few others.
I have only come across the [glyFX Animation Pack][1] so far.
Can anybody recomend other places to get nice avi animations?
Thanks in advance.
[1]: http://www.glyfx.com/shop/detail/animationpack/ | 0 | [
2,
13,
5271,
6236,
18,
26,
9457,
800,
3726,
3726,
31,
376,
20,
164,
109,
13,
5271,
6236,
18,
26,
275,
29,
14,
3895,
618,
566,
5316,
13,
10606,
5281,
5912,
15,
20,
3042,
112,
1311,
145,
28,
13,
22,
218,
1143,
11100,
22,
15,
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... |
Determining available bandwidth
===
What is the best way to determine available bandwidth in .NET?
We have users that access business applications from various remote access points, wired and wireless and at times the bandwidth can be very low based on where the user is. When the applications appear to be running slow, the issue could be due to low bandwidth and not some other issue.
I would like to be able to run some kind of service that would warn users whenever the available bandwidth dips below a specific threshold.
Any thoughts? | 0 | [
2,
13521,
904,
23392,
800,
3726,
3726,
98,
25,
14,
246,
161,
20,
3746,
904,
23392,
19,
13,
9,
2328,
60,
95,
57,
3878,
30,
1381,
508,
3767,
37,
617,
5388,
1381,
819,
15,
21124,
17,
10149,
17,
35,
436,
14,
23392,
92,
44,
253,
70... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
uses for hypothetical indexes
===
Does anybody know what hypothetical indexes are used for in sqlserver 2000? I have a table with 15+ such indexes, but have no idea what they were created for. Can they slow down deletes/inserts?
Thanks,
Sergio Bastos | 0 | [
2,
2027,
26,
26161,
4348,
160,
800,
3726,
3726,
630,
11181,
143,
98,
26161,
4348,
160,
50,
147,
26,
19,
4444,
255,
10321,
106,
824,
60,
31,
57,
21,
859,
29,
357,
2430,
145,
4348,
160,
15,
47,
57,
90,
882,
98,
59,
46,
679,
26,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Characteristics of a Death March project
===
In software development, a death march project generally refers to a project that has a fixed release date with fixed functionality and fixed resources - resulting in crazy demands from management that developers work extra long hours and weekends.
What do you think a death march project is and how does it come about?
| 0 | [
2,
5626,
16,
21,
372,
285,
669,
800,
3726,
3726,
19,
2306,
522,
15,
21,
372,
285,
669,
1469,
3806,
20,
21,
669,
30,
63,
21,
3535,
830,
1231,
29,
3535,
18548,
17,
3535,
2566,
13,
8,
2927,
19,
3328,
7311,
37,
1097,
30,
10168,
17... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How to move asp.net/ajax control BEFORE page loading?
===
I have an Panel control that I need to maintain position across postbacks. I am able to do this by maintaining a cookie which is read each time the page is loaded to get the position of the Panel before the page is loaded.
The problem is, the page is loaded, then repositioned which causes this brief flash where the control is at its default location and jumps to the location it was at prior to postback.
Is there a way to prevent this? I want the control to move to its position first, THEN have it displayed to prevent this "flash".
| 0 | [
2,
184,
20,
780,
28,
306,
9,
2328,
118,
6881,
7522,
569,
115,
2478,
12797,
60,
800,
3726,
3726,
31,
57,
40,
4113,
569,
30,
31,
376,
20,
4027,
649,
464,
678,
1958,
18,
9,
31,
589,
777,
20,
107,
48,
34,
8215,
21,
19980,
56,
25... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Edit php.ini with .htaccess
===
I'm slowly getting back into PHP, and now I run into a problem, I want to install some web software on our host and I need to have either the latest Zend (which they don't have) or IonCube on the server and IonCube requires enable_dl to be on in the php.ini. Now a colleague of mine thinks I can update this via an .htaccess file on the server. So I created a s.htaccess on my machine as Windows doesn't like emptiness before the file extension. So I added the line php_flag enable_dl On to the file uploaded it and renamed the file to just .htaccess on the server. When I refresh the file is gone, when I keep it as s.htaccess it's fine but my php info still shows it as Off.
What n00b mistake am I making? | 0 | [
2,
9392,
13,
26120,
9,
2651,
29,
13,
9,
9020,
20604,
800,
3726,
3726,
31,
22,
79,
1447,
1017,
97,
77,
13,
26120,
15,
17,
130,
31,
485,
77,
21,
1448,
15,
31,
259,
20,
16146,
109,
2741,
2306,
27,
318,
2015,
17,
31,
376,
20,
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... |
Opinions on DBCook?
===
I'm looking for opinions on the [DBCook framework][1] as a declarative wrapper for SQLAlchemy.. Has anyone used it?
Thanks for your time!
[1]: http://dbcook.sf.net/readme | 2 | [
2,
11900,
27,
13,
9007,
20840,
60,
800,
3726,
3726,
31,
22,
79,
699,
26,
11900,
27,
14,
636,
9007,
20840,
6596,
500,
2558,
165,
500,
28,
21,
121,
12078,
3366,
28051,
26,
4444,
10834,
2569,
915,
9,
9,
63,
1276,
147,
32,
60,
3669,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Not Nil shortcut in Delphi
===
What standard library function asserts that an object is not nil? | 0 | [
2,
52,
1781,
255,
502,
4118,
19,
23030,
800,
3726,
3726,
98,
1236,
1248,
1990,
10908,
18,
30,
40,
3095,
25,
52,
1781,
255,
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... | [
1,
1,
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... |
Boost Library
===
Since I have started using this site, I keep hearing about the Boost library. I am wondering what are some of the major benefits of the Boost library (hence why should I use it) and how portable is the Boost library? | 0 | [
2,
10419,
1248,
800,
3726,
3726,
179,
31,
57,
373,
568,
48,
689,
15,
31,
643,
3229,
88,
14,
10419,
1248,
9,
31,
589,
5712,
98,
50,
109,
16,
14,
394,
5800,
16,
14,
10419,
1248,
13,
5,
252,
2940,
483,
378,
31,
275,
32,
6,
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,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
How do eliminate the flicker effect on ajax call
===
I am encountering a problem: on an html page, when i click a certain control (a tab panel title) i make an ajax call. From Wicket (java code) i call a javascript function that "redraws" all the componenets on my page (this is like a reload of the page). Everytime i do this i get a flickering effect on the html (which, as i said, after the ajax call will trigger a redrawing of all the components on the page).
I am triggering the javascript function (that redraws) because i need to "redraw" using the new information supplied by the ajax response (the response gives me a new table for instance and i have to redraw, repaint the page using this new info as a sort of parameter, according to it). | 0 | [
2,
184,
107,
10628,
14,
18709,
1590,
27,
20624,
645,
800,
3726,
3726,
31,
589,
7007,
68,
21,
1448,
45,
27,
40,
13,
15895,
2478,
15,
76,
31,
10840,
21,
1200,
569,
13,
5,
58,
6523,
4113,
581,
6,
31,
233,
40,
20624,
645,
9,
37,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
HTTP vs HTTPS performance
===
Are there any major differences in performance between http and https? I seem to recall reading that https can be up to 1/5 times slower than http. Is this valid with the current generation webservers/browsers? If so, are there any whitepapers to support it? | 0 | [
2,
7775,
4611,
7775,
18,
956,
800,
3726,
3726,
50,
80,
186,
394,
4921,
19,
956,
128,
7775,
17,
7775,
18,
60,
31,
2260,
20,
7111,
1876,
30,
7775,
18,
92,
44,
71,
20,
137,
18133,
436,
14085,
119,
7775,
9,
25,
48,
7394,
29,
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... |
Package dependencies
===
What are the possibilities to enforce certain package dependencies in a java build system?
E.g. the myapp.server.bl.Customer class not allowed to refer to the myapp.client.ui.customlayout package.
I'm interested in either Ant or IDE-specific solutions.
I'd like to get an error message in the build process indicating that a (custom) package dependency rule has been violated and
the build aborted. I also would like to maintain the dependencies in a list, preferably in a text file, outside of the ant
scripts or ide project files.
(I don't know Maven but I've read it here it has better support for module dependency management)
| 0 | [
2,
6030,
29411,
800,
3726,
3726,
98,
50,
14,
13086,
20,
16525,
1200,
6030,
29411,
19,
21,
8247,
1895,
329,
60,
13,
62,
9,
263,
9,
14,
51,
7753,
9,
10321,
106,
9,
6287,
9,
4636,
262,
1263,
718,
52,
1159,
20,
5017,
20,
14,
51,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Prevent Text Wrap in DataGrid
===
I have a problem with a data-bound DataGrid control, in that despite each column having its Wrap property set to false, the text still wraps. It seems to only do this on IE, and not FF. | 0 | [
2,
2501,
1854,
8118,
19,
1054,
16375,
800,
3726,
3726,
31,
57,
21,
1448,
29,
21,
1054,
8,
7410,
1054,
16375,
569,
15,
19,
30,
869,
206,
4698,
452,
82,
8118,
1354,
309,
20,
4997,
15,
14,
1854,
174,
8118,
18,
9,
32,
2206,
20,
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,
0,
0,
0,
0,
0,
0... |
ASP.NET GridView postback not setting posted controls' values
===
When adding an EditItemTemplate of some complexity (mulitple fields in one template), and then parsing the controls from the RowUpdating event, the controls that were manually entered by the user have no values. My guess is there is something going on with when the data is bound, but I've had instances where simply adding and attribute to a control in codebehind started the behavior and removing that code made the code work. As a work-around, I can Request(controlname.UniqueId) to get it's value, but that is rather a hack. | 0 | [
2,
28,
306,
9,
2328,
7354,
4725,
678,
1958,
52,
2697,
6054,
8671,
22,
4070,
800,
3726,
3726,
76,
4721,
40,
9392,
2119,
79,
9577,
6554,
16,
109,
12745,
13,
5,
10965,
242,
5106,
2861,
19,
53,
22894,
6,
15,
17,
94,
2017,
18,
68,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Virtualized SQL Server: Why not?
===
The IT department where I work it trying to move to completely virtualized servers, with all the data stored on a SAN. They haven't done it yet, but the plan eventually calls for moving the SQL Server systems to virtual servers as well.
A few months ago I attended the Heroes Happen Here launch event, and in one of the SQL Server sessions the speaker mentioned in passing that this is not a good idea.
So I'm looking for a few things:
1. What are the specific reasons why this is or is not a good idea? I need references, or don't bother responding. I could come up with a vague "I/O bound" response on my own.
2. The HHH speaker recollection alone probably won't convince our IT department to change their minds. Can anyone point me directly to something more authoritative? And by "directly", I mean something more specific than just a vague Books OnLine comment. Please narrow it down a little. | 0 | [
2,
6599,
1333,
4444,
255,
8128,
45,
483,
52,
60,
800,
3726,
3726,
14,
32,
604,
113,
31,
170,
32,
749,
20,
780,
20,
1524,
6599,
1333,
17595,
15,
29,
65,
14,
1054,
8214,
27,
21,
523,
9,
59,
2933,
22,
38,
677,
32,
768,
15,
47,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
What IDE would be good for linux kernel driver development
===
I am using ubuntu 8.04.1 and i am trying to write a character driver in kernel mode.
What would be a good ide, ideally with code completion, to do that ?
| 0 | [
2,
98,
13,
3448,
83,
44,
254,
26,
13024,
17007,
2425,
522,
800,
3726,
3726,
31,
589,
568,
287,
12968,
2473,
469,
9,
3277,
9,
165,
17,
31,
589,
749,
20,
2757,
21,
925,
2425,
19,
17007,
3740,
9,
98,
83,
44,
21,
254,
13,
3448,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
Setting per-file flags with automake
===
Is there a way set flags on a per-file basis with automake?
In particular, if I have a c++ project and want to compile with -WAll all the files except one for which I want to disable a particular warning, what could I do?
The automake manual (chapter 17, Changing Automake behavior) says:
`‘-Wcategory’ or ‘--warnings=category’: These options behave exactly like their command-line counterpart. This allows you to enable or disable some warning categories on a per-file basis`
but no practical example is provided.
I tried something like:
CXXFLAGS = -WAll ...
bin_PROGRAMS = test
test_SOURCES = main.cpp utility.cpp
utility_o_CXXFLAGS = $(CXXFLAGS) -Wno-unused-value
but it didn't work.
| 0 | [
2,
2697,
416,
8,
16877,
9318,
29,
3108,
11115,
800,
3726,
3726,
25,
80,
21,
161,
309,
9318,
27,
21,
416,
8,
16877,
2239,
29,
3108,
11115,
60,
19,
1498,
15,
100,
31,
57,
21,
272,
20512,
669,
17,
259,
20,
26561,
29,
13,
8,
6051,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Practical Uses for the "Curiously Recurring Template Pattern"
===
What are some practical Uses for the "Curiously Recurring Template Pattern"? The "counted class" example commonly shown just isn't a convincing example to me. | 0 | [
2,
5713,
2027,
26,
14,
13,
7,
4734,
18190,
11344,
22894,
3732,
7,
800,
3726,
3726,
98,
50,
109,
5713,
2027,
26,
14,
13,
7,
4734,
18190,
11344,
22894,
3732,
7,
60,
14,
13,
7,
16549,
69,
718,
7,
823,
2524,
1721,
114,
2532,
22,
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,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
HTTP Authentication in .NET
===
Is it possible to create a .NET equivalent to the following code?
<?php
if (!isset($_SERVER['PHP_AUTH_USER'])) {
header('WWW-Authenticate: Basic realm="My Realm"');
header('HTTP/1.0 401 Unauthorized');
echo 'Text to send if user hits Cancel button';
exit;
} else {
echo "<p>Hello {$_SERVER['PHP_AUTH_USER']}.</p>";
echo "<p>You entered {$_SERVER['PHP_AUTH_PW']} as your password.</p>";
}
?>
I would like to be able to define a static user/password in the web.config as well. This is very easy to do in PHP, haven't seen anything explaining how to do this in MSDN.
| 0 | [
2,
7775,
27963,
19,
13,
9,
2328,
800,
3726,
3726,
25,
32,
938,
20,
1600,
21,
13,
9,
2328,
4602,
20,
14,
249,
1797,
60,
13,
1,
60,
26120,
100,
13,
5,
187,
11001,
38,
5,
4403,
1,
10321,
106,
2558,
22,
26120,
1,
1346,
96,
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... |
Adobe Air book - from HTML/Javascript perspective
===
Can anyone recommend a good book on Adobe Air?
The book I'm looking for should be on how Air works using HTML and JavaScript.
I'm **not** interested in the Flash/Flex part. | 0 | [
2,
20299,
282,
360,
13,
8,
37,
13,
15895,
118,
1004,
1385,
8741,
6531,
800,
3726,
3726,
92,
1276,
12360,
21,
254,
360,
27,
20299,
282,
60,
14,
360,
31,
22,
79,
699,
26,
378,
44,
27,
184,
282,
693,
568,
13,
15895,
17,
8247,
874... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
SQL Server 2000 and System.Transactions.TransactionScope()
===
Is it possible to create LIGHTWEIGHT transactions using TransactionScope() with SQL2000? Or if not, is there a workaround using CommitableTransaction and/or something similar?
| 0 | [
2,
4444,
255,
8128,
824,
17,
329,
9,
7028,
8645,
18,
9,
7028,
8645,
11555,
5,
6,
800,
3726,
3726,
25,
32,
938,
20,
1600,
13613,
13147,
568,
12799,
11555,
5,
6,
29,
4444,
255,
3050,
60,
54,
100,
52,
15,
25,
80,
21,
170,
10037,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
New Date/Time data types in SQL 2008
===
I am trying to use the new DATETIMEOFFSET data type in SQL 2008 but I can't figure out how to get the DATETIMEOFFSET '2008-09-27 21:28:17.2930000 -07:00' to show as '2008-09-27 14:28:17.2930000' (basically applying the offset to show the local time).
Does anyone know how to do this? | 0 | [
2,
78,
1231,
118,
891,
1054,
2551,
19,
4444,
255,
570,
800,
3726,
3726,
31,
589,
749,
20,
275,
14,
78,
1231,
891,
1299,
3554,
1054,
1001,
19,
4444,
255,
570,
47,
31,
92,
22,
38,
1465,
70,
184,
20,
164,
14,
1231,
891,
1299,
355... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 superscript character into a Powerbuilder textbox?
===
Is there any way to do this in the Powerbuilder properties window for a datawindow's textbox? | 0 | [
2,
184,
107,
42,
3547,
21,
1026,
8741,
925,
77,
21,
414,
20904,
1854,
5309,
60,
800,
3726,
3726,
25,
80,
186,
161,
20,
107,
48,
19,
14,
414,
20904,
3704,
1463,
26,
21,
1054,
27508,
22,
18,
1854,
5309,
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... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
How to generate barcodes in vb.net
===
I want to create barcodes from my application. I'm not sure yet which encoding I need to be using, but I'm pretty sure it will be a 1-dimensional barcode (will update this when I know more).
Are there any free libraries out there that I can use? I've Googled, but all haven't found anything free or open source.
I know I can use a font for this, but I'd prefer not to as I'd have to register the font on the server and I've had some pretty bad experiences with that. | 0 | [
2,
184,
20,
7920,
748,
9375,
18,
19,
13,
20468,
9,
2328,
800,
3726,
3726,
31,
259,
20,
1600,
748,
9375,
18,
37,
51,
3010,
9,
31,
22,
79,
52,
562,
768,
56,
19608,
31,
376,
20,
44,
568,
15,
47,
31,
22,
79,
1772,
562,
32,
129... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Dynamic Sorting within SQL Stored Procedures
===
This is an issue that I've spent hours researching in the past. It seems to me to be something that should have been addressed by modern RDBMS solutions but as yet I have not found anything that really addresses what I see to be an incredibly common need in any Web or Windows application with a database back-end.
I speak of dynamic sorting. In my fantasy world, it should be as simple as something like:
ORDER BY @sortCol1, @sortCol2
This is the canononical example given by newbie SQL and Stored Procedure developers all over forums across the internet. "Why isn't this possible?" they ask. Invariably, somebody eventually comes along to lecture them about the compiled nature of stored procedures, of execution plans in general, and all sorts of other reasons why it isn't possible to put a parameter directly into an `ORDER BY` clause.
----------
I know what some of you are already thinking: "Let the client do the sorting, then." Naturally, this offloads the work from your database. In our case though, our database servers aren't even breaking a sweat 99% of the time and they aren't even multi-core yet or any of the other myriad improvements to system architecture that happen every 6 months. For this reason alone, having our databases handle sorting wouldn't be a problem. Additionally, databases are *very* good at sorting. They are optimized for it and have had years to get it right, the language for doing it is incredibly flexible, intuitive, and simple and above-all any beginner SQL writer knows how to do it and even more importantly they know how to edit it, make changes, do maintenance, etc. When your databases are far from being taxed and you just want to simplify (and shorten!) development time this seems like an obvious choice.
Then there's the web issue. I've played around with JavaScript that will do client-side sorting of HTML tables, but they inevitably aren't flexible enough for my needs and, again, since my databases aren't overly taxed and can do sorting really *really* easily, I have a hard time justifying the time it would take to re-write or roll-my-own JavaScript sorter. The same generally goes for server-side sorting, though it is already probably much preferred over JavaScript. I'm not one that particularly likes the overhead of DataSets, so sue me.
But this brings back the point that it isn't possible — or rather, not easily. I've done, with prior systems, an incredibly hack way of getting dynamic sorting. It wasn't pretty, nor intuitive, simple, or flexible and a beginner SQL writer would be lost within seconds. Already this is looking to be not so much a "solution" but a "complication."
----------
The following examples are not meant to expose any sort of best practices or good coding style or anything, nor are they indicative of my abilities as a T-SQL programmer. They are what they are and I fully admit they are confusing, bad form, and just plain hack.
We pass an integer value as a parameter to a stored procedure (let's call the parameter just "sort") and from that we determine a bunch of other variables. For example... let's say sort is 1 (or the default):
DECLARE @sortCol1 AS varchar(20)
DECLARE @sortCol2 AS varchar(20)
DECLARE @dir1 AS varchar(20)
DECLARE @dir2 AS varchar(20)
DECLARE @col1 AS varchar(20)
DECLARE @col2 AS varchar(20)
SET @col1 = 'storagedatetime';
SET @col2 = 'vehicleid';
IF @sort = 1 -- default sort
BEGIN
SET @sortCol1 = @col1;
SET @dir1 = 'asc';
SET @sortCol2 = @col2;
SET @dir2 = 'asc';
END
ELSE IF @sort = 2 -- reversed order default sort
BEGIN
SET @sortCol1 = @col1;
SET @dir1 = 'desc';
SET @sortCol2 = @col2;
SET @dir2 = 'desc';
END
You can already see how if I declared more @colX variables to define other columns I could really get creative with the columns to sort on based on the value of "sort"... to use it, it usually ends up looking like the following incredibly messy clause:
ORDER BY
CASE @dir1
WHEN 'desc' THEN
CASE @sortCol1
WHEN @col1 THEN [storagedatetime]
WHEN @col2 THEN [vehicleid]
END
END DESC,
CASE @dir1
WHEN 'asc' THEN
CASE @sortCol1
WHEN @col1 THEN [storagedatetime]
WHEN @col2 THEN [vehicleid]
END
END,
CASE @dir2
WHEN 'desc' THEN
CASE @sortCol2
WHEN @col1 THEN [storagedatetime]
WHEN @col2 THEN [vehicleid]
END
END DESC,
CASE @dir2
WHEN 'asc' THEN
CASE @sortCol2
WHEN @col1 THEN [storagedatetime]
WHEN @col2 THEN [vehicleid]
END
END
Obviously this is a very stripped down example. The real stuff, since we usually have four or five columns to support sorting on, each with possible secondary or even a third column to sort on in addition to that (for example date descending then sorted secondarily by name ascending) and each supporting bi-directional sorting which effectively doubles the number of cases. Yeah... it gets hairy really quick.
The idea is that one could "easily" change the sort cases such that vehicleid gets sorted before the storagedatetime... but the pseudo-flexibility, at least in this simple example, really ends there. Essentially, each case that fails a test (because our sort method doesn't apply to it this time around) renders a NULL value. And thus you end up with a clause that functions like the following:
ORDER BY NULL DESC, NULL, [storagedatetime] DESC, blah blah
You get the idea. It works because SQL Server effectively ignores null values in order by clauses. This is incredibly hard to maintain, as anyone with any basic working knowledge of SQL can probably see. If I've lost any of you, don't feel bad. It took us a long time to get it working and we still get confused trying to edit it or create new ones like it. Thankfully it doesn't need changing often, otherwise it would quickly become "not worth the trouble."
Yet it *did* work.
----------
My question is then: **is there a better way?**
I'm okay with solutions other than Stored Procedure ones, as I realize it may just not be the way to go. Preferably, I'd like to know if anyone can do it better within the Stored Procedure, but if not, how do you all handle letting the user dynamically sort tables of data (bi-directionally, too) with ASP.NET?
And thank you for reading (or at least skimming) such a long question!
PS Be glad I didn't show my example of a stored procedure that supports dynamic sorting, dynamic filtering/text-searching of columns, pagination via ROWNUMBER() OVER, *AND* try...catch with transaction rollbacking on errors... "behemoth-sized" doesn't even begin to describe them. | 0 | [
2,
7782,
2058,
68,
363,
4444,
255,
8214,
8876,
800,
3726,
3726,
48,
25,
40,
1513,
30,
31,
22,
195,
1111,
974,
527,
68,
19,
14,
640,
9,
32,
2206,
20,
55,
20,
44,
301,
30,
378,
57,
74,
7832,
34,
773,
13,
897,
13178,
18,
6776,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Low-level details of the implementation of performSelectorOnMainThread:
===
Was wondering if anyone knows, or has pointers to good documentation that discusses, the low-level implementation details of Cocoa's 'performSelectorOnMainThread:' method.
My best guess, and one I think is probably pretty close, is that it uses mach ports or an abstraction on top of them to provide intra-thread communication, passing selector information along as part of the mach message.
Right? Wrong? Thanks! | 0 | [
2,
708,
8,
3906,
3289,
16,
14,
6123,
16,
11563,
16964,
248,
218,
6232,
96,
10647,
45,
800,
3726,
3726,
23,
5712,
100,
1276,
3620,
15,
54,
63,
454,
445,
20,
254,
13945,
30,
18272,
15,
14,
708,
8,
3906,
6123,
3289,
16,
24507,
22,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
What are some ways of accessing Microsoft SQL Server from Linux?
===
We have a Windows machine running SQL Server 2005, and we need to be able to run some database queries on it from a Linux box. What are some of the recommended ways of doing this? Ideally, we would want a command-line utility similar to sqlcmd on Windows. | 0 | [
2,
98,
50,
109,
2847,
16,
1381,
68,
7099,
4444,
255,
8128,
37,
13024,
60,
800,
3726,
3726,
95,
57,
21,
1936,
1940,
946,
4444,
255,
8128,
812,
15,
17,
95,
376,
20,
44,
777,
20,
485,
109,
6018,
9386,
2829,
27,
32,
37,
21,
13024,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Customizing Visual Studio's Intellisense
===
A recent project had me working with C# again, and I noticed something I hadn't before -- C#'s Intellisense shows possible exceptions that can be thrown when calling a method
![C# Method Help Intellisense][1]
Since I work mostly with VB.NET applications, it'd be really nice to have this feature in those applications as well, but it's unfortunately absent from VB's Intellisense
![VB.NET Method Help Intellisense][2]
Is there any quick and easy way I can customize Visual Studio's Intellisense to show exceptions (as well as other members from the XML comments)? Or am I looking at a full modification using the SDK?
[1]: http://i38.tinypic.com/2vl4ldg.png "C# Method Help Intellisense"
[2]: http://i33.tinypic.com/2v1lxf9.png "VB.NET Method Help Intellisense" | 0 | [
2,
5816,
3335,
3458,
1120,
22,
18,
14635,
3159,
6498,
800,
3726,
3726,
21,
1764,
669,
41,
55,
638,
29,
272,
5910,
188,
15,
17,
31,
2711,
301,
31,
1241,
22,
38,
115,
13,
8,
8,
272,
5910,
22,
18,
14635,
3159,
6498,
1285,
938,
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 does Stackoverflow implement the resizable textarea?
===
How does Stackoverflow implement the resizable textarea?
Is that something they rolled themselves or is it a publicly available component that I can easily attach to textareas on my sites?
I found this question and it doesn't quite do what I want.
[autosizing-textarea](http://stackoverflow.com/questions/7477/autosizing-textarea)
That talks more about automatically resizing textareas whereas I want the little grab-area that you can drag up and down. | 0 | [
2,
184,
630,
7566,
2549,
9990,
8713,
14,
10719,
3186,
579,
1854,
17760,
60,
800,
3726,
3726,
184,
630,
7566,
2549,
9990,
8713,
14,
10719,
3186,
579,
1854,
17760,
60,
25,
30,
301,
59,
2958,
1366,
54,
25,
32,
21,
6713,
904,
5912,
30... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How can circular dependencies be avoided when callbacks are used?
===
How can you avoid circular dependencies when you're designing two classes with a producer/consumer relationship? Here ListenerImpl needs a reference to Broadcaster in order to register/unregister itself, and Broadcaster needs a reference back to the Listeners in order to send messages. This example is in Java but it can apply to and OO language.
public interface Listener {
void callBack(Object arg);
}
public class ListenerImpl implements Listener {
public Foo(Broadcaster b) { b.register(this); }
public void callBack(Object arg) { ... }
public void shutDown() { b.unregister(this); }
}
public class Broadcaster {
private final List listeners = new ArrayList();
public void register(Listener lis) { listeners.add(lis); }
public void unregister(Listener lis) {listeners.remove(lis); }
public void broadcast(Object arg) { for (Listener lis : listeners) { lis.callBack(arg); } }
}
| 0 | [
2,
184,
92,
8155,
29411,
44,
9460,
76,
645,
1958,
18,
50,
147,
60,
800,
3726,
3726,
184,
92,
42,
2658,
8155,
29411,
76,
42,
22,
99,
15026,
81,
2684,
29,
21,
1421,
118,
12124,
723,
106,
1429,
60,
235,
21772,
8983,
255,
2274,
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... |
IIS 6, Wildcard Application Mapping, and FrontPage
===
While I'd love to get rid of requiring FrontPage Extensions on a heavy traffic site I host, the client requires it to administrate the site. Having just implemented Wildcard Application Mapping in IIS 6 on this site in order to provide integrated Forms Authentication security between ASP and ASP.NET resources, this breaks FrontPage extensions. Everything works like a charm, including encrypting and caching roles that are now available even to ASP, except for the loss of FrontPage. Specifically, you cannot even login to FrontPage administration (incorrect credentials).
Has anyone gotten FrontPage to work with Wildcard Application Mapping routing through the ASP.NET 2.0 aspnet_isapi.dll?
| 0 | [
2,
595,
18,
400,
15,
23003,
3010,
13305,
15,
17,
431,
6486,
800,
3726,
3726,
133,
31,
22,
43,
339,
20,
164,
6681,
16,
9052,
431,
6486,
17529,
27,
21,
1278,
2227,
689,
31,
2015,
15,
14,
6819,
4781,
32,
20,
27932,
591,
14,
689,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
I have a 100+MB XML file (sans-DTD/Schema). XSLT won't have it. Strategies for transforming/parsing?
===
This XML file contained archived news stories for all of last year. I was asked to sort these stories by story categor[y|ies] into new XML files.
big_story_export.xml
turns into
lifestyles.xml
food.xml
nascar.xml
...and so on.
I got the job done using a one-off python script, *however*, **I originally attempted this using XSLT**. This resulted in frustration as my XPATH selections were crapping the bed. Test files were transformed perfectly, but putting the big file up against my style sheet resulted in ...*nothing*.
What strategies do you recommend for ensuring that files like this will run through XSLT? *This was handed to me by a vendor, so imagine that I don't have a lot of leverage when it comes to defining the structure of this file.*
If you guys want code samples, I'll put some together.
If anything, I'd be satisfied with some tips for making XML+XSLT work together smoothly. | 0 | [
2,
31,
57,
21,
808,
2430,
5024,
23504,
3893,
13,
5,
2729,
18,
8,
43,
38,
43,
118,
7526,
540,
6,
9,
993,
18,
255,
38,
230,
22,
38,
57,
32,
9,
10272,
26,
22335,
118,
3574,
18,
68,
60,
800,
3726,
3726,
48,
23504,
3893,
3437,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Adding a caption to an equation in LaTeX
===
Well, it seems simple enough, but I can't find a way to add a caption to an equation.
The caption is needed to explain the variables used in the equation, so some kind of table-like structure to keep it all aligned and pretty would be great. | 0 | [
2,
4721,
21,
26622,
20,
40,
8020,
19,
456,
396,
800,
3726,
3726,
134,
15,
32,
2206,
1935,
511,
15,
47,
31,
92,
22,
38,
477,
21,
161,
20,
3547,
21,
26622,
20,
40,
8020,
9,
14,
26622,
25,
851,
20,
3271,
14,
12157,
147,
19,
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... |
Disk-backed STL container classes?
===
I enjoy developing algorithms using the STL, however, I have this recurring problem where my data sets are too large for the heap.
I have been searching for drop-in replacements for STL containers and algorithms which are disk-backed, i.e. the data structures on stored on disk rather than the heap.
A friend recently pointed me towards [stxxl][1]. Before I get too involved with it... Are any other disk-backed STL replacements available that I should be considering?
**NOTE: I'm not interested in persistence or embedded databases. Please don't mention boost::serialization, POST++, Relational Template Library, Berkeley DB, sqlite, etc. I am aware of these projects and use them when they are appropriate for my purposes.**
[1]: http://stxxl.sourceforge.net | 0 | [
2,
8582,
8,
18614,
354,
255,
12147,
2684,
60,
800,
3726,
3726,
31,
4696,
3561,
15935,
568,
14,
354,
255,
15,
207,
15,
31,
57,
48,
11344,
1448,
113,
51,
1054,
3415,
50,
266,
370,
26,
14,
15414,
9,
31,
57,
74,
5792,
26,
2804,
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... |
Pascal casing or Camel Casing for C# code?
===
I've been arguing with my coworkers about this since they are used to camel casing for everything from table names in SQL databases to property naming in C# code but I like pascal casing better, camel casing for variables and pascal casing for properties:
string firstName;
public string FirstName {
...
}
But they are used to this:
string _firstname;
public string firstName {
...
}
I try to keep up with their "standard" so code looks the same but I just dont like it.
I've seen that at least the .Net framework uses this convention and that is how I try to keep my code eg:
System.Console.WriteLine("string")
What do you use/prefer and why? Im sorry if somebody else asked this question but I searched and did not find anything. | 0 | [
2,
18661,
7167,
68,
54,
15386,
7167,
68,
26,
272,
5910,
1797,
60,
800,
3726,
3726,
31,
22,
195,
74,
9000,
29,
51,
326,
16355,
88,
48,
179,
59,
50,
147,
20,
15386,
7167,
68,
26,
796,
37,
859,
1817,
19,
4444,
255,
6018,
18,
20,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
What does the code if ( blah(), 5) {} do?
===
What does the following code do?
if ( blah(), 5) {
//do something
}
| 0 | [
2,
98,
630,
14,
1797,
100,
13,
5,
27220,
5,
6,
15,
331,
6,
13,
1,
107,
60,
800,
3726,
3726,
98,
630,
14,
249,
1797,
107,
60,
100,
13,
5,
27220,
5,
6,
15,
331,
6,
13,
1,
12894,
537,
301,
13,
1,
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... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
annotation based Spring bean validation
===
I'm investigating an annotation-based approach to validating Spring beans using [spring modules][1]. In [the tutorial][2], the following bean (getters and setters omitted) is used as an example:
public final class User {
@NotBlank
@Length(max = 80)
private String name;
@NotBlank
@Email
@Length(max = 80)
private String email;
@NotBlank
@Length(max = 4000)
private String text;
}
The corresponding error messages should follow this format:
<bean class>.<bean propery>.<validation rule>=Validation Error message
Examples for the class shown above include:
User.email[not.blank]=Please enter your e-mail address.
User.email[email]=Please enter a valid e-mail address.
User.email[length]=Please enter no more than {2} characters.
The fact that the message keys contain the class name presents a couple of problems:
1. If the class is renamed, the message keys also need to be changed
2. If I have another class (e.g. Person) with an email property that is validated identically to User.email, I need to duplicate these messages
Person.email[not.blank]=Please enter your e-mail address.
Person.email[email]=Please enter a valid e-mail address.
Person.email[length]=Please enter no more than {2} characters.
In fact, the documentation claims that is possible to configure a default message for a particular rule (e.g. @Email) like this:
email=email address is invalid
This default message should be used if a bean-specific message for the rule (e.g. Person.email[email] and User.email[email]) cannot be found. However, my experience is that this simply does not work. An alternative mechanism for avoiding duplicate messages is to pass the key of the error message to the rule annotation. For example, assume I have defined the following default error message for @Email rule
badEmail=Email address is invalid
This message should be used if I annotate the relevant property like this:
@Email(errorCode="badEmail")
private String email;
However I tried this out and again, it just doesn't seems to work. Has anyone found a way to avoid duplicating error messages when using this validation framework?
Cheers,
Don
[1]: https://springmodules.dev.java.net/
[2]: http://wheelersoftware.com/articles/spring-bean-validation-framework.html
| 0 | [
2,
40,
1270,
857,
432,
1573,
15322,
27999,
800,
3726,
3726,
31,
22,
79,
12490,
40,
40,
1270,
857,
8,
1281,
2141,
20,
7394,
1880,
1573,
14685,
568,
636,
15827,
17113,
500,
2558,
165,
500,
9,
19,
636,
124,
29724,
500,
2558,
135,
500... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
"Submit" button works in Firefox 3 but not in IE7 (ASP 1.1)
===
I have code from an old website that I needed to modify. There are two pages that I modified some form code in. I modified the max length of a textbox and I modified slightly a line or two of code in a function. The "btnSubmit_Click" function as it happens.
With the new code FTP'd up on the webserver, when I click on the "Submit" button using Firefox 3, the button does what it is supposed to do. With IE7, nothing happens. No page load, no refresh, no error, no nothing. IE isn't busy, it doesn't time out, it does nada.
On my development laptop however, when I run the project, the submit button works in IE7 as it is supposed to do.
Any thoughts? | 0 | [
2,
13,
7,
7563,
5130,
7,
5167,
693,
19,
535,
18219,
203,
47,
52,
19,
13,
660,
465,
13,
5,
472,
306,
137,
9,
165,
6,
800,
3726,
3726,
31,
57,
1797,
37,
40,
315,
2271,
30,
31,
851,
20,
17579,
9,
80,
50,
81,
4434,
30,
31,
5... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
What is StringBuilder's RAM consumption like?
===
We have a few operations where we are doing a large number of large string concatenations, and have recently encountered a out of memory exception. Unfortunately, debugging the code is not an option, as this is occurring at customer site.
So, before looking into a overhaul of our code, does anyone know what the RAM consumption characteristics of StringBuilder are for large strings? Especially as they compare to the standard string type.
**NOTE** : This is not about speed but RAM. | 0 | [
2,
98,
25,
3724,
20904,
22,
18,
2843,
8330,
101,
60,
800,
3726,
3726,
95,
57,
21,
310,
1311,
113,
95,
50,
845,
21,
370,
234,
16,
370,
3724,
1065,
9530,
7914,
18,
15,
17,
57,
1989,
8208,
21,
70,
16,
1912,
5391,
9,
6200,
15,
1... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Recommended Vim plugins for C coding?
===
What are the essential addons to help with editing C? | 0 | [
2,
5773,
1790,
79,
10922,
108,
18,
26,
272,
13,
15458,
60,
800,
3726,
3726,
98,
50,
14,
5832,
3547,
4710,
20,
448,
29,
9510,
272,
60,
3,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
Python desktop widgets
===
I'm interested in making desktop widgets, similar to Apple's Dashboard or what Vista has. I'd like to make them cross-platform, if possible. Opera's widgets are cross-platform but require the user to have Opera installed, so that's a big limitation.
I know most widgets are made with HTML/XML, CSS, and Javascript. Is there a way to create them using Python? | 0 | [
2,
20059,
17404,
4807,
43,
3060,
18,
800,
3726,
3726,
31,
22,
79,
3158,
19,
544,
17404,
4807,
43,
3060,
18,
15,
835,
20,
4037,
22,
18,
26478,
54,
98,
13520,
63,
9,
31,
22,
43,
101,
20,
233,
105,
919,
8,
27035,
15,
100,
938,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Continuations in Ruby
===
Has anyone ever done work to get Ruby to do continuations (like Seaside on Smalltalk)? | 0 | [
2,
15503,
18,
19,
10811,
800,
3726,
3726,
63,
1276,
462,
677,
170,
20,
164,
10811,
20,
107,
15503,
18,
13,
5,
1403,
21994,
27,
284,
9718,
6,
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... | [
1,
1,
1,
1,
1,
1,
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... |
Check if option is selected with jQuery, if not select a default
===
Using jQuery, how do you check if there is an option selected in a select menu, and if not, assign one of the options as selected.
(The select is generated with a maze of PHP functions in an app I just inherited, so this is a quick fix while I get my head around those :)
| 0 | [
2,
2631,
100,
4255,
25,
1704,
29,
487,
8190,
93,
15,
100,
52,
5407,
21,
12838,
800,
3726,
3726,
568,
487,
8190,
93,
15,
184,
107,
42,
2631,
100,
80,
25,
40,
4255,
1704,
19,
21,
5407,
11379,
15,
17,
100,
52,
15,
13952,
53,
16,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
need an algorithm for collapsing netblock ranges into lists of superset ranges
===
My math-fu is failing me! I need an efficient way of reducing network ranges to supersets, e.g. if I input list of IP ranges:
* 1.1.1.1 to 2.2.2.5
* 1.1.1.2 to 2.2.2.4
* 10.5.5.5 to 155.5.5.5
* 10.5.5.6 to 10.5.5.7
I want to return the following ranges:
* 1.1.1.1 to 2.2.2.5
* 10.5.5.5 to 155.5.5.5
Note: the input lists are not ordered (though they could be?). The naive way to do this is to check every range in the list to see if the input range x is a subset, and if so, NOT insert range x. However, whenever you insert a new range it might be a superset of existing ranges, so you have to check the existing ranges to see if they can be collapsed (e.g., removed from my list).
| 0 | [
2,
376,
40,
9083,
26,
24898,
4275,
12048,
9230,
77,
7227,
16,
1026,
3554,
9230,
800,
3726,
3726,
51,
5057,
8,
4096,
25,
7250,
55,
187,
31,
376,
40,
8243,
161,
16,
7974,
982,
9230,
20,
1026,
3554,
18,
15,
13,
62,
9,
263,
9,
100... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Viewing repository information from within Eclipse, when code was checked out using svn tortoise
===
I am using svn tortoise to checkout a maven project from a repository, I then open eclispe, and use the m2eclipse plugin to import a maven project. The maven projeect comes in okay, and I can build it fine.
The problem is that eclipse using subversive, isn't marking files/ resources as being in source control (even though I seem to have all the relevant .svn directories.)
I get the same behaviour if I try and check the code in using
-> import -> check out Maven Projects from SCM. ie the project imports okay, but the files aren't linked in to teh svn repository in eclipse.
Are there any suggestions as to how I might proceed, as I find the tortoise svn checkin process pretty painful.
thanks in advance.
David | 0 | [
2,
11244,
24869,
676,
37,
363,
11652,
15,
76,
1797,
23,
6505,
70,
568,
13,
18,
16578,
25691,
800,
3726,
3726,
31,
589,
568,
13,
18,
16578,
25691,
20,
2631,
1320,
21,
1216,
3124,
669,
37,
21,
24869,
15,
31,
94,
368,
6695,
3159,
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... |
BeautifulSoup's Python 3 compatibility
===
Does BeautifulSoup work with Python 3?
If not, how soon will there be a port? Will there be a port at all?
Google doesn't turn up anything to me (Maybe it's 'coz I'm looking for the wrong thing?) | 0 | [
2,
1632,
656,
576,
22,
18,
20059,
203,
13,
21618,
800,
3726,
3726,
630,
1632,
656,
576,
170,
29,
20059,
203,
60,
100,
52,
15,
184,
651,
129,
80,
44,
21,
1295,
60,
129,
80,
44,
21,
1295,
35,
65,
60,
8144,
1437,
22,
38,
805,
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 define a type in a Linq 2 SQL mapping?
===
I'm trying to do my linq 2 sql objects manually, so I have the following code:
var mapping = XmlMappingSource.FromXml(xml);
using (DataContext ctx = new DataContext(conn_string, mapping))
{
list = ctx.GetTable<Achievement>().ToList();
}
and the XML looks like this:
<?xml version="1.0" encoding="utf-8" ?>
<Database Name="FatFights" xmlns="http://schemas.microsoft.com/linqtosql/mapping/2007">
<Table Name="dbo.Achievements">
<Type Name="FatFights.Business.Objects.Achievement">
<Column Name="Id" Member="Id" DbType="UniqueIdentifier NOT NULL" IsPrimaryKey="true" />
<Column Name="UserId" Member="UserId" />
<Column Name="Achieved" Member="Achieved" />
<Column Name="AchievementId" Member="AchievementTypeId" />
<Association Name="AchievementType_Achievement" Member="AchievementTypeId" ThisKey="Id" OtherKey="Id" IsForeignKey="true" />
</Type>
</Table>
</Database>
this returns the following error:
System.InvalidOperationException: Could not find key member 'Id' of key 'Id' on type 'Int32'. The key may be wrong or the field or property on 'Int32' has changed names..
So I need to figure out how to tell Linq 2 SQL that Id is a GUID not an Int32... So I generated some Linq2SQL XML to see how they do it and they pass Type, but Type isn't a valid attribute according to the XSD, so it fails.
Here is the SQL table:
CREATE TABLE Achievements
(
Id UNIQUEIDENTIFIER NOT NULL CONSTRAINT RG_Achievements ROWGUIDCOL
CONSTRAINT DF_Achievements_Id DEFAULT (NEWID()),
UserId UNIQUEIDENTIFIER NOT NULL,
AchievementId INTEGER NOT NULL,
Achieved DATETIME NOT NULL,
CONSTRAINT FK_Achievements_Users
FOREIGN KEY (UserId)
REFERENCES aspnet_Users (UserId),
CONSTRAINT FK_Achievements_AcheivementTypes
FOREIGN KEY (AchievementId)
REFERENCES AchievementTypes (Id),
CONSTRAINT PK_Achievements
PRIMARY KEY (Id),
CONSTRAINT UQ_Achievements_1
UNIQUE (UserId, AchievementId)
)
and the business object:
using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;
namespace FatFights.Business.Objects
{
public class Achievement
{
public Guid Id { get; set; }
public Guid UserId { get; set; }
public int AchievementTypeId { get; set; }
public DateTime Achieved { get; set; }
}
}
| 0 | [
2,
184,
107,
42,
9267,
21,
1001,
19,
21,
6294,
1251,
172,
4444,
255,
13305,
60,
800,
3726,
3726,
31,
22,
79,
749,
20,
107,
51,
6294,
1251,
172,
4444,
255,
3916,
23671,
15,
86,
31,
57,
14,
249,
1797,
45,
4033,
13305,
800,
23504,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Multiple platform development
===
I was currently developing a desktop application in C# using mono and testing in SuSE and Windows. The concept doesn't matter much, but it is a "web lint" program that will scan a web site and return possible issues with security and/or cross browser compatibility. However, I want to be able to offer binaries for multiple platforms. Should I stay with Mono, or is there another platform that would give me a better availablility of platforms, such as on Macs, Windows, Linux, and others (possibly mobile platforms), and make it easier to port?
| 0 | [
2,
1886,
2452,
522,
800,
3726,
3726,
31,
23,
871,
3561,
21,
17404,
3010,
19,
272,
5910,
568,
4129,
17,
4431,
19,
13,
18,
3699,
17,
1936,
9,
14,
2420,
1437,
22,
38,
1161,
212,
15,
47,
32,
25,
21,
13,
7,
14113,
6294,
38,
7,
62... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Php code formatter / beautifier and php beautificaton in general
===
Do you know any good tools for nicely formatting messy php code? Preferably a script for Aptana/Eclipse, but a standalone tool will do too. | 0 | [
2,
13,
26120,
1797,
26,
24700,
13,
118,
7821,
38,
16292,
17,
13,
26120,
7821,
38,
24831,
444,
19,
297,
800,
3726,
3726,
107,
42,
143,
186,
254,
4672,
26,
24050,
2595,
1203,
21503,
13,
26120,
1797,
60,
6369,
4801,
21,
3884,
26,
844... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
C# "Using" Syntax
===
Does the using catch the exception or throw it?
i.e.
using (StreamReader rdr = File.OpenText("file.txt"))
{
//do stuff
}
If the streamreader throws an exception is it caught by using or thrown so the calling function can handle it?
Thanks
| 0 | [
2,
272,
5910,
13,
7,
12655,
7,
22649,
800,
3726,
3726,
630,
14,
568,
2949,
14,
5391,
54,
3814,
32,
60,
31,
9,
62,
9,
568,
13,
5,
11260,
10647,
106,
13,
897,
139,
800,
3893,
9,
10157,
11969,
5,
7,
16877,
9,
38,
396,
38,
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 to guess checksum algoritam?
===
Let's assume that I have some packets with 16-bit checksum at end. I want to guess which checksum algorithm is used.
For a start, from dump data I can see that one byte change in packet payload totally change checksum, so I can assume that it isn't some kind of simple XOR or sum.
Then I [tried several variations of CRC16][1], but without much luck.
This question might be more biased towards cryptography, but I'm really interested in easy to understand statistical tools to find out which CRC this might be. I might even turn to [drawing different CRC algorithms][2] if everything else fails :-)
[1]: http://svn.rot13.org/index.cgi/RFID/view/guess-crc.pl
[2]: http://lcamtuf.coredump.cx/newtcp/ | 0 | [
2,
184,
20,
2321,
16602,
723,
493,
839,
15428,
79,
60,
800,
3726,
3726,
408,
22,
18,
7158,
30,
31,
57,
109,
12795,
18,
29,
347,
8,
3326,
16602,
723,
35,
241,
9,
31,
259,
20,
2321,
56,
16602,
723,
9083,
25,
147,
9,
26,
21,
79... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
SQL clone record with a unique index
===
Is there a clean way of cloning a record in SQL that has an index(auto increment). I want to clone all the fields except the index. I currently have to enumerate every field, and use that in an insert select, and I would rather not explicitly list all of the fields, as they may change over time. | 0 | [
2,
4444,
255,
13871,
571,
29,
21,
2619,
4348,
800,
3726,
3726,
25,
80,
21,
2745,
161,
16,
19226,
68,
21,
571,
19,
4444,
255,
30,
63,
40,
4348,
5,
18042,
13,
28461,
6,
9,
31,
259,
20,
13871,
65,
14,
2861,
1613,
14,
4348,
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... |
Way to Stop a Windows Service when CanStop is set to False (C#)
===
Ok so part two of [I have no will power experiment][1] is:
Summary Question -
**Is there a way to set the CanStop property on a windows service dynamically?**
Whole Spiel -
I have a service that is currently checking and killing processes (IE Games) I have told it to if it's day I'm not allowed. Great. I set the CanStop to false so that I can't just kill the service if I give into the addiction. I have a program that will have a password check (Someone else enters the password) that will stop the service if the password is correct. (If I have serious withdrawals) Problem is using the ServiceController class.
Far as I can tell, ServiceController just is a decorator (yah design patern guess) and so I have no way to get at the actual service it represents. First attempt was Property Info, but I was too dumb to realize what that would be pointless. Second was Field Info because I thought there might be a private field that "represents" the service. As you might guess, both failed.
Any ideas?
[1]: http://stackoverflow.com/questions/146439/way-to-stop-a-program-from-starting-up-using-c | 0 | [
2,
161,
20,
747,
21,
1936,
365,
76,
92,
7318,
25,
309,
20,
4997,
13,
5,
150,
5910,
6,
800,
3726,
3726,
5854,
86,
141,
81,
16,
636,
49,
57,
90,
129,
414,
5737,
500,
2558,
165,
500,
25,
45,
14740,
1301,
13,
8,
13,
1409,
403,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
JSON editor/formatter?
===
I've got some JSON data, but it's all on one line. Does anyone know of a web or Windows editor that will format (e.g. indent and insert new lines) this data for me, so I can read it better? Preferably one that uses a GUI to display the JSON—instead of a command-line tool that outputs a reformatted document, for example. | 0 | [
2,
487,
528,
1835,
118,
23588,
815,
60,
800,
3726,
3726,
31,
22,
195,
330,
109,
487,
528,
1054,
15,
47,
32,
22,
18,
65,
27,
53,
293,
9,
630,
1276,
143,
16,
21,
2741,
54,
1936,
1835,
30,
129,
2595,
13,
5,
62,
9,
263,
9,
19,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
SQL to reorder nodes in a hierarchy
===
I've got a 'task list' database that uses the adjacency list model (see below) so each 'task' can have unlimited sub-tasks. The table has an 'TaskOrder' column so everything renders in the correct order on a treeview.
Is there an SQL statement (MS-SQL 2005) that will select all the child nodes for a specified parent and update the TaskOder column when a sibling is deleted?
<pre>
Task Table
----------
TaskId
ParentTaskId
TaskOrder
TaskName
--etc--
</pre>
Any ideas? Thanks.
| 0 | [
2,
4444,
255,
20,
302,
7861,
16272,
19,
21,
14417,
800,
3726,
3726,
31,
22,
195,
330,
21,
13,
22,
38,
20310,
968,
22,
6018,
30,
2027,
14,
21,
43,
17920,
8883,
968,
1061,
13,
5,
1798,
1021,
6,
86,
206,
13,
22,
38,
20310,
22,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Best way to make NSRunLoop wait for a flag to be set?
===
In the Apple documentation for [NSRunLoop](http://developer.apple.com/documentation/Cocoa/Reference/Foundation/Classes/NSRunLoop_Class/Reference/Reference.html#//apple_ref/occ/instm/NSRunLoop/run) there is sample code demonstrating suspending execution while waiting for a flag to be set by something else.
BOOL shouldKeepRunning = YES; // global
NSRunLoop *theRL = [NSRunLoop currentRunLoop];
while (shouldKeepRunning && [theRL runMode:NSDefaultRunLoopMode beforeDate:[NSDate distantFuture]]);
I have been using this and it works but in investigating a performance issue I tracked it down to this piece of code. I use almost exactly the same piece of code (just the name of the flag is different :) and if I put a `NSLog` on the line after the flag is being set (in another method) and then a line after the `while()` there is a seemingly random wait between the two log statements of several seconds.
The delay does not seem to be different on slower or faster machines but does vary from run to run being at least a couple of seconds and up to 10 seconds.
I have worked around this issue with the following code but it does not seem right that the original code doesn't work.
NSDate *loopUntil = [NSDate dateWithTimeIntervalSinceNow:0.1];
while (webViewIsLoading && [[NSRunLoop currentRunLoop] runMode: NSDefaultRunLoopMode beforeDate:loopUntil])
loopUntil = [NSDate dateWithTimeIntervalSinceNow:0.1];
using this code, the log statements when setting the flag and after the while loop are now consistently less than 0.1 seconds apart.
Anyone any ideas why the original code exhibits this behaviour? | 0 | [
2,
246,
161,
20,
233,
13,
2172,
3169,
18786,
1760,
26,
21,
3157,
20,
44,
309,
60,
800,
3726,
3726,
19,
14,
4037,
13945,
26,
636,
2172,
3169,
18786,
500,
5,
21127,
6903,
26051,
106,
9,
24212,
9,
960,
118,
28132,
857,
118,
716,
71... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 strategy to implement stackoverflow style badges system in asp.net mvc
===
I was wondering what would be the best strategy to implement a badges system using asp.net mvc. The one that stackoverflow has is pretty interesting. What do you suggest? | 0 | [
2,
246,
4427,
20,
8713,
7566,
2549,
9990,
1034,
8715,
18,
329,
19,
28,
306,
9,
2328,
307,
8990,
800,
3726,
3726,
31,
23,
5712,
98,
83,
44,
14,
246,
4427,
20,
8713,
21,
8715,
18,
329,
568,
28,
306,
9,
2328,
307,
8990,
9,
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,
0,
0... |
What is a good MFC starting book?
===
Hey all. Any one have any recommendations for a great MFC book that I can learn? I have background in .NET and C++. Thanks! | 0 | [
2,
98,
25,
21,
254,
307,
7061,
1422,
360,
60,
800,
3726,
3726,
8409,
65,
9,
186,
53,
57,
186,
12121,
26,
21,
374,
307,
7061,
360,
30,
31,
92,
2484,
60,
31,
57,
2395,
19,
13,
9,
2328,
17,
272,
20512,
9,
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... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
Interlocked equivalent on Linux
===
In a C++ Linux app, what is the simplest way to get the functionality that the [Interlocked][1] functions on Win32 provide? Specifically, a lightweight way to atomically increment or add 32 or 64 bit integers?
[1]: http://msdn.microsoft.com/en-us/library/system.threading.interlocked.aspx | 0 | [
2,
1480,
3966,
69,
4602,
27,
13024,
800,
3726,
3726,
19,
21,
272,
20512,
13024,
4865,
15,
98,
25,
14,
24384,
161,
20,
164,
14,
18548,
30,
14,
636,
6280,
3966,
69,
500,
2558,
165,
500,
3719,
27,
628,
3125,
1181,
60,
3524,
15,
21,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
pitfalls/gotchas of click-once/smart-client deployment in .NET
===
I have several .NET WinForms applications that I'm preparing to convert into a click-once/smart-client deployment scenario. I've read the isn't-this-great tutorials but want to ask if there are pitfalls or "gotchas" that I should be aware of.
there are several minor apps used off and on, but the main app is in C#, runs 24/7, is quite large, but only changes every few weeks. It also writes a log file locallly, and talks to local hardware devices.
thanks in advance! | 0 | [
2,
4175,
5660,
18,
118,
7597,
1651,
18,
16,
10840,
8,
13120,
118,
18,
9534,
8,
150,
18513,
38,
10475,
19,
13,
9,
2328,
800,
3726,
3726,
31,
57,
238,
13,
9,
2328,
628,
4190,
18,
3767,
30,
31,
22,
79,
7575,
20,
8406,
77,
21,
1... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Open source Analysis/Design tools
===
What open source analysis and design tools are available?
Which would you recommend? | 0 | [
2,
368,
1267,
2495,
118,
19862,
4672,
800,
3726,
3726,
98,
368,
1267,
2495,
17,
704,
4672,
50,
904,
60,
56,
83,
42,
12360,
60,
3,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
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... |
Programs don't work on Vista and Server 2008
===
Many, if not all, of my old VC++ 6.0 MFC apps don't work in Vista and Server 2008. I had that migration was a problem, but now it's my problem :(
How do I go about making these things work? Is that possible? I've searched, but is there some repository of knowledge on this subject? | 0 | [
2,
1726,
221,
22,
38,
170,
27,
13520,
17,
8128,
570,
800,
3726,
3726,
151,
15,
100,
52,
65,
15,
16,
51,
315,
13,
8990,
20512,
400,
9,
387,
307,
7061,
4865,
18,
221,
22,
38,
170,
19,
13520,
17,
8128,
570,
9,
31,
41,
30,
8443,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 use GROUP BY to concatenate strings in MySQL?
===
Basically the question is how to get from this:
<pre>
id string
1 A
1 B
2 C
</pre>
to this:
<pre>
id string
1 A B
2 C
</pre> | 0 | [
2,
184,
20,
275,
214,
34,
20,
1065,
9530,
8820,
7887,
19,
51,
18,
22402,
60,
800,
3726,
3726,
11374,
14,
1301,
25,
184,
20,
164,
37,
48,
45,
13,
1,
3515,
1,
4924,
3724,
137,
21,
137,
334,
172,
272,
13,
1,
118,
3515,
1,
20,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Crystalspace vs. Irrlicht vs. ..... ?
===
So, I use Linux, and I've been trying to find the time to get into game programming. I started out with Panda3d and had some pretty decent results and got a feel for many of the concepts in game programming. Not too long after that, I decided to step it up a notch and go to something more powerful and C or C++ based.
I'm probably just really dumb, but I could never really figure out how to use Crystalspace correctly. If somebody has any useful resources on how to use it, I would appreciate that. But in the meantime, I was messing around with Irrlicht and I like it, but I would like to know what more knowledgable people have to say about the subject. And maybe theres another awesome option out there I don't know about. | 0 | [
2,
4282,
5582,
4611,
9,
31,
5932,
8945,
38,
4611,
9,
13,
9,
9,
9,
9,
9,
13,
60,
800,
3726,
3726,
86,
15,
31,
275,
13024,
15,
17,
31,
22,
195,
74,
749,
20,
477,
14,
85,
20,
164,
77,
250,
3143,
9,
31,
373,
70,
29,
16982,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 respond_to for graceful degradation with ajax in RoR 2.x
===
I was going through the AWDR book on web development with ruby on rails and one of the issues with the old code was it didn't use respond_to to make sure the view used would be the javascript view. Now in some updated examples I've seen people mention they later, when implementing graceful degradation, use request.xhr? to tell if the user has javascript enabled, and if not they redirect the user.
I was wondering if you could use respond_to to get the same behaviour and if so, if this is considered good form or not and why?
So what I'm thinking of doing is something like:
def function
respond_to do |format|
format.js do
basic_stuff
end
format.html do
basic_stuff
user_redirect
end
end
end
It does seem to sorta violate the DRY principle, and I'm probably missing something about how the user and the server are interacting here. To be honest the API documentation did not make it entirely clear to me. | 0 | [
2,
568,
4590,
1,
262,
26,
22609,
19131,
29,
20624,
19,
761,
248,
172,
9,
396,
800,
3726,
3726,
31,
23,
228,
120,
14,
13,
3885,
3807,
360,
27,
2741,
522,
29,
10811,
27,
2240,
18,
17,
53,
16,
14,
1549,
29,
14,
315,
1797,
23,
3... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
what's the fundamental difference between a jsp taglib vs including a jsp page?
===
i have several common elements (components), that will generate some html. it seems my options are creating a taglib, or just putting that logic into a jsp page and including the jsp.
whats the difference? positives vs negatives? | 0 | [
2,
98,
22,
18,
14,
6377,
2841,
128,
21,
487,
3401,
3383,
8326,
4611,
215,
21,
487,
3401,
2478,
60,
800,
3726,
3726,
31,
57,
238,
757,
2065,
13,
5,
11103,
849,
14128,
6,
15,
30,
129,
7920,
109,
13,
15895,
9,
32,
2206,
51,
6368,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 copy a record in a SQL table but swap out the unique id of the new row?
===
[This question][1] comes close to what I need, but my scenario is slightly different. The source table and destination table are the same and the primary key is a uniqueidentifier (guid). When I try this:
insert into MyTable
select * from MyTable where uniqueId = @Id;
I obviously get a primary key constraint violation, since I'm attempting to copy over the primary key. Actually, I don't want to copy over the primary key at all. Rather, I want to create a new one. Additionally, I would like to selectively copy over certain fields, and leave the others null. To make matters more complex, I need to take the primary key of the original record, and insert it into another field in the copy (PreviousId field).
I'm sure there is an easy solution to this, I just don't know enough TSQL to know what it is.
[1]: http://stackoverflow.com/questions/57168/how-to-copy-a-row-from-one-sql-server-table-to-another | 0 | [
2,
184,
107,
42,
4344,
21,
571,
19,
21,
4444,
255,
859,
47,
17150,
70,
14,
2619,
4924,
16,
14,
78,
3131,
60,
800,
3726,
3726,
636,
1565,
1301,
500,
2558,
165,
500,
1624,
543,
20,
98,
31,
376,
15,
47,
51,
12705,
25,
1847,
421,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 disadvantage to blindly using INSERT in MySQL?
===
Often I want to add a value to a table or update the value if its key already exists. This can be accomplished in several ways, assuming a primary or unique key is set on the 'user_id' and 'pref_key' columns in the example:
**1. Blind insert, update if receiving a duplicate key error:**
// Try to insert as a new value
INSERT INTO my_prefs
(user_id, pref_key, pref_value)
VALUES (1234, 'show_help', 'true');
// If a duplicate-key error occurs run an update query
UPDATE my_prefs
SET pref_value = 'true'
WHERE user_id=1234 AND pref_key='show_help';
**2. Check for existence, then select or update:**
// Check for existence
SELECT COUNT(*)
FROM my_prefs
WHERE user_id=1234 AND pref_key='show_help';
// If count is zero, insert
INSERT INTO my_prefs
(user_id, pref_key, pref_value)
VALUES (1234, 'show_help', 'true');
// If count is one, update
UPDATE my_prefs
SET pref_value = 'true'
WHERE user_id=1234 AND pref_key='show_help';
The first way seems to be preferable as it will require only one query for new inserts and two for an update, where as the second way will always require two queries. Is there anything I'm missing though that would make it a bad idea to blindly insert? | 0 | [
2,
25,
80,
21,
13387,
20,
4631,
102,
568,
14692,
19,
51,
18,
22402,
60,
800,
3726,
3726,
478,
31,
259,
20,
3547,
21,
1923,
20,
21,
859,
54,
11100,
14,
1923,
100,
82,
1246,
614,
5636,
9,
48,
92,
44,
8812,
19,
238,
2847,
15,
1... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Stored Procedure Ownership Chaining
===
I have several stored procedures in my database that are used to load data from a datamart that is housed in a separate database. These procedures are, generally, in the form:
<pre><code>
CREATE PROCEDURE load_stuff
WITH EXECUTE AS OWNER AS
INSERT INTO my_db.dbo.report_table
(
column_a
)
SELECT
column_b
FROM data_mart.dbo.source_table
WHERE
foo = 'bar';
</code></pre>
These run fine when I execute the query in SQL Server Management Studio. When I try to execute them using EXEC load\_stuff, the procedure fails with a security warning:
*The server principal "the\_user" is not able to access the database "data\_mart" under the current security context.*
The OWNER of the sproc is dbo, which is the\_user (for the sake of our example). The OWNER of both databases is also the_user and the\_user is mapped to dbo (which is what SQL Server should do).
Why would I be seeing this error in SQL Server? Is this because the user in question is being aliased as dbo and I should use a different user account for my cross-database data access? | 0 | [
2,
8214,
7004,
5074,
2858,
68,
800,
3726,
3726,
31,
57,
238,
8214,
8876,
19,
51,
6018,
30,
50,
147,
20,
6305,
1054,
37,
21,
1054,
9534,
30,
25,
7112,
19,
21,
1725,
6018,
9,
158,
8876,
50,
15,
1469,
15,
19,
14,
505,
45,
13,
1... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Use jQuery to send Excel data using AJAX
===
I have the following function that is pulling data from a database. The ajax call is working correctly. How can I send the tab delimited data in my success function to the user? Setting the contect type to "application/vnd.ms-excel" didn't work. The alert on success shows the correctly formatted data.
function SendToExcel() {
$.ajax({
type: "GET",
url: "/Search.aspx",
contentType: "application/vnd.ms-excel",
dataType: "text",
data: "{id: '" + "asdf" + "'}",
success: function(data) {
alert(data);
},
error: function (XMLHttpRequest, textStatus, errorThrown) {
alert(XMLHttpRequest.responseText);
}});
}
I don't want to display the data in the browser--I want to send it to Excel. | 0 | [
2,
275,
487,
8190,
93,
20,
2660,
20700,
1054,
568,
20624,
800,
3726,
3726,
31,
57,
14,
249,
1990,
30,
25,
3303,
1054,
37,
21,
6018,
9,
14,
20624,
645,
25,
638,
12044,
9,
184,
92,
31,
2660,
14,
6523,
121,
23012,
1054,
19,
51,
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... |
Accessing a dynamitcally added buttoncolumn's (in a Datagrid) click event. C#/ASP.NET
===
When I dynamically create a Datagrid and add in a new buttoncolumn how do I access the buttoncolumn_click event?
Thanks.
| 0 | [
2,
1381,
68,
21,
24151,
5130,
150,
1326,
905,
5167,
716,
4404,
103,
22,
18,
13,
5,
108,
21,
1054,
16375,
6,
10840,
807,
9,
272,
5910,
118,
472,
306,
9,
2328,
800,
3726,
3726,
76,
31,
7782,
1326,
1600,
21,
1054,
16375,
17,
3547,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
What the heck does loader.load((newSource is URLRequest)? newSource:new URLRequest(newSource)); do?
===
I ran across the following code in [Ely Greenfield's][1] SuperImage from his Book component - I understand loader.load() but what does the rest of do?
loader.load((newSource is URLRequest)? newSource:new URLRequest(newSource));
It looks like some kind of crazy inline if statement but still, I'm a little preplexed. And if it is an if statement - is this way better than a regular if statement?
[1]: http://www.quietlyscheming.com/blog/ | 0 | [
2,
98,
14,
16490,
630,
6305,
106,
9,
8294,
5,
5,
2681,
12097,
25,
287,
6362,
99,
10351,
6,
60,
78,
12097,
45,
2681,
287,
6362,
99,
10351,
5,
2681,
12097,
6,
6,
73,
107,
60,
800,
3726,
3726,
31,
717,
464,
14,
249,
1797,
19,
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... |
Preferred path to applications on OSX?
===
I want to be able to run a text editor from my app, as given by the user in the TEXT_EDITOR environment variable. Now, assuming there is nothing in that variable, I want to default to the TextEdit program that ships with OSX. Is it kosher to hardcode /Applications/TextEdit.app/Contents/MacOS/TextEdit into my app, or is there a better way to call the program? | 0 | [
2,
5981,
2013,
20,
3767,
27,
13,
759,
396,
60,
800,
3726,
3726,
31,
259,
20,
44,
777,
20,
485,
21,
1854,
1835,
37,
51,
4865,
15,
28,
504,
34,
14,
4155,
19,
14,
1854,
1,
13401,
2307,
7612,
9,
130,
15,
11704,
80,
25,
626,
19,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How do you write Valid XHTML 1.0 Strict code when you are using javascript to fill an element that requires a child?
===
I'm running my site through the W3C's validator trying to get it to validate as XHTML 1.0 Strict and I've gotten down to a particularly sticky (at least in my experience) validation error. I'm including certain badges from various services in the site that provide their own API and code for inclusion on an external site. These badges use javascript (for the most part) to fill an element that you insert in the markup which requires a child. This means that in the end, perfectly valid markup is generated, but to the validator, all it sees is an incomplete parent-child tag which it then throws an error on.
As a caveat, I understand that I could complain to the services that their badges don't validate. Sans this, I assume that someone has validated their code while including badges like this, and that's what I'm interested in. Answers such as, 'Complain to Flickr about their badge' aren't going to help me much.
An additional caveat: I would prefer that as much as possible the markup remains semantic. I.E. Adding an empty li tag or tr-td pair to make it validate would be an _undesirable_ solution, even though it may be necessary. If that's the only way it can be made to validate, oh well, but please lean answers towards semantic markup.
Thanks in advance! | 0 | [
2,
184,
107,
42,
2757,
7394,
993,
15895,
137,
9,
387,
8170,
1797,
76,
42,
50,
568,
8247,
8741,
20,
3509,
40,
4520,
30,
4781,
21,
850,
60,
800,
3726,
3726,
31,
22,
79,
946,
51,
689,
120,
14,
619,
240,
150,
22,
18,
7394,
3457,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Classic ASP SQL Injection Protection
===
What is a strong way to protect against sql injection for a classic asp app? | 0 | [
2,
2732,
28,
306,
4444,
255,
13646,
2057,
800,
3726,
3726,
98,
25,
21,
966,
161,
20,
2196,
149,
4444,
255,
13646,
26,
21,
2732,
28,
306,
4865,
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... | [
1,
1,
1,
1,
1,
1,
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... |
.NET Log Soap Request on Client
===
I'm consuming a third party .NET WebService in my client application. For debugging purposes I want to capture the SOAP requests that are being sent from my server. How would I go about doing this? This is being done on .NET 2.0 without the use of WCF or WSE. | 0 | [
2,
13,
9,
2328,
6738,
6447,
3772,
27,
6819,
800,
3726,
3726,
31,
22,
79,
13,
17601,
21,
422,
346,
13,
9,
2328,
2741,
11449,
19,
51,
6819,
3010,
9,
26,
121,
16254,
2762,
4612,
31,
259,
20,
3683,
14,
6447,
12279,
30,
50,
142,
79... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
profile program's speed on Linux
===
I have a couple variants of a program that I want to compare on performance. Both perform essentially the same task.
One does it all in C and memory. The other calls an external utility and does file IO.
How do I reliably compare them? Getting "time on CPU" favors the second variant for calling system() and doing IO. And I can't just clock them for they run on a server and can be pushed off the CPU any time.
I need to add up all CPU time that these programs consume, including user, kernel, IO, and children's recursively.
thanks! | 0 | [
2,
5296,
625,
22,
18,
1362,
27,
13024,
800,
3726,
3726,
31,
57,
21,
1335,
11070,
16,
21,
625,
30,
31,
259,
20,
11590,
27,
956,
9,
156,
2985,
7398,
14,
205,
3005,
9,
53,
630,
32,
65,
19,
272,
17,
1912,
9,
14,
89,
3029,
40,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 prevent fgets blocks when file stream has no new data.
===
I have a popen() function which executes "tail -f sometextfile". Aslong as there is data in the filestream obviously i can get the data through fgets(). Now, if no new data comes from tail, fgets() hangs. I tried ferror() and feof() to no avail. How can i make sure fgets() doesn't try to read data when nothing new is in the file stream? | 0 | [
2,
184,
20,
2501,
398,
3060,
18,
5198,
76,
3893,
3766,
63,
90,
78,
1054,
9,
800,
3726,
3726,
31,
57,
21,
3075,
103,
5,
6,
1990,
56,
15644,
18,
13,
7,
8682,
13,
8,
410,
109,
11969,
16877,
7,
9,
28,
2701,
28,
80,
25,
1054,
1... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How to design a fact table for delivery data
===
I'm building a data warehouse that includes delivery information for restaurants. The data is stored in SQL Server 2005 and is then put into a SQL Server Analysis Services 2005 cube.
The Deliveries information consists of the following tables:
**FactDeliveres**
- BranchKey
- DeliveryDateKey
- ProductKey
- InvoiceNumber (DD: degenerate dimension)
- Quantity
- UnitCosT
- Linecost
**Note:**
- The granularity of FactDeliveres is each line on the invoice
- The Product dimension include supplier information
**And the problem:** there is no primary key for the fact table. The primary key should be something that uniquely identifies each delivery plus the ProductKey. But I have no way to uniquely identify a delivery.
In the source OLTP database there is a DeliveryID that is unique for every delivery, but that is an internal ID that meaningless to users. The InvoiceNumber is the suppliers' invoices number -- this is typed in manually and so we get duplicates.
In the cube, I created a dimension based only on the InvoiceNumber field in FactDeliveres. That does mean that when you group by InvoiceNumber, you might get 2 deliveries combined only because they (mistakenly) have the same InvoiceNumber.
I feel that I need to include the DeliveryID (to be called DeliveryKey), but I'm not sure how.
**So, do I:**
1. Use that as the underlying key for the InvoiceNumber dimension?
2. Create a DimDelivery that grows every time there is a new delivery? That could mean that some attributes come out of FactDeliveries and go into DimDelivery, like DeliveryDate,Supplier, InvoiceNumber.
After all that, I could just ask you: how do I create a Deliveries cube when I have the following information in my source database
**DeliveryHeaders**
- DeliveryID (PK)
- DeliveryDate
- SupplierID (FK)
- InvoiceNumber (typed in manually)
**DeliveryDetails**
- DeliveryID (PK)
- ProductID (PK)
- Quantity
- UnitCosT | 0 | [
2,
184,
20,
704,
21,
837,
859,
26,
6010,
1054,
800,
3726,
3726,
31,
22,
79,
353,
21,
1054,
8308,
30,
1103,
6010,
676,
26,
7708,
9,
14,
1054,
25,
8214,
19,
4444,
255,
8128,
812,
17,
25,
94,
442,
77,
21,
4444,
255,
8128,
2495,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
If you don't design in UML, then what do you design in?
===
I was taught to draw diagrams in UML to see the interactions between classes, objects, and participants/the system and so on. However, I've seen several answers here stating the UML is a documentation tool and not a design tool.
How do you depict designs graphically if you don't use UML? | 0 | [
2,
100,
42,
221,
22,
38,
704,
19,
13,
723,
255,
15,
94,
98,
107,
42,
704,
19,
60,
800,
3726,
3726,
31,
23,
2359,
20,
2003,
14161,
18,
19,
13,
723,
255,
20,
196,
14,
11224,
128,
2684,
15,
3916,
15,
17,
5889,
118,
124,
329,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Issues working with JSF redirect and WebTrends
===
On our new platform we are utilizing JSF. Our WebTrends tags are not reflecting the proper page title on this platform. It currently is displaying the name of the users previous page instead of the current page.
We are making use of the JSF Navigation rule in which we have some "< redirect />" tags.
Has anyone experienced this and is there a solution. I have made the suggestion that we move a way from this model, still use JSF but not the navigation rules.
Thanks | 0 | [
2,
1549,
638,
29,
487,
18,
410,
302,
14706,
17,
2741,
6384,
2451,
18,
800,
3726,
3726,
27,
318,
78,
2452,
95,
50,
19894,
487,
18,
410,
9,
318,
2741,
6384,
2451,
18,
3383,
18,
50,
52,
11560,
14,
4119,
2478,
581,
27,
48,
2452,
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... |
MSSQL 2005 How to transfer sql encrypted data between databases?
===
I have an existing SQL Server 2005 database that contains data encrypted using a Symmetric key. The symmetric key is opened using a password. I am working on an upgrade to the front end applications that use this database, which include adding dozens of new tables, stored procedures, UDFs, etc. and dozens of modifications to existing tables and database objects. To that end I am making a copy of the existing development database, so that the current system can be independently supported, maintained, and updated while new development takes place.
What is a good way to go about copying the database? Normally, I'd take a backup of the existing database, and then restore it to the new database. However, will this be feasible given the encrypted data? Will I still be able to encrypt and more importantly decrypt data in the new database using the existing symmetric key and password?
Might I instead want to use DTS to transfer the existing schema only. Create a new symmetric key/password in the new database. Then write ad hoc queries to transfer the data, decrypting using existing key/password, and encrypting using new key/password in new database.
I guess at the heart of this is, are symmetric keys good for encrypting/decrypting data in a single database or in many databases on the same server? | 0 | [
2,
4235,
18,
22402,
812,
184,
20,
2617,
4444,
255,
29403,
1054,
128,
6018,
18,
60,
800,
3726,
3726,
31,
57,
40,
3149,
4444,
255,
8128,
812,
6018,
30,
1588,
1054,
29403,
568,
21,
13,
16367,
1246,
9,
14,
13,
16367,
1246,
25,
520,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 Profile the ADO.NET Connection Pool?
===
I'm profiling a web application. I believe it is very database connection intensive (excessive use of the ADO.NET connection pool). **How to I tell w/out debugging how many times it is going to the pool and on average how many connections are available in the pool?** Are there counters that will give me this info in PerfMon or some other tool?
Thanks in advance! | 0 | [
2,
184,
107,
31,
5296,
14,
21,
537,
9,
2328,
2760,
3067,
60,
800,
3726,
3726,
31,
22,
79,
8721,
49,
802,
21,
2741,
3010,
9,
31,
985,
32,
25,
253,
6018,
2760,
13633,
13,
5,
1706,
5052,
18,
1284,
275,
16,
14,
21,
537,
9,
2328,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 use a generic type as a constraint?
===
I would like to specify a constraint which is another type with a generic argument:
class KeyFrame<T>
{
public float Time;
public T Value;
}
class Timeline<T> where T : Keyframe<*>
{
}
But this cannot be done in c# as of yet, (and I really doubt it will ever be). Is there any elegant solution to this rather than having to specify the type of the keyframe argument?:
class Timeline<TKeyframe, TKeyframeValue>
where TKeyframe : Keyframe<TKeyframeValue>,
{
}
| 0 | [
2,
184,
92,
31,
275,
21,
12733,
1001,
28,
21,
28804,
60,
800,
3726,
3726,
31,
83,
101,
20,
19077,
21,
28804,
56,
25,
226,
1001,
29,
21,
12733,
5476,
45,
718,
1246,
8361,
1,
38,
1,
13,
1,
317,
11510,
85,
73,
317,
13,
38,
1923... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Compatibility Mode for Web Services
===
I have a web service that loads an unmanaged .dll made from VC++ 6. In Vista and Windows Server 2008, I can get applications using this to work by putting them in Win98 Compatibility mode. Is there a similar way I can do this with my web service, so it will run? | 0 | [
2,
13,
21618,
3740,
26,
2741,
687,
800,
3726,
3726,
31,
57,
21,
2741,
365,
30,
19069,
40,
367,
177,
8030,
13,
9,
43,
211,
117,
37,
13,
8990,
20512,
400,
9,
19,
13520,
17,
1936,
8128,
570,
15,
31,
92,
164,
3767,
568,
48,
20,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Naming conventions for threads?
===
It's helpful to name threads so one can sort out which threads are doing what for diagnostic and debugging purposes.
Is there a particular naming convention for threads in a heavily multi-threaded application that works better than another? What kind of information should go into the name for a thread? What have you learned about naming your threads that could be helpful to others?
| 0 | [
2,
10929,
15117,
26,
20396,
60,
800,
3726,
3726,
32,
22,
18,
15600,
20,
204,
20396,
86,
53,
92,
2058,
70,
56,
20396,
50,
845,
98,
26,
16458,
17,
121,
16254,
2762,
4612,
9,
25,
80,
21,
1498,
10929,
3087,
26,
20396,
19,
21,
2991,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Creating non-reverse-engineerable java programs
===
The title is essentially the question. Does anyone know of a way to deploy a Java program in a format that is not reverse-engineer-able? I know how to convert my application into an executable jar, but I want to make sure that the code cannot be reverse engineered, or at least, not easily.
Obfuscation of the source code doesn't count... it makes it harder to understand the code, but does not hide it.
Any suggestions? | 0 | [
2,
2936,
538,
8,
99,
9453,
8,
19153,
579,
8247,
1726,
800,
3726,
3726,
14,
581,
25,
7398,
14,
1301,
9,
630,
1276,
143,
16,
21,
161,
20,
17617,
21,
8247,
625,
19,
21,
2595,
30,
25,
52,
7006,
8,
19153,
8,
579,
60,
31,
143,
184... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
jsp create scripting variable like jsp:usebean does
===
I would like to do something like
`<test:di id="someService" `/`>
<%
someService.methodCall();
%>
where `<test:di`
gets and instantiates a service bean and creates a scripting variable for use. similar to how jsp:usebean works for example
`<jsp:useBean id="someDate" class="java.util.Date" `/>
<%
someDate.getYear();
%>
how do i make my own objects available as a scritping variable? | 0 | [
2,
487,
3401,
1600,
3884,
68,
7612,
101,
487,
3401,
45,
3699,
863,
210,
630,
800,
3726,
3726,
31,
83,
101,
20,
107,
301,
101,
13,
1,
10543,
45,
1115,
4924,
3726,
7,
3220,
11449,
7,
13,
1,
118,
1,
13,
1,
11881,
109,
11449,
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... |
DB2 + Fujitsu COBOL: runtime error due to wrong (pre)compilation?
===
I'm able to (on Windows XP) precompile, compile and link a sample (Fujitsu NetCobol) COBOL test program which contains embedded SQL. This test program is to read and display the number of rows in a DB2 (UDB 9.5 on Linux) database table.
At runtime I get following error message:
**FAILURE IN LINKAGE RULES OR PARAMETER OF THE 'sqlgstrt' PROGRAM. PGM=DB2TST1**
The precompile source code this error refers to looks as follows:
* ... in WORKING-STORAGE section:
01 SQLA-PROGRAM-ID.
05 SQL-PART1 pic 9(4) COMP-5 value 172.
05 SQL-PART2 pic X(6) value "AEAMAI".
05 SQL-PART3 pic X(24) value "gBSdTdJY01111 2 ".
05 SQL-PART4 pic 9(4) COMP-5 value 13.
05 SQL-PART5 pic X(13) value "ADMINISTRATOR".
05 SQL-PART6 pic X(115) value LOW-VALUES.
05 SQL-PART7 pic 9(4) COMP-5 value 8.
05 SQL-PART8 pic X(8) value "COBOL/DB".
05 SQL-PART9 pic X(120) value LOW-VALUES.
* .. in PROCEDURE DIVISION:
*EXEC SQL CONNECT TO :DB-SERVER USER :DB-USER USING :DB-PWD
* END-EXEC
CALL "sqlgstrt" USING
BY CONTENT SQLA-PROGRAM-ID
BY VALUE 0
BY REFERENCE SQLCA
Does anybody know what this error message means?
| 0 | [
2,
13,
9007,
135,
2754,
10300,
9556,
326,
6966,
45,
485,
891,
7019,
397,
20,
1389,
13,
5,
3515,
6,
11103,
49,
10832,
60,
800,
3726,
3726,
31,
22,
79,
777,
20,
13,
5,
218,
1936,
23045,
6,
782,
11103,
3599,
15,
26561,
17,
3508,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
determine when copy finishes in vbScript
===
Does anyone know of a method to determine when a file copy completes in VBScript? I'm using the following to copy:<br>
`set sa = CreateObject ("Shell.Application")
set zip = sa.NameSpace (saveFile)
set Fol = sa.NameSpace (folderToZip)
zip.copyHere (Fol.items)`
| 0 | [
2,
3746,
76,
4344,
13625,
19,
13,
20468,
8741,
800,
3726,
3726,
630,
1276,
143,
16,
21,
2109,
20,
3746,
76,
21,
3893,
4344,
1279,
18,
19,
13,
20468,
8741,
60,
31,
22,
79,
568,
14,
249,
20,
4344,
45,
1,
5145,
1,
13,
1,
3554,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How to avoid a postback in javascript?
===
I have an ASP.NET page which has a button it it. The button click launches a modal dialog box using javacript. Based on the value returned by the modal dialog box, i want to proceed with, or cancel the post back that happens. How do i do this? | 0 | [
2,
184,
20,
2658,
21,
678,
1958,
19,
8247,
8741,
60,
800,
3726,
3726,
31,
57,
40,
28,
306,
9,
2328,
2478,
56,
63,
21,
5167,
32,
32,
9,
14,
5167,
10840,
22933,
21,
13,
20756,
28223,
1649,
568,
8247,
28215,
38,
9,
432,
27,
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... |
previousstate in OnFlushDirty(object id, System.Collections.IDictionary previousState, System.Collections.IDictionary currentState, NHibernate.Type.IType[] types)
===
I have this problem, I'm using Castle ActiveRecord and when I update I verify changes in the object and I do that in the OnFlushDirty event, however when I access to the previoustate["MyProperty"] it turns to be null and I can't get the old value.
Do you know why?
this is the code;
protected override bool OnFlushDirty(object id, System.Collections.IDictionary previousState, System.Collections.IDictionary currentState, NHibernate.Type.IType[] types)
{
StringBuilder errors = new StringBuilder();
if (this._bankCode <= 0)
errors.Append("Bank code is invalid" + Environment.NewLine);
if (string.IsNullOrEmpty(this._name) || this._name.Trim().Length == 0)
errors.Append("Name is invalid" + Environment.NewLine);
//previousState["EnterpriseCode"] is always null
if (previousState["EnterpriseCode"] != currentState["EnterpriseCode"])
{
if (this._enterpriseCode == 0)
errors.Append("Enterprise code is invalid" + Environment.NewLine);
else
... | 0 | [
2,
1158,
3859,
19,
27,
12848,
1635,
28067,
5,
23793,
4924,
15,
329,
9,
15015,
5757,
9,
49,
22595,
1857,
1158,
3859,
15,
329,
9,
15015,
5757,
9,
49,
22595,
1857,
866,
3859,
15,
12109,
15191,
8820,
9,
4474,
9,
49,
4474,
2558,
500,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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.