unified_texts stringlengths 32 30.1k | OpenStatus_id int64 0 4 | input_ids list | token_type_ids list | attention_mask list |
|---|---|---|---|---|
VBA script for auto resizing of controls/subforms in MS Access 2003 forms?
===
Since Access 2003 doesn't have the control anchoring functionality as exists in 2007, I was wondering if anyone has or is aware of some VBA script, or a freeware control, that can give this functionality? | 0 | [
2,
566,
969,
3884,
26,
3108,
10719,
3335,
16,
8671,
118,
7563,
4190,
18,
19,
4235,
1381,
973,
1997,
60,
800,
3726,
3726,
179,
1381,
973,
1437,
22,
38,
57,
14,
569,
6265,
68,
18548,
28,
5636,
19,
624,
15,
31,
23,
5712,
100,
1276,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
C# Desktop Applications?
===
In looking at the use of C# in a ISV setting, I'm wondering what prominent C# based desktop apps are out there? I can think of only Paint .NET.
Is C# a good idea for an ISV, or should one stick to more native environments like Delphi or even QT? | 0 | [
2,
272,
5910,
17404,
3767,
60,
800,
3726,
3726,
19,
699,
35,
14,
275,
16,
272,
5910,
19,
21,
25,
710,
2697,
15,
31,
22,
79,
5712,
98,
2357,
272,
5910,
432,
17404,
4865,
18,
50,
70,
80,
60,
31,
92,
277,
16,
104,
5107,
13,
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... |
Rails x FastCGI
===
Should i stay out of rails if a client has a cheap hosting service with a provider that do not support mod_rails? Will rails + fast.cgi provide a good experience for a user or should I choose, in this scenario, php + my-favorite-framework as platform ?
Regards,
Victor
| 0 | [
2,
2240,
18,
993,
1512,
150,
2234,
800,
3726,
3726,
378,
31,
1179,
70,
16,
2240,
18,
100,
21,
6819,
63,
21,
9148,
10637,
365,
29,
21,
11747,
30,
107,
52,
555,
7226,
1,
7301,
18,
60,
129,
2240,
18,
2754,
1512,
9,
150,
2234,
118... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How do I guarantee fast shutdown of my win32 app?
===
I've got a c++ Win32 app that has a number of threads that might be busy doing IO (HTTP calls, etc) when the user wants to shutdown the app. Currently, I play nicely and wait for all the threads to end before returning from main. Sometimes, this takes longer than I would like and indeed, it seems kind of pointless to make the user wait when I could just exit. However, if I just go ahead and return from main, I'm likely to get crashes as destructors start getting called while there are still threads using the objects.
So, recognizing that in an ideal, platonic world of virtue, the best thing to do would be to wait for all the threads to exit and then shutdown cleanly, what is the next best real world solution? Simply making the threads exit faster may not be an option. The goal is to get the process dead as quickly as possible so that, for example, a new version can be installed over it. The only disk IO I'm doing is in a transactional db, so I'm not terribly concerned about pulling the plug on that.
Thanks! | 0 | [
2,
184,
107,
31,
9120,
1512,
28450,
16,
51,
628,
3125,
4865,
60,
800,
3726,
3726,
31,
22,
195,
330,
21,
272,
20512,
628,
3125,
4865,
30,
63,
21,
234,
16,
20396,
30,
530,
44,
4394,
845,
13,
1963,
13,
5,
21127,
3029,
15,
2722,
6... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
interpolate varaible to call a function from module
===
requirement is to pass module name and function name from the command line argument.
and I need to get the command line argument in the program and I need to call that function from that module
Ex:
perl try.pl MODULE1 Display --> calling a try.pl program with 2 arguments MODULE1(Module name) Display(Function name)
Program:
use $ARGV[0];
& $ARGV[0]::$ARGV[1](); --> I want to some thing like this, But its not working, please guide me | 0 | [
2,
23336,
1373,
13,
12483,
3426,
20,
645,
21,
1990,
37,
12613,
800,
3726,
3726,
8981,
25,
20,
1477,
12613,
204,
17,
1990,
204,
37,
14,
1202,
293,
5476,
9,
17,
31,
376,
20,
164,
14,
1202,
293,
5476,
19,
14,
625,
17,
31,
376,
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 is the best web-based File Explorer?
===
I would like to know what you think is the best web-based File Explorer to manage files in a remote server through HTTP / Web.
It would be preferable to have PHP or Flash technology, but any good suggestion would do.
More generally, how would you allow someone to manage files on a remote server with HTTP being the only open outgoing port?
| 4 | [
2,
98,
25,
14,
246,
2741,
8,
1281,
3893,
8520,
60,
800,
3726,
3726,
31,
83,
101,
20,
143,
98,
42,
277,
25,
14,
246,
2741,
8,
1281,
3893,
8520,
20,
4705,
6488,
19,
21,
5388,
8128,
120,
7775,
13,
118,
2741,
9,
32,
83,
44,
6369... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
MFC: Showing / Hiding Splitter Panes
===
In my application I have a number of panes from m_wndspliter classes. What I want to do is at run time show and hide one of these panes. Whilst with the following code I can show and hide the view associated with the pane, I can't temporarily remove the pane itself.
CWnd * pCurView = m_wndSplitter2.GetPane(2, 0);
if( !pCurView == NULL )
{
if( fShow )
{
pCurView->ShowWindow(SW_SHOW);
RecalcLayout();
}
else
{
pCurView->ShowWindow(SW_HIDE);
RecalcLayout();
}
}
Any examples / ideas ?
Thanks all.
| 0 | [
2,
307,
7061,
45,
3187,
13,
118,
5314,
2132,
815,
1809,
160,
800,
3726,
3726,
19,
51,
3010,
31,
57,
21,
234,
16,
1809,
160,
37,
307,
1,
6156,
43,
25603,
106,
2684,
9,
98,
31,
259,
20,
107,
25,
35,
485,
85,
298,
17,
3077,
53,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Good JavaScript IDE with JQuery support ?
===
I'm planing to start learning JQuery (among other things), so I'm looking for a **good Javascript editor** that can preferably provide some of the following features:
- Syntax coloring
- Contextual help for standard JS functions, JQuery functions and possibly custom ones.
- Some code completion.
- (optional) JS debugging
Is there such and editor out here? or any that come close to this?
| 4 | [
2,
254,
8247,
8741,
13,
3448,
29,
487,
8190,
93,
555,
13,
60,
800,
3726,
3726,
31,
22,
79,
944,
68,
20,
799,
2477,
487,
8190,
93,
13,
5,
21068,
89,
564,
6,
15,
86,
31,
22,
79,
699,
26,
21,
13,
1409,
3264,
8247,
8741,
1835,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
jQuery - Live Validation Plug-ins
===
I'm looking for a plugin for jQuery that can validate as a key is pressed and after it loses focus (text boxes).
I'm currently using [jVal - jQuery Form Field Validation Plugin][1]. It works pretty good. The only issue I have is that I can only use a generic error message.
For example:
I need a string to between 2 and 5 characters. If its too short I would like to display an error message that indicates it to short, equally if its too long. I know I could display an error message that requires the string to between 2 and 5 characters. **The validation that is being done is more complicated.**
Any ideas of other validators or how I could use this plug-in to display unique error messages.
Thanks
[1]: http://www.overset.com/2008/07/31/jval-jquery-form-field-validation-plugin/ | 0 | [
2,
487,
8190,
93,
13,
8,
515,
27999,
10922,
8,
108,
18,
800,
3726,
3726,
31,
22,
79,
699,
26,
21,
10922,
108,
26,
487,
8190,
93,
30,
92,
7394,
1373,
28,
21,
1246,
25,
2931,
17,
75,
32,
14745,
1776,
13,
5,
11969,
8120,
6,
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... |
JSP struts
===
How would I assign a variable within scriplet code in JSP <%> </%> and then use struts logic tags to do stuff based on the value of the variable assigned in the scriplet code block?
I have tried using struts:logic equal and greaterthan to no avail....
Many Thanks,
| 0 | [
2,
487,
3401,
18316,
18,
800,
3726,
3726,
184,
83,
31,
13952,
21,
7612,
363,
13,
18,
28215,
1336,
1797,
19,
487,
3401,
13,
1,
11881,
1,
13,
1,
118,
11881,
1,
17,
94,
275,
18316,
18,
7085,
3383,
18,
20,
107,
3217,
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... |
C# - Exception messages in English?
===
We are logging any exceptions that happen in our system by writing the Exception.Message to a file. However, they are written in the culture of the client. And Turkish errors don't mean a lot to me.
So how can we log any error messages in English without changing the users culture? | 0 | [
2,
272,
5910,
13,
8,
5391,
7561,
19,
486,
60,
800,
3726,
3726,
95,
50,
13,
13919,
186,
13392,
30,
2384,
19,
318,
329,
34,
1174,
14,
5391,
9,
3845,
18,
1303,
20,
21,
3893,
9,
207,
15,
59,
50,
642,
19,
14,
1365,
16,
14,
6819,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How to keep your own debug lines without checking them in?
===
When working on some code, I add extra debug logging of some kind to make it easier for me to trace the state and values that I care about for this particular fix.
But if I would check this in into the source code repository, my colleagues would get angry on me for polluting the Log output and polluting the code.
So how do I locally keep these lines of code that are important to me, without checking them in? | 0 | [
2,
184,
20,
643,
154,
258,
121,
16254,
1560,
366,
9886,
105,
19,
60,
800,
3726,
3726,
76,
638,
27,
109,
1797,
15,
31,
3547,
2230,
121,
16254,
13,
13919,
16,
109,
825,
20,
233,
32,
4950,
26,
55,
20,
5565,
14,
146,
17,
4070,
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... |
Unix: Getting Export PATH to "Stick"
===
When setting the export path in Unix, example:
export PATH=$PATH: $EC2_HOME/bin
If I quit terminal and open it back up to continue working, I have to go through all the steps again, setting up the paths each time.
I'm wondering how I can set the path and have it "stick" so my system knows where to find everything the next time I open terminal without having to do it all over again.
Thanks! | 0 | [
2,
22540,
45,
1017,
7487,
2013,
20,
13,
7,
10277,
7,
800,
3726,
3726,
76,
2697,
14,
7487,
2013,
19,
22540,
15,
823,
45,
7487,
2013,
3726,
4403,
8353,
45,
5579,
3319,
135,
1,
8167,
118,
4772,
100,
31,
6489,
3855,
17,
368,
32,
97,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
MFC: What on earth is a Caret?
===
What on earth is a caret in the context of a CSplitterWnd class? I can't find any documentation relating explicitly to CSplitterWnds... | 0 | [
2,
307,
7061,
45,
98,
27,
1073,
25,
21,
781,
38,
60,
800,
3726,
3726,
98,
27,
1073,
25,
21,
781,
38,
19,
14,
4141,
16,
21,
272,
25603,
815,
6156,
43,
718,
60,
31,
92,
22,
38,
477,
186,
13945,
8456,
13108,
20,
272,
25603,
815... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
Nullable type as a generic parameter possible?
===
I want to do something like this :
myYear = record.GetValueOrNull<int?>("myYear"),
Notice the nullable type as the generic paramater.
Since the GetValueOrNull function could return null my first attempt was this :
public static T GetValueOrNull<T>(this DbDataRecord reader, string columnName) where T : class
{
object columnValue = reader[columnName];
if (!(columnValue is DBNull))
{
return (T)columnValue;
}
return null;
}
But the error I get now is
*The type 'int?' must be a reference type in order to use it as parameter 'T' in the generic type or method*
Right! Nullable<int> is a stuct! So I tried changing the class contstrainted to a stuct constrained (and as a side effect can't return null anymore) :
public static T GetValueOrNull<T>(this DbDataRecord reader, string columnName) where T : stuct
Now the assingment
myYear = record.GetValueOrNull<int?>("myYear")
Gives the following error
*The type 'int?' must be a non-nullable value type in order to use it as parameter 'T' in the generic type or method*
Is specifying a nullable type as a generic parameter at all possible?
| 0 | [
2,
16203,
579,
1001,
28,
21,
12733,
18906,
938,
60,
800,
3726,
3726,
31,
259,
20,
107,
301,
101,
48,
13,
45,
51,
731,
800,
571,
9,
3060,
15165,
248,
4215,
211,
1,
6391,
60,
1,
5,
7,
915,
731,
7,
6,
15,
3551,
14,
16203,
579,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How much does it cost to develop an iphone application?
===
How much can a developer charge for an iphone app like twitterrific. I want to know this because I need such an app with the same functionality for a new community website. I can do Ruby but have no experience with Objective C. So it would be interesting for me if I should start reading books about iPhone programming or outsource the work to a iPhone programmer. | 2 | [
2,
184,
212,
630,
32,
1516,
20,
2803,
40,
21024,
3010,
60,
800,
3726,
3726,
184,
212,
92,
21,
10058,
1906,
26,
40,
21024,
4865,
101,
10623,
9807,
596,
9,
31,
259,
20,
143,
48,
185,
31,
376,
145,
40,
4865,
29,
14,
205,
18548,
2... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
What is a way for a web browser to communicate with a hardware device?
===
I have a data acquisition hardware device that I'd like to send some information and settings, acquire some data, and then retrieve the acquired data. The plan is to use a web portal to communicate with the device. I was planning on writing a DLL to talk to the device. My environment is Windows using IE as the browser. What is the best way to communicate from a web browser client to a client side device?
**Please respond with one method per answer so people can vote on indenpendent answers.**
As with all StackOverflow Poll type Q&As, please make certain your answer is NOT listed already before adding a new answer
- If it already exists, vote that one up so we see what the most popular answer is, rather than duplicating an existing entry.
- If you see a duplicate, vote it down so the top entries have only one of each model listed.
- If you have interesting or additional information to add, use a comment to the entry it applies to rather than creating a duplicate.
| 0 | [
2,
98,
25,
21,
161,
26,
21,
2741,
16495,
20,
8709,
29,
21,
7610,
3646,
60,
800,
3726,
3726,
31,
57,
21,
1054,
5860,
7610,
3646,
30,
31,
22,
43,
101,
20,
2660,
109,
676,
17,
12410,
15,
8942,
109,
1054,
15,
17,
94,
11917,
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... |
Matching a time string with a regular expression
===
I would like to match the time (10.00) from a string with the date and time ("21.01.08 10.00"). I'm using the following regular expression:
new RegExp("\\b[0-9]{1,2}\\.[0-9]{1,2}\\b" "g");
But this matches 21.01 from 21.01.08 and 10.00.
I'm using PCRE as my regualar expression engine. | 0 | [
2,
10120,
21,
85,
3724,
29,
21,
1290,
1803,
800,
3726,
3726,
31,
83,
101,
20,
730,
14,
85,
13,
5,
1036,
9,
2032,
6,
37,
21,
3724,
29,
14,
1231,
17,
85,
13,
5,
7,
1941,
9,
3026,
9,
3099,
332,
9,
2032,
7,
6,
9,
31,
22,
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... |
Special Characters in XML
===
I am creating a left navigation system utilizing xml and xsl. Everything was been going great until I tried to use a special character in my xml document. I am using » and I get th error.
reason: Reference to undefined entity 'raquo'.
error code: -1072898046
How do I amke this work?
Thanks
| 0 | [
2,
621,
1766,
19,
23504,
800,
3726,
3726,
31,
589,
2936,
21,
225,
8368,
329,
19894,
23504,
17,
993,
18,
255,
9,
796,
23,
74,
228,
374,
163,
31,
794,
20,
275,
21,
621,
925,
19,
51,
23504,
4492,
9,
31,
589,
568,
279,
525,
8970,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 search TFS for a word without 'getting' the project?
===
I often have occasion to search for a function name in a project that I haven't retrieved from Team Foundation Server (TFS) and that I don't want to retrieve. Is there a way to search for that function name (any word) on TFS? | 0 | [
2,
184,
107,
31,
2122,
13,
11720,
18,
26,
21,
833,
366,
13,
22,
27380,
22,
14,
669,
60,
800,
3726,
3726,
31,
478,
57,
5434,
20,
2122,
26,
21,
1990,
204,
19,
21,
669,
30,
31,
2933,
22,
38,
3685,
37,
173,
1304,
8128,
13,
5,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Borland inlined assembler, current location counter
===
I am using Borland Turbo C++ with some inlined assembler code, so presumably Turbo Assembler (TASM) style assembly code. I wish to do the following:
void foo::bar( void )
{
__asm
{
mov eax, SomeLabel
// ...
}
// ...
SomeLabel:
// ...
}
So the address of SomeLabel is placed into EAX. This doesnt work and the compiler complains of: Undefined symbol 'SomeLabel'.
In Microsoft Assembler (MASM) the dollar symbol ($) serves as the current location counter, which would be usefull for my purpose. But again this does not seem to work in Borlands Assember (expression syntax error).
Can anybody suggest how to get this working?
Many thanks in advance. | 0 | [
2,
3895,
618,
19,
15875,
13,
13736,
139,
15,
866,
1474,
2105,
800,
3726,
3726,
31,
589,
568,
3895,
618,
12036,
272,
20512,
29,
109,
19,
15875,
13,
13736,
139,
1797,
15,
86,
12411,
12036,
13,
13736,
139,
13,
5,
6922,
79,
6,
1034,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 point of the var keyword?
===
The [var][1] keyword does away with the need for an explicit type declaration and I have read with interest the [SO discussion][2] of when it might be appropriate.
I have also read about (but not used) [Boo][3] which seems to take things a step further by making it [optional to declare a local variable][4]. With Boo, both the type and the declaration can be implied.
Which leads me to wonder, why did the C# language designers bother to include a var keyword at all?
[1]: http://msdn.microsoft.com/en-us/library/bb384061.aspx
[2]: http://stackoverflow.com/questions/41479/use-of-var-keyword-in-c
[3]: http://boo.codehaus.org
[4]: http://boo.codehaus.org/Type+Inference | 0 | [
2,
98,
22,
18,
14,
454,
16,
14,
4033,
1246,
9587,
60,
800,
3726,
3726,
14,
636,
3311,
500,
2558,
165,
500,
1246,
9587,
630,
229,
29,
14,
376,
26,
40,
14990,
1001,
7098,
17,
31,
57,
1302,
29,
1163,
14,
636,
656,
5460,
500,
2558... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How to make Dojo a bit more lightweight?
===
I've been looking at Dojo, and it has some nice tricks, however its quite huge IMHO. Basically when viewing my test my slow machine (600mhz), just loading Dojo was kind of painful, and can imagine lots of mobile devices will also not be happy with it.
Is there a slim version or something like that available? | 0 | [
2,
184,
20,
233,
107,
1636,
21,
1142,
91,
13613,
60,
800,
3726,
3726,
31,
22,
195,
74,
699,
35,
107,
1636,
15,
17,
32,
63,
109,
2210,
13747,
15,
207,
82,
1450,
2329,
797,
1807,
9,
11374,
76,
11244,
51,
1289,
51,
2276,
1940,
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... |
.htaccess redirect performance
===
Are htaccess redirects any slower/put any more strain on Apache than redirects in configuration files? Also, how big can a number of redirects in htaccess get before they start decreasing performance? | 0 | [
2,
13,
9,
9020,
20604,
302,
14706,
956,
800,
3726,
3726,
50,
13,
9020,
20604,
302,
14706,
18,
186,
14085,
118,
4881,
186,
91,
8302,
27,
17140,
119,
302,
14706,
18,
19,
8091,
6488,
60,
67,
15,
184,
580,
92,
21,
234,
16,
302,
1470... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
Best XSLT Editor &| Debugger
===
Other than Visual Studio, what tool have you found best to create, edit, maintain, and possibly debug your XSLT files?
I work on a fairly big project and we have tons of XSLT files and they have grown quite complex in their implementation.
The language seems so brittle. It would be nice to navigate and identify errors more quickly.
| 4 | [
2,
246,
993,
18,
255,
38,
1835,
279,
1,
121,
2345,
11356,
800,
3726,
3726,
89,
119,
3458,
1120,
15,
98,
5607,
57,
42,
216,
246,
20,
1600,
15,
9392,
15,
4027,
15,
17,
2879,
121,
16254,
154,
993,
18,
255,
38,
6488,
60,
31,
170,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Bundling .NET in installer
===
Would you (or your customers) rather download a 1mb installer and perhaps be prompted to download and install .NET, or a 23mb installer and never need to even know what .NET is?
Chris | 0 | [
2,
5502,
11371,
13,
9,
2328,
19,
16146,
106,
800,
3726,
3726,
83,
42,
13,
5,
248,
154,
5279,
6,
864,
7121,
21,
137,
5024,
16146,
106,
17,
1774,
44,
9491,
20,
7121,
17,
16146,
13,
9,
2328,
15,
54,
21,
1137,
5024,
16146,
106,
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,
0,
0,
0,
0,
0... |
ORM for Database with 1000+ Tables
===
I'm looking for a solid ORM for .NET that can handle over a 1000 tables and entities. What can you suggest? Any comments would be appreciated, but those from people who have actually dealth with this challenge and a description of how with what they dealt with it would be appreciated even more. | 0 | [
2,
54,
79,
26,
6018,
29,
6150,
2430,
7484,
800,
3726,
3726,
31,
22,
79,
699,
26,
21,
2941,
54,
79,
26,
13,
9,
2328,
30,
92,
3053,
84,
21,
6150,
7484,
17,
12549,
9,
98,
92,
42,
5601,
60,
186,
7534,
83,
44,
13746,
15,
47,
27... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
.Net Consuming Web Service: Identical types in two different services
===
I have to consume 2 different web services. Both contain a definition for a 'user' object.
When I reference the services using "Add service reference" I give each service a unique namespace:
com.xyz.appname.ui.usbo.UserManagement
com.xyz.appname.ui.usbo.AgencyManagement
The problem I have is that each one of the proxies that are generated contain a new user class. One is located at com.xyz.appname.ui.usbo.UserManagement.user and the other at com.xyz.appname.ui.usbo.AgencyManagement.user. However, the user objects are identical and I would like to treat them as such.
Is there a way that I can somehow reference the user object as one object instead of treating them as two different?
I am using .Net 3.5 to consume the service.
Thanks!! | 0 | [
2,
13,
9,
2328,
13,
17601,
2741,
365,
45,
6323,
2551,
19,
81,
421,
687,
800,
3726,
3726,
31,
57,
20,
16447,
172,
421,
2741,
687,
9,
156,
3717,
21,
5465,
26,
21,
13,
22,
16704,
22,
3095,
9,
76,
31,
2801,
14,
687,
568,
13,
7,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Asp.Net Role-based authentication using Security groups in Active Directory
===
I am attempting to do something simple (I thought) - securing my application using roles-based security using ActiveD groups in our Domain.
Specifically, I need to show/hide items on a page depending upon whether the currently logged in user is part of "domain\groupA" in ActiveD. For some reason, it is difficult finding information on using ActiveD for this. Everything I seem to find goes into details of using forms-based authentication using roles, or it uses a DB to store the information.
All I want to do is use our already outlined security structure in our Active Directory. Can someone please explain what I need?
Do I need:
1) <roleManager enabled="true"/> in web.config
2) <allow roles ="domain\groupA"/> in web.config
3) IIS set to windows authentication
4) if (User.IsInRole(@"domain\groupA")){ //do stuff } in my page?
What else am I missing? Anything? 'cause its not working. heh.
Thanks all for your help.
| 0 | [
2,
28,
306,
9,
2328,
597,
8,
1281,
27963,
568,
1221,
1170,
19,
1348,
16755,
800,
3726,
3726,
31,
589,
6314,
20,
107,
301,
1935,
13,
5,
49,
289,
6,
13,
8,
13498,
51,
3010,
568,
2954,
8,
1281,
1221,
568,
1348,
43,
1170,
19,
318,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
JQuery: has a button been pressed again within so many milliseconds..
===
I'm writing a web application that decodes Morse Code that is tapped in using mouse button.
I originally did a proof of concept using conventional JavaScript, but now I'm redoing it using jQuery.
Is there a clever way with jQuery to tell if a button has been pressed again within so many milliseconds, or not - and run some jQuery code if the button was NOT pressed again.
I've been going over the jQuery API and I'm not seeing a clever way of doing this....
Any ideas...
Derek | 0 | [
2,
487,
8190,
93,
45,
63,
21,
5167,
74,
2931,
188,
363,
86,
151,
13436,
5007,
18,
9,
9,
800,
3726,
3726,
31,
22,
79,
1174,
21,
2741,
3010,
30,
12015,
3196,
19020,
1797,
30,
25,
11218,
19,
568,
7567,
5167,
9,
31,
912,
144,
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... |
Traversing a unidirectional tree efficiently
===
I've got a unidirectional tree of objects, in which each objects points to its parent. Given an object, I need to obtain its entire subtree of descendants. The objects are not actually in any data structure, but I can easily get a collection of all the objects.
The naive approach is to examine each object in the batch, see if the given object is an ancestor, and keep it aside. This would not be too efficient... It carries an overhead of O(N*N), where N is the number of objects.
Another approach is the recursive one, meaning search for the object's direct children and repeat the process for the next level. Unfortunately the tree is unidirectional... there's no direct approach to the children, and this would be only slightly less costly than the previous approach.
My question: Is there an efficient algorithm I'm overlooking here?
Thanks,
Yuval =8-) | 0 | [
2,
19501,
68,
21,
9911,
19393,
1541,
20519,
800,
3726,
3726,
31,
22,
195,
330,
21,
9911,
19393,
1541,
16,
3916,
15,
19,
56,
206,
3916,
819,
20,
82,
4766,
9,
504,
40,
3095,
15,
31,
376,
20,
5545,
82,
1078,
972,
8101,
16,
8568,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
C# Remoting - How to turn off CustomErrors
===
I getting the following error when I try to connect to my server app using remoting:
> *A problem seems to have occured whilst connecting to the remote server:
> Server encountered an internal error. For more information, turn off customErrors in the server's .config file.*
This is the code on my server app:
TcpChannel tcpChannel = new TcpChannel(999);
MyRemoteObject remObj = new MyRemoteObject (this);
RemotingServices.Marshal(remObj, "MyUri");
ChannelServices.RegisterChannel(tcpChannel);
It seems to work the first time, but unless the server app is restarted the error occurs.
I would guess something isn't being cleaned up properly but I'm not sure what as the customError is still on.
Any ideas where I start. Thanks. | 0 | [
2,
272,
5910,
302,
7662,
68,
13,
8,
184,
20,
805,
168,
5816,
29992,
18,
800,
3726,
3726,
31,
1017,
14,
249,
7019,
76,
31,
1131,
20,
6379,
20,
51,
8128,
4865,
568,
302,
7662,
68,
45,
13,
1,
1637,
58,
1448,
2206,
20,
57,
3744,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
DLLImport Int** - How to do this if it can be done.
===
I am trying to use a third party DLL that wants an int** as one of the parameters to the method. It describes the parameter as the address of the pointer that will point to the memory allocation. | 0 | [
2,
13,
8643,
8585,
1993,
19,
38,
1409,
13,
8,
184,
20,
107,
48,
100,
32,
92,
44,
677,
9,
800,
3726,
3726,
31,
589,
749,
20,
275,
21,
422,
346,
13,
43,
211,
30,
2846,
40,
19,
38,
1409,
28,
53,
16,
14,
12905,
20,
14,
2109,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 devenv flag to disable pdb generation at compile time?
===
Our continuous integration system currently runs a perl script to parse our sln/proj files to set the following options:
DebugInformationFormat="0"
GenerateDebugInformation="FALSE"
Preventing generation of pdbs allows us to increase the parallelization of the CIS compile. However, this method seems hacky and occasionally fails - is there a better method?
The only alternative I can think of is adding a configuration called REALEASE_NOPDB, but I'm afraid that will complicate maintenance of the REALEASE configuration - maintainers will have to ensure to reflect all changes to the NOPDB version when changes are made.
Suggestions? | 0 | [
2,
25,
80,
21,
121,
3124,
710,
3157,
20,
1460,
579,
351,
9007,
2782,
35,
26561,
85,
60,
800,
3726,
3726,
318,
6357,
8078,
329,
871,
1461,
21,
416,
255,
3884,
20,
2017,
870,
318,
13,
18,
16600,
118,
2740,
728,
6488,
20,
309,
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... |
C# equivelent to java's wait and notify?
===
I am aware that you can lock an object in c# using lock but can you give up the lock and wait for something else to notify you that it's changed like you can in java with wait and notify?
It seems to me that synchronised and lock in java and c# respectively are synonomous. | 0 | [
2,
272,
5910,
13,
9629,
195,
13465,
20,
8247,
22,
18,
1760,
17,
52,
8612,
60,
800,
3726,
3726,
31,
589,
3854,
30,
42,
92,
3991,
40,
3095,
19,
272,
5910,
568,
3991,
47,
92,
42,
590,
71,
14,
3991,
17,
1760,
26,
301,
962,
20,
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... |
C# Console Application still resident in memory after exit
===
I have an .net C# console application (not a service). it basically connects to a webservice, gets some xml files, copies those files to a few location on a drives, validates the xml, processes it and sends these objects to another web service.
However, when the main method exists (and the console window closes) I can still see the process in task manager.
I tried surrounding everything in the main method with a try, to catch an ApplicationException, and I still got nothing as to why the app crashes even though everything works smoothly otherwise...
Anybody has a clue as to where to begin to check for the faulty part?
| 0 | [
2,
272,
5910,
8650,
3010,
174,
5321,
19,
1912,
75,
4350,
800,
3726,
3726,
31,
57,
40,
13,
9,
2328,
272,
5910,
8650,
3010,
13,
5,
1270,
21,
365,
6,
9,
32,
11374,
8534,
20,
21,
2741,
11449,
15,
3049,
109,
23504,
6488,
15,
3298,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 discard incoming packets in raw socket?
===
I'm writing a C/C++ application under Linux that reads data from a raw socket (for ICMP packets). Question: is there a way to discard all data that is still queued on the socket?
The problem is that after sleeping for a while, there is data queued up on the socket which I'm not interested in; so it would be best to just tell the socket "forget all data you have buffered right now", so that if I go into a select()/recvfrom() loop then, I only get data that was received recently.
Is there a better way than going into a separate poll()/recvfrom() loop first? Some socket API call maybe? Portable, even? :-)
| 0 | [
2,
184,
20,
26251,
17126,
12795,
18,
19,
4333,
18482,
60,
800,
3726,
3726,
31,
22,
79,
1174,
21,
272,
118,
150,
20512,
3010,
131,
13024,
30,
11137,
1054,
37,
21,
4333,
18482,
13,
5,
1106,
13,
596,
2554,
12795,
18,
6,
9,
1301,
45... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Javascript registering event to object
===
I have an activex object I loaded into an html page. I then use that activex object to create another object, but I need to register an event with the new object created. The object is expecting an event listener of a certain type.
I can load this same dll in c# and it will work fine. Code looks like this for c#.
upload = obj.constructUploadObj(uploadConfig);
upload.stateChanged += new UploadActionEvents_stateChangedEventHandler(upload_stateChanged);
In javascript I have similar code however I cannot get the event registered with the object.
uploadAction = obj.constructUploadObj(uploadConfig);
uploadAction.stateChanged = upload_stateChanged;
function upload_stateChanged(sender){
writeLine("uploadState changed " + sender.getState());
}
I have enumerated some of the properties of the uploadAction object in javascript to ensure that it is actually created. When I try and register the event with uploadAction it throws an error saying "Object doesn't support this property or method."
To me it seems like its expecting a strongly typed event. Is there anyway to register the event similar to that of C# in javascript?
Thanks In Advance. | 0 | [
2,
8247,
8741,
2243,
68,
807,
20,
3095,
800,
3726,
3726,
31,
57,
40,
1348,
396,
3095,
31,
8572,
77,
40,
13,
15895,
2478,
9,
31,
94,
275,
30,
1348,
396,
3095,
20,
1600,
226,
3095,
15,
47,
31,
376,
20,
2243,
40,
807,
29,
14,
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... |
Regarding Linux Programming
===
I am working on C++ and COM/ATL in Windows from last few years. Now I want to shift to Linux Programming. I know basic architecture of Linux. I did some of the projects which are using ncurses library(Terminal Applications) under Linux. On which tool I should be familiar to do professional projects.
| 0 | [
2,
3467,
13024,
3143,
800,
3726,
3726,
31,
589,
638,
27,
272,
20512,
17,
13,
960,
118,
721,
255,
19,
1936,
37,
236,
310,
122,
9,
130,
31,
259,
20,
4471,
20,
13024,
3143,
9,
31,
143,
2125,
2607,
16,
13024,
9,
31,
144,
109,
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... |
Excel Macro - how to set X axis?
===
I have a chart in a Worksheet in Excel and I have a macro set up so that when I change the value in a certain cell the range of data in the chart is set to A2 down as far as the row number corresponding in the this certain cell.
What I can't seem to be able to do is to modify the axis as the specified axis no longer covers the range of the graph i.e. the current x axis is set to:
=Sheet1!$C$2:$C$600
I can't figure out how I can update this in a macro. Any help would be much appreciated. | 0 | [
2,
20700,
9069,
13,
8,
184,
20,
309,
993,
8577,
60,
800,
3726,
3726,
31,
57,
21,
1795,
19,
21,
170,
17627,
19,
20700,
17,
31,
57,
21,
9069,
309,
71,
86,
30,
76,
31,
753,
14,
1923,
19,
21,
1200,
1667,
14,
978,
16,
1054,
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... |
Best way to determine how to case an object to an appropriate type in C#?
===
I am currently developing an approval routing WCF service that will allow an user to create "rules" which determine how an request is routed. The route is determined by comparing the "ObjectToEvaluate" property of the Request class against the "ObjectToEvaluate" property of the "Rule" class. The "UnitOfMeasurement" enum determines how to cast the "ObjectToEvaluate" property for each class.
public enum UnitOfMeasurement
{
Currency = 1,
Numeric = 2,
Special = 3,
Text = 4,
}
public class Request
{
public object ObjectToEvaluate { get; set; }
}
public class Rule
{
public object ObjectToEvaluate { get; set; }
public void ExecuteRule()
{
//logic to see if it passes the rule condition
}
}
What would be the best way to implement the method to cast the "ObjectToEvaluate" property using the "UnitOfMeasurement" enum?
| 0 | [
2,
246,
161,
20,
3746,
184,
20,
610,
40,
3095,
20,
40,
4593,
1001,
19,
272,
5910,
60,
800,
3726,
3726,
31,
589,
871,
3561,
40,
4988,
19880,
11801,
410,
365,
30,
129,
1655,
40,
4155,
20,
1600,
13,
7,
16154,
18,
7,
56,
3746,
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... |
Need a book on rails - does it need to cover 2.0?
===
This is similar to a previous question on [Rails Books][1], but I'm looking for a little more detail on something that was brought up in that thread.
I'm starting a project using Rails 2.0 next week, and I'd like a book to read to get going. Dead-tree format is a must, this is for the bus.
[Agile Web Development][2] with Rails seems to be the defacto standard, but it covers rails 1.2, and [2.0 changes a bunch][3], apparently.
Am I better off buying a book on rails 2.0 ([Simply Rails 2][4] seems like a promising candidate, but I'm definitely open to other suggestions)? Or should I go with Agile?
[1]: http://stackoverflow.com/questions/83784/rails-books
[2]: http://pragprog.com/titles/rails2/agile-web-development-with-rails
[3]: http://stackoverflow.com/questions/83784/rails-books#108898
[4]: http://www.amazon.com/Simply-Rails-2-Patrick-Lenz/dp/0980455200 | 0 | [
2,
376,
21,
360,
27,
2240,
18,
13,
8,
630,
32,
376,
20,
1227,
172,
9,
387,
60,
800,
3726,
3726,
48,
25,
835,
20,
21,
1158,
1301,
27,
636,
7301,
18,
964,
500,
2558,
165,
500,
15,
47,
31,
22,
79,
699,
26,
21,
265,
91,
6110,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 generically tell if a Java Class is a primitive type?
===
Is there any way to take a Class and determine if it represents a primitive type (is there a solution that doesn't require specifically enumerating all the primitive types)?
NOTE: I've seen [this question][1]. I'm asking basically the opposite. I have the Class, I want to know if it's a primitive.
[1]: http://stackoverflow.com/questions/180097/dynamically-find-the-class-that-represents-a-primitive-java-type | 0 | [
2,
184,
92,
31,
12733,
1326,
494,
100,
21,
8247,
718,
25,
21,
11473,
1001,
60,
800,
3726,
3726,
25,
80,
186,
161,
20,
247,
21,
718,
17,
3746,
100,
32,
4719,
21,
11473,
1001,
13,
5,
403,
80,
21,
4295,
30,
1437,
22,
38,
4077,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Cross apply in Linq
===
Is it possible to use SQL Server 2008 CROSS APPLY using LINQ?
In SQL, an example could be:
select d.dateCol, tvf.descr, tvf.value
from dateTable d
cross apply tvFunction(d.dt, 'anotherParam') tvf
where d.category='someCat'
CROSS APPLY enables using values from a table (dateTable in the example) and using these as parameters to a tablevalue function. This is very usefull if you need do do a complex calculation (encapsulated in a table value function) for a range of inputs.
| 0 | [
2,
919,
5645,
19,
6294,
1251,
800,
3726,
3726,
25,
32,
938,
20,
275,
4444,
255,
8128,
570,
919,
5645,
568,
6294,
1251,
60,
19,
4444,
255,
15,
40,
823,
110,
44,
45,
5407,
13,
43,
9,
8209,
7771,
15,
983,
410,
9,
3196,
6711,
15,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Select columns from result set of stored procedure
===
I have a stored procedure that returns 80 columns, and 300 rows. I want to write a select that gets 2 of those columns. Something like
SELECT col1, col2 FROM EXEC MyStoredProc 'param1', 'param2'
When I used the above syntax I get the error "Invalid Column Name".
I know the easiest solution would be to change the stored procedure, but I didn't write it, and I can't change it.
is there any way to do what I want?
| 0 | [
2,
5407,
7498,
37,
829,
309,
16,
8214,
7004,
800,
3726,
3726,
31,
57,
21,
8214,
7004,
30,
4815,
2972,
7498,
15,
17,
3565,
11295,
9,
31,
259,
20,
2757,
21,
5407,
30,
3049,
172,
16,
273,
7498,
9,
301,
101,
5407,
3313,
165,
15,
3... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
What value to use? C#
===
If i have a string (010) and i want to add 1 to it (011) what value type should i use to convert this string into a number for adding and at the sametime pervser the whole number and not 10 + 1 = 11. | 0 | [
2,
98,
1923,
20,
275,
60,
272,
5910,
800,
3726,
3726,
100,
31,
57,
21,
3724,
13,
5,
387,
1036,
6,
17,
31,
259,
20,
3547,
137,
20,
32,
13,
5,
387,
1306,
6,
98,
1923,
1001,
378,
31,
275,
20,
8406,
48,
3724,
77,
21,
234,
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... |
UI for easy, simultaneous adjustment of multiple controls
===
I am developing a specialty application where the end-user needs to operate multiple controls simultaneously. The application is used to "tune" the control parameters of an electronic device to calibrate the unit to its best performance.
Currently, there is a UI with multiple graphical sliders which the operator click-drags one slider at a time. He can also click on a slider, and use the mouse-scroll wheel, which is a little easier to use.
This works, sort of, but is somewhat cumbersome. The various parameters (5 in this particular case) are sufficiently independent of each other so that I can't just refactor the parameters into a single adjustment. And, if the operator can keep his eye on the device being adjusted, rather than the UI of the control application, it would speed up and simplify his work.
One idea that I had was that I might buy a whole bunch of the USB jog-dial products, and bind each dial to a specific control. This way, the operator can quickly adjust any parameter, or even two parameters simultaneously. (BTW, Griffin PowerMate comes to immediate mind, but I know there are a few other jog dials out there.)
Do you have any suggestions? | 0 | [
2,
13,
5661,
26,
2010,
15,
4861,
1287,
11613,
1291,
16040,
16,
1886,
8671,
800,
3726,
3726,
31,
589,
3561,
21,
13744,
3010,
113,
14,
241,
8,
16704,
2274,
20,
4055,
1886,
8671,
6888,
9,
14,
3010,
25,
147,
20,
13,
7,
38,
6763,
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... |
Why must someone be subscribed for an event to occur?
===
class Tree
{
public event EventHandler MadeSound;
public void Fall() { MadeSound(this, new EventArgs()); }
static void Main(string[] args)
{
Tree oaky = new Tree();
oaky.Fall();
}
}
I haven't used events much in C#, but the fact that this would cause a NullRefEx seems weird. The EventHandler reference is considered null because it currently has no subsribers - but that doesn't mean that the event hasn't occurred, does it?
EventHandlers are differentiated from standard delegates by the **event** keyword. Why didn't the language designers set them up to fire silently in to the void when they have no subscribers? (I gather you can do this manually by explicitly adding an empty delegate).
| 0 | [
2,
483,
491,
737,
44,
13,
20330,
43,
26,
40,
807,
20,
3744,
60,
800,
3726,
3726,
718,
1541,
13,
1,
317,
807,
807,
3203,
1252,
117,
8489,
73,
317,
11364,
1080,
5,
6,
13,
1,
117,
8489,
5,
1565,
15,
78,
807,
10663,
18,
5,
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... |
In a WPF ListView how can I prevent auto scrolling?
===
I have a WPF ListView which currently scrolls everytime I click on an item which is only partially visible. How can I keep the control from scrolling that item into view (instead simply selecting the partially visible one)? This behavior is very annoying when doing a drag from this control.
Thanks. | 0 | [
2,
19,
21,
619,
7721,
968,
4725,
184,
92,
31,
2501,
3108,
13,
28166,
60,
800,
3726,
3726,
31,
57,
21,
619,
7721,
968,
4725,
56,
871,
12159,
18,
352,
891,
31,
10840,
27,
40,
9101,
56,
25,
104,
5933,
4560,
9,
184,
92,
31,
643,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Has anyone tried Divmod's "Ultimate Quality Development System"?
===
[Ultimate Quality Development System][1]
[1]: http://divmod.org/trac/wiki/UltimateQualityDevelopmentSystem
Does anyone have any experience with this or a similar methodology, good or bad? | 0 | [
2,
63,
1276,
794,
13,
12916,
13670,
22,
18,
13,
7,
10368,
49,
5281,
2190,
522,
329,
7,
60,
800,
3726,
3726,
636,
10368,
49,
5281,
2190,
522,
329,
500,
2558,
165,
500,
636,
165,
500,
45,
7775,
6903,
12916,
13670,
9,
5583,
118,
38... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Best JavaScript Unit Testing and Mocking Frameworks?
===
My main JavaScript framework is [jQuery][1] so I would like my unit test and mocking frameworks to be compatible with that. I'd rather not have to introduce another JavaScript framework.
I am currently using [QUnit][2] for unit testing and [Jack][3] for mocking, but I am pretty new to the whole unit testing of JavaScript.
Does anyone else have a better tool to suggest? What has worked for you?
[1]: http://jquery.com/
[2]: http://docs.jquery.com/QUnit
[3]: http://boss.bekk.no/display/BOSS/Jack | 0 | [
2,
246,
8247,
8741,
1237,
4431,
17,
18446,
6596,
18,
60,
800,
3726,
3726,
51,
407,
8247,
8741,
6596,
25,
636,
728,
8190,
93,
500,
2558,
165,
500,
86,
31,
83,
101,
51,
1237,
1289,
17,
18446,
6596,
18,
20,
44,
14961,
29,
30,
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... |
Non-Standard Attributes on HTML Tags. Good Thing? Bad Thing? Your Thoughts?
===
HTML (or maybe just XHTML?) is relatively strict when it comes to non-standard attributes on tags. If they aren't part of the spec, then your code is considered non-compliant.
Non-standard attributes can be fairly useful for passing along meta-data to Javascript however. For instance, if a link is suppose to show a popup, you can set the name of the popup in an attribute:
<a href="#null" class="popup" popup_title="Title for My Popup">click me</a>
Alternatively, you can store the title for the popup in a hidden element, like a span:
<style>
.popup .title { display: none; }
</style>
<a href="#null" class="popup">
click me
<span class="title">Title for My Popup</span>
</a>
I am torn however as to which should be a preferred method. The first method is more concise and, I'm guessing, doesn't screw with search engines and screen readers as much. Conversely, the second option makes storing large amounts of data more easy and is thusly more versatile. It is also standards compliant.
I am curious what this communities thoughts are. How do you handle a situation like this? Does the simplicity of the first method outweigh the potential downsides (if there are any)? | 0 | [
2,
538,
8,
15566,
13422,
27,
13,
15895,
3383,
18,
9,
254,
584,
60,
896,
584,
60,
154,
3064,
60,
800,
3726,
3726,
13,
15895,
13,
5,
248,
913,
114,
993,
15895,
60,
6,
25,
3109,
8170,
76,
32,
1624,
20,
538,
8,
15566,
13422,
27,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Why do I receive an ImportError when running one of the CherryPy tutorials
===
I have installed CherryPy 3.1.0,. Here is what happens when I try to run tutorial 9:
$ cd /Library/Python/2.5/site-packages/cherrypy/tutorial/
$ python tut09_files.py
Traceback (most recent call last):
File "tut09_files.py", line 48, in <module>
from cherrypy.lib import static
ImportError: cannot import name static
The previous line in the file:
import cherrypy
passes without error, so it appears that it can find cherrypy on the path. What am I missing?
| 0 | [
2,
483,
107,
31,
2588,
40,
9010,
29992,
76,
946,
53,
16,
14,
9257,
6448,
29724,
18,
800,
3726,
3726,
31,
57,
4066,
9257,
6448,
203,
9,
165,
9,
387,
15,
9,
235,
25,
98,
5531,
76,
31,
1131,
20,
485,
29724,
561,
45,
5579,
1745,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
view SQL executed by Jasper report
===
When running a Jasper report in which the SQL is embedded in the report file (.jrxml), is it possible to see the SQL that is executed? Ideally, I'd also like to see the values that are substituted for each of the '?' placeholders.
Cheers,
Don
| 0 | [
2,
1418,
4444,
255,
5557,
34,
16750,
1330,
800,
3726,
3726,
76,
946,
21,
16750,
1330,
19,
56,
14,
4444,
255,
25,
12138,
19,
14,
1330,
3893,
13,
5,
9,
13529,
396,
8184,
6,
15,
25,
32,
938,
20,
196,
14,
4444,
255,
30,
25,
5557,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
jQuery Selector
===
I'm new to jQuery so hopefully there is an easy answer to this.
I have html similar to:
<table id="dataTable">
<tr> <!-- I want this row -->
<td>...</td>
<tr>
<tr>
<td>
<table>
<tr> <!-- I do not want this row -->
<td>...</td>
</tr>
</table>
</td>
<tr>
</table>
I am using jQuery similar to this:
$("#dataTable tr").length;
I would expect length to equal 2, but its returning 3 (includes the <tr> in the nested table.) My question is: **How do I prevent the 3rd <tr> from being selected?**
I know that I could add an `ignorethisrow` class to the last row and exclude that from my results, but I'd prefer an option that allows me to control the *depth* that the select engine searches. | 0 | [
2,
487,
8190,
93,
23946,
800,
3726,
3726,
31,
22,
79,
78,
20,
487,
8190,
93,
86,
13416,
80,
25,
40,
2010,
1623,
20,
48,
9,
31,
57,
13,
15895,
835,
20,
45,
13,
1,
5924,
4924,
3726,
7,
18768,
5924,
7,
1,
13,
1,
6384,
1,
13,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Concatenating bits in VHDL
===
How do you concatenate bits in VHDL? I'm trying to use the following code:
Case b0 & b1 & b2 & b3 is
...
and it throws an error
Thanks | 0 | [
2,
1065,
793,
1316,
1880,
10181,
19,
566,
252,
8643,
800,
3726,
3726,
184,
107,
42,
1065,
9530,
8820,
10181,
19,
566,
252,
8643,
60,
31,
22,
79,
749,
20,
275,
14,
249,
1797,
45,
610,
334,
387,
279,
334,
165,
279,
334,
135,
279,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
Using python as a bash replacement
===
I currently do my textfile manipulation through a bunch of badly remembered awk, sed, bash and a tiny bit of perl.
I've seen mentioned a few places that python is good for this kind of thing, I know a little and I would like to know more. Is python a good choice for this, and is there a good book or guide to learning how to use python to replace shell scripting, awk, sed and friends? | 0 | [
2,
568,
20059,
28,
21,
13158,
4610,
800,
3726,
3726,
31,
871,
107,
51,
1854,
16877,
17561,
120,
21,
7653,
16,
5730,
3082,
13,
3885,
197,
15,
13924,
15,
13158,
17,
21,
3228,
1142,
16,
416,
255,
9,
31,
22,
195,
541,
2211,
21,
310,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 programming is taught in different countries?
===
I know it's not really a programming qestion, but I think it could be useful for all anyway.
I would like to know from people that worked with people from different countries if there's any deep difference between how and what is taught in different schools(i.e University, college..) all over the world.
I don't mean "They didn't taught me the to write the Gaussian Elimination in C++" but more on way of teaching...
Is one person coming from Italy (as me) best for a work then one from USA or vice-versa? and for what kind of work? what are those differences?
Thank you.
-luiss- | 0 | [
2,
184,
630,
3143,
25,
2359,
19,
421,
1166,
60,
800,
3726,
3726,
31,
143,
32,
22,
18,
52,
510,
21,
3143,
2593,
160,
3309,
15,
47,
31,
277,
32,
110,
44,
4811,
26,
65,
2774,
9,
31,
83,
101,
20,
143,
37,
148,
30,
577,
29,
148... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Could I improve this method with duck typing?
===
Hopefully I haven't misunderstood the meaning of "duck typing", but from what I've read, it means that I should write code based on how an object responds to methods rather than what type/class it is.
Here's the code:
def convert_hash(hash)
if hash.keys.all? { |k| k.is_a?(Integer) }
return hash
elsif hash.keys.all? { |k| k.is_a?(Property) }
new_hash = {}
hash.each_pair {|k,v| property_hash[k.id] = v}
return new_hash
else
raise "Custom attribute keys should be ID's or Property objects"
end
end
What I want is to make sure that I end up with a hash where the keys are an integer representing the ID of an ActiveRecord object. I don't particularly enjoy having to iterate through the hash keys twice with `all?` to determine if I need to grab the ID's out.
Of course, I'll accept any other suggestions to improve this code as well :) | 0 | [
2,
110,
31,
3545,
48,
2109,
29,
7026,
25266,
60,
800,
3726,
3726,
13416,
31,
2933,
22,
38,
29000,
14,
1813,
16,
13,
7,
43,
8311,
25266,
7,
15,
47,
37,
98,
31,
22,
195,
1302,
15,
32,
1108,
30,
31,
378,
2757,
1797,
432,
27,
18... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Howto do python command-line autocompletion but NOT only at the beginning of a string
===
Python, through it's readline bindings allows for great command-line autocompletion (as described [here][1]).
But, the completion only seems to work at the beginning of strings. If you want to match the middle or end of a string readline doesn't work.
I would like to autocomplete strings, in a command-line python program by matching what I type with any of the strings in a list of available strings.
- A good example of the type of autocompletion I would like to have is the type that happens in GMail when you type in the To field. If you type one of your contacts' last name, it will come up just as well as if you typed her first name.
- Some use of the up and down arrows or some other method to select from the matched strings may be needed (and not needed in the case of readline) and that is fine in my case.
- My particular use case is a command-line program that sends emails.
- Specific code examples would be very helpful.
Using terminal emulators like curses would be fine. It only has to run on linux, not Mac or Windows.
[1]: http://stackoverflow.com/questions/187621/how-to-make-a-python-command-line-program-autocomplete-arbitrary-things-not-int | 0 | [
2,
184,
262,
107,
20059,
1202,
8,
1143,
3108,
11103,
1336,
872,
47,
52,
104,
35,
14,
997,
16,
21,
3724,
800,
3726,
3726,
20059,
15,
120,
32,
22,
18,
1302,
1143,
8728,
18,
2965,
26,
374,
1202,
8,
1143,
3108,
11103,
1336,
872,
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... |
CSS bleed-through with cfinput type="datefield"
===
I have a form using multiple `<cfinput type="datefield" ...>`. They are positioned in such a way that the pop-up CSS calendar should appear over the field for others. However, the text fields for the other dates end up in front of the calendar.
This is only an IE issue as Firefox and Safari work just fine.
Is there a simple CSS hack or some other simple thing I can do to get the calendar to act as it should? Re-arranging the form is not very helpful. | 0 | [
2,
272,
18,
18,
20097,
8,
11639,
29,
10084,
108,
4881,
1001,
3726,
7,
8209,
1109,
7,
800,
3726,
3726,
31,
57,
21,
505,
568,
1886,
13,
1,
150,
5617,
4881,
1001,
3726,
7,
8209,
1109,
7,
13,
9,
9,
9,
1,
9,
59,
50,
12125,
19,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
What type should Struts ActionForm properties be?
===
I inherited this gigantic legacy Java web app using Struts 1.2.4/Spring 2.0.1/Hibernate 3.2.1. I have a specific question regarding ActionForms. Some of them have only String properties (even for numbers), some of them use the seemingly appropriate types (Integer, Date, String, etc). What's the best practice here?
Also, it seems that if a property is of type Integer, and the value the user entered is not an integer value, Struts silently swallows this and just doesn't set the property. What's up with this? | 0 | [
2,
98,
1001,
378,
18316,
18,
1028,
4190,
3704,
44,
60,
800,
3726,
3726,
31,
7179,
48,
23051,
7780,
8247,
2741,
4865,
568,
18316,
18,
137,
9,
135,
9,
12918,
15827,
172,
9,
387,
9,
8197,
8630,
106,
8820,
203,
9,
135,
9,
165,
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... |
Best ruby idiom for "nil or zero"
===
I am looking for a concise way to check a value to see if it is nil or zero. Currently I am doing something like:
if (!val || val == 0)
# Is nill or zero
end
But this seems very clumsy. | 0 | [
2,
246,
10811,
28380,
26,
13,
7,
103,
947,
54,
4606,
7,
800,
3726,
3726,
31,
589,
699,
26,
21,
29455,
161,
20,
2631,
21,
1923,
20,
196,
100,
32,
25,
1781,
255,
54,
4606,
9,
871,
31,
589,
845,
301,
101,
45,
100,
13,
5,
187,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 a SQL Server for application logging. Pros/Cons?
===
I have a multi-user application that keeps a centralized logfile for activity. Right now, that logging is going into text files to the tune of about 10MB-50MB / day. The text files are rotated daily by the logger, and we keep the past 4 or 5 days worth. Older than that is of no interest to us.
They're read rarely: either when developing the application for error messages, diagnostic messages, or when the application is in production to do triage on a user-reported problem or a bug.
(This is *strictly* an application log. Security logging is kept elsewhere.)
But when they are read, they're a pain in the ass. Grepping 10MB text files is no fun even with Perl: the fields (transaction ID, user ID, etc..) in the file are useful, but just text. Messages are written sequentially, one like at a time, so interleaved activity is all mixed up when trying to follow a particular transaction or user.
I'm looking for thoughts on the topic. Anyone done application-level logging with an SQL database and liked it? Hated it?
| 0 | [
2,
568,
21,
4444,
255,
8128,
26,
3010,
13,
13919,
9,
895,
18,
118,
12124,
60,
800,
3726,
3726,
31,
57,
21,
1889,
8,
16704,
3010,
30,
8968,
21,
25176,
6738,
16877,
26,
2358,
9,
193,
130,
15,
30,
13,
13919,
25,
228,
77,
1854,
64... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
What is the best way to serialize xml into appropriate objects when versioned by namespaces?
===
My question is the following.
I have xml that is versioned by a namespace. I want to serialize this received xml into the appropriate object, but the only way I know to do this means I have to process the xml two times. First to discover the namespace, and then in order to serialize to the object of the proper type based on the discovered namespace. This seems dreadfully inefficient to me, and there must be some way using generics or something to get the appropriate type of object back without an 'if namespace == x then serialze to that' check.
Below is a sample of the only way I know to accomplish this. Is there a better or more efficient way?
Thanks
using System;
using System.Text;
using System.Collections.Generic;
using System.Linq;
using Microsoft.VisualStudio.TestTools.UnitTesting;
using System.Xml.Linq;
using System.Xml;
using System.Xml.Serialization;
using System.IO;
namespace TestProject1
{
[TestClass]
public class UnitTest1
{
[TestMethod]
public void TestMethod3()
{
//Build up an employee object to xml
Schema.v2.Employee employee = new Schema.v2.Employee { FirstName = "First", LastName = "Last" };
string xml = employee.ObjectToXml<Schema.v2.Employee>();
//Now pretend I don't know what type I am receiving.
string nameSpace = GetNamespace(xml);
Object newemp;
if (nameSpace == "Employee.v2")
newemp = XmlSerializationExtension.XmlToObject<Schema.v2.Employee>(null, xml);
else
newemp = XmlSerializationExtension.XmlToObject<Schema.v1.Employee>(null, xml);
// Check to make sure that the type I got was what I made.
Assert.AreEqual(typeof(Schema.v2.Employee), newemp.GetType());
}
public string GetNamespace(string s)
{
XDocument z = XDocument.Parse(s);
var result = z.Root.Attributes().
Where(a => a.IsNamespaceDeclaration).
GroupBy(a => a.Name.Namespace == XNamespace.None ? String.Empty : a.Name.LocalName,
a => XNamespace.Get(a.Value)).
ToDictionary(g => g.Key,
g => g.First());
foreach (System.Xml.Linq.XNamespace item in result.Values)
if (item.NamespaceName.Contains("Employee")) return item.NamespaceName;
return String.Empty;
}
}
public static class XmlSerializationExtension
{
public static string ObjectToXml<T>(this T Object)
{
XmlSerializer s = new XmlSerializer(Object.GetType());
using (StringWriter writer = new StringWriter())
{
s.Serialize(writer, Object);
return writer.ToString();
}
}
public static T XmlToObject<T>(this T Object, string xml)
{
XmlSerializer s = new XmlSerializer(typeof(T));
using (StringReader reader = new StringReader(xml))
{
object obj = s.Deserialize(reader);
return (T)obj;
}
}
}
}
namespace Schema.v1
{
[XmlRoot(ElementName = "Employee", Namespace= "Employee.v1", IsNullable = false)]
public class Employee
{
[XmlElement(ElementName = "FirstName")]
public string FirstName { get; set; }
[XmlElement(ElementName = "LastName")]
public string LastName { get; set; }
}
}
namespace Schema.v2
{
[XmlRoot(ElementName = "Employee", Namespace = "Employee.v2", IsNullable = false)]
public class Employee
{
[XmlAttribute(AttributeName = "FirstName")]
public string FirstName { get; set; }
[XmlAttribute(AttributeName = "LastName")]
public string LastName { get; set; }
}
}
| 0 | [
2,
98,
25,
14,
246,
161,
20,
5956,
2952,
23504,
77,
4593,
3916,
76,
615,
69,
34,
204,
5582,
18,
60,
800,
3726,
3726,
51,
1301,
25,
14,
249,
9,
31,
57,
23504,
30,
25,
615,
69,
34,
21,
204,
5582,
9,
31,
259,
20,
5956,
2952,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 JavaScript is it possible to launch a file browser dialog programatically?
===
Instead of using the `<input type="file">` tag I'd like to have a button that launches a file browser dialog.
My first thought was to have a hidden file input tag and a button. I'd use the button click on the button to fire the onclick of the hidden file input, but I haven't been able to get this working properly.
So the question is, is this even possible? And second is there a nicer way to do this and still be able to send the information back in a form? | 0 | [
2,
19,
8247,
8741,
25,
32,
938,
20,
3394,
21,
3893,
16495,
28223,
625,
721,
8438,
60,
800,
3726,
3726,
700,
16,
568,
14,
13,
1,
108,
4881,
1001,
3726,
7,
16877,
7,
1,
3383,
31,
22,
43,
101,
20,
57,
21,
5167,
30,
22933,
21,
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... |
Convert hex string to int in Python
===
How do I convert a hex string to an int in Python? I may have it as "0xffff" or just "ffff". | 0 | [
2,
8406,
24,
396,
3724,
20,
19,
38,
19,
20059,
800,
3726,
3726,
184,
107,
31,
8406,
21,
24,
396,
3724,
20,
40,
19,
38,
19,
20059,
60,
31,
123,
57,
32,
28,
13,
7,
387,
396,
2460,
2460,
7,
54,
114,
13,
7,
2460,
2460,
7,
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,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
How to deal with monstrous Struts Actions?
===
I inherited this gigantic legacy Java web app using Struts 1.2.4. I have a specific question regarding Actions. Most of the pages have exactly one Action, and the processExecute() methods are hideous monsters (very long and tons of nested if statements based on request parameters).
Given that Actions are an implementation of the command pattern, I'm thinking to split these Actions into one Action per user gesture. This will be a large refactoring though, and I'm wondering:
1. Is this the right direction?
2. Is there an intermediate step I could take, a pattern that deals with the mess inside the monolithic actions? Maybe another command pattern inside the Action?
| 0 | [
2,
184,
20,
1183,
29,
23939,
18316,
18,
3078,
60,
800,
3726,
3726,
31,
7179,
48,
23051,
7780,
8247,
2741,
4865,
568,
18316,
18,
137,
9,
135,
9,
300,
9,
31,
57,
21,
1903,
1301,
3467,
3078,
9,
127,
16,
14,
4434,
57,
1890,
53,
10... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Powershell - Increase the timeout for retrieving XML from a URL
===
I'm trying to retrieve an XML stream from a URL. For most URLs my code below works fine. But, I have a couple URLs that timeout. The URLs in question <b>do</b> work from Internet Explorer.
$webclient=New-Object "System.Net.WebClient"
[xml]$data=$webclient.DownloadString($url)
So, I went searching for a way to increase the timeout period. From what I've read, I believe I cannot do this using System.Net.WebClient. I think I need to use System.Net.WebRequest instead, but I cannot get it to work. The code I've been working on is below:
$myHttpWebRequest = [system.net.WebRequest]::Create($url)
$myHttpWebRequest.Timeout = 600000
$myHttpWebResponse = $myHttpWebRequest.GetResponse()
$sr = New-Object System.IO.StreamReader($response.GetResponseStream())
[xml]$xml = [xml]$sr.ReadToEnd()
The URLs I'm trying to access are internal to my company, so I can't post them. But, they do work in IE and the actual URL should be irrelevant.
Ideas?
| 0 | [
2,
414,
15984,
13,
8,
1839,
14,
85,
1320,
26,
13,
6239,
3272,
8397,
23504,
37,
21,
287,
6362,
800,
3726,
3726,
31,
22,
79,
749,
20,
11917,
40,
23504,
3766,
37,
21,
287,
6362,
9,
26,
127,
13,
911,
7532,
51,
1797,
1021,
693,
112... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
prettify my gdb
===
Is there a way to highlight and color gdb output during interactive debugging?
Please don't reply I should use ddd, nemiver, emacs, vim, or any other front-end, I just prefer gdb as it is, but would like to see its output with some terminal colors.
thank you | 0 | [
2,
782,
5249,
9596,
51,
489,
9007,
800,
3726,
3726,
25,
80,
21,
161,
20,
14373,
17,
1665,
489,
9007,
5196,
112,
9194,
121,
16254,
2762,
60,
2247,
221,
22,
38,
6504,
31,
378,
275,
13,
43,
8096,
15,
16714,
19737,
15,
13,
62,
6893,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 create a Virtual Com1 port in windows?
===
I am developing a mobile app to run on a pocketpc. We have a mobile printer and card swipe that uses com1 to send and get info. I'm using the device emulator and want to test without the printer. How do I create a virtual com1 port to right to and read from? I tried com0com but the device emulator will not set that as serial 0. | 0 | [
2,
184,
20,
1600,
21,
6599,
13,
960,
165,
1295,
19,
1936,
60,
800,
3726,
3726,
31,
589,
3561,
21,
3241,
4865,
20,
485,
27,
21,
3397,
5779,
9,
95,
57,
21,
3241,
12925,
17,
2056,
27246,
30,
2027,
13,
960,
165,
20,
2660,
17,
164,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Recommendations for an enterprise management dashboard
===
Like many organizations, I don't have a single software application that I run to support the enterprise. I have many different software components that facilitate the business and these software components are deployed to multiple machines. All of these applications were built with some enterprise monitoring and management in mind. Since we are a Windows shop, we made sure they publish performance counters and use WMI to expose services.
Where we have struggled is in finding enterprise management software that can *at a glance* provide us with a high level dashboard on the health of our system. For example, if I have 10 instances of a software component running and said software component is publishing 2 critical performance counters, how difficult would it be to have a drill down for that component that allows me to see a graph of the performance counters for each instance. Additionally, I'd like to have a solution that can "alert" me when performance counters cross various thresholds...
In the past, I've looked at the big boys... OpenView, Unicenter, etc., but I didn't see anything that would provide me with a single real time view of performance counters for my set of instances. Can you help? Have you seen any tools that help pull the enterprise management picture together? | 0 | [
2,
12121,
26,
40,
6002,
1097,
26478,
800,
3726,
3726,
101,
151,
2856,
15,
31,
221,
22,
38,
57,
21,
345,
2306,
3010,
30,
31,
485,
20,
555,
14,
6002,
9,
31,
57,
151,
421,
2306,
5090,
30,
9681,
14,
508,
17,
158,
2306,
5090,
50,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
"Token Text in state EndRootElement would result in an invalid XML document"
===
I'm seeing this exception message coming from XslCompiledTransform.Transform(), but after handling the exception the XSL transform still appears to have been successful. The full exception message is:
> Token Text in state EndRootElement
> would result in an invalid XML
> document. Make sure that the
> ConformanceLevel setting is set to
> ConformanceLevel.Fragment or
> ConformanceLevel.Auto if you want to
> write an XML fragment.
The stylesheet looks like this:
<xsl:stylesheet version="1.0" xmlns:ext="ext:extensions" xmlns:f="http://schemas.foo.com/FOAMSchema">
<xsl:template match="/Root/Documents/PO/DROPSHIP">
<Transactions>
<Transaction>
<f:partnerTransmission>
<transmission_id>
<xsl:value-of select="ext:NewGUID()"/>
</transmission_id>
<partner_code>
<xsl:value-of select="/Root/@PartnerCode"/>
</partner_code>
<control_nbr>
<xsl:value-of select="@GS_CNTRL_NUM"/>
</control_nbr>
<creationTime>
<xsl:value-of select="ext:ConvertToStandardDateTime(@DATE,@TIME,'ISO8601Basic')"/>
</creationTime>
<direction>I</direction>
<messageCount>
<xsl:value-of select="count(ORDERS/ORDER)"/>
</messageCount>
<syntax>XML</syntax>
<format>BARBAZ</format>
<deliveryMethod>FTP</deliveryMethod>
</f:partnerTransmission>
</Transaction>
</Transactions>
</xsl:template>
</xsl:stylesheet>
The generated XML looks like this:
<Transactions xmlns="http://schemas.foo.com/IntegrationProfile" xmlns:ext="ext:extensions">
<Transaction>
<f:partnerTransmission xmlns:f="http://schemas.foo.com/FOAMSchema">
<transmission_id>a5e0ec76-6c24-426b-9eb5-aef9c45d913f</transmission_id>
<partner_code>VN000033</partner_code>
<control_nbr>650</control_nbr>
<creationTime>9/27/2008 12:51:00 AM</creationTime>
<direction>I</direction>
<messageCount>2</messageCount>
<syntax>XML</syntax>
<format>BARBAZ</format>
<deliveryMethod>FTP</deliveryMethod>
</f:partnerTransmission>
</Transaction>
</Transactions>
The above is what I get when I catch and ignore the exception.
I haven't been able to find a way to set the ConformanceLevel (the property is read-only), but at the same time I also don't think there should be a problem here anyway.
Does my output constitute an XML fragment? Am I missing something in the stylesheet? | 0 | [
2,
13,
7,
262,
2853,
1854,
19,
146,
241,
14032,
27567,
83,
829,
19,
40,
16671,
23504,
4492,
7,
800,
3726,
3726,
31,
22,
79,
2078,
48,
5391,
2802,
880,
37,
993,
18,
255,
11103,
49,
1294,
7028,
4190,
9,
7028,
4190,
5,
6,
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... |
why you chose java programming language over others? why you chose java to program with?
===
why you chose java programming language over others? why you chose java to program with?
Note: tell for what you using java (desktop application/ web application/ mobile) then answer the question. | 4 | [
2,
483,
42,
3305,
8247,
3143,
816,
84,
654,
60,
483,
42,
3305,
8247,
20,
625,
29,
60,
800,
3726,
3726,
483,
42,
3305,
8247,
3143,
816,
84,
654,
60,
483,
42,
3305,
8247,
20,
625,
29,
60,
1945,
45,
494,
26,
98,
42,
568,
8247,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Column order of results from rails ActiveRecord find_by_sql call.
===
I'm attempting to put together some basic report screens. I've got some fairly complicated SQL queries that I'm feeding into ActiveRecord's find_by_sql method. The problem I am having here is that I am losing the order of the columns as given in the original query. I'm assuming that this is because the Hash class does not preserve entry order of its keys.
Is there a way around this problem? Should I be using a different method then find_by_sql for my queries?
| 0 | [
2,
4698,
389,
16,
1736,
37,
2240,
18,
1348,
14953,
477,
1,
779,
1,
18,
22402,
645,
9,
800,
3726,
3726,
31,
22,
79,
6314,
20,
442,
429,
109,
2125,
1330,
14236,
9,
31,
22,
195,
330,
109,
6647,
8343,
4444,
255,
9386,
2829,
30,
31... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
What is the best way to teach you and your boss C#?
===
My boss wants to "get back into programming" by making an internal web application. I've got lots of experience with php and mvc frameworks, but he's doesn't want to learn php, he wants to learn c# as it probably will be more useful to him down the road (I can't disagree.) I think I'll be ok with tutorials and code snippets I find online, but he's not the kind of guy who would read Jeff's blog and I think I need to find him some more resources... besides StackOverflow. | 0 | [
2,
98,
25,
14,
246,
161,
20,
5348,
42,
17,
154,
4054,
272,
5910,
60,
800,
3726,
3726,
51,
4054,
2846,
20,
13,
7,
3060,
97,
77,
3143,
7,
34,
544,
40,
3117,
2741,
3010,
9,
31,
22,
195,
330,
7503,
16,
1496,
29,
13,
26120,
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 do I do a deep copy of a node in LINQ to XML?
===
I want to make a deep copy of a LINQ to XML XNode. The reason I want to do this is there are some nodes in the document that I want to create modified copies of (in the same document). I don't see a method to do this.
I could convert the node to an XML string and then reparse it, but I'm wondering if there's a better way. | 0 | [
2,
184,
107,
31,
107,
21,
855,
4344,
16,
21,
15421,
19,
6294,
1251,
20,
23504,
60,
800,
3726,
3726,
31,
259,
20,
233,
21,
855,
4344,
16,
21,
6294,
1251,
20,
23504,
993,
251,
546,
9,
14,
1215,
31,
259,
20,
107,
48,
25,
80,
50... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Steps to make a LED blink from a C/C++ program?
===
What are the easiest steps to make a small circuit with an LED flash from a C/C++ program?
I would prefer the least number of dependencies and packages needed.
- What port would I connect something into?
- Which compiler would I use?
- How do I send data to that port?
- Do I need to have a micro-processor? If not I don't want to use one for this simple project.
| 0 | [
2,
2382,
20,
233,
21,
481,
11718,
37,
21,
272,
118,
150,
20512,
625,
60,
800,
3726,
3726,
98,
50,
14,
27237,
2382,
20,
233,
21,
284,
3343,
29,
40,
481,
4433,
37,
21,
272,
118,
150,
20512,
625,
60,
31,
83,
6369,
14,
639,
234,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Is there any tools for automatic removal of comments from JavaScript code?
===
I'd like to have comments in my code, but I want them to be removed before deploying.
Yes, it's not hard to write such a thing, but if it already exists…
And how about comments in ASP pages? | 0 | [
2,
25,
80,
186,
4672,
26,
6715,
7797,
16,
7534,
37,
8247,
8741,
1797,
60,
800,
3726,
3726,
31,
22,
43,
101,
20,
57,
7534,
19,
51,
1797,
15,
47,
31,
259,
105,
20,
44,
1974,
115,
17617,
68,
9,
1643,
15,
32,
22,
18,
52,
552,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Query a single value from a column that pulls multiple values
===
Using the following query:
SELECT pe.prodtree_element_name_l, MAX(rs.resource_value) AS resource_value
FROM prodtree_element pe
LEFT JOIN resource_shortstrings rs
ON pe.prodtree_element_name_l_rk = rs.resource_key
WHERE rs.language_id = '5'
AND pe.prodtree_element_name_l <> ''
GROUP BY prodtree_element_name_l
I'm trying to figure out how to grab ANY of the "resource_value". The problem being that while this works for a number of other queries, I have one particular table that uses ntext datatypes instead of varchars (which can utilize the MAX function). So basically, MAX doesn't work here. Is there a substitute I can use on MS SQL Server 2005?
I need the prodtree_element_name_l column grouped, but I only need one value from the resource_value column, and I don't care what it is as most of them are identical regardless (although some are not, hence I can't group that one as well). | 0 | [
2,
25597,
21,
345,
1923,
37,
21,
4698,
30,
8071,
1886,
4070,
800,
3726,
3726,
568,
14,
249,
25597,
45,
5407,
3560,
9,
2740,
43,
8101,
1,
27567,
1,
7259,
1,
255,
15,
2049,
5,
1224,
9,
99,
12097,
1,
15165,
6,
28,
6577,
1,
15165,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Architectual design patterns
===
I am looking for some architectual design patterns for enterprise application development. I am aware of the all of the GoF patterns, and MVC, and such things, but I am looking for patterns that emerge at a larger scope. In particular I have a somewhat larger enterprise desktop and website application, they share certain functionality, and some is unique, and I am looking for best practices on how to structure the entire solution, how to expose business logic domains to others via factories, or such, and generally things of this nature that deal with the entire application as a whole. | 0 | [
2,
3338,
6948,
704,
6282,
800,
3726,
3726,
31,
589,
699,
26,
109,
3338,
6948,
704,
6282,
26,
6002,
3010,
522,
9,
31,
589,
3854,
16,
14,
65,
16,
14,
162,
410,
6282,
15,
17,
307,
8990,
15,
17,
145,
564,
15,
47,
31,
589,
699,
2... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
REPLACE and Unicode characters in SQL
===
I have some data with messed-up accented characters. For example in the data we have things like
`ClΘmentine`
that should should read
`Clémentine`
I'd like to clean it up with a script, but when I do this for example
Select Replace('ClΘmentine', 'Θ', 'é')
and this is what I get:
`Clémenéine`
Apparently Θ matches both Θ and t. Any ideas what's going on and what I can do to make this work?
| 0 | [
2,
3934,
17,
28010,
1766,
19,
4444,
255,
800,
3726,
3726,
31,
57,
109,
1054,
29,
21537,
8,
576,
7980,
69,
1766,
9,
26,
823,
19,
14,
1054,
95,
57,
564,
101,
13,
1,
5316,
1,
1130,
1149,
1,
30,
378,
378,
1302,
13,
1,
5615,
1130... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How do I make the footer stretch vertically?
===
I have a footer that is a 1 x 70px, which is set as the background and tiles horizonally.
In cases when the web page does not contain a lot of content on it, it will display the footer above where the footer should be. I want it to fill in with a solid color, so if they scroll down, it won't show the footer, then the white under the footer.
Here is the style I have for the footer.
.footer{
background:#055830 url('/images/footer_tile.gif') repeat-x top left;
color:#fff;
font-size:12px;
height: 70px;
margin-top: 10px;
font-family: Arial, Verdana, sans-serif;
width:100%;
}
![alt text][1]
I want the footer to look like this:
![alt text][2]
[1]: http://i34.tinypic.com/2q9xk02.jpg
[2]: http://i37.tinypic.com/2ng4ew9.jpg | 0 | [
2,
184,
107,
31,
233,
14,
1749,
106,
6363,
23300,
60,
800,
3726,
3726,
31,
57,
21,
1749,
106,
30,
25,
21,
137,
993,
3201,
306,
396,
15,
56,
25,
309,
28,
14,
2395,
17,
14836,
7530,
1326,
9,
19,
1871,
76,
14,
2741,
2478,
630,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 update and XBAP's config file after deployment?
===
We have a WPF XBAP application that we want to change the configuration on the server after it is deployed. Since the config file is embedded in the deployment files, how is this possible?
For example, we want to change the database connection strings the deployed app is connected to or we want to update the WCF service binding settings that it is connecting to? We want to update the config file on the server and not have to recompile and redeploy each time.
Thanks! | 0 | [
2,
184,
20,
11100,
17,
993,
969,
306,
22,
18,
13,
14093,
2816,
3893,
75,
10475,
60,
800,
3726,
3726,
95,
57,
21,
619,
7721,
993,
969,
306,
3010,
30,
95,
259,
20,
753,
14,
8091,
27,
14,
8128,
75,
32,
25,
6698,
9,
179,
14,
13,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Passing List<> to SQL Stored Procedure
===
I've often had to load multiple items to a particular record in the database. For example: a web page displays items to include for a single report, all of which are records in the database (Report is a record in the Report table, Items are records in Item table). A user is selecting items to include in a single report via a web app, and let's say they select 3 items and submit. The process will add these 3 items to this report by adding records to a table called ReportItems (ReportId,ItemId).
Currently, I would do something like this in in the code:
public void AddItemsToReport(string connStr, int Id, List<int> itemList)
{
Database db = DatabaseFactory.CreateDatabase(connStr);
string sqlCommand = "AddItemsToReport"
DbCommand dbCommand = db.GetStoredProcCommand(sqlCommand);
string items = "";
foreach (int i in itemList)
items += string.Format("{0}~", i);
if (items.Length > 0)
items = items.Substring(0, items.Length - 1);
// Add parameters
db.AddInParameter(dbCommand, "ReportId", DbType.Int32, Id);
db.AddInParameter(dbCommand, "Items", DbType.String, perms);
db.ExecuteNonQuery(dbCommand);
}
and this in the Stored procedure:
INSERT INTO ReportItem (ReportId,ItemId)
SELECT @ReportId,
Id
FROM fn_GetIntTableFromList(@Items,'~')
Where the function returns a one column table of integers.
My question is this: is there a better way to handle something like this? Note, I'm not asking about database normalizing or anything like that, my question relates specifically with the code. | 0 | [
2,
2848,
968,
1,
20,
4444,
255,
8214,
7004,
800,
3726,
3726,
31,
22,
195,
478,
41,
20,
6305,
1886,
3755,
20,
21,
1498,
571,
19,
14,
6018,
9,
26,
823,
45,
21,
2741,
2478,
9412,
3755,
20,
468,
26,
21,
345,
1330,
15,
65,
16,
56... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Ordering values in xslt
===
I'm trying to order items based on an attribute value:
<xsl:apply-templates select="Question">
<xsl:sort order="ascending" select="@Value"></xsl:sort>
</xsl:apply-templates>
This does order them, but I could have values like 1,2,3, ... 10, 11, ... 20 and it will order them 1,10,11, ... 2,20... 3. etc.
I could also have values like 1.A, 1.B, 2.A, 2.B etc.
How can I order these values to take into account the numeric content and the alphabetic, in that priority? | 0 | [
2,
15775,
4070,
19,
993,
18,
255,
38,
800,
3726,
3726,
31,
22,
79,
749,
20,
389,
3755,
432,
27,
40,
35,
14755,
1923,
45,
13,
1,
396,
18,
255,
45,
7753,
102,
8,
9577,
6554,
18,
5407,
3726,
7,
24652,
7,
1,
13,
1,
396,
18,
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... |
Individual indexes vs multiple field indexes
===
Currently we have a table that we use to track inivitations. We have an email field that is indexed but we also have three optional keys that the user can specify when adding new record emails. We don't allow duplicates so we have to query if the email plus the optional keys already exists. Currently the keys are only added to the select statement if they are specified. The normal case is only email is specified and using the index it works fairly quickly. When the keys are added performance drops.
Would adding three indexes affect performance for other operations? Keys are probably used infrequently that we wouldn't want to impact performance for this case.
- email, key1
- email, key1, key2
- email, key1, key2, key3
The other idea is we add 1 key.
- email, key1, key2, key3
Then always use all 3 keys in the lookup (eg. key1 = mykey AND key2 is NULL AND key3 is NULL)
| 0 | [
2,
1359,
4348,
160,
4611,
1886,
575,
4348,
160,
800,
3726,
3726,
871,
95,
57,
21,
859,
30,
95,
275,
20,
792,
19,
49,
8901,
7504,
9,
95,
57,
40,
8517,
575,
30,
25,
4348,
69,
47,
95,
67,
57,
132,
12832,
5534,
30,
14,
4155,
92,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
checkbox in YUI DataTable
===
I'm using a column of checkboxes in a YUI DataTable, I works fine. But I haven't found a way to put a name and value attribute so I can use when the form is submitted.
Thanks in advance. | 0 | [
2,
2631,
5309,
19,
2600,
49,
1054,
5924,
800,
3726,
3726,
31,
22,
79,
568,
21,
4698,
16,
2631,
5309,
160,
19,
21,
2600,
49,
1054,
5924,
15,
31,
693,
1123,
9,
47,
31,
2933,
22,
38,
216,
21,
161,
20,
442,
21,
204,
17,
1923,
35... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0... |
Algorithm for most recently/often contacts for auto-complete?
===
We have an auto-complete list that's populated when an you send an email to someone, which is all well and good until the list gets really big you need to type more and more of an address to get to the one you want, which goes against the purpose of auto-complete
I was thinking that some logic should be added so that the auto-complete results should be sorted by some function of most recently contacted or most often contacted rather than just alphabetical order.
What I want to know is if there's any known good algorithms for this kind of search, or if anyone has any suggestions.
I was thinking just a point system thing, with something like same day is 5 points, last three days is 4 points, last week is 3 points, last month is 2 points and last 6 months is 1 point. Then for most often, 25+ is 5 points, 15+ is 4, 10+ is 3, 5+ is 2, 2+ is 1. No real logic other than those numbers "feel" about right.
Other than just arbitrarily picked numbers does anyone have any input? Other numbers also welcome if you can give a reason why you think they're better than mine | 0 | [
2,
9083,
26,
127,
1989,
118,
14855,
11894,
26,
3108,
8,
15990,
60,
800,
3726,
3726,
95,
57,
40,
3108,
8,
15990,
968,
30,
22,
18,
11111,
76,
40,
42,
2660,
40,
8517,
20,
737,
15,
56,
25,
65,
134,
17,
254,
163,
14,
968,
3049,
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... |
PHP Opt-Code Caching/Zend Acceleration and include_once vs. require_once
===
I have a colleague who is looking into Opt-Code Caching/Zend Acceleration (I've always assumed these are the same thing) for our PHP based application. His Benchmarks appear to indicate that we're NOT seeing a performance benefit if we include our (large) class libraries with require_once, but we DO see the performance benefit when using include_once.
This smells fishy to both of us, but I don't have time to check into our benchmark methodology myself and my colleague has more tolerance for the smell of fish than I do. :)
Has anyone ever run into anything like this? If not, any thoughts on other things that might be causing the appearance of a performance increase by switching from include_once to require_once? | 0 | [
2,
13,
26120,
17034,
8,
9375,
1658,
7192,
118,
4257,
43,
17661,
17,
468,
1,
13120,
4611,
9,
4077,
1,
13120,
800,
3726,
3726,
31,
57,
21,
12321,
72,
25,
699,
77,
17034,
8,
9375,
1658,
7192,
118,
4257,
43,
17661,
13,
5,
49,
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... |
How to force/get to use GTKLookAndFeel on KDE in Java?
===
First of all, using gnome is not an option (but it is possible to install its libraries).
I need to know what is necessary to display a Java Swing desktop application using the current installed KDE look and feel of KDE. Ideally, the solution should allow me to apply a look and feel that looks like the underlying windowing system (ie: Windows LNF for Windows, GTK LNF for Gnome(GTK), QT LNF for KDE (QT), the default one for other platforms).
Under KDE, you can configure it to use the current KDE theme for GTK applications, too. So, if the solution works with GTK it is fine.
When I run the following piece of code under Gnome (Ubuntu 8.04), the Java application looks beautiful. It integrates very well with the rest of applications:
try {
// Set System L&F
UIManager.setLookAndFeel(
UIManager.getSystemLookAndFeelClassName());
} catch(Exception e) { //Handle it }
However, if I run the same thing under Debian (Lenny) with KDE, the UIManager.getSystemLookAndFeelClassName() call returns the Java default one.
If I go ahead and force it to use the GTK LNF, the application doesn't work. Some fields are invisible, others become out of place, everything is unusable.
This same system has all GTK applications working (for example: Firefox) as expected. So:
1) What is missing from the environment to have a Java GTK LNF application working under KDE?
2) What does the JVM checks for to return GTK as the default system theme?
Thanks for you help
Luis Fernando
PS->I've tried other solutions,too, such as JGoodies, plain AWT and SWT. However, Swing with GTK LNF would be the best solution to avoid the hassle of SWT native libraries and JGoodies extra jars (also, JGoodies LNF doesn't look as integrated as Swing GTK under Gnome). AWT looks hideous (motif-like) and misses lots of features.
| 0 | [
2,
184,
20,
558,
118,
3060,
20,
275,
9509,
197,
5810,
290,
16963,
27,
680,
546,
19,
8247,
60,
800,
3726,
3726,
64,
16,
65,
15,
568,
24117,
25,
52,
40,
4255,
13,
5,
811,
32,
25,
938,
20,
16146,
82,
8649,
6,
9,
31,
376,
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... |
Inconsistent javascript logic behavior
===
I have code similar to this filtering entries in an Array of Objects:
var filterRegex = new RegExp(".*blah.*","ig");
if (filterRegex.test(events[i].thing) && events[0].show) {
console.log("SUCCESS: filtering thing " + i + " " + events[i].thing);
events[0].show = false;
numevents--;
}
I get inconsistent results with this if condition (checking with Firebug, both conditions are true individually, but *sometimes* the whole expression evaluates to false). HOWEVER, if I actually put an alert() called inside this if statement (like line 4), it becomes consistent and I get the result I want.
Can you see anything wrong with this logic and tell me why it's not always producing what is expected? | 0 | [
2,
22380,
8247,
8741,
7085,
3257,
800,
3726,
3726,
31,
57,
1797,
835,
20,
48,
25272,
11399,
19,
40,
7718,
16,
3916,
45,
4033,
11945,
12463,
1706,
800,
78,
7953,
6899,
5,
7,
9,
2483,
220,
9396,
9,
2483,
7,
15,
7,
2816,
7,
6,
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... |
Any Real-World Experience Using Software Transactional Memory?
===
It seems that there has been a recent rising interest in STM (software transactional memory) frameworks and language extensions. [Clojure][1] in particular has an excellent implementation which uses [MVCC (multi-version concurrency control)][4] rather than a rolling commit log. GHC Haskell also has [an extremely elegant STM monad][2] which also allows transaction composition. Finally, so as to toot my own horn just a bit, I've recently implemented an [STM framework for Scala][3] which statically enforces reference restrictions.
All of these are interesting experiments, but they seem to be confined to that sphere alone (experimentation). So my question is: have any of you seen or used STM in the real world? If so, why? What sort of benefits did it bring? What about performance? (there seems to be a great deal of conflicting information on this point) Would you use STM again or would you prefer to use some other concurrency abstraction like actors?
[1]: http://clojure.org
[2]: http://research.microsoft.com/%7Esimonpj/papers/stm/beautiful.pdf
[3]: http://www.codecommit.com/blog/scala/software-transactional-memory-in-scala
[4]: http://en.wikipedia.org/wiki/Multiversion_concurrency_control | 0 | [
2,
186,
683,
8,
4423,
1496,
568,
2306,
12799,
192,
1912,
60,
800,
3726,
3726,
32,
2206,
30,
80,
63,
74,
21,
1764,
3316,
1163,
19,
354,
79,
13,
5,
12980,
5011,
12799,
192,
1912,
6,
6596,
18,
17,
816,
17529,
9,
636,
13023,
2142,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 access "assigns" after "render :template => ..."?
===
I have an error handling method in my ApplicationController:
rescue_from ActiveRecord::RecordNotFound, :with => :not_found
def not_found(exception)
@exception = exception
render :template => '/errors/not_found', :status => 404
end
In `RAILS_ROOT/app/views/errors/not_found.html.erb`, I have this:
<h1>Error 404: Not Found</h1>
<%= debug @exception %>
But `@exception` is always `nil` there. I've tried `debug assigns`, but that's always `{}`. Do assigns not get copied when calling `render :template`? If so, how can I get them?
I'm on edge Rails. | 0 | [
2,
184,
107,
31,
1381,
13,
7,
472,
11255,
18,
7,
75,
13,
7,
99,
16706,
13,
45,
9577,
6554,
800,
1,
13,
9,
9,
9,
7,
60,
800,
3726,
3726,
31,
57,
40,
7019,
7988,
2109,
19,
51,
3010,
12898,
1252,
45,
3655,
1,
2665,
1348,
1495... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 wrong with my sitemap?
===
We have a sitemap for our site [http://www.appsamuck.com/][1]
The sitemap is here [http://www.appsamuck.com/sitemap.xml][2]
But Google seems to hate it. My question is why? I'm just staring at it now saying to myself it looks right. Am I missing something?
3 Paths don't match
We've detected that you submitted your Sitemap using a URL path that doesn't include the www prefix (for instance, http://example.com/sitemap.xml). However, the URLs listed inside your Sitemap do use the www prefix (for instance, http://www.example.com/myfile.htm). Help Help
URL:
Problem detected on: http://www.appsamuck.com/
Oct 15, 2008
[1]: http://www.appsamuck.com/
[2]: http://www.appsamuck.com/sitemap.xml | 0 | [
2,
98,
22,
18,
1389,
29,
51,
689,
15022,
60,
800,
3726,
3726,
95,
57,
21,
689,
15022,
26,
318,
689,
636,
21127,
6903,
6483,
9,
7753,
6101,
8311,
9,
960,
118,
500,
2558,
165,
500,
14,
689,
15022,
25,
235,
636,
21127,
6903,
6483,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How do I get the previous field value in the modifiedField method of a Dynamic Ax table?
===
I would like to be able to perform some logic in the table.modifiedField method which compares the previous value of a field to the new value. How do I get to the previous value? | 0 | [
2,
184,
107,
31,
164,
14,
1158,
575,
1923,
19,
14,
5372,
1109,
2109,
16,
21,
7782,
21,
396,
859,
60,
800,
3726,
3726,
31,
83,
101,
20,
44,
777,
20,
2985,
109,
7085,
19,
14,
859,
9,
13670,
4462,
1109,
2109,
56,
11590,
18,
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... |
Payroll System Design, Business Logic in SPs or Application Layer (C#.Net), Maintainability - Repost
===
We are designing a Payroll Generation System for a client.
The organization we are targeting has a hierarchy as follows:
Company -> Cluster -> Business Unit (BU) -> Department -> Employee
The salary for an employee is made up of various salary components.
Each salary component has 3 rules associated with it, a Calculation Rule (Calculate component as % of another component, or % of a fixed number or a fixed number), an Eligibility Rule (whether an Employee/Dept is eligible for a component) and a Constraint Rule which limits tha max and min of a component.
****These rules are editable and can be edited by a user end user**. Also these rules are inherited top-down, but if defined at a lower level, the lower level rule takes precedence.**
**We have a database which has Attendance, Leaves, Bonuses tables and these rules are also supposed to interact with these tables.**
The client will be generating payroll for multiple clients each hosting a Separate Database instance. They may each have a different interpretation of each component and may have different components.
We are only looking to support SQL Server, and payroll generation will be an offline activity.
**We are divided upon where to put the logic which uses these rules to generate the individual tax components (which will include Tax Deductions, Tax Write-offs, Allowances, etc).**
Some people are advocating magic SPs which will take an employee Id and generate a payroll for that month.
Others want the logic to be split into separate components which will get the dependent data for an employee in the application layer and calculate these components there.
The order of our priorities are:
1. The ability to adapt changes to new clients quickly
2. Long term maintainability
3. Performance
1 and 2 outweigh 3 here by a large factor as this will be an offline activity.
Maintainability and Quick Customizability are very important, we will be deploying the application for different clients.
Client A may have a Salary Component Rule as ((0.3 * Basic) + 800)
and Client B as (0.2 * Basic) + (0.1 * Atendance Bonus)
**Will SPs cause a mess here, as the rules suggested above will be specified by the end user and will need to be customizable through a web UI.
We will have to parse the formulas from SQL. How difficult or easy will it be?
What advantage will doing this in the Application Layer (C# .Net) have over using SPs?**
Suggestions and pointers to existing systems' architecture will be very helpful.
...and yes, we are using LINQ to SQL elsewhere in the system.
Kind regards,
Ashish Sharma | 0 | [
2,
28019,
329,
704,
15,
508,
7085,
19,
3782,
18,
54,
3010,
5385,
13,
5,
150,
5910,
9,
2328,
6,
15,
4027,
4091,
13,
8,
302,
6962,
800,
3726,
3726,
95,
50,
15026,
21,
28019,
2782,
329,
26,
21,
6819,
9,
14,
1165,
95,
50,
15972,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Does PHP have theading?
===
I found this [PECL package called threads][1], but there is not a release yet. And nothing is coming up on the PHP website.
[1]: http://pecl.php.net/package/threads | 0 | [
2,
630,
13,
26120,
57,
14,
1283,
68,
60,
800,
3726,
3726,
31,
216,
48,
636,
12610,
255,
6030,
227,
20396,
500,
2558,
165,
500,
15,
47,
80,
25,
52,
21,
830,
768,
9,
17,
626,
25,
880,
71,
27,
14,
13,
26120,
2271,
9,
636,
165,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 run remote commands on a Windows server from Java?
===
Are there any existing solutions for remote execution of commands on a windows server from Java natively? psexec.exe is not an option since the java application has to be cross platform.
Even a preexisting solution using Java RM would be sufficient.
Currently, I'm using an SSH client library to ssh through java into a Windows server that's running the cygwin SSH daemon. Sadly the SSH daemon has some issues when it comes to quoting commands that go into a CMD (as opposed to bash) shell. | 0 | [
2,
246,
161,
20,
485,
5388,
14294,
27,
21,
1936,
8128,
37,
8247,
60,
800,
3726,
3726,
50,
80,
186,
3149,
6776,
26,
5388,
5769,
16,
14294,
27,
21,
1936,
8128,
37,
8247,
1275,
102,
60,
351,
6353,
3319,
9,
1706,
62,
25,
52,
40,
4... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
What does 'lew' stand for in 'lew2' or 'lew4'?
===
I'm seeing the term 'lew2' and 'lew4' being used in reference to character size in certain files. I know that the number represents how many bytes are used to store certain types of characters (maybe wide chars?), but I'm not sure what the 'lew' part stands for. My best guess is 'length of wide'. Can anyone enlighten me? | 0 | [
2,
98,
630,
13,
22,
413,
499,
22,
1261,
26,
19,
13,
22,
413,
499,
135,
22,
54,
13,
22,
413,
499,
300,
22,
60,
800,
3726,
3726,
31,
22,
79,
2078,
14,
981,
13,
22,
413,
499,
135,
22,
17,
13,
22,
413,
499,
300,
22,
142,
147... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.