unified_texts stringlengths 32 30.1k | OpenStatus_id int64 0 4 | input_ids list | token_type_ids list | attention_mask list |
|---|---|---|---|---|
Saving a SecureString
===
One of the feature requests I've got for the program I'm working on is to be able to save the list of credentials users enter in, so they can be shared around in the case of network failure. My initial instinct is to scoff at this request - saving passwords? *really?* - but it turns out one of the classes I use the credentials for can take a SecureString. That got me to wondering:
Is it possible to save an encrypted SecureString, so that I can save the sensitive data to a file and open it up someplace else?
What are your thoughts, Stack Overflow? | 0 | [
2,
7599,
21,
4315,
11130,
800,
3726,
3726,
53,
16,
14,
1580,
12279,
31,
22,
195,
330,
26,
14,
625,
31,
22,
79,
638,
27,
25,
20,
44,
777,
20,
2079,
14,
968,
16,
5059,
43,
10107,
18,
3878,
2830,
19,
15,
86,
59,
92,
44,
2592,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Character reading from file in Python
===
In a text file, there is a string "I don't like this".
However, when I read it into a string, it becomes "I don\u2018t like this". I understand that \u2018 is the unicode representation of "'". I use
f1 = open (file1, "r")
text = f1.read()
command to do the reading.
Now, is it possible to read the string in such a way that when it is read into the string, it is "I don't like this", instead of "I don\u2018t like this"? | 0 | [
2,
925,
1876,
37,
3893,
19,
20059,
800,
3726,
3726,
19,
21,
1854,
3893,
15,
80,
25,
21,
3724,
13,
7,
49,
221,
22,
38,
101,
48,
7,
9,
207,
15,
76,
31,
1302,
32,
77,
21,
3724,
15,
32,
2633,
13,
7,
49,
221,
1,
291,
8277,
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... |
Return "correct" error code, or protect privacy?
===
OK, probably best to give an example here of what I mean.
Imagine a web based forum system, where the user authentication is done by some external method, which the system is aware of.
Now, say for example, a user enters the URL for a thread that they do not have access to. For this should I return a 403 (Forbidden), letting the user know that they should try another authentication method, or a 404, not letting them know that there is something there to access.
Assuming I return a 403, should I also return a 403 when they access a URL for a topic that doesn't exist yet?
| 0 | [
2,
788,
13,
7,
25345,
7,
7019,
1797,
15,
54,
2196,
9226,
60,
800,
3726,
3726,
5854,
15,
910,
246,
20,
590,
40,
823,
235,
16,
98,
31,
884,
9,
4382,
21,
2741,
432,
5691,
329,
15,
113,
14,
4155,
27963,
25,
677,
34,
109,
4886,
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... |
In Django is there a way to display choices as checkboxes?
===
In the admin interface and newforms there is the brilliant helper of being able to define choices. You can use code like this:
APPROVAL_CHOICES = (
('yes', 'Yes'),
('no', 'No'),
('cancelled', 'Cancelled'),
)
client_approved = models.CharField(choices=APPROVAL_CHOICES)
to create a drop down box in your form and force the user to choose one of those options.
I'm just wondering if there is a way to define a set of choices where multiple can be chosen using checkboxes? (Would also be nice to be able to say that the user can select a maximum number of them.) It seems like it's a feature that is probably implemented, it's just I can't seem to find it in the documentation. | 0 | [
2,
19,
3857,
14541,
25,
80,
21,
161,
20,
3042,
10978,
28,
2631,
5309,
160,
60,
800,
3726,
3726,
19,
14,
21,
43,
2160,
6573,
17,
78,
4190,
18,
80,
25,
14,
7472,
448,
106,
16,
142,
777,
20,
9267,
10978,
9,
42,
92,
275,
1797,
1... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How to be successful in web user interface testing ?
===
We are setting up a [Selenium][1] test campaign on a big web application.
The first thing we've done was to build a framework which initialize SQL data in database before the test, launch the test, archive results and then clear data.
We've integrate that in a Maven 2 process, run every day by [TeamCity][2] on a dedicated database.
We've set up several Selenium tests now but It's not as used as planned.
Reasons are that tests are sometimes broken for other reasons than regressions (data may have changed, stored procedure may have been recompiled and so on).
I would like to know if there are big success in user interface testing and if so, reasons to that. Commons errors may also interest me.
[1]: http://selenium.openqa.org/
[2]: http://www.jetbrains.com/teamcity/
| 0 | [
2,
184,
20,
44,
1300,
19,
2741,
4155,
6573,
4431,
13,
60,
800,
3726,
3726,
95,
50,
2697,
71,
21,
636,
18,
20110,
2187,
500,
2558,
165,
500,
1289,
1150,
27,
21,
580,
2741,
3010,
9,
14,
64,
584,
95,
22,
195,
677,
23,
20,
1895,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
MS VC++ 6 class wizard
===
Ok, I'm developing an application that has been in pretty much continous development over the last 16 years, from C in DOS, through various flavours of C++ and now is largely based around C++ with MFC and StingRay GUIs and various other SDKs.
While I use VS 2005 for the release builds, I still use MSVC 6 for much of the GUI building, simply because ClassWizard is so much quicker in this environment than the weak equivalent tools that followed. Note that I am using ClassWizard to automatically generate code for my own user defined types (see [Custom DDXs][1]) and I like to add a lot of member variables and methods in one go. Creating them one at a time as per later versions of Visual Studio for me is a big backward step. At the same time, working with multiple IDEs is also a pain.
My question is in two parts;
**1** Is there any way of getting ClassWizard to work is VS 2005 or VS 2008?
**2** Is there any drop in replacement, or alternative IDE, that provides similar levels of productivty for old C++ hacks such as myself?
[1]: http://msdn.microsoft.com/en-us/library/57weza95%28VS.71%29.aspx | 0 | [
2,
4235,
13,
8990,
20512,
400,
718,
10276,
800,
3726,
3726,
5854,
15,
31,
22,
79,
3561,
40,
3010,
30,
63,
74,
19,
1772,
212,
13,
13391,
1291,
522,
84,
14,
236,
347,
122,
15,
37,
272,
19,
107,
18,
15,
120,
617,
22408,
18,
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... |
MPI for multicore ?
===
With the recent buzz on multicore programming is anyone exploring the possibilities of using [MPI][1] ?
[1]: http://www-unix.mcs.anl.gov/mpi/ | 0 | [
2,
4628,
49,
26,
1889,
10375,
13,
60,
800,
3726,
3726,
29,
14,
1764,
9122,
27,
1889,
10375,
3143,
25,
1276,
11748,
14,
13086,
16,
568,
636,
2554,
49,
500,
2558,
165,
500,
13,
60,
636,
165,
500,
45,
7775,
6903,
6483,
8,
1020,
402... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
Delphi Active Commercial Components
===
Similar to the Delphi FOSS component question, a commercial component directory will also be a valuable searchable resource. I invite you to contribute your expierience with your favourite commercial components and also share with us your experiences with commercial components that doesn't make the grade as well. Then there is the question of price/performance or better price/features. Often commercial component pricing is sky high - indicate where you think it is good value or expensive.
Please don't forget your links. | 0 | [
2,
23030,
1348,
1439,
5090,
800,
3726,
3726,
835,
20,
14,
23030,
13,
15912,
5912,
1301,
15,
21,
1439,
5912,
16755,
129,
67,
44,
21,
5940,
2122,
579,
6577,
9,
31,
10275,
42,
20,
8606,
154,
13,
6899,
17611,
2940,
29,
154,
7740,
1439... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 SAPI module for PHP 5 for supporting the thttpd web server?
===
Is there a SAPI module for PHP 5 for supporting the thttpd web server?
Oddly, the one included on PHP 5.2.6 source is for PHP 4.x.
Thanks,
Kenneth | 0 | [
2,
25,
80,
21,
7508,
49,
12613,
26,
13,
26120,
331,
26,
3134,
14,
13,
38,
21127,
43,
2741,
8128,
60,
800,
3726,
3726,
25,
80,
21,
7508,
49,
12613,
26,
13,
26120,
331,
26,
3134,
14,
13,
38,
21127,
43,
2741,
8128,
60,
17459,
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... |
Best way to parse float CSharp
===
What is the best way to parse a float in CSharp?
I know about TryParse, but what I'm particularly wondering about is dots, comma's etc.
I'm having problems with my website. On my dev server, the ',' is for decimals, the '.' for separator. On the prod server though, it is the other way round.
How can I best capture this? | 0 | [
2,
246,
161,
20,
2017,
870,
11510,
272,
23646,
800,
3726,
3726,
98,
25,
14,
246,
161,
20,
2017,
870,
21,
11510,
19,
272,
23646,
60,
31,
143,
88,
1131,
3574,
870,
15,
47,
98,
31,
22,
79,
1653,
5712,
88,
25,
17900,
15,
11951,
58... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Why does Swing in my Java Applet flicker on fast mouse over?
===
I made a Java Applet with some Standard GUI Components on it. I used the [MigLayout][1] Manager.
If I move the mouse slowly over the various GUI Components everything appears to be fine, but if I move the mouse fast, it flickers.
What could make that nasty ugly redraw?
(Core 2 Duo 6300, 2GB Ram, Windows XP)
[1]: http://www.miglayout.com/ | 0 | [
2,
483,
630,
5587,
19,
51,
8247,
4037,
38,
18709,
27,
1512,
7567,
84,
60,
800,
3726,
3726,
31,
117,
21,
8247,
4037,
38,
29,
109,
1236,
9457,
5090,
27,
32,
9,
31,
147,
14,
636,
10183,
4414,
1320,
500,
2558,
165,
500,
1382,
9,
1... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Preserving signatures of decorated functions
===
Suppose I have written a decorator that does something very generic. For example, it might convert all arguments to a specific type, perform logging, implement memoization, etc.
Here is an example:
<pre>
def args_as_ints(f):
def g(*args, **kwargs):
args = [int(x) for x in args]
kwargs = dict((k, int(v)) for k, v in kwargs.items())
return f(*args, **kwargs)
return g
@args_as_ints
def funny_function(x, y, z=3):
"""Computes x*y + 2*z"""
return x*y + 2*z
>>> funny_function("3", 4.0, z="5")
22
</pre>
Everything well so far. There is one problem, however. The decorated function does not retain the documentation of the original function:
<pre>
>>> help(funny_function)
Help on function g in module __main__:
g(*args, **kwargs)
</pre>
Fortunately, there is a workaround:
<pre>
def args_as_ints(f):
def g(*args, **kwargs):
args = [int(x) for x in args]
kwargs = dict((k, int(v)) for k, v in kwargs.items())
return f(*args, **kwargs)
g.__name__ = f.__name__
g.__doc__ = f.__doc__
return g
@args_as_ints
def funny_function(x, y, z=3):
"""Computes x*y + 2*z"""
return x*y + 2*z
</pre>
This time, the function name and documentation are correct:
<pre>
>>> help(funny_function)
Help on function funny_function in module __main__:
funny_function(*args, **kwargs)
Computes x*y + 2*z
</pre>
But there is still a problem: the function signature is wrong. The information "\*args, \*\*kwargs" is next to useless.
What to do? I can think of two simple but flawed workarounds:
1 -- Include the correct signature in the docstring:
<pre>
def funny_function(x, y, z=3):
"""funny_function(x, y, z=3) -- computes x*y + 2*z"""
return x*y + 2*z
</pre>
This is bad because of the duplication. The signature will still not be shown properly in automatically generated documentation. It's easy to update the function and forget about changing the docstring, or to make a typo. [<i>And yes, I'm aware of the fact that the docstring already duplicates the function body. Please ignore this; funny_function is just a random example.</i>]
2 -- Not use a decorator, or use a special-purpose decorator for every specific signature:
<pre>
def funny_functions_decorator(f):
def g(x, y, z=3):
return f(int(x), int(y), z=int(z))
g.__name__ = f.__name__
g.__doc__ = f.__doc__
return g
</pre>
This works fine for a set of functions that have identical signature, but it's useless in general. As I said in the beginning, I want to be able to use decorators entirely generically.
I'm looking for a solution that is fully general, and automatic.
So the question is: is there a way to edit the decorated function signature after it has been created?
Otherwise, can I write a decorator that extracts the function signature and uses that information instead of "\*kwargs, \*\*kwargs" when constructing the decorated function? How do I extract that information? How should I construct the decorated function -- with exec?
Any other approaches? | 0 | [
2,
17936,
19506,
16,
6933,
3719,
800,
3726,
3726,
5787,
31,
57,
642,
21,
17650,
3457,
30,
630,
301,
253,
12733,
9,
26,
823,
15,
32,
530,
8406,
65,
10553,
20,
21,
1903,
1001,
15,
2985,
13,
13919,
15,
8713,
22236,
1829,
15,
2722,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Loading .sql files from within PHP
===
I'm creating an installation script for an application that I'm developing and need to create databases dynamically from within PHP. I've got it to create the database but now I need to load in several .sql files. I had planned to open the file and mysql_query it a line at a time - until I looked at the schema files and realised they aren't just one query per line.
So, please.. how do I load an sql file from within PHP? (as phpMyAdmin does with it's import command). | 0 | [
2,
12797,
13,
9,
18,
22402,
6488,
37,
363,
13,
26120,
800,
3726,
3726,
31,
22,
79,
2936,
40,
7758,
3884,
26,
40,
3010,
30,
31,
22,
79,
3561,
17,
376,
20,
1600,
6018,
18,
7782,
1326,
37,
363,
13,
26120,
9,
31,
22,
195,
330,
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... |
Javascript: How to find whether a particular string has unicode characters (esp. Double Byte characters)
===
To be more precise, I need to know whether (and if possible, how) I can find whether a given string has double byte characters or not. Basically, I need to open a pop-up to display a given text which can contain double byte characters, like Chinese or Japanese. In this case, we need to adjust the window size than it would be for English or ASCII.
Anyone has a clue? | 0 | [
2,
8247,
8741,
45,
184,
20,
477,
1472,
21,
1498,
3724,
63,
28010,
1766,
13,
5,
160,
306,
9,
1494,
34,
591,
1766,
6,
800,
3726,
3726,
20,
44,
91,
11114,
15,
31,
376,
20,
143,
1472,
13,
5,
290,
100,
938,
15,
184,
6,
31,
92,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
CouchDB modeling for multi-user
===
I am already exited about document databases and specially about CouchDB's simplicity. But I have a hard time understanding if such databases are a viable option for multi user systems. Since those systems require some kind of relations between records which document databases do not provide.
Is it completely the wrong tool for such cases? Or some tagging and temporary views are the way to accomplish this? Or else...
| 0 | [
2,
4914,
9007,
12807,
26,
1889,
8,
16704,
800,
3726,
3726,
31,
589,
614,
16974,
88,
4492,
6018,
18,
17,
13444,
88,
4914,
9007,
22,
18,
20595,
9,
47,
31,
57,
21,
552,
85,
3260,
100,
145,
6018,
18,
50,
21,
17347,
4255,
26,
1889,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 "closable TabbedPane" Component in Java?
===
After solving my [flicker issue][1], I wonder if there is a better closable Tabbed Pane, then the one that pops up on top by googling for [closabletappedpane][2]?
(you recognize it by its [processMouseEvents Method][3])
I especially need one, that never flickers :-)
Please post your experience, links with your own closable Tabbed Panes here.
[1]: http://stackoverflow.com/questions/147802/why-does-swing-in-my-java-applet-flicker-on-fast-mouse-over
[2]: http://www.google.ch/search?q=closeabletabbedpane
[3]: http://www.koders.com/java/fidA4A2ADA8513A83E2024E550ADF906CAE16A4EDFB.aspx?s=cdef%3Aaccount#L125 | 0 | [
2,
98,
25,
14,
246,
13,
7,
13023,
18,
579,
6523,
4283,
16660,
7,
5912,
19,
8247,
60,
800,
3726,
3726,
75,
17533,
51,
636,
410,
10129,
106,
1513,
500,
2558,
165,
500,
15,
31,
2666,
100,
80,
25,
21,
574,
7383,
18,
579,
6523,
428... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Subcribe via RSS for log4j logs?
===
Is it possible to subscribe to a url with log4j logs?
I understand that many applications do have daily error logs notification by email. But a problem with this approach is that the server that host the application may not provide smtp capability. Thus the RSS subscribe approach seens to be more flexibile.
Anyone know how is this being done ?
| 0 | [
2,
972,
150,
19118,
1197,
13,
1224,
18,
26,
6738,
300,
728,
18893,
60,
800,
3726,
3726,
25,
32,
938,
20,
13,
20330,
20,
21,
287,
6362,
29,
6738,
300,
728,
18893,
60,
31,
1369,
30,
151,
3767,
107,
57,
1954,
7019,
18893,
52,
4634,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
When using ANT, how can I define a task only if I have some specific java version ?
===
I have the problem that an specific step in Ant can only be executed when we have Java 1.5 installed in the build computer. The task definition uses uses a jar file that was compiled using 1.5, so running with a 1.4 virtual machine will throw an IncompatibleClassVersion exception.
I have to find a solution meanwhile to have this task working for this specific project that requires 1.4, but a question came to me. How can I avoid defining this task and executing this optional step if I don't have a specific java version?
I could use the "if" or "unless" tags on the target tag, but those only check if a property is set or not. I also would like to have a solution that doesn't require extra libraries, but I don't know if the build-in functionality in standard is enough to perform such a task. | 0 | [
2,
76,
568,
40,
38,
15,
184,
92,
31,
9267,
21,
3005,
104,
100,
31,
57,
109,
1903,
8247,
615,
13,
60,
800,
3726,
3726,
31,
57,
14,
1448,
30,
40,
1903,
1424,
19,
40,
38,
92,
104,
44,
5557,
76,
95,
57,
8247,
137,
9,
264,
4066... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Customization of Hibernate sequence generation
===
I have one hibernate sequence, that generates all sequence-numbers in my app. When I generate the schemas from hibernate (target Oracle10), it genererates:
create sequence hibernate_sequence;
I would like to change the configuration of the sequence. I have to use something like:
create sequence hibernate_sequence order nocache;
I don't like to change the generated scripts, everytime I create them. Where can I customize the sequence, hibernate generates? | 0 | [
2,
5816,
1829,
16,
4148,
2102,
8820,
4030,
2782,
800,
3726,
3726,
31,
57,
53,
4148,
2102,
8820,
4030,
15,
30,
7920,
18,
65,
4030,
8,
16299,
18,
19,
51,
4865,
9,
76,
31,
7920,
14,
23874,
18,
37,
4148,
2102,
8820,
13,
5,
3958,
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 is your favourite Java Script WYSIWYG Editor component?
===
I definitifely like the one at stackoverflow, because it's clean and simple. Also the live preview with code/syntax hilighting is really helpful (and motivating).
What is your favourite Javascript Editor Framework and why?
| 0 | [
2,
98,
25,
154,
7740,
8247,
3884,
5809,
18,
49,
7913,
263,
1835,
5912,
60,
800,
3726,
3726,
31,
121,
5617,
8793,
3739,
102,
101,
14,
53,
35,
7566,
2549,
9990,
15,
185,
32,
22,
18,
2745,
17,
1935,
9,
67,
14,
515,
16121,
29,
179... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Best book for Programming VMWare ESX + VDI
===
I've been asked to research creating a solution around VMWare ESX and VDI. This will require extensive use of the APIs for managing the solution. It will also look to leverage the VDM client.
Can anyone recommend a good book which will get me started on this topic.
Thanks. | 4 | [
2,
246,
360,
26,
3143,
13,
20147,
5011,
13,
160,
396,
2754,
566,
1115,
800,
3726,
3726,
31,
22,
195,
74,
411,
20,
527,
2936,
21,
4295,
140,
13,
20147,
5011,
13,
160,
396,
17,
566,
1115,
9,
48,
129,
4077,
3386,
275,
16,
14,
21,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How to convert generic dictionary to non-generic without enumerating?
===
I want to convert an instance of generic [IDictionary][1] to non generic [IDictionary][2]. Can I do it without creating new instance of [IDictionary][2]? Is any framework support for this task?
[1]: http://msdn.microsoft.com/en-us/library/s4ys34ea.aspx
[2]: http://msdn.microsoft.com/en-us/library/system.collections.idictionary.aspx | 0 | [
2,
184,
20,
8406,
12733,
9186,
20,
538,
8,
17083,
596,
366,
26940,
68,
60,
800,
3726,
3726,
31,
259,
20,
8406,
40,
4851,
16,
12733,
636,
49,
22595,
1857,
500,
2558,
165,
500,
20,
538,
12733,
636,
49,
22595,
1857,
500,
2558,
135,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 exception stack trace
===
In Firefox I can get the stack trace of an exception by using`exception.stack`.
Is there a way to get that in other browsers, too? | 0 | [
2,
8247,
8741,
5391,
7566,
5565,
800,
3726,
3726,
19,
535,
18219,
31,
92,
164,
14,
7566,
5565,
16,
40,
5391,
34,
568,
1,
10066,
872,
9,
25325,
1,
9,
25,
80,
21,
161,
20,
164,
30,
19,
89,
16495,
18,
15,
266,
60,
3,
0,
0,
0,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
In SQL Server can I insert multiple nodes into XML from a table?
===
I want to generate some XML in a stored procedure based on data in a table.
The following insert allows me to add many nodes but they have to be hard-coded or use variables (sql:variable):
SET @MyXml.modify('
insert
<myNode>
{sql:variable("@MyVariable")}
</myNode>
into (/root[1]) ')
So I could loop through each record in my table, put the values I need into variables and execute the above statement.
But is there a way I can do this by just combining with a select statement and avoiding the loop? | 0 | [
2,
19,
4444,
255,
8128,
92,
31,
14692,
1886,
16272,
77,
23504,
37,
21,
859,
60,
800,
3726,
3726,
31,
259,
20,
7920,
109,
23504,
19,
21,
8214,
7004,
432,
27,
1054,
19,
21,
859,
9,
14,
249,
14692,
2965,
55,
20,
3547,
151,
16272,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Linux configuration file libraries
===
Are there any good configuration file reading libraries for C\C++ that can be used for applications written on the linux platform. I would like to have a simple configuration file for my application. At best i would like to steer clear of XML files that might potentially confuse users. | 0 | [
2,
13024,
8091,
3893,
8649,
800,
3726,
3726,
50,
80,
186,
254,
8091,
3893,
1876,
8649,
26,
272,
1,
150,
20512,
30,
92,
44,
147,
26,
3767,
642,
27,
14,
13024,
2452,
9,
31,
83,
101,
20,
57,
21,
1935,
8091,
3893,
26,
51,
3010,
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... |
Tabbed VS Tree for navigaion. Which is the preferred approach?
===
I realize that in of TOAD books right, it justifies the reaons on why it uses tabbed pane is that tree view involves too much scrolling.
But for me i like tree view better. As it only shows you the top level.
I see TOAD user interface. i thought the tabbed panels was very confusing for me to switch around.
What are your opinions regarding this?
| 0 | [
2,
6523,
4283,
4611,
1541,
26,
16048,
9571,
872,
9,
56,
25,
14,
5981,
2141,
60,
800,
3726,
3726,
31,
4007,
30,
19,
16,
20,
1283,
964,
193,
15,
32,
114,
12970,
14,
13,
9994,
4710,
27,
483,
32,
2027,
6523,
4283,
13,
16660,
25,
3... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How do I databind a ColumnDefinition's Width or RowDefinition's Height?
===
Under the View-Model-ViewModel pattern for WPF, I am trying to databind the Heights and Widths of various definitions for grid controls, so I can store the values the user sets them to after using a GridSplitter. However, the normal pattern doesn't seem to work for these particular properties.
*Note: I'm posting this as a reference question that I'm posting as Google failed me and I had to work this out myself. My own answer to follow.*
| 0 | [
2,
184,
107,
31,
1054,
4772,
43,
21,
4698,
28643,
22,
18,
9456,
54,
3131,
28643,
22,
18,
2947,
60,
800,
3726,
3726,
131,
14,
1418,
8,
13998,
8,
4725,
13998,
3732,
26,
619,
7721,
15,
31,
589,
749,
20,
1054,
4772,
43,
14,
7161,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How to check the overall health of database using Toad?
===
Anyone have any idea? And any open source sofware which also seens to perform this kind of functionality? | 0 | [
2,
184,
20,
2631,
14,
1677,
853,
16,
6018,
568,
20,
1283,
60,
800,
3726,
3726,
1276,
57,
186,
882,
60,
17,
186,
368,
1267,
86,
410,
5011,
56,
67,
541,
18,
20,
2985,
48,
825,
16,
18548,
60,
3,
0,
0,
0,
0,
0,
0,
0,
0,
0,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
Monitor SQL currently in shared pool using Toad
===
Anyone have any idea? And any open source sofware which also seens to perform this kind of functionality? | 0 | [
2,
7626,
4444,
255,
871,
19,
2592,
3067,
568,
20,
1283,
800,
3726,
3726,
1276,
57,
186,
882,
60,
17,
186,
368,
1267,
86,
410,
5011,
56,
67,
541,
18,
20,
2985,
48,
825,
16,
18548,
60,
3,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
Monitoring a database instance
===
Anyone have any idea? And any open source sofware which also seens to perform this kind of functionality? | 0 | [
2,
8984,
21,
6018,
4851,
800,
3726,
3726,
1276,
57,
186,
882,
60,
17,
186,
368,
1267,
86,
410,
5011,
56,
67,
541,
18,
20,
2985,
48,
825,
16,
18548,
60,
3,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
SBCL on Vista crashes. Do you know how to make it work?
===
I've searched a lot for an answer for this question in the web: they say it's true, SBCL doesn't work under Vista.
But I really need to work with lisp on my home Vista laptop and VM doesn't help really...
And CL is not so interesting because of speed...
If you have any recommendation, please share! | 0 | [
2,
13,
18,
220,
5316,
27,
13520,
21563,
9,
107,
42,
143,
184,
20,
233,
32,
170,
60,
800,
3726,
3726,
31,
22,
195,
9036,
21,
865,
26,
40,
1623,
26,
48,
1301,
19,
14,
2741,
45,
59,
395,
32,
22,
18,
1151,
15,
13,
18,
220,
531... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Can you create collapsible #Region like scopes in C++ within VS 2008?
===
I miss it so much (used it a lot in C#). can you do it in C++? | 0 | [
2,
92,
42,
1600,
9470,
2552,
18,
3426,
6926,
18790,
101,
9914,
18,
19,
272,
20512,
363,
4611,
570,
60,
800,
3726,
3726,
31,
1501,
32,
86,
212,
13,
5,
8795,
32,
21,
865,
19,
272,
5910,
6,
9,
92,
42,
107,
32,
19,
272,
20512,
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,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
How to use SQLab Xpert Tuning to tune SQL for better performance?
===
Anyone have any idea? And any open source sofware which also seens to perform this kind of functionality? | 0 | [
2,
184,
20,
275,
4444,
9086,
993,
17631,
19253,
20,
6768,
4444,
255,
26,
574,
956,
60,
800,
3726,
3726,
1276,
57,
186,
882,
60,
17,
186,
368,
1267,
86,
410,
5011,
56,
67,
541,
18,
20,
2985,
48,
825,
16,
18548,
60,
3,
0,
0,
0... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
Anyone have commit notification hook script that will send email upon commit of codes?
===
Can share with me any of this script? | 0 | [
2,
1276,
57,
9686,
52,
4634,
5559,
3884,
30,
129,
2660,
8517,
685,
9686,
16,
11358,
60,
800,
3726,
3726,
92,
1891,
29,
55,
186,
16,
48,
3884,
60,
3,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
What's the best way to get the name of a folder that doesn't exist?
===
What's the best way to get a string containing a folder name that I can be certain does **not** exist? That is, if I call <code>DirectoryInfo.Exists</code> for the given path, it should return false. | 0 | [
2,
98,
22,
18,
14,
246,
161,
20,
164,
14,
204,
16,
21,
19294,
30,
1437,
22,
38,
3182,
60,
800,
3726,
3726,
98,
22,
18,
14,
246,
161,
20,
164,
21,
3724,
3503,
21,
19294,
204,
30,
31,
92,
44,
1200,
630,
13,
1409,
1270,
1409,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
C# - Sending messages to Google Chrome from C# application
===
I've been searching around, and I haven't found how I would do this from C#.
I was wanting to make it so I could tell Google Chrome to go **Forward**, **Back**, **Open New Tab**, **Close Tab**, **Open New Window**, and **Close Window** from my C# application.
I did something similar with WinAmp using
[DllImport("user32", EntryPoint = "SendMessageA")]
private static extern int SendMessage(int Hwnd, int wMsg, int wParam, int lParam);
and a a few others. But I don't know what message to send or how to find what window to pass it to, or anything.
So could someone show me how I would send those 6 commands to Chrome from C#? thanks | 0 | [
2,
272,
5910,
13,
8,
4907,
7561,
20,
8144,
13,
12985,
37,
272,
5910,
3010,
800,
3726,
3726,
31,
22,
195,
74,
5792,
140,
15,
17,
31,
2933,
22,
38,
216,
184,
31,
83,
107,
48,
37,
272,
5910,
9,
31,
23,
4638,
20,
233,
32,
86,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Create a tag upon every build of the application?
===
Do anyone do this in ANT Build. Meaning everytimie a certain target is called e.g. build-sit. A tag will be created in the svn respositoyr to reference to that particular sit version.
Any idea how to do about doing that?
| 0 | [
2,
1600,
21,
3383,
685,
352,
1895,
16,
14,
3010,
60,
800,
3726,
3726,
107,
1276,
107,
48,
19,
40,
38,
1895,
9,
1813,
352,
10002,
660,
21,
1200,
2935,
25,
227,
13,
62,
9,
263,
9,
1895,
8,
18,
242,
9,
21,
3383,
129,
44,
679,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 read an Http response stream twice in C#?
===
I am trying to read an Http response stream twice via the following:
<pre><code>HttpWebResponse response = (HttpWebResponse)request.GetResponse();
stream = response.GetResponseStream();
RssReader reader = new RssReader(stream);
do
{
element = reader.Read();
if (element is RssChannel)
{
feed.Channels.Add((RssChannel)element);
}
} while (element != null);</br>
</br>
StreamReader sr = new StreamReader(stream);
feed._FeedRawData = sr.ReadToEnd();
</code></pre>
However when the StreamReader code executes there is no data returned because the stream has now reached the end. I tried to reset the stream via stream.Position = 0 but this throws an exception (I think because the stream can't have its position changed manually).
Basically, I would like to parse the stream for XML and have access to the raw data (in string format).
Any ideas?
-g | 0 | [
2,
184,
92,
31,
1302,
40,
7775,
1627,
3766,
2088,
19,
272,
5910,
60,
800,
3726,
3726,
31,
589,
749,
20,
1302,
40,
7775,
1627,
3766,
2088,
1197,
14,
249,
45,
13,
1,
3515,
1,
9375,
1,
21127,
458,
3692,
18,
8782,
870,
1627,
800,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Great resources for using the CLR Profiler APIs
===
I'm looking for good resources to learn and contribute to regarding CLR profiler API knowledge (a.k.a "Extended Reflection"). Got one?
Only other question here is[link text][1] but it's just a beginning.
[1]: http://stackoverflow.com/questions/33727/clr-profiler-attaching-to-existing-process | 0 | [
2,
374,
2566,
26,
568,
14,
10842,
139,
5296,
139,
21,
8954,
800,
3726,
3726,
31,
22,
79,
699,
26,
254,
2566,
20,
2484,
17,
8606,
20,
3467,
10842,
139,
5296,
139,
21,
2159,
1918,
13,
5,
58,
9,
197,
9,
58,
13,
7,
25138,
9138,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 list a member and all of its desendants in MDX?
===
In an OLAP database I work with there is a 'Location' hierarchy consisting of the levels Company, Region, Area, Site, Room, Till. For a particular company I need to write some MDX that lists all regions, areas and sites (but not any levels below Site). Currently I am achieving this with the following MDX
HIERARCHIZE({
[Location].[Test Company],
Descendants([Location].[Test Company], [Location].[Region]),
Descendants([Location].[Test Company], [Location].[Area]),
Descendants([Location].[Test Company], [Location].[Site])
})
Because my knowledge of MDX is limited, I was wondering if there was a simpler way to do this, with a single command rather that four? Is there a less verbose way of achieveing this, or is my example the only real way of achieving this?
| 0 | [
2,
98,
25,
14,
246,
161,
20,
968,
21,
322,
17,
65,
16,
82,
1746,
2451,
5958,
19,
8138,
396,
60,
800,
3726,
3726,
19,
40,
13,
2268,
306,
6018,
31,
170,
29,
80,
25,
21,
13,
22,
19032,
22,
14417,
4160,
16,
14,
2216,
237,
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... |
Dynamic search and display
===
I have a big load of documents, text-files, that I want to search for relevant content. I've seen a searching tool, can't remeber where, that implemented a nice method as I describe in my requirement below.
My requirement is as follows:
- I need an optimised search function: I supply this search function with a list (one or more) partially-complete (or complete) words separated with spaces.
- The function then finds all the documents containing words starting or equal to the first word, then search these found documents in the same way using the second word, and so on, at the end of which it returns a list containing the actual words found linked with the documents (name & location) containing them, for the complete the list of words.
- The documents must contain **all** the words in the list.
- I want to use this function to do an as-you-type search so that I can display and update the results in a tree-like structure in real-time.
A possible approach to a solution I came up with is as follows:
I create a database (most likely using mysql) with three tables: 'Documents', 'Words' and 'Word_Docs'.
- 'Documents' will have (idDoc, Name, Location) of all documents.
- 'Words' will have (idWord, Word) , and be a list of unique words from all the documents (a specific word appears only once).
- 'Word_Docs' will have (idWord, idDoc) , and be a list of unique id-combinations for each word and document it appears in.
The function is then called with the content of an editbox on each keystroke (except space):
- the string is tokenized
- (here my wheels spin a bit): I am sure a single SQL statement can be constructed to return the required dataset: (actual_words, doc_name, doc_location); (I'm not a hot-number with SQL), alternatively a sequence of calls for each token and parse-out the non-repeating idDocs?
- this dataset (/list/array) is then returned
The returned list-content is then displayed:
e.g.: called with: "seq sta cod"
displays:
sequence - start - code - Counting Sequences [file://docs/sample/con_seq.txt]
- stop - code - Counting Sequences [file://docs/sample/con_seq.txt]
sequential - statement - code - SQL intro [file://somewhere/sql_intro.doc]
(and-so-on)
Is this an optimal way of doing it? The function needs to be fast, or should it be called only when a space is hit?
Should it offer word-completion? (Got the words in the database) At least this would prevent useless calls to the function for words that does not exist.
If word-completion: how would that be implemented?
(Maybe SO could also use this type of search-solution for browsing the tags? (In top-right of main page))
| 0 | [
2,
7782,
2122,
17,
3042,
800,
3726,
3726,
31,
57,
21,
580,
6305,
16,
4374,
15,
1854,
8,
16877,
18,
15,
30,
31,
259,
20,
2122,
26,
7480,
2331,
9,
31,
22,
195,
541,
21,
5792,
5607,
15,
92,
22,
38,
11948,
17669,
113,
15,
30,
68... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Is it idiomatic Ruby to add an assert( ) method to Ruby's Kernel class?
===
I'm expanding my Ruby understanding by coding an equivalent of Kent Beck's xUnit in Ruby. Python (which Kent writes in) has an assert() method in the language which is used extensively. Ruby does not. I think it should be easy to add this but is Kernel the right place to put it?
BTW, I know of the existence of the various Unit frameworks in Ruby - this is an exercise to learn the Ruby idioms, not to "get something done".
All help gratefully received.
TIA | 0 | [
2,
25,
32,
28380,
12479,
10811,
20,
3547,
40,
10908,
5,
13,
6,
2109,
20,
10811,
22,
18,
17007,
718,
60,
800,
3726,
3726,
31,
22,
79,
9393,
51,
10811,
3260,
34,
13,
15458,
40,
4602,
16,
4422,
6846,
22,
18,
993,
15464,
19,
10811,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 Remoting and Server 2008 (64 Bit)
===
I have a .NET application that is meant to be run on a local PC and started from a file share on the LAN.
It works fine on 32 bit Windows XP and Vista workstations.
But it fails with a System.InvalidOperationException on 64 bit Windows Server 2008.
It runs fine locally on all three configurations.
What could be the cause?
.NET 2.0 is installed an all machines involved.
Summary:
32 bit XP: runs locally and remotely
32 bit Vista: runs locally and remotely
64 bit 2008: runs locally, fails remotely
"remotely" means running locally but launched from a file share rather than a local drive.
Zone security is set to "full trust" for "Local Intranet" on all machines involved including the 64 bit 2008 machine.
Any ideas? | 0 | [
2,
13,
9,
2328,
302,
7662,
68,
17,
8128,
570,
13,
5,
3470,
1142,
6,
800,
3726,
3726,
31,
57,
21,
13,
9,
2328,
3010,
30,
25,
1380,
20,
44,
485,
27,
21,
375,
5168,
17,
373,
37,
21,
3893,
1891,
27,
14,
6178,
9,
32,
693,
1123,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
.html() Jquery method bizzare bug - resolves to empty space locally, but not on production.
===
I'm making a simple jquery command:
element.html(" ");
using the attributes/html method: http://tinyurl.com/4ocd7d
It works on my local app engine server, but it doesn't work once i push to the google server. The element empties, but doesn't fill with spaces.
So instead of " " it's just "".
Once again, this is running on App Engine, but I don't think that should matter... | 0 | [
2,
13,
9,
15895,
5,
6,
487,
8190,
93,
2109,
1732,
5092,
1509,
6256,
13,
8,
9854,
18,
20,
2424,
726,
6680,
15,
47,
52,
27,
637,
9,
800,
3726,
3726,
31,
22,
79,
544,
21,
1935,
487,
8190,
93,
1202,
45,
4520,
9,
15895,
5,
7,
1... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Tomahawk and scrolling tabs
===
is there a tomahawk component, that enables "scrollable tabs"? What I mean is something for the following situation:
If I have very many tabs, the tab-bar gets a little arrow on the side to scroll through all the open tabs (like in firefox).
Is there a tomahawk component for creating something similar?
| 0 | [
2,
20,
540,
9390,
17,
13,
28166,
6523,
18,
800,
3726,
3726,
25,
80,
21,
20,
540,
9390,
5912,
15,
30,
14645,
13,
7,
3862,
8694,
579,
6523,
18,
7,
60,
98,
31,
884,
25,
301,
26,
14,
249,
1858,
45,
100,
31,
57,
253,
151,
6523,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Standard algorithm to tokenize a string, keep delimiters (in PHP)
===
I want to split an arithmetic expression into tokens, to convert it into RPN.
Java has the StringTokenizer, which can optionally keep the delimiters. That way, I could use the operators as delimiters. Unfortunately, I need to do this in PHP, which has strtok, but that throws away the delimiters, so I need to brew something myself.
This sounds like a classic textbook example for Compiler Design 101, but I'm afraid I'm lacking some formal education here. Is there a standard algorithm you can point me to?
My other options are to read up on [Lexical Analysis][1] or to roll up something quick and dirty with the available string functions.
[1]: http://en.wikipedia.org/wiki/Lexical_analysis | 0 | [
2,
1236,
9083,
20,
20,
2853,
2952,
21,
3724,
15,
643,
121,
20565,
445,
13,
5,
108,
13,
26120,
6,
800,
3726,
3726,
31,
259,
20,
2132,
40,
21211,
1803,
77,
20,
2853,
18,
15,
20,
8406,
32,
77,
13,
6952,
103,
9,
8247,
63,
14,
37... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How to get WCF statistics from inside an application that uses it?
===
Is it possible to gather performance statistics programmatically from inside a WCF application? For example, the number of connections open or requests received. | 0 | [
2,
184,
20,
164,
11801,
410,
5818,
37,
572,
40,
3010,
30,
2027,
32,
60,
800,
3726,
3726,
25,
32,
938,
20,
7442,
956,
5818,
625,
6732,
1326,
37,
572,
21,
11801,
410,
3010,
60,
26,
823,
15,
14,
234,
16,
6760,
368,
54,
12279,
420... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
Is having different users for different types of queries a good practice?
===
I am using MySQL and PHP for a project I am working. I have created separate users for carrying out different functions (one for running select queries, one for running update queries, etc.) to provide an extra layer of security. This way, I figure if someone does manage to carry out an injection attack (which is unlikely since I am using prepared statements), whatever they are able to do will be limited to the type of query that was originally meant to be run. Is this a good practice or is it not worth the trouble? | 0 | [
2,
25,
452,
421,
3878,
26,
421,
2551,
16,
9386,
2829,
21,
254,
1345,
60,
800,
3726,
3726,
31,
589,
568,
51,
18,
22402,
17,
13,
26120,
26,
21,
669,
31,
589,
638,
9,
31,
57,
679,
1725,
3878,
26,
3346,
70,
421,
3719,
13,
5,
849... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Do you actually use a webbased IDE and why?
===
I used [web2py][1] for several projects.
Mostly because the deployment is dead simple and you can easily add and modify the application.
But the editor for python code was not very pythonic and the form handling was lacking some [DRY][2]-ness.
Do you use a webbased environment for development? Why and what is your experience?
[1]: http://mdp.cti.depaul.edu/
[2]: http://en.wikipedia.org/wiki/Don%27t_repeat_yourself | 4 | [
2,
107,
42,
1121,
275,
21,
2741,
1281,
13,
3448,
17,
483,
60,
800,
3726,
3726,
31,
147,
636,
14113,
135,
6448,
500,
2558,
165,
500,
26,
238,
2314,
9,
1555,
185,
14,
10475,
25,
828,
1935,
17,
42,
92,
2351,
3547,
17,
17579,
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... |
Why doesnt paginator remember my custom parameters when I go to page 2?
===
When using the paginator helper in cakephp views, it doesnt remember parts of the url that are custom for my useage.
For example:
http://example.org/users/index/moderators/page:2/sort:name/dir:asc
here **moderators** is a parameter that helps me filter by that type. But pressing a paginator link will not include this link. | 0 | [
2,
483,
5886,
19006,
108,
3457,
1518,
51,
5816,
12905,
76,
31,
162,
20,
2478,
172,
60,
800,
3726,
3726,
76,
568,
14,
19006,
108,
3457,
448,
106,
19,
8390,
26120,
4146,
15,
32,
5886,
1518,
1341,
16,
14,
287,
6362,
30,
50,
5816,
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... |
How do you write the end of a file opened with FILE_FLAG_NO_BUFFERING?
===
I am using VB6 and the Win32 API to write data to a file, this functionality is for the export of data, therefore write performance to the disk is the key factor in my considerations. As such I am using the `FILE_FLAG_NO_BUFFERING` and `FILE_FLAG_WRITE_THROUGH` options when opening the file with a call to `CreateFile`.
`FILE_FLAG_NO_BUFFERING` requires that I use my own buffer and write data to the file in multiples of the disk's sector size, this is no problem generally, apart from the last part of data, which if it is not an exact multiple of the sector size will include character zero's padding out the file, how do I set the file size once the last block is written to not include these character zero's?
I can use `SetEndOfFile` however this requires me to close the file and re-open it without using `FILE_FLAG_NO_BUFFERING`. I have seen someone talk about `NtSetInformationFile` however I cannot find how to use and declare this in VB6. `SetFileInformationByHandle` can do exactly what I want however it is only available in Windows Vista, my application needs to be compatible with previous versions of Windows. | 0 | [
2,
184,
107,
42,
2757,
14,
241,
16,
21,
3893,
520,
29,
3893,
1,
22868,
1,
251,
1,
2345,
6866,
68,
60,
800,
3726,
3726,
31,
589,
568,
13,
20468,
379,
17,
14,
628,
3125,
21,
2159,
20,
2757,
1054,
20,
21,
3893,
15,
48,
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... |
Algorithm for finding the maximum difference in an array of numbers
===
I have an array of a few million numbers.
double* const data = new double (3600000);
I need to iterate through the array and find the range (the largest value in the array minus the smallest value). However, there is a catch. I only want to find the range where the smallest and largest values are within 1,000 samples of each other.
So I need to find the maximum of: range(data + 0, data + 1000), range(data + 1, data + 1001), range(data + 2, data + 1002), ...., range(data + 3599000, data + 3600000).
I hope that makes sense. Basically I could do it like above, but I'm looking for a more efficient algorithm if one exists. I think the above algorithm is O(n), but I feel that it's possible to optimize. An idea I'm playing with is to keep track of the most recent maximum and minimum and how far back they are, then only backtrack when necessary.
I'll be coding this in C++, but a nice algorithm in pseudo code would be just fine. Also, if this number I'm trying to find has a name, I'd love to know what it is.
Thanks.
| 0 | [
2,
9083,
26,
3007,
14,
2979,
2841,
19,
40,
7718,
16,
2116,
800,
3726,
3726,
31,
57,
40,
7718,
16,
21,
310,
507,
2116,
9,
1494,
2483,
11608,
38,
1054,
800,
78,
1494,
13,
5,
19454,
21903,
6,
73,
31,
376,
20,
32,
106,
1373,
120,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Find out the calling stored procedure in SQL Server
===
Is it possible to find out who called a store procedure. So if you get an error in proc3, I know if it was called by proc1 or proc2.
I'm using SQL Server 2005. | 0 | [
2,
477,
70,
14,
2555,
8214,
7004,
19,
4444,
255,
8128,
800,
3726,
3726,
25,
32,
938,
20,
477,
70,
72,
227,
21,
1718,
7004,
9,
86,
100,
42,
164,
40,
7019,
19,
13,
15617,
240,
15,
31,
143,
100,
32,
23,
227,
34,
13,
15617,
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,
0,
0... |
How to update unique values in SQL using a PostgreSQL sequence?
===
In SQL, how do update a table, setting a column to a different value for each row?
I want to update some rows in a PostgreSQL database, setting one column to a number from a sequence, where that column has a unique constraint. I hoped that I could just use:
update person set unique_number = (select nextval('number_sequence') );
but it seems that *nextval* is only called once, so the update uses the same number for every row, and I get a 'duplicate key violates unique constraint' error. What should I do instead? | 0 | [
2,
184,
20,
11100,
2619,
4070,
19,
4444,
255,
568,
21,
678,
6879,
18,
22402,
4030,
60,
800,
3726,
3726,
19,
4444,
255,
15,
184,
107,
11100,
21,
859,
15,
2697,
21,
4698,
20,
21,
421,
1923,
26,
206,
3131,
60,
31,
259,
20,
11100,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 plot data with a non-numeric X-axis?
===
I have a series of performance tests I would like to show as a graph. I have a set of tests (about 10) which I run on a set of components (currently 3), and get throughput results.
The Y-axis would be the throughput result from the test, and the X-axis should have an abbreviated name of the test, with the results from the various components I'm testing. So, for each X label (eg. retrieve20Items, store20Items) there would be 3 different results above it, one for each of the three components I'm testing, each colour-coded and referenced in the legend.
Is this non-numeric x-axis something that I can do with gnuplot? This is being done on a linux platform, so Windows-only tools won't work for me. | 0 | [
2,
184,
92,
31,
3798,
1054,
29,
21,
538,
8,
6336,
14744,
993,
8,
19676,
60,
800,
3726,
3726,
31,
57,
21,
231,
16,
956,
4894,
31,
83,
101,
20,
298,
28,
21,
7210,
9,
31,
57,
21,
309,
16,
4894,
13,
5,
6901,
332,
6,
56,
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... |
Why is this parameter of type char* not modified when called from C++ lib
===
I have got a C function in a static library, let's call it A, with the following interface :
int A(unsigned int a, unsigned long long b, unsigned int *y, unsigned char *z);
This function will change the value of y an z (this is for sure). I use it from within a dynamic C++ library.
Now, here is what stune me :
1. y is properly set, z is not changed.
2. when called from a C binary, this function works seamlessly (z is modified).
3. if I create a dummy C library with a function having the same prototype, and I use it from within my dynamic C++ library, it works very well. If I re-use the same variables to call A(..), I get the same result as before, z is not changed.
I think that the above points show that it is not a stupid mistake with the declaration of my variables.
I am clearly stuck, and I can't change the C library. Do you have any clue on what can be the problem ?
I was thinking about a problem on the C/C++ interface, per instance the way a char* is interpreted.
Thanks in advance for any help or clue.
| 0 | [
2,
483,
25,
48,
18906,
16,
1001,
4892,
2483,
52,
5372,
76,
227,
37,
272,
20512,
13,
8326,
800,
3726,
3726,
31,
57,
330,
21,
272,
1990,
19,
21,
12038,
1248,
15,
408,
22,
18,
645,
32,
21,
15,
29,
14,
249,
6573,
13,
45,
19,
38,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
What's the best approach to migrate a CGI to a Framework?
===
i have a big web application running in perl CGI. It's running ok, it's well written, but as it was done in the past, all the html are defined hardcoded in the CGI calls, so as you could imagine, it's hard to mantain, improve and etc. So now i would like to start to add some templating and integrate with a framework (catalyst or CGI::application). My question is: Somebody here has an experience like that? There is any things that i must pay attention for? I'm aware that with both frameworks i can run native CGI scripts, so it's good because i can run both (CGI native ad "frameworked" code) together without any trauma. Any tips?
| 0 | [
2,
98,
22,
18,
14,
246,
2141,
20,
22985,
21,
272,
2234,
20,
21,
6596,
60,
800,
3726,
3726,
31,
57,
21,
580,
2741,
3010,
946,
19,
416,
255,
272,
2234,
9,
32,
22,
18,
946,
5854,
15,
32,
22,
18,
134,
642,
15,
47,
28,
32,
23,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 OR comparisons with IF statements
===
When using IF statements in Python, you have to do the following to make the "cascade" work correctly.
if job == "mechanic" or job == "tech":
print "awesome"
elif job == "tool" or job == "rock":
print "dolt"
Is there a way to make Python accept multiple values when checking for "equals to"? For example,
if job == "mechanic" or "tech":
print "awesome"
elif job == "tool" or "rock":
print "dolt"
| 0 | [
2,
568,
54,
6050,
18,
29,
100,
9015,
800,
3726,
3726,
76,
568,
100,
9015,
19,
20059,
15,
42,
57,
20,
107,
14,
249,
20,
233,
14,
13,
7,
5949,
7257,
7,
170,
12044,
9,
100,
1205,
800,
3726,
13,
7,
790,
3606,
596,
7,
54,
1205,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Is it OK to have object instantation 'hooks' in base classes?
===
I have created my own Tree implementation for [various reasons][1] and have come up with two classes, a 'base' class that is a generic tree node that is chock full of logic and another class that extends that one which is more specialised.
In my base class certain methods involve instantiating new tree nodes (e.g. adding children). These instantations are inside logic (in a nested loop, say) which makes the logic hard to separate from the instantation.
So, if I don't override these instantations in the specific class the wrong type of node will be created. However, I don't *want* to override those methods because they also contained shared logic that shouldn't be duplicated!
The problem can be boiled down to this:
public class Foo {
public String value() { return "foo"; }
public Foo doStuff() {
// Logic logic logic..
return new Foo();
}
}
class Bar extends Foo {
public String value() { return "bar"; }
}
new Foo().doStuff().value(); // returns 'foo', we want 'bar'
The first thing that popped into my head would have a 'create hook' that extending classes could override:
public Foo createFooHook(/* required parameters */) {
return new Foo();
}
Now. while it was a fine first thought, there is a stench coming off that code something awful. There is something very... *wrong* about it.
It's like cooking while naked-- it feels dangerous and *unnecessary*.
So, **how would you deal with this situation?**
[1]: http://stackoverflow.com/questions/144642/tree-directed-acyclic-graph-implementation | 0 | [
2,
25,
32,
5854,
20,
57,
3095,
6322,
857,
13,
22,
20378,
18,
22,
19,
1000,
2684,
60,
800,
3726,
3726,
31,
57,
679,
51,
258,
1541,
6123,
26,
636,
8220,
1291,
2932,
500,
2558,
165,
500,
17,
57,
340,
71,
29,
81,
2684,
15,
21,
1... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How to call a mathematica program from the command line, with command-line args, stdin, stdout, and stderr.
===
Mathematica can be invoked with
-noprompt
and with
-run "<<somefilewithmathematicacode"
and the command line arguments are available in <code>$CommandLine</code> (with extra junk in there) but is there a way to just have some mathematica code like
#!/usr/bin/env MathKernel
x = 2+2;
Print[x];
etc.
and chmod it executable and run it? In other words, how does one use mathematica like any other scripting language (perl, python, ruby, etc)? | 0 | [
2,
184,
20,
645,
21,
5057,
5996,
12630,
625,
37,
14,
1202,
293,
15,
29,
1202,
8,
1143,
13,
10663,
18,
15,
354,
3653,
15,
354,
43,
1320,
15,
17,
354,
1157,
139,
9,
800,
3726,
3726,
5057,
5996,
12630,
92,
44,
26252,
29,
13,
8,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Is encrypting AJAX calls for authentication possible with jQuery?
===
I'm fairly new to the AJAX methodologies (I only recently discovered jQuery a short time ago). I am interested to know if there is anyway to authenticate a user on a PHP setup; securely.
Does jQuery have any special options to allow use of HTTPS (or any other way to encrypt my ajax call)?
Yes, I could very well just post data back to the server, but that ruins the fun. Thanks in advance. :) | 0 | [
2,
25,
1957,
11435,
68,
20624,
3029,
26,
27963,
938,
29,
487,
8190,
93,
60,
800,
3726,
3726,
31,
22,
79,
6647,
78,
20,
14,
20624,
2109,
13331,
18,
13,
5,
49,
104,
1989,
1848,
487,
8190,
93,
21,
502,
85,
1464,
6,
9,
31,
589,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Problem using large binary segment in OOXML
===
**System Description**
A plotting component that uses OOXML to generate a document.
Plotting component consists of several parts.
All parts are written in C++ as exe + dll's, with the exception of the interface to the OOXML document.
The latter component is a COM component that was created in C#/.NET. The main reason for this is that the .NET contains *System.IO.Packaging*. This is a very handy built-in facility for dealing with OOXML documents.
We create a document out of a template OOXML document where certain bits and pieces are replaced by their actual content.
One of these bits is an OLE Server component. Basically this is a binary segment within the OOXML file. For writing this binary segment, the Packaging component apparently uses isolated storage.
**Problem**
Writing a segment > 8MB results in an exception being thrown "Unable to determine the identity of the domain".
On the C++ side this exception contains the error ISS\_E\_ISOSTORE ( 0x80131450 ).
We have analyzed this and as far as we can tell, this is a security feature that prevents semi-untrusted third-party component from completely ruining your HD by writing immense files.
We have then tried a lot of things in the .NET/COM component ( creating custom AppDomains, setting Attributes for maximum permissivity, Creating our own Streams and passing those to the Packaging component ) but every time it resulted in the same exception being thrown.
What could we do to make this work?
Could it be that when the .NET component is instantiated as a COM component, its AppDomain is alway untrusted?
| 0 | [
2,
1448,
568,
370,
14171,
5631,
19,
635,
6326,
8184,
800,
3726,
3726,
13,
1409,
10724,
5318,
1409,
21,
22716,
5912,
30,
2027,
635,
6326,
8184,
20,
7920,
21,
4492,
9,
22716,
5912,
2043,
16,
238,
1341,
9,
65,
1341,
50,
642,
19,
272,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
.Net, Is Array.Sort stable sort?
===
Is the sorting algorithm used by .Net Array.Sort method a [stable][1] algorithm?
[1]: http://en.wikipedia.org/wiki/Stable_sort#Classification | 0 | [
2,
13,
9,
2328,
15,
25,
7718,
9,
22843,
4521,
2058,
60,
800,
3726,
3726,
25,
14,
2058,
68,
9083,
147,
34,
13,
9,
2328,
7718,
9,
22843,
2109,
21,
636,
18,
5924,
500,
2558,
165,
500,
9083,
60,
636,
165,
500,
45,
7775,
6903,
219,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
How to make a method exclusive in a multithreaded context ?
===
I have a method which should be executed in an exclusive fashion. Basically, it's a multi threaded application where the method is invoked periodically by a timer, but which could also be manually triggered by a user action.
Let's take an example :
1. The timer elapses, so the method is
called. The task could take a few
seconds.
2. Right after, the user clicks on some
button, which should trigger the
same task : BAM. It does nothing
since the method is already running.
I used the following solution :
public void DoRecurentJob()
{
if(!Monitor.TryEnter(this.lockObject))
{
return;
}
try
{
// Do work
}
finally
{
Monitor.Exit(this.lockObject);
}
}
Where `lockObject` is declared like that:
private static readonly object lockObject = new object();
I made the lock static, because I explicitly want to prevent the method to be executed in parallel, even from different instances.
Is there a better way to do that ? Or maybe this one is just wrong for any reason ? | 0 | [
2,
184,
20,
233,
21,
2109,
6753,
19,
21,
1889,
96,
10647,
69,
4141,
13,
60,
800,
3726,
3726,
31,
57,
21,
2109,
56,
378,
44,
5557,
19,
40,
6753,
3161,
9,
11374,
15,
32,
22,
18,
21,
1889,
9322,
69,
3010,
113,
14,
2109,
25,
262... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 convert a string into bignum in C code which extends Guile?
===
In Guile 1.6.*, the function <tt>scm_istring2number(char *str,int strlen,int radix)</tt> does the work.
However, this function does not exist in Guile 1.8.*.
How can I accomplish the same task in Guile 1.8.*?
This is not trivial because the function <tt>scm_string_to_number(SCM str,int radix)</tt> does not convert numbers larger than 2^31-1 (at least in Guile 1.6.*). | 0 | [
2,
184,
20,
8406,
21,
3724,
77,
580,
6336,
19,
272,
1797,
56,
9073,
9457,
413,
60,
800,
3726,
3726,
19,
9457,
413,
137,
9,
379,
9,
2483,
15,
14,
1990,
13,
1,
38,
38,
1,
18,
9095,
1,
49,
11130,
135,
16299,
5,
5433,
1637,
9729... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 deploy an ASP.NET Application with zero downtime
===
To deploy a new version of our website we do the following:
1. Zip up the new code, and upload it to the server.
2. On the live server, delete all the live code from the IIS website directory.
3. Extract the new code zipfile into the now empty IIS directory
This process is all scripted, and happens quite quickly, but there can still be a 10-20 second downtime when the old files are being deleted, and the new files being deployed.
Any suggestions on a 0 second downtime method?
| 0 | [
2,
184,
20,
17617,
40,
28,
306,
9,
2328,
3010,
29,
4606,
125,
891,
800,
3726,
3726,
20,
17617,
21,
78,
615,
16,
318,
2271,
95,
107,
14,
249,
45,
137,
9,
12133,
71,
14,
78,
1797,
15,
17,
71,
8294,
32,
20,
14,
8128,
9,
172,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
"Colorizing" images in .NET
===
Is there any simple way to programatically colorize images in .NET? Basically we have a black and white image and need to put a layer of say pink above it and reduce the opacity of that layer to make the picture colorized in pink. | 0 | [
2,
13,
7,
11282,
3335,
7,
3502,
19,
13,
9,
2328,
800,
3726,
3726,
25,
80,
186,
1935,
161,
20,
625,
721,
8438,
1665,
2952,
3502,
19,
13,
9,
2328,
60,
11374,
95,
57,
21,
319,
17,
359,
1961,
17,
376,
20,
442,
21,
5385,
16,
395,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
enabling/disabling asp.net web service extension via script
===
In IIS 6, I can use the Web Service Extensions folder in Inetmgr to allow/prohibit isapi filters, such as ASP.net. I want to be able to do this programmatically (in particular, from an installer script/exe).
Any ideas? | 0 | [
2,
13168,
118,
2906,
58,
8599,
28,
306,
9,
2328,
2741,
365,
3896,
1197,
3884,
800,
3726,
3726,
19,
595,
18,
400,
15,
31,
92,
275,
14,
2741,
365,
17529,
19294,
19,
19,
1198,
79,
8807,
20,
1655,
118,
2740,
8630,
242,
25,
2552,
49,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How can addChild choose the wrong insertion index?
===
So, In a Flex app I add a new GUI component by creating it and calling `parent.addChild()`. However in some cases, this causes an error in the bowels of Flex. Turns out, addChild actually does:
return addChildAt(child, numChildren);
In the cases where it breaks, somehow the numChildren is off by one. Leading to this error:
> RangeError: Error #2006: The supplied
> index is out of bounds. at
> flash.display::DisplayObjectContainer/addChildAt()
> at
> mx.core::Container/addChildAt()[E:\dev\3.1.0\frameworks\projects\framework\src\mx\core\Container.as:2206]
> at
> mx.core::Container/addChild()[E:\dev\3.1.0\frameworks\projects\framework\src\mx\core\Container.as:2140]
> . . at
> flash.events::EventDispatcher/dispatchEventFunction()
> at
> flash.events::EventDispatcher/dispatchEvent()
> at
> mx.core::UIComponent/dispatchEvent()[E:\dev\3.1.0\frameworks\projects\framework\src\mx\core\UIComponent.as:9156]
> at
> mx.controls::SWFLoader/http://www.adobe.com/2006/flex/mx/internal::contentLoaderInfo_completeEventHandler()[E:\dev\3.1.0\frameworks\projects\framework\src\mx\controls\SWFLoader.as:1671]
Is this a bug in Flex or in how I am using it? It kind of looks like it could be a threading bug, but since Flex doesn't support threads that is a bit confusing.
Any thoughts? | 0 | [
2,
184,
92,
3547,
11287,
3538,
14,
1389,
24245,
4348,
60,
800,
3726,
3726,
86,
15,
19,
21,
14409,
4865,
31,
3547,
21,
78,
9457,
5912,
34,
2936,
32,
17,
2555,
13,
1,
18908,
9,
14854,
11287,
5,
6,
1,
9,
207,
19,
109,
1871,
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... |
What framework would you recommend for making desktop-like apps for the web?
===
Several frameworks for writing web-based desktop-like applications have recently appeared. E.g. [SproutCore][1] and [Cappuccino][2]. Do you have any experience using them? What's your impression? Did I miss some other framework?
I've seen [related][3] [questions][4] on StackOverflow, but they generate mostly standard answers like "use jQuery or MochiKit or MooTools or Dojo or YUI". While some people give [non-standard][5] [answers][6], they seem to have little experience *using* this frameworks.
Can anyone share real experience developing destop-like apps for the browser?
[1]: http://www.sproutcore.com/
[2]: http://cappuccino.org/
[3]: http://stackoverflow.com/questions/68114/what-is-the-single-most-useful-general-purpose-javascript-library-for-rich-inte
[4]: http://stackoverflow.com/questions/913/what-javascript-library-would-you-choose-for-a-new-project-and-why
[5]: http://stackoverflow.com/questions/68114/what-is-the-single-most-useful-general-purpose-javascript-library-for-rich-inte#68564
[6]: http://stackoverflow.com/questions/913/what-javascript-library-would-you-choose-for-a-new-project-and-why#74111 | 0 | [
2,
98,
6596,
83,
42,
12360,
26,
544,
17404,
8,
1403,
4865,
18,
26,
14,
2741,
60,
800,
3726,
3726,
238,
6596,
18,
26,
1174,
2741,
8,
1281,
17404,
8,
1403,
3767,
57,
1989,
682,
9,
13,
62,
9,
263,
9,
636,
18,
2740,
1982,
10375,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
SQL Server - Triggers vs Constaints
===
I'm trying to find out whether I should be using business critical logic in a trigger or constraint.
So far I've added logic in triggers as it gives me the control over what happens next and means I can provide custom user messages instead of a sql server error that will probably confuse the users.
Is there any noticable performance gain in using constraints over triggers and what are the best practices for determining which to use. | 0 | [
2,
4444,
255,
8128,
13,
8,
7286,
18,
4611,
11608,
5851,
38,
18,
800,
3726,
3726,
31,
22,
79,
749,
20,
477,
70,
1472,
31,
378,
44,
568,
508,
2507,
7085,
19,
21,
7286,
54,
28804,
9,
86,
463,
31,
22,
195,
905,
7085,
19,
7286,
1... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How do I peek at the first two bytes in an InputStream?
===
Should be pretty simple: I have an InputStream where I want to peek at (not read) the first two bytes, i.e. I want the "current position" of the InputStream to stil be at 0 after my peeking. What is the best and safest way to do this? | 0 | [
2,
184,
107,
31,
14918,
35,
14,
64,
81,
34,
3231,
19,
40,
6367,
11260,
60,
800,
3726,
3726,
378,
44,
1772,
1935,
45,
31,
57,
40,
6367,
11260,
113,
31,
259,
20,
14918,
35,
13,
5,
1270,
1302,
6,
14,
64,
81,
34,
3231,
15,
31,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Oracle sql query, concatenate fileds with CASE section
===
I'm currently generating SQL insert statements from more than one tables, and in the generated data I need to use a CASE statement, like this:
select 'INSERT INTO TABLE1 (f1, f2, f3, f4 ...) values ('
||t.f1||','
||CASE
WHEN t.f2 > 0 THEN '1'
ELSE '0'
END CASE
from table2 t , table3 t3
But at this point if I want to continue my statement with `... END CASE||','|| ....` I can't run the query anymore, as TOAD complains about not finding the FROM keyword.
A quick solution was to separate the ouput into fields, then save it to text, and edit, but there must be a better way....
Thanks in advance! | 0 | [
2,
15759,
4444,
255,
25597,
15,
1065,
9530,
8820,
5263,
18,
29,
610,
1050,
800,
3726,
3726,
31,
22,
79,
871,
13500,
4444,
255,
14692,
9015,
37,
91,
119,
53,
7484,
15,
17,
19,
14,
6756,
1054,
31,
376,
20,
275,
21,
610,
3331,
15,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Is there anyway to tell Visual Studio not to open all the documents when I load solution?
===
When you open a solution in Visual Studio 2008 (or ealier versions for that matter), it opens all the documents that you did not close before you closed Visual Studio. Is there anyway to turn this functionality off, or a plugin that fixes this behavior? It takes forever to load a solution with 50 files open?
Thanks in advance | 0 | [
2,
25,
80,
2774,
20,
494,
3458,
1120,
52,
20,
368,
65,
14,
4374,
76,
31,
6305,
4295,
60,
800,
3726,
3726,
76,
42,
368,
21,
4295,
19,
3458,
1120,
570,
13,
5,
248,
13507,
10491,
3281,
26,
30,
1161,
6,
15,
32,
8965,
65,
14,
437... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Sharepoint Workflow Modification is not disabled
===
I am working on a Sharepoint Server 2007 State machine Workflow. Until now I have a few states and a custom Association/InitiationForm which I created with InfoPath 2007. In Addition I have a few modification forms. I have a Problem with the removing of the modification link in the state-page of my workflow.
I have a state and in the initialize block of this state my EnableWorkflowModification Activity appears. So at the beginning of the state the modification is active. In the same state I have an OnWorkflowModification activity, which catches the event raised by the EnableWorkflowModification activity. After this state my modification is over and the link should disappear in the state-page. But this is not the case.
Both activities have the same correlation token (modification) and the same owner (the owning state).
Has anybody an idea why the link is not removed and how to remove the modification link?
Thank you in advance, Stefan!
| 0 | [
2,
1891,
3132,
170,
9990,
16135,
25,
52,
10154,
800,
3726,
3726,
31,
589,
638,
27,
21,
1891,
3132,
8128,
624,
146,
1940,
170,
9990,
9,
163,
130,
31,
57,
21,
310,
202,
17,
21,
5816,
607,
118,
108,
8793,
857,
4190,
56,
31,
679,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
When deleting hasOne or hasMany associations, should the foreignKey be set to NULL?
===
Given :
> Group hasMany Persons
but the relationship is independent (ie. Persons can exist without belonging to a Group), should the foreign key in the persons table (ie group_id) be set to 0 (or NULL) when deleting a group? If you do not, the person will try to belong to a group that does't exist.
The reason I ask is that this is default behavior in Cakephp. If you set dependent to true, it will delete the associated models, but if it's set to false it will leave the associated model untouched. | 0 | [
2,
76,
121,
1336,
68,
63,
849,
54,
63,
14842,
10642,
15,
378,
14,
1228,
4237,
44,
309,
20,
16203,
60,
800,
3726,
3726,
504,
13,
45,
13,
1,
214,
63,
14842,
4280,
47,
14,
1429,
25,
1124,
13,
5,
660,
9,
4280,
92,
3182,
366,
597... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Strange MFC / VC++ Linker Error (std::list<CRect> already defined)
===
I've got a really odd error message that only occurs when I add the following line to my project:
std::list<CRect> myVar;
It's worth noting that it doesn't have to be a std::list, it can be std::vector or any other STL container I assume.
Here is the error message:
> Error 1 error LNK2005: "public:
> __thiscall std::list<class CRect,class std::allocator<class CRect>
> >::list<class CRect,class std::allocator<class CRect> >(void)"
> (??0?$list@VCRect@@V?$allocator@VCRect@@@std@@@std@@QAE@XZ)
> already defined in
> SomeLowLevelLibrary.lib
The low level library that's referenced in the error message has no idea about the project I am building, it only has core low level functionality and doesn't deal with high level MFC GUIs.
I can get the linker error to go away if I change the line of code to:
std::list<CRect*> myVar;
But I don't want to hack it for the sake of it.
Also, it doesn't matter if I create the variable on the stack or the heap, I still get the same error.
Does anyone have any ideas whatsoever about this?
I'm using Microsoft Visual Studio 2008 SP1 on Vista Enterprise.
**Edit:** The linker error above is for the std::list<> constructor, I also get an error for the destructor, _Nextnode and clear functions. | 0 | [
2,
2578,
307,
7061,
13,
118,
13,
8990,
20512,
3508,
106,
7019,
13,
5,
384,
43,
45,
45,
5739,
1,
6037,
4812,
1,
614,
2811,
6,
800,
3726,
3726,
31,
22,
195,
330,
21,
510,
4210,
7019,
2802,
30,
104,
3690,
76,
31,
3547,
14,
249,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
SQL2005 Express slow from remote VB6 application
===
I have a legacy VB6 application that was built using MSDE.
As many client's database grow towards the MSDE 2 GB limit they are upgraded to SQL 2005 Express.
This has proven very successful until today.
I have spent the entire day troubleshooting a client's network on which our application runs unacceptably slowly, when connecting the a SQL 2005 Express named instance across the "network".
I say "network" because it is only two XP SP2 machines - there is no dedicated server here. No AD.
In trying to isolate this problem I have installed SQL 2005 Express on both machines and placed copies of our database on both machines. I have even completely reinstalled our application using the SQL2005 Express install routine we now have. It makes no difference whether I restore an old MSDE database or use a newly created SQL 2005 Express one.
When running our application and connecting to the local server performance is fine. Once you connect our application to the instance on the other PC, it is unworkably slow.
Now, I have rebuilt statistics (exec sp_updatestats), rebuilt ALL indexes, disabled (temporarily) firewalls and virus software and clutched and countless other straws.
I have resorted to running FileMon and ProcessMon on both machines and have even written a little test application to simply connect and query a table in the database. It too runs slowly - (takes about 5 - 6 seconds to connect).
The monitors (File and Process) show delays when SQL Server is writing to a log file (c:\program files\microsoft sql server\mssql.1\log files\log_12.trc).
Other tools though, like SQL Management Studio Express and even SSEUtil (a SQL Server Express Diagnostic Utility I found) run perfectly when connecting from the client to the server. Queries (even large ones) run as you would expect.
I feel sure this problem is environmental as we have so many sites running what would appear to be the same setup, with no such problems.
Can someone tell me what I should be doing to isolate this problem or even offer any clues or suggestions that could help solve this? | 0 | [
2,
4444,
255,
2835,
2999,
2276,
37,
5388,
13,
20468,
379,
3010,
800,
3726,
3726,
31,
57,
21,
7780,
13,
20468,
379,
3010,
30,
23,
392,
568,
4235,
546,
9,
28,
151,
6819,
22,
18,
6018,
3213,
1016,
14,
4235,
546,
172,
14857,
4496,
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... |
Integrating jQuery into an existing ASP.NET Web Application?
===
Microsoft [recently announced][1] that the Javascript/HTML DOM library **jQuery will be integrated** into the ASP.NET MVC framework and into ASP.NET / Visual Studio.
What is the best practice or strategy adopting jQuery using **ASP.NET 2.0**? I'd like to prepare a large, existing ASP.NET Web Application (**not** MVC) for jQuery. How would I deal with versioning and related issues?
Are the any caveats integrating jQuery and **ASP.NET Ajax**? Or **3rd party components** like Telerik or Intersoft controls?
[1]: http://weblogs.asp.net/scottgu/archive/2008/09/28/jquery-and-microsoft.aspx | 0 | [
2,
24529,
487,
8190,
93,
77,
40,
3149,
28,
306,
9,
2328,
2741,
3010,
60,
800,
3726,
3726,
7099,
636,
99,
5089,
102,
703,
500,
2558,
165,
500,
30,
14,
8247,
8741,
118,
15895,
11859,
1248,
13,
1409,
728,
8190,
93,
129,
44,
5547,
1... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Java: print_r?
===
last time I asked how to populate a data structure <a href="http://stackoverflow.com/questions/144474/java-arrays-vectors">here</a>. Now I would like to know if there's something in Java, like the <a href="http://www.php.net/print_r">print_r</a> I use in PHP, to represent what I have populated in the Maps and lists without having to do my own algorithm.
Any ideas? | 0 | [
2,
8247,
45,
4793,
1,
139,
60,
800,
3726,
3726,
236,
85,
31,
411,
184,
20,
1675,
12383,
21,
1054,
1411,
13,
1,
58,
746,
14057,
3726,
7,
21127,
6903,
25325,
2549,
9990,
9,
960,
118,
24652,
18,
118,
13365,
2918,
12918,
1004,
1385,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
coordination between Design and Development
===
Background:
I am developing a site in Asp.net 2.0 . Up until now i was handling both the design and development of the site. I used css for the design part.
Now the company wants to outsource the design work to a web designer.
Question:
How exactly are a designer and developer supposed to coordinate
What specifications should i give to the web designer, Do i need to provide him with the aspx pages i have developed, does he also need to look at the code behind.
And how do i incorporate the designed pages in the existing aspx pages.
I would appreciate if someone who is experienced in this provides some insight
thanks. | 0 | [
2,
13209,
128,
704,
17,
522,
800,
3726,
3726,
2395,
45,
31,
589,
3561,
21,
689,
19,
28,
306,
9,
2328,
172,
9,
387,
13,
9,
71,
163,
130,
31,
23,
7988,
156,
14,
704,
17,
522,
16,
14,
689,
9,
31,
147,
272,
18,
18,
26,
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... |
Run macro in visual studio when solution is closed
===
Is it possible to run a macro in Visual Studio 2008 the moment a solution is closed? I would like to delete the .suo-files of that solution, so that the current user settings are not presented to me the next time I open the solution. | 0 | [
2,
485,
9069,
19,
3458,
1120,
76,
4295,
25,
827,
800,
3726,
3726,
25,
32,
938,
20,
485,
21,
9069,
19,
3458,
1120,
570,
14,
688,
21,
4295,
25,
827,
60,
31,
83,
101,
20,
27448,
14,
13,
9,
18,
13324,
8,
16877,
18,
16,
30,
4295,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 extract four unsigned short ints from one long long int?
===
Suppose I have one long long int and want to take its bits and construct three unsigned short ints out of it.
Crude example:
<pre>
0101 0101 0101 0101 <- suppose this is my long long
^ ^ ^ ^
| | | ` this would be first short int
| | |
| | ` this would be second one
| |
| ` this would be third one
|
` and this would be fourth one
</pre>
Particular order doesn't matter much here.
I generally know that I need to shift bits and truncate to the size of unsigned short int. But I think I may make some weird mistake somewhere, so I ask. | 0 | [
2,
184,
20,
10962,
222,
28839,
502,
19,
38,
18,
37,
53,
175,
175,
19,
38,
60,
800,
3726,
3726,
5787,
31,
57,
53,
175,
175,
19,
38,
17,
259,
20,
247,
82,
10181,
17,
6960,
132,
28839,
502,
19,
38,
18,
70,
16,
32,
9,
13725,
8... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Best way to learn how to use FPGAs
===
In next weeks probably I will have some little FPGA to play with. I have a programmer background (C, C++, Java mostly) and some (very) limited experience in electronics.
What are the best tools to know if you want to develop on FPGAs?
What are the best languages to study? (what HW description languages?)
Have you some examples of little "toy projects" that can be interesting, easy, and "eye-opener"?
Thanks in advance. | 4 | [
2,
246,
161,
20,
2484,
184,
20,
275,
13,
12087,
6927,
800,
3726,
3726,
19,
328,
1342,
910,
31,
129,
57,
109,
265,
13,
12087,
1136,
20,
418,
29,
9,
31,
57,
21,
17968,
2395,
13,
5,
150,
15,
272,
20512,
15,
8247,
1555,
6,
17,
1... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Is there any way to check which kind of RAM my computer uses without opening it up?
===
I would like to check which type of RAM my computer uses before I order an upgrade. I'm fairly sure its DDR2 but I would like to double check this.
Is there any way to check this in Windows XP without opening the case up and looking?
Thanks in advance. | 0 | [
2,
25,
80,
186,
161,
20,
2631,
56,
825,
16,
2843,
51,
1428,
2027,
366,
1214,
32,
71,
60,
800,
3726,
3726,
31,
83,
101,
20,
2631,
56,
1001,
16,
2843,
51,
1428,
2027,
115,
31,
389,
40,
9483,
9,
31,
22,
79,
6647,
562,
82,
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 centering tricks
===
My favorite equation for centering an xhtml element using only CSS is as follows:
display:block;
position:absolute;
width: _insert width here_;
left:50%;
margin-left: _insert width divided by two & multiplied by one here_
There's also the simpler margin:auto method in browsers that support it. Does anyone else have tricky ways to force content to display centered in its container? (bonus points for vertical centering) | 4 | [
2,
272,
18,
18,
459,
68,
13747,
800,
3726,
3726,
51,
3839,
8020,
26,
459,
68,
40,
993,
15895,
4520,
568,
104,
272,
18,
18,
25,
28,
2415,
45,
3042,
45,
12048,
73,
649,
45,
2297,
656,
14047,
73,
9456,
45,
13,
1,
108,
18,
6767,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 draw transparent DirectX content in a transparent window?
===
I want to draw DirectX content so that it appears to be floating over top of the desktop and any other applications that are running. I also need to be able to make the directx content semi-transparent, so other things show through. Is there a way of doing this?
I am using Managed DX with C#. | 0 | [
2,
184,
107,
31,
2003,
14862,
1744,
396,
2331,
19,
21,
14862,
1463,
60,
800,
3726,
3726,
31,
259,
20,
2003,
1744,
396,
2331,
86,
30,
32,
1780,
20,
44,
8319,
84,
371,
16,
14,
17404,
17,
186,
89,
3767,
30,
50,
946,
9,
31,
67,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
C# Word spell check runs slow on Word 2007/Vista
===
I have written a DLL that uses MS Word to spell check the content of a RichtextBox. The project uses *Microsoft Word 11.0 Object Library*. I have read that you can use that reference on machines using that version of Word or later, and that seem to be true.
However ... When I run the dll in a test app on a machine with Windows Vista and Word 2007 then it runs very slow. Does the Word Object Library for the 2007 version differ in any way that makes it really slow during automation? Or is it some kind of re-interpetation at runtime that makes it behave like this?
Should I make different version of the dll, One for machines with Word 2003 and one for machines with Word 2007? That would really make the whole point of making a spell checking dll for use in many different project kind of pointless. | 0 | [
2,
272,
5910,
833,
4762,
2631,
1461,
2276,
27,
833,
624,
118,
22034,
800,
3726,
3726,
31,
57,
642,
21,
13,
43,
211,
30,
2027,
4235,
833,
20,
4762,
2631,
14,
2331,
16,
21,
2042,
11969,
5309,
9,
14,
669,
2027,
1637,
22019,
12980,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Eclipse C++ pretty printing?
===
The output we get when printing C++ sources from Eclipse is rather ugly.
Is there are way/a plugin to pretty print C++ source code like e.g. with a2ps?
| 0 | [
2,
11652,
272,
20512,
1772,
7312,
60,
800,
3726,
3726,
14,
5196,
95,
164,
76,
7312,
272,
20512,
2662,
37,
11652,
25,
864,
9212,
9,
25,
80,
50,
161,
118,
58,
10922,
108,
20,
1772,
4793,
272,
20512,
1267,
1797,
101,
13,
62,
9,
263... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
How to print values at points with Google Chart API?
===
I have gone through their developer guide but haven't been able to find a way to print the value at points (in case of line charts) or after bars (bar charts).Is there a way to do it? | 0 | [
2,
184,
20,
4793,
4070,
35,
819,
29,
8144,
1795,
21,
2159,
60,
800,
3726,
3726,
31,
57,
1042,
120,
66,
10058,
3378,
47,
2933,
22,
38,
74,
777,
20,
477,
21,
161,
20,
4793,
14,
1923,
35,
819,
13,
5,
108,
610,
16,
293,
5158,
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... |
How to check for equals? (0 == i) or (i == 0)
===
Okay, we know that the following two lines are equivalent -
1. (0 == i)
2. (i == 0)
Also, the first method was encouraged in the past because that would have allowed the compiler to give an error message if you accidentally used '=' instead of '=='.
My question is - in today's generation of pretty slick IDE's and intelligent compilers, do you still recommend the first method?
In particular, this question popped into my mind when I saw the following code -
if(DialogResult.OK == MessageBox.Show("Message")) ...
In my opinion, I would never recommend the above. I would rather ask the programmer to grow up. Any second opinions? | 4 | [
2,
184,
20,
2631,
26,
2747,
18,
60,
13,
5,
387,
800,
3726,
31,
6,
54,
13,
5,
49,
800,
3726,
713,
6,
800,
3726,
3726,
1705,
15,
95,
143,
30,
14,
249,
81,
1560,
50,
4602,
13,
8,
137,
9,
13,
5,
387,
800,
3726,
31,
6,
172,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 Manage Configuration in a SaaS application
===
I'm working on a SaaS application where each customer will have different configurations depending on the edition they have purchased, additional features they have purchased, etc. For example, a customer might have a limit of 3 custom reports.
Obviously I want to store this configuration in the database, but I am unsure of the best approach. We want to be able to add additional features in the future without requiring a change to the database schema, so a single table with a column per configuration option isn't sensible.
Possible options are a table with one entry per customer, with an XML field containing the entire configuration for that customer, but that adds complexity when the XML schema changes to add additional features.
We could use a table with key value pairs, and store all configuration settings as strings and then parse to the correct data type, but that seems a bit of a cludge, as does having a seperate table for string config options, integer config options, etc.
Is there a good pattern for this type of scenario which people are using? | 0 | [
2,
246,
161,
20,
4705,
8091,
19,
21,
18194,
18,
3010,
800,
3726,
3726,
31,
22,
79,
638,
27,
21,
18194,
18,
3010,
113,
206,
7705,
129,
57,
421,
8091,
18,
4758,
27,
14,
1322,
59,
57,
2432,
15,
1351,
967,
59,
57,
2432,
15,
2722,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 upload files from ASP.NET to another web application
===
I have a scenario where I need to upload a file from one web application and use it in another one. My setup is the following.
* One server, hosting two web applications in IIS - both are ASP.NET
* One of the applications is used to administer the other one + a bunch more stuff
* I need to upload a file from this admin app, save the path in DB through the DAL and then access the file from the other web app, which would provide the file for download
* I keep files on disk, only the path in DB
So where and how can I upload the file so that it can be accessed from both web applications? Should I use a service or is there some other way?
Here are some related questions I found, but I don't think they cover my particular scenario:
<http://stackoverflow.com/questions/63146/how-to-handle-file-uploads-to-a-dedicated-image-server>
<http://stackoverflow.com/questions/51256/how-to-upload-a-file-to-a-wcf-service> | 0 | [
2,
184,
20,
71,
8294,
6488,
37,
28,
306,
9,
2328,
20,
226,
2741,
3010,
800,
3726,
3726,
31,
57,
21,
12705,
113,
31,
376,
20,
71,
8294,
21,
3893,
37,
53,
2741,
3010,
17,
275,
32,
19,
226,
53,
9,
51,
18161,
25,
14,
249,
9,
1... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
how to register url handler for apache commons httpclient
===
I want to be able to access custom URLs with apache httpclient. Something like this:
HttpClient client = new HttpClient();
HttpMethod method = new GetMethod("media:///squishy.jpg");
int statusCode = client.executeMethod(method);
Can I somehow register a custom URL handler? Or should I just register one with Java, using
URL.setURLStreamHandlerFactory(...)
Regards. | 0 | [
2,
184,
20,
2243,
287,
6362,
24641,
26,
17140,
8322,
7775,
150,
18513,
38,
800,
3726,
3726,
31,
259,
20,
44,
777,
20,
1381,
5816,
13,
911,
7532,
29,
17140,
7775,
150,
18513,
38,
9,
301,
101,
48,
45,
7775,
150,
18513,
38,
6819,
8... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Is it possible to create and then upload a file to a web server from silverlight?
===
I have just started using silverlight 2 beta and cannot find how to or if it is possible to render a canvas to an bitmap image and then upload it to my web server?
Is this possible and if so how would I complete this task? | 0 | [
2,
25,
32,
938,
20,
1600,
17,
94,
71,
8294,
21,
3893,
20,
21,
2741,
8128,
37,
1172,
3130,
60,
800,
3726,
3726,
31,
57,
114,
373,
568,
1172,
3130,
172,
8434,
17,
1967,
477,
184,
20,
54,
100,
32,
25,
938,
20,
16535,
21,
9696,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Where do you check to if a hotfix from Microsoft have been applied to any service packs?
===
I have a interest in a [reported bug][1] which Microsoft have made available a hotfix for. When looking on the site, I'm not able to figure out if this fix is included in a service pack or not. Do anyone know where I can find this out?
[1]: http://support.microsoft.com/kb/941132/en-us | 0 | [
2,
113,
107,
42,
2631,
20,
100,
21,
1047,
18594,
37,
7099,
57,
74,
2435,
20,
186,
365,
18936,
60,
800,
3726,
3726,
31,
57,
21,
1163,
19,
21,
636,
17437,
69,
6256,
500,
2558,
165,
500,
56,
7099,
57,
117,
904,
21,
1047,
18594,
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... |
How can I give keyboard focus to a DIV and attach keyboard event handlers to it?
===
I am building an application where I want to be able to click a rectangle represented by a DIV, and then use the keyboard to move that DIV
Rather than using an event listener for keyboard events at the document level, can I listen for keyboard events at the DIV level, perhaps by giving it keyboard focus?
Here's a simplified sample to illustrate the problem:
<html>
<head>
</head>
<body>
<div id="outer" style="background-color:#eeeeee;padding:10px">
outer
<div id="inner" style="background-color:#bbbbbb;width:50%;margin:10px;padding:10px;">
want to be able to focus this element and pick up keypresses
</div>
</div>
<script language="Javascript">
function onClick()
{
document.getElementById('inner').innerHTML="clicked";
document.getElementById('inner').focus();
}
//this handler is never called
function onKeypressDiv()
{
document.getElementById('inner').innerHTML="keypress on div";
}
function onKeypressDoc()
{
document.getElementById('inner').innerHTML="keypress on doc";
}
//install event handlers
document.getElementById('inner').addEventListener("click", onClick, false);
document.getElementById('inner').addEventListener("keypress", onKeypressDiv, false);
document.addEventListener("keypress", onKeypressDoc, false);
</script>
</body>
</html>
On clicking the inner DIV I try to give it focus, but subsequent keyboard events are always picked up at the document level, not my DIV level event listener.
Do I simply need to implement an application-specific notion of keyboard focus?
I should add I only need this to work in Firefox. | 0 | [
2,
184,
92,
31,
590,
8896,
1776,
20,
21,
13,
12916,
17,
19514,
8896,
807,
24641,
18,
20,
32,
60,
800,
3726,
3726,
31,
589,
353,
40,
3010,
113,
31,
259,
20,
44,
777,
20,
10840,
21,
27181,
1622,
34,
21,
13,
12916,
15,
17,
94,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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++ Restrict Template Function
===
I wrote a sample program at http://codepad.org/ko8vVCDF that use a template function how do I retrict the template function to only use numbers? int, double etc. | 0 | [
2,
272,
20512,
15436,
22894,
1990,
800,
3726,
3726,
31,
738,
21,
5717,
625,
35,
7775,
6903,
9375,
8240,
9,
5583,
118,
921,
457,
20492,
150,
8736,
30,
275,
21,
22894,
1990,
184,
107,
31,
302,
8731,
38,
14,
22894,
1990,
20,
104,
275... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
Nifty live web tracking
===
I'm looking for a real time web log watcher that can visually display visitors as they browse around different pages etc. I'd like it to be a web application, it's going to be shown on a big screen in the office. Any tips? | 0 | [
2,
1781,
3072,
93,
515,
2741,
10353,
800,
3726,
3726,
31,
22,
79,
699,
26,
21,
683,
85,
2741,
6738,
1455,
106,
30,
92,
20747,
3042,
4531,
28,
59,
10175,
62,
140,
421,
4434,
2722,
9,
31,
22,
43,
101,
32,
20,
44,
21,
2741,
3010,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How do I inspect the Asp.Net request pipeline?
===
When I measure request times on "the inside" of an Asp.Net application and compare it to timings on "the outside" of the app, I get different values -- 1000-5000ms strange overheads from time to time.
Maybe the requests are beeing queued up in front of IIS?
Or something strange is going on in an HttpModule?
The question: Is there a way to inspect the request pipeline for tracing exactly where the time is spent before the app is hit?
| 0 | [
2,
184,
107,
31,
19,
7350,
14,
28,
306,
9,
2328,
3772,
12250,
60,
800,
3726,
3726,
76,
31,
4058,
3772,
436,
27,
13,
7,
124,
572,
7,
16,
40,
28,
306,
9,
2328,
3010,
17,
11590,
32,
20,
11812,
18,
27,
13,
7,
124,
719,
7,
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... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.