unified_texts stringlengths 32 30.1k | OpenStatus_id int64 0 4 | input_ids list | token_type_ids list | attention_mask list |
|---|---|---|---|---|
How to encourage user to fill in long application forms?
===
E.g. what i can think of is prepopulating certain form input base on user geographical information.
What are other ways you all can think of to speed up user input to complete long application form or at least keep them focus on completing the application form? | 0 | [
2,
184,
20,
8333,
4155,
20,
3509,
19,
175,
3010,
1997,
60,
800,
3726,
3726,
13,
62,
9,
263,
9,
98,
31,
92,
277,
16,
25,
782,
6057,
10038,
1200,
505,
6367,
1000,
27,
4155,
10490,
676,
9,
98,
50,
89,
2847,
42,
65,
92,
277,
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... |
How to use reflection to call generic Method?
===
What's the best way to call a generic method when the type parameter isn't known at compile time, but instead is obtained dynamically at runtime?
Consider the following sample code - inside the Example() method, what's the most concise way to invoke GenericMethod<T>() using the type stored in the myType variable?
public class Sample
{
public void Example(string typeName)
{
Type myType = FindType(typeName);
// what goes here to call GenericMethod<T>() ?
GenericMethod<myType>(); // This doesn't work
// what changes to call StaticMethod<T>() ?
Sample.StaticMethod<myType>(); // This also doesn't work
}
public void GenericMethod<T>()
{
...
}
public static void StaticMethod<T>()
{
...
}
}
| 0 | [
2,
184,
20,
275,
9138,
20,
645,
12733,
2109,
60,
800,
3726,
3726,
98,
22,
18,
14,
246,
161,
20,
645,
21,
12733,
2109,
76,
14,
1001,
18906,
2532,
22,
38,
167,
35,
26561,
85,
15,
47,
700,
25,
3048,
7782,
1326,
35,
485,
891,
60,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
What's the best way to extract a one-dimensional array from a two-dimensional array in C#?
===
Say I have a two-dimensional string array (stringarray[rows, columns]). What's the best way to extract a one-dimensional array from this (either a single row or a single column)? I can do this with a for loop, of course, but I'm hoping .NET has a more elegant way built in.
Bonus points for converting the extracted string array to an object array. | 0 | [
2,
98,
22,
18,
14,
246,
161,
20,
10962,
21,
53,
8,
7865,
7718,
37,
21,
81,
8,
7865,
7718,
19,
272,
5910,
60,
800,
3726,
3726,
395,
31,
57,
21,
81,
8,
7865,
3724,
7718,
13,
5,
11130,
8576,
93,
2558,
5417,
18,
15,
7498,
500,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Sugestions on how to make a configurable parser.
===
I want to build a parser for a C like language. The interesting aspect about it is that I want to build it in such a way that someone who has access to the source can easily modified it to extend the language (a new expression type of instance) with the extensions being runtime configurable (they can be turned on and off).
My current intent is to build a recursive decent parser as an object. Each production will be a method of an object. The method of extension will be to derive classes from this base replacing methods (and production definitions) as needed. I'm still trying to figure out how to mix and match extensions. One idea is to play games with the v-tbl. Objects would be constructed with a v-tbl that is a copy of the base but with methods replaced from derived classes.
Aside from the bit-twiddling nature of the solution the only issues I have with it is
- a reasonable way to do the v-tbl mixup
- what to do when 2 extensions alter the same productions (as most replacements will end up calling the original having one replacement call the other would work but the mechanics of setting this up are the issue)
- how to allow the extension of extensions (this might end up looking like a standard MI system, but I've never got how they work)
Another solution (a slightly more mundane version of the same same approach) would be to use static member variables to store function-pointers and call them for the same effect.
| 0 | [
2,
2538,
14288,
5757,
27,
184,
20,
233,
21,
1065,
13549,
579,
2017,
4104,
9,
800,
3726,
3726,
31,
259,
20,
1895,
21,
2017,
4104,
26,
21,
272,
101,
816,
9,
14,
4883,
7289,
88,
32,
25,
30,
31,
259,
20,
1895,
32,
19,
145,
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... |
Why IEnumerable of T inherts from IDisposable, but non-generic IEnumerable does NOT?
===
I noticed that generic IEnumerable(of T) inherits from IDisposable, but the non-generic interface IEnumerable does NOT. Why it is designed in this way?
Usually, we use foreach statement to go through a IEnumerable(of T) instance. The generated code of foreach actually has try-finally block that invokes Dispose() in finally. | 0 | [
2,
483,
13,
660,
6336,
106,
579,
16,
13,
38,
19,
1694,
38,
18,
37,
13,
19405,
12551,
579,
15,
47,
538,
8,
17083,
596,
13,
660,
6336,
106,
579,
630,
52,
60,
800,
3726,
3726,
31,
2711,
30,
12733,
13,
660,
6336,
106,
579,
5,
10... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Winforms user control getting clipped when in another user control (sometimes)
===
The problem is fairly simple, but is best illustrated visually. Note that all screen shots are from the Visual Studio 2005 design surface. I've noticed no difference when I actually run the application.
Here is my user control (let's call this UC-1):
![alt text][1]
The buttons on the control are set to anchor to Bottom + Right.
Here is what it looks like when placed onto a particular parent user control (UC-A):
![alt text][2]
Please disregard the difference in colors and such. Some styling is done in the user control's constructor.
Notice the bottom of the control is getting clipped. The instance of the consumed control on the parent is set with a "FixedSingle" border. Notice also that the consumed control is taller than the original, indicating that the buttons bottom anchor settings are being respected, but are essentially overshooting where it should be.
To confirm this is definitely a problem on the parent control, notice another user control (UC-2) containing a data grid view when placed on the same parent:
![alt text][3]
Again, the instance of the consumed control is set with a "FixedSingle" border which helps illustrate the clipping. The datagrid is properly anchored to the Bottom Right. To reinforce the perplexity of this problem, here's the first user control (UC-1) when placed on a different parent user control (UC-B):
![alt text][4]
Here's the second "consumed" control (UC-2) when consumed by a form:
![alt text][5]
Notice, no clipping this time.
I have spent many hours searching and experimenting to resolve this. I have exhausted the various settings of margins, padding, sizes (min/max), locations, anchors... etc. I can not for the life of me figure out why this one user control is causing child user controls to clip like this.
Another strange thing I noticed was that when I do an UNDO on the parent user control design surface (where the controls are misbehaving), the clipped user control instances actually shift location even though the undo action is unrelated to those controls. For example, if I make the main containing control larger, then undo, a couple of the child user controls jump up. They appear to move about as far as they are being clipped. Very suspicious.
Does anyone have any idea what is going on??
[1]: http://i34.tinypic.com/wciaer.png
[2]: http://i37.tinypic.com/2emnak9.png
[3]: http://i34.tinypic.com/2rgci7o.png
[4]: http://i38.tinypic.com/2rnyjd0.png
[5]: http://i34.tinypic.com/rr8uc9.png | 0 | [
2,
628,
4190,
18,
4155,
569,
1017,
22505,
76,
19,
226,
4155,
569,
13,
5,
9310,
6,
800,
3726,
3726,
14,
1448,
25,
6647,
1935,
15,
47,
25,
246,
6607,
20747,
9,
1945,
30,
65,
2324,
7280,
50,
37,
14,
3458,
1120,
812,
704,
1490,
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... |
Sun App Server Deployment : When choose to precompile JSP : Throw this error com.sun.enterprise.admin.common.exception.MBeanConfigException: Component not registered then have to do asadmin undeploy
===
Sun App Server Deployment : When choose to precompile JSP : Throw this error com.sun.enterprise.admin.common.exception.MBeanConfigException: Component not registered then have to do asadmin undeploy
Anyone know what is the reason for this error? | 0 | [
2,
939,
4865,
8128,
10475,
13,
45,
76,
3538,
20,
782,
11103,
3599,
487,
3401,
13,
45,
3814,
48,
7019,
13,
960,
9,
7843,
9,
13679,
15839,
62,
9,
1283,
2160,
9,
17130,
9,
10066,
872,
9,
10045,
210,
14093,
2816,
10066,
872,
45,
591... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
What are the best Cocoa-Touch/iPhone programming blogs?
===
What are the best Cocoa-Touch/iPhone programming blogs? One blog per answer please. | 4 | [
2,
98,
50,
14,
246,
24507,
8,
15725,
118,
49,
7709,
3143,
8146,
18,
60,
800,
3726,
3726,
98,
50,
14,
246,
24507,
8,
15725,
118,
49,
7709,
3143,
8146,
18,
60,
53,
8146,
416,
1623,
2247,
9,
3,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
.NET library for working with mobile devices eg PDA
===
Does anyone know any good .net libraries for working with PDAs and such?
I mainly looking for something that will allow me to copy files to/from devices and do some registry work on the device. The PDAs are running windows mobile 5 & 6
I have been using the OpenNETCF.Desktop.Communication.RAPI library in a couple of my apps but I was just interested to see what other people are using.
Thanks
| 0 | [
2,
13,
9,
2328,
1248,
26,
638,
29,
3241,
4690,
12369,
351,
593,
800,
3726,
3726,
630,
1276,
143,
186,
254,
13,
9,
2328,
8649,
26,
638,
29,
351,
8016,
17,
145,
60,
31,
2011,
699,
26,
301,
30,
129,
1655,
55,
20,
4344,
6488,
20,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How to check colomn if exist in table in sql server 2000
===
ow to check colomn if exist in table in sql server 2000 | 0 | [
2,
184,
20,
2631,
326,
13517,
103,
100,
3182,
19,
859,
19,
4444,
255,
8128,
824,
800,
3726,
3726,
13,
3581,
20,
2631,
326,
13517,
103,
100,
3182,
19,
859,
19,
4444,
255,
8128,
824,
3,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
How to backup project folders to local desktop if path more than 255 characters?
===
For e.g. if i am storing some files on a network server which is under many hiearchial folders.
Then i want to do backup. But i always encounter issue because the file path is more than 255?
How can i resolve this issue or work around it? | 0 | [
2,
184,
20,
10119,
669,
19294,
18,
20,
375,
17404,
100,
2013,
91,
119,
13,
20038,
1766,
60,
800,
3726,
3726,
26,
13,
62,
9,
263,
9,
100,
31,
589,
25615,
109,
6488,
27,
21,
982,
8128,
56,
25,
131,
151,
4148,
62,
18326,
192,
192... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
JIRA - Revision Fix, Work Start and Resolve Issue
===
Do you all add revision fixed to your custom fields?
And what is the point of have Work Start i thought resolve issue is good enough? | 0 | [
2,
487,
3517,
13,
8,
11323,
6098,
15,
170,
799,
17,
9854,
1513,
800,
3726,
3726,
107,
42,
65,
3547,
11323,
3535,
20,
154,
5816,
2861,
60,
17,
98,
25,
14,
454,
16,
57,
170,
799,
31,
289,
9854,
1513,
25,
254,
511,
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... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
How to encourage developer to write more documentation?
===
I not sure if it is me but seen like developer don't really like to document because they find it easier to explain things briefly instead of documenting it down and from time to time have to update the document.
And another thing is that
consultant come up with use cases for different functionality should they then also write the underlying technical implementation or it should be left entirely up to developer team to decide and work on the technincal implementation?
| 0 | [
2,
184,
20,
8333,
10058,
20,
2757,
91,
13945,
60,
800,
3726,
3726,
31,
52,
562,
100,
32,
25,
55,
47,
541,
101,
10058,
221,
22,
38,
510,
101,
20,
4492,
185,
59,
477,
32,
4950,
20,
3271,
564,
3224,
700,
16,
4492,
68,
32,
125,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 does makecert store the private key if -sv is not specified?
===
Let say I run this command:
makecert testcert.cer
Is a private key created? If so, where is it automatically stored in the system even though I did not tell makecert to install this certificate in any certificate store? | 0 | [
2,
113,
630,
233,
17580,
1718,
14,
932,
1246,
100,
13,
8,
18,
710,
25,
52,
9931,
60,
800,
3726,
3726,
408,
395,
31,
485,
48,
1202,
45,
233,
17580,
1289,
17580,
9,
5482,
25,
21,
932,
1246,
679,
60,
100,
86,
15,
113,
25,
32,
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... |
What is acceptable memory usage for a PHP page?
===
I'm building a webpage that queries a MySQL database and (currently) produces a text-only list of the findings. The queries to complete a single record are similar to:
- movie (title, description, etc)
- actors in the movie (name, gender)
- related movies
Out of curiosity I've used <code>memory_get_peak_usage()</code> and <code>memory_get_usage()</code>:
<pre>
start 110,440 bytes
peak 656,056 bytes
end 637,976 bytes
time 0.008 seconds
</pre>
The above is with no records found!
With 40 records I'm reaching approximately 2MB, though the time remains the same.
I know that premature optimization is evil and all, but I have to ask:
Do I need to do some reworking? Is this memory usage normal? What is considered excessive?
| 0 | [
2,
98,
25,
12513,
1912,
7514,
26,
21,
13,
26120,
2478,
60,
800,
3726,
3726,
31,
22,
79,
353,
21,
2741,
6486,
30,
9386,
2829,
21,
51,
18,
22402,
6018,
17,
13,
5,
24947,
6,
6700,
21,
1854,
8,
4965,
968,
16,
14,
10172,
9,
14,
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... |
Tortoise SVN Icon Overlays Displaying Everywhere...Why?
===
Been using Tortoise SVN for some time on my Vista box. Within the last few days (and after recently upgrading to 1.5.4) the icon overlays are displaying on all files.
My exclude path is:
*
My include paths are:
C:\Users\jw\Documents\Visual Studio 2008\Projects\SVNProjects\*
C:\Users\jw\Documents\VB Projects\SVNProjects\*
I haven't touched those settings in months. Any ideas? Help. Thanks.
| 0 | [
2,
25691,
13,
18,
16578,
9801,
84,
4414,
18,
17418,
6417,
9,
9,
9,
2256,
60,
800,
3726,
3726,
74,
568,
25691,
13,
18,
16578,
26,
109,
85,
27,
51,
13520,
1649,
9,
363,
14,
236,
310,
509,
13,
5,
290,
75,
1989,
26939,
20,
137,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 "The system cannot find the batch label specified" is thrown even if label exists?
===
While running a batch file in Windows XP I have found randomly occuring error message:
The system cannot find the batch label specified name_of_label
Of course label existed. What causes this error? | 0 | [
2,
483,
13,
7,
124,
329,
1967,
477,
14,
13064,
1899,
9931,
7,
25,
6027,
166,
100,
1899,
5636,
60,
800,
3726,
3726,
133,
946,
21,
13064,
3893,
19,
1936,
23045,
31,
57,
216,
21324,
3744,
68,
7019,
2802,
45,
14,
329,
1967,
477,
14,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How to refactor from using window.open(...) to an unobtrusive modal dhtml window?
===
I have a function which launches a javascript window, like this
function genericPop(strLink, strName, iWidth, iHeight) {
var parameterList = "location=0,directories=0,status=0,menubar=0,resizable=no, scrollbars=no,toolbar=0,maximize=0,width=" + iWidth + ", height=" + iHeight;
var new_window="";
new_window = open(strLink, strName, parameterList);
window.self.name = "main";
new_window.moveTo(((screen.availWidth/2)-(iWidth/2)),((screen.availHeight/2)-(iHeight/2)));
new_window.focus();
}
This function is called about 52 times from different places in my web application.
I want to re-factor this code to use a DHTML modal pop-up window. The change should be as unobtrusive as possible.
To keep this solution at par with the old solution, I think would also need to do the following
1. Provide a handle to "Close" the window.
2. Ensure the window cannot be moved, and is positioned at the center of the screen.
3. Blur the background as an option.
I thought [this solution][1] is the closest to what I want, but I could not understand how to incorporate it.
[1]: http://particletree.com/features/lightbox-gone-wild/ | 0 | [
2,
184,
20,
302,
17455,
37,
568,
1463,
9,
10157,
5,
9,
9,
9,
6,
20,
40,
367,
4995,
8989,
18,
1284,
13,
20756,
13,
43,
15895,
1463,
60,
800,
3726,
3726,
31,
57,
21,
1990,
56,
22933,
21,
8247,
8741,
1463,
15,
101,
48,
1990,
12... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Can I get DirectInput / XInput without the whole DirectX SDK?
===
I am developing an in-house app that would use XInput or DirectInput to read from the Xbox 360 controller. (I think it'll be the cheapest/easiest way to get multiple controls in the operator's hands.)
I will need to source-control all source and tools, which means also the SDK's. I'd rather not take all of DirectX -- is DirectInput and XInput separable from the whole DirectX SDK? | 0 | [
2,
92,
31,
164,
1744,
108,
4881,
13,
118,
17466,
4881,
366,
14,
979,
1744,
396,
13,
18,
43,
197,
60,
800,
3726,
3726,
31,
589,
3561,
40,
19,
8,
1682,
4865,
30,
83,
275,
17466,
4881,
54,
1744,
108,
4881,
20,
1302,
37,
14,
13800... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Way to preview (retroview) SQL queries of SQL Server Management Studio Express
===
Could you tell me, please, if it's possible to preview (or at least retroview, for example, in a kind of a log file) SQL commands which SQL Server Management Studio Express is about to execute (or has just executed)?
In the past I used Embarcadero DBArtisan which shows SQL queries to be executed before actually running them on the server, so I am eager for this feature in Management Studio.
I have found an option "Auto generate change scripts", but it shows only DDL SQL queries
(structure change), not data change. | 0 | [
2,
161,
20,
16121,
13,
5,
99,
3996,
4725,
6,
4444,
255,
9386,
2829,
16,
4444,
255,
8128,
1097,
1120,
2999,
800,
3726,
3726,
110,
42,
494,
55,
15,
2247,
15,
100,
32,
22,
18,
938,
20,
16121,
13,
5,
248,
35,
639,
13534,
4725,
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... |
Malloc Error: incorrect checksum for freed object
===
I am working on implementing tail for an assignment. I have it working correctly however I seem to be getting an error from free at random times.
I can't see, to track it down to a pattern or anything besides it is consistent.
For example if I call my program as "tail -25 test.in" I would get the the the incorrect checksum error at the same line on multiple runs. However, with different files and even different numbers of lines to print back I will come back without errors.
Any idea on how to track down the issue, I've been trying to debug it for hours to no avail.
Here is the offending code:
void insert_line(char *s, int len){
printf("\t\tLine Number: %d Putting a %d line into slot: %d\n",processed,len,slot);
if(processed > numlines -1){//clean up
free(*(lines+slot));
*(lines + slot) = NULL;
}
*(lines + slot) = (char *) malloc(len * sizeof(char));
if((lines + slot) == NULL) exit(EXIT_FAILURE);
strcpy(*(lines+slot),s);
slot = ++processed % numlines;
}
| 0 | [
2,
3668,
2499,
7019,
45,
18867,
16602,
723,
26,
9292,
3095,
800,
3726,
3726,
31,
589,
638,
27,
17333,
3424,
26,
40,
8427,
9,
31,
57,
32,
638,
12044,
207,
31,
2260,
20,
44,
1017,
40,
7019,
37,
551,
35,
5477,
436,
9,
31,
92,
22,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
What does it takes to be a better OO programmer?
===
I’ve almost 6 years of experience in application development using .net technologies. Over the years I have improved as a better OO programmer but when I see code written by other guys (especially the likes of Jeffrey Richter, Peter Golde, Ayende Rahien, Jeremy Miller etc), I feel there is a generation gap between mine and their designs. I usually design my classes on the fly with some help from tools like ReSharper for refactoring and code organization.
So, my question is “what does it takes to be a better OO programmer”. Is it
a) Experience
b) Books (reference please)
c) Process (tdd or uml)
d) patterns
e) anything else?
And how should one validate that the design is good, easy to understand and maintainable. As there are so many buzzwords in industry like dependency injection, IoC, MVC, MVP, etc where should one concentrate more in design. I feel abstraction is the key. What else?
| 0 | [
2,
98,
630,
32,
1384,
20,
44,
21,
574,
13,
4328,
17968,
60,
800,
3726,
3726,
31,
1,
195,
557,
400,
122,
16,
1496,
19,
3010,
522,
568,
13,
9,
2328,
5740,
9,
84,
14,
122,
31,
57,
3999,
28,
21,
574,
13,
4328,
17968,
47,
76,
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 would you go about implementing off-side rule?
===
I've already written a generator that does the trick, but I'd like to know the best possible way to implement the off-side rule.
Shortly: [Off-side rule][1] means in this context that indentation is getting recognized as a syntactic element.
[1]: http://en.wikipedia.org/wiki/Off-side_rule
Here is the offside rule in pseudocode for making tokenizers that capture indentation in usable form, I don't want to limit answers by language:
token NEWLINE
matches r"\n\ *"
increase line count
pick up and store the indentation level
remember to also record the current level of parenthesis
procedure layout tokens
level = stack of indentation levels
push 0 to level
last_newline = none
per each token
if it is NEWLINE put it to last_newline and get next token
if last_newline contains something
extract new_level and parenthesis_count from last_newline
- if newline was inside parentheses, do nothing
- if new_level > level.top
push new_level to level
emit last_newline as INDENT token and clear last_newline
- if new_level == level.top
emit last_newline and clear last_newline
- otherwise
while new_level < level.top
pop from level
if new_level > level.top
freak out, indentation is broken.
emit last_newline as DEDENT token and clear last_newline
emit token
while level.top != 0
emit token as DEDENT token
pop from level
comments are ignored before they are getting into the layouter
layouter lies between a lexer and a parser
This layouter doesn't generate more than one NEWLINE at time, and doesn't generate NEWLINE when there's indentation coming up. Therefore parsing rules remain quite simple. It's pretty good I think but inform if there's better way of accomplishing it. | 0 | [
2,
184,
83,
42,
162,
88,
17333,
168,
8,
1416,
1828,
60,
800,
3726,
3726,
31,
22,
195,
614,
642,
21,
15286,
30,
630,
14,
5514,
15,
47,
31,
22,
43,
101,
20,
143,
14,
246,
938,
161,
20,
8713,
14,
168,
8,
1416,
1828,
9,
2100,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 Menu (Can't get the tabs to full height)
===
<style type="text/css">
html, body {
background: #fff;
margin: 0;
padding: 0;
}
#nav {
font-family: Verdana, sans-serif;
height: 29px;
font-size: 12px;
padding: 0 0 0 10px; /* this is used for something else */
background-color: #456;
}
#nav ul, #nav ul li {
list-style: none;
margin: 0;
padding: 9px 0 0 0px;
}
#nav ul {
text-align: center;
}
#nav ul li {
display: inline;
}
#nav ul li.last {
margin-right: 0;
}
#nav ul li a {
color: #FFF;
text-decoration: none;
padding: 0px 0 0 20px;
height: 29px;
}
#nav ul li a span {
padding: 8px 20px 0 0;
height: 21px;
}
#nav ul li a:hover {
background: #789;
}
</style>
<div id="nav">
<ul>
<li><a href="/1/"><span>One</span></a></li>
<li><a href="/2/"><span>Two</span></a></li>
<li><a href="/3/"><span>Three</span></a></li>
<li><a href="/4/"><span>Four</span></a></li>
</ul>
</div>
I have a little problem with that, as it doesn't make the "hover background" 100% of the height of the nav bar. | 0 | [
2,
272,
18,
18,
11379,
13,
5,
1245,
22,
38,
164,
14,
6523,
18,
20,
503,
2947,
6,
800,
3726,
3726,
13,
1,
4381,
1001,
3726,
7,
11969,
118,
6824,
18,
7,
1,
13,
15895,
15,
358,
13,
1,
2395,
45,
6926,
410,
2460,
73,
5440,
45,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Editing escaped code (for display)
===
If I escape some code because I want it to display as the actual code in html (ie for an example code snippet), save it to the database and then pull it back to the editor (an html page), it is displayed as html, as opposed to the escaped text.
My problem arises when I include a textarea tag in the text becasue it will prematurely close the editing area and chop off the rest of what I write when it is saved (or more if I dont close the tag).
So my question is: Is this intended behavior on the part of the browser? -> So I need to escape the text (code and pre tags perhaps)? every time I want to make changes to it? Or am I doing something wrong?
*Note I am the only person using this and it is mostly just for learning, so I am not worried about the security aspect so much as the way in check I need to handle my html when using it in a browser and have it behave in an expected way. | 0 | [
2,
9510,
5409,
1797,
13,
5,
1106,
3042,
6,
800,
3726,
3726,
100,
31,
2220,
109,
1797,
185,
31,
259,
32,
20,
3042,
28,
14,
3463,
1797,
19,
13,
15895,
13,
5,
660,
26,
40,
823,
1797,
13,
29061,
6,
15,
2079,
32,
20,
14,
6018,
17... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Array size from pointer in C?
===
so I've allocated an "array" of mystruct of size n like this:
<code>
if (NULL == (p = calloc(sizeof(struct mystruct) * n,1))) {
/* handle error */
}
</code>
Later on, I only have access to p, and no longer have n. Is there a way to determine the length of the array given just the pointer p?
If figure it must be possble, since free(p) does just that. I know malloc keeps track of how much memory it has allocated, and thats why it knows the length, but maybe there is a way to query for this information?
<code>
int length = askMallocLibraryHowMuchMemoryWasAlloced(p) / sizeof(mystruct)
</code>
I know I should just rework the code so that I know n, but I'd rather not if possible. Any ideas?
| 0 | [
2,
7718,
1072,
37,
454,
106,
19,
272,
60,
800,
3726,
3726,
86,
31,
22,
195,
11685,
40,
13,
7,
8576,
93,
7,
16,
51,
10346,
16,
1072,
13,
103,
101,
48,
45,
13,
1,
9375,
1,
100,
13,
5,
4215,
211,
800,
3726,
13,
5,
306,
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... |
NTPD: use an unrestricted port for communication
===
When querying ntp servers with the command **ntpdate**, I can use the **-u** argument to make the source port an unrestricted port (port 1024 and above).
With ntpd, which is meant to run in the background, I can't seem to find a way to turn this option on. So the source port is always 123. It's playing around horribly with my firewall configuration.
Is there a configuration option in **ntp.conf** to make it use a random source port? | 0 | [
2,
13,
2877,
9251,
45,
275,
40,
29702,
1295,
26,
3291,
800,
3726,
3726,
76,
25597,
68,
13,
2877,
306,
17595,
29,
14,
1202,
13,
1409,
2877,
306,
8209,
1409,
15,
31,
92,
275,
14,
13,
1409,
8,
291,
1409,
5476,
20,
233,
14,
1267,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Code obfuscator for php?
===
Have anybody used a good obfuscater for PHP?, I've tried some but they dont work for quite big projects. They can't handle variables that is included in one file and used in another for instance.
Or do you have any other tricks for stopping the spread of your great code? :) | 0 | [
2,
1797,
5122,
13735,
150,
3457,
26,
13,
26120,
60,
800,
3726,
3726,
57,
11181,
147,
21,
254,
5122,
13735,
793,
815,
26,
13,
26120,
60,
15,
31,
22,
195,
794,
109,
47,
59,
1049,
170,
26,
1450,
580,
2314,
9,
59,
92,
22,
38,
3053... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 print <incomplete type> variable in gdb
===
Sometimes gdb prints <incomplete type> for some type of variables. What does this mean and how can we see that value? | 0 | [
2,
184,
20,
4793,
13,
1,
108,
15990,
1001,
1,
7612,
19,
489,
9007,
800,
3726,
3726,
1030,
489,
9007,
12202,
13,
1,
108,
15990,
1001,
1,
26,
109,
1001,
16,
12157,
9,
98,
630,
48,
884,
17,
184,
92,
95,
196,
30,
1923,
60,
3,
0,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
Read environment variables from file in Windows Batch (cmd.exe)
===
I'm trying to read variables from a batch file for later use in the batch script, which is a Java launcher. I'd ideally like to have the same format for the settings file on all platforms (Unix, Windows), and also be a valid Java Properties file. That is, it should look like this:
setting1=Value1
setting2=Value2
...
Is it possible to read such values like you would in a Unix shell script? The could should look something like this:
READ settingsfile.xy
java -Dsetting1=%setting1% ...
I know that this is probably possible with `SET setting1=Value1`, but I'd really rather have the same file format for the settings on all platforms. | 0 | [
2,
1302,
2307,
12157,
37,
3893,
19,
1936,
13064,
13,
5,
9095,
43,
9,
1706,
62,
6,
800,
3726,
3726,
31,
22,
79,
749,
20,
1302,
12157,
37,
21,
13064,
3893,
26,
138,
275,
19,
14,
13064,
3884,
15,
56,
25,
21,
8247,
19755,
9,
31,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Concurrent ASP.NET session best practices
===
User A logs into a ticket management system to edit content on "SomePage.aspx"
User B logs in 30 seconds later to edit the same ticket on "SomePage.aspx"
What are some of the best known practices(in a 3-tier architecture) for notifying each of the users that someone else is modifying the same content? | 0 | [
2,
19513,
28,
306,
9,
2328,
3723,
246,
5242,
800,
3726,
3726,
4155,
21,
18893,
77,
21,
6133,
1097,
329,
20,
9392,
2331,
27,
13,
7,
3220,
6486,
9,
472,
306,
396,
7,
4155,
334,
18893,
19,
712,
2582,
138,
20,
9392,
14,
205,
6133,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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't import settings in Visual Studio 2008
===
I recently baselined my machine and installed VS2008 and I am trying to import my settings file: [http://naspinski.net/file.axd?file=naspinski.vssettings][1]
I click **Tools->Import** Settings, **select Import selected environment settings** and click on **Next**
Next screen I select **No, just import new settings, overwrite my current settings** and click **Next**
I browse to my file and click **Open** -or- double-click on the file and it just dumps out... I don't get the option to click **Finished**, it just dumps out?
Any ideas what is wrong?
[1]: http://naspinski.net/file.axd?file=naspinski.vssettings | 0 | [
2,
92,
22,
38,
9010,
12410,
19,
3458,
1120,
570,
800,
3726,
3726,
31,
1989,
27150,
43,
51,
1940,
17,
4066,
4611,
2753,
17,
31,
589,
749,
20,
9010,
51,
12410,
3893,
45,
636,
21127,
6903,
325,
3401,
12099,
9,
2328,
118,
16877,
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... |
Cherry-pick a merge
===
Let's say branch B is a topic branch off of branch A, and you want those changes in branch C. What does it mean when you cherry-pick the merge commit of branch A and branch B to branch C?
For example, if you use the -m flag to specify the old HEAD of branch A to cherry-pick the merge to branch C, does that simply mean "Take the diff between the cherry-picked commit tree and old HEAD of branch A and apply it to branch C?"
Are there any gotchas for using this method? (e.g. Would branch C look like it's merged to branch A and B? Would more changes be applied than simply the commits from branch B?) | 0 | [
2,
9257,
8,
16855,
21,
12666,
800,
3726,
3726,
408,
22,
18,
395,
1686,
334,
25,
21,
8303,
1686,
168,
16,
1686,
21,
15,
17,
42,
259,
273,
1693,
19,
1686,
272,
9,
98,
630,
32,
884,
76,
42,
9257,
8,
16855,
14,
12666,
9686,
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... |
Can I trigger a complete web page reload with content from a javascript string ?
===
This is one of those ajax "alternate flow" questions. Normally I expect my ajax request to return a part of the page. But sometimes it may return a full page with html, head and body tag.
At the time I return from my ajax-request I can detect if this is a full page, but is it possible to trigger a full page reload (with full event cycle) based on the string content I have ?
(And yes, I have tried replacing the body element, but that does not give me the events and does not allow me to change the content in the head block)
Any framework reference is ok | 0 | [
2,
92,
31,
7286,
21,
1279,
2741,
2478,
27339,
29,
2331,
37,
21,
8247,
8741,
3724,
13,
60,
800,
3726,
3726,
48,
25,
53,
16,
273,
20624,
13,
7,
28978,
3312,
7,
2346,
9,
4147,
31,
4186,
51,
20624,
3772,
20,
788,
21,
141,
16,
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... |
build a string using checkbox
===
can anybody show me how to build a string using checkbox. what would be the best way to do this.
for example i have 4 checkbox's each with its own value (valueA, valueB, valueC, valueD)
the thing is i want to display each result in different lines.
result if B & C is selected :
valueB <br>
valueC
and how would i display this again if i saved this into a database? | 0 | [
2,
1895,
21,
3724,
568,
2631,
5309,
800,
3726,
3726,
92,
11181,
298,
55,
184,
20,
1895,
21,
3724,
568,
2631,
5309,
9,
98,
83,
44,
14,
246,
161,
20,
107,
48,
9,
26,
823,
31,
57,
268,
2631,
5309,
22,
18,
206,
29,
82,
258,
1923... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Boundary for comment box
===
In my java application, I need to create a comment box for the users to add comments. Moreover, I need to provide the user with the provision for resizing and dragging the comment box. For this, I need to show a boundary around the comment box as in the case of comment box in Microsoft Excel which I have shown below:
![alt text][1]
[1]: http://lh3.ggpht.com/subinvarghesein/SQGDAcBgHjI/AAAAAAAAAJc/YVGvsQltkyk/boundary.jpg
I dont need the circles shown on the boundary for resizing because I will be using a triangle kind of a thing on the bottom-right of the box. But I need the dotted area.
How do I create it for my application in java? Any good thoughts? | 0 | [
2,
5067,
26,
6484,
1649,
800,
3726,
3726,
19,
51,
8247,
3010,
15,
31,
376,
20,
1600,
21,
6484,
1649,
26,
14,
3878,
20,
3547,
7534,
9,
9353,
15,
31,
376,
20,
1181,
14,
4155,
29,
14,
8738,
26,
10719,
3335,
17,
13052,
14,
6484,
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... |
Implementing Claims-Based Security (WCF/Asp.NET)
===
After researching on the topic of Claims-Based Security (or a Federated Security Model). I've been coming across many examples that use Cardspace as an example. The main article that I read that gave a really great explanation of the subject was a [PDF][1] by Microsoft on a framework called [Zermatt][2].
The claims-based security architecture I'm looking into is the equivalent of implementing an STS Authentication Broker in combination with a STS Authorization Broker. This way, when I create a new service all I need to do is ensure that the service will only accept claims issued by the Authorization Broker. And as noted in the article, the Authorization Broker would only accept claims issued by the Authentication Broker.
When that's setup, anytime a client attempts to use the new service, it must authenticate with the ***Authentication Broker*** **(issuing an authenticated claim)** and then get authorized with the
***Authorization Broker*** **(issuing an authorized claim)**.
This is all fine and dandy and the architecture is clear but I don't see exactly how to implement an STS. As I mentioned, most (if not all) examples around the web are showing how to use Cardspace but that doesn't exactly work when you have a database backing up your authentication scheme.
**Sample Scenario**
![alt text][3]
[1]: https://connect.microsoft.com/Downloads/DownloadDetails.aspx?SiteID=642&DownloadID=12901
[2]: https://connect.microsoft.com/Downloads/Downloads.aspx?SiteID=642
[3]: http://img512.imageshack.us/img512/8329/claimsbasedsecurityza6.jpg | 0 | [
2,
17333,
2810,
8,
1281,
1221,
13,
5,
499,
8940,
118,
472,
306,
9,
2328,
6,
800,
3726,
3726,
75,
527,
68,
27,
14,
8303,
16,
2810,
8,
1281,
1221,
13,
5,
248,
21,
29391,
1221,
1061,
6,
9,
31,
22,
195,
74,
880,
464,
151,
3770,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Wrapping StopWatch timing with a delegate or lambda?
===
I'm writing code like this, doing a little quick and dirty timing:
var sw = new Stopwatch();
sw.Start();
for (int i = 0; i < 1000; i++)
{
b = DoStuff(s);
}
sw.Stop();
Console.WriteLine(sw.ElapsedMilliseconds);
Surely there's a way to call this bit of timing code as a fancy-schmancy .NET 3.0 lambda rather than (God forbid) cutting and pasting it a few times and replacing the **`DoStuff(s)`** with **`DoSomethingElse(s)`**?
I know it can be done as a `Delegate` but I'm wondering about the lambda way. | 0 | [
2,
13437,
747,
9054,
11812,
29,
21,
11300,
54,
13,
24187,
60,
800,
3726,
3726,
31,
22,
79,
1174,
1797,
101,
48,
15,
845,
21,
265,
2231,
17,
6121,
11812,
45,
4033,
8783,
800,
78,
747,
9054,
5,
6,
73,
8783,
9,
13680,
5,
6,
73,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Exporting reports - Quest's Spotlight on SQL Server
===
I'm setting up some monitoring on a few SQL Servers. Currently our environment uses Hobbit Monitoring System, but we are probably migrating to Nagios pretty soon.
One of the DBAs recommended Spotlight to me, and it seems like a great piece of software, but here's what I'm wondering...
**Is it possible to configure Spotlight to report some of its findings to another monitoring application?** | 0 | [
2,
7487,
68,
2813,
13,
8,
7769,
22,
18,
19135,
27,
4444,
255,
8128,
800,
3726,
3726,
31,
22,
79,
2697,
71,
109,
8984,
27,
21,
310,
4444,
255,
17595,
9,
871,
318,
2307,
2027,
13908,
3326,
8984,
329,
15,
47,
95,
50,
910,
28749,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Code review process?
===
I'm looking to formalize the way we do code reviews at within my department because at the moment it't a bit disorganised.
Do you have a formal code review process?
If so what is it and how do you think it could be improved?
I'm working in a team of 5 developers which means there is not very much experience floating about the company in this kind of process. | 0 | [
2,
1797,
1487,
953,
60,
800,
3726,
3726,
31,
22,
79,
699,
20,
3337,
2952,
14,
161,
95,
107,
1797,
2783,
35,
363,
51,
604,
185,
35,
14,
688,
32,
22,
38,
21,
1142,
1460,
6826,
2541,
9,
107,
42,
57,
21,
3337,
1797,
1487,
953,
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... |
Fibonacci Code Golf
===
Generate the fibonacci sequence in the fewest amount of characters possible. Any language is OK, except for one that you define with one operator, `f`, which prints the fibonacci numbers.
Starting point: <b>25 characters</b> in <b>Haskell</b>:
f=0:1:zipWith(+)f(tail f)
| 0 | [
2,
14143,
218,
17177,
1797,
4034,
800,
3726,
3726,
7920,
14,
14143,
218,
17177,
4030,
19,
14,
310,
1430,
2006,
16,
1766,
938,
9,
186,
816,
25,
5854,
15,
1613,
26,
53,
30,
42,
9267,
29,
53,
6022,
15,
13,
1,
410,
1,
15,
56,
1220... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Really useful VB6 source code
===
This isn't a question but I thought I'd start a thread where links to exceptionally useful (and widely applicable) vb6 code could be placed.
My choice is by someone called John Korejwa and is located on planet sourcecode at
http://www.planet-source-code.com/vb/scripts/ShowCode.asp?txtCodeId=50065&lngWId=1
Basically what it does is to overcome a serious deficiency in vb6 without resorting to 3rd party components
In vb6 pictures can only be stored as bitmaps. If your application involves capturing and storing images (such as document scans) this can require vastly greater hard disk space than if th images coulsd be stored as jpgs.
That's what this source code provides via a single class that incorporates jpeg compression code.
This limitation is the cause of innumerable questions on vb forums but this is the only code I've ever found that solves the problem just using code inside your vb6 program. | 0 | [
2,
510,
4811,
13,
20468,
379,
1267,
1797,
800,
3726,
3726,
48,
2532,
22,
38,
21,
1301,
47,
31,
289,
31,
22,
43,
799,
21,
9322,
113,
6271,
20,
20056,
4811,
13,
5,
290,
2525,
14535,
6,
13,
20468,
379,
1797,
110,
44,
1037,
9,
51,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How to set up a computing cloud and how it works?
===
Is it possible to have all the computing capacity of all the hardware nodes allocated to one instance (for eg. one basic linux installation)?
How to manage the cloud? | 0 | [
2,
184,
20,
309,
71,
21,
10626,
4005,
17,
184,
32,
693,
60,
800,
3726,
3726,
25,
32,
938,
20,
57,
65,
14,
10626,
2301,
16,
65,
14,
7610,
16272,
11685,
20,
53,
4851,
13,
5,
1106,
12369,
9,
53,
2125,
13024,
7758,
6,
60,
184,
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,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
Trying to Add Radio Inputs (+Labels) To An Example Form
===
<style type="text/css">
body{
font-family:Helvetica, sans-serif;
font-size:12px;
}
p, h1, form, button{border:0; margin:0; padding:0;}
.spacer{clear:both; height:1px;}
/* ----------- My Form ----------- */
.myform{
margin:0 auto;
width:400px;
padding:14px;
}
/* ----------- basic ----------- */
#basic{
border:solid 2px #DEDEDE;
}
#basic h1 {
font-size:14px;
font-weight:bold;
margin-bottom:8px;
}
#basic p{
font-size:11px;
color:#666666;
margin-bottom:20px;
border-bottom:solid 1px #dedede;
padding-bottom:10px;
}
#basic label{
display:block;
font-weight:bold;
text-align:right;
width:140px;
float:left;
}
#basic .small{
color:#666666;
display:block;
font-size:11px;
font-weight:normal;
text-align:right;
width:140px;
}
#basic input{
float:left;
width:200px;
margin:2px 0 30px 10px;
}
#basic button{
clear:both;
margin-left:150px;
background:#888888;
color:#FFFFFF;
border:solid 1px #666666;
font-size:11px;
font-weight:bold;
padding:4px 6px;
}
</style>
<div id="basic" class="myform">
<form id="form1" name="form1" method="post" action="">
<h1>Sign-up form</h1>
<p>This is the basic look of my form without table</p>
<label>Name
<span class="small">Add your name</span>
</label>
<input type="text" name="textfield" id="textfield" />
<label>Email
<span class="small">Add a valid address</span>
</label>
<input type="text" name="textfield" id="textfield" />
<label>Email
<span class="small">Add a valid address</span>
</label>
<!-- Problem --->
<input type="radio" name="textfield" id="r1" class="radio" value="1" /><label for="r1">One</label>
<input type="radio" name="textfield" id="r2" class="radio" value="2" /><label for="r2">Two</label>
<!-- Problem --->
<button type="submit">Sign-up</button>
<div class="spacer"></div>
</form>
</div>
I was given this example form, however I cannot add radio buttons without them being messed up. | 0 | [
2,
749,
20,
3547,
603,
6367,
18,
13,
5,
2430,
21018,
18,
6,
20,
40,
823,
505,
800,
3726,
3726,
13,
1,
4381,
1001,
3726,
7,
11969,
118,
6824,
18,
7,
1,
358,
1,
9978,
8,
13819,
45,
9180,
195,
12630,
15,
523,
18,
8,
4104,
821,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 set a default configuration in a Visual Studio Solution File?
===
In VS2005 and up, is it possible to specify which configuration should be selected by default?
I have several configurations in my solution but one of them should be used in most cases. Hence I'd like to make sure that devs who pull it out of Source Control use the right solution (unless of course they specifically choose another one).
Ideally, this setting should be in the .sln file since that one is under Source Control.
TIA, | 0 | [
2,
184,
20,
309,
21,
12838,
8091,
19,
21,
3458,
1120,
4295,
3893,
60,
800,
3726,
3726,
19,
4611,
2835,
17,
71,
15,
25,
32,
938,
20,
19077,
56,
8091,
378,
44,
1704,
34,
12838,
60,
31,
57,
238,
8091,
18,
19,
51,
4295,
47,
53,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Aspect Oriented Programming vs. Object-Oriented Programming. Which one????
===
Hello and good day for everyone
Like most developers here and in the entire world, I have been developing software systems using object-oriented programming (OOP) techniques for many, may and may years. So when I read that aspect-oriented programming (AOP) addresses many of the problems that traditional OOP doesn't solve completely or directly,
I get a pause and think , it is real ????
I had read a lot of Information trying to learn the keys of this AOP paradigm and i´m in the same place, so,i wanted to better understand its benefits in real world application development.
Somebody have the answer????
Thats all
With no more....
bye bye | 0 | [
2,
7289,
13,
6800,
3143,
4611,
9,
3095,
8,
6800,
3143,
9,
56,
53,
60,
60,
60,
60,
800,
3726,
3726,
10975,
17,
254,
208,
26,
1266,
101,
127,
10168,
235,
17,
19,
14,
1078,
126,
15,
31,
57,
74,
3561,
2306,
1242,
568,
3095,
8,
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... |
Intercept Video/Image from webcam and modify
===
Is there a generic API call I can make to get a handle of the image or video feed coming from a webcam and replace it with an image or video of my own so that applications interfacing to the cam (e.g. MSN/Skype/Yahoo IM) will see my image instead of what the camera is capturing?
Ideally, I am trying to solve this in a generic way independent of device vendor or interface (via standard webcam stack that all these apps utilize, if such a thing exists).
It is for a security application that needs to be able to disable webcams on clients other than for specific purposes. I can stop and start image capture devices through code, but ideally I would prefer to leave the device enabled and replace the captured image with a graphic that tells the user the reason they cannot currently use their cam.
| 0 | [
2,
18324,
763,
118,
22039,
37,
2741,
8760,
17,
17579,
800,
3726,
3726,
25,
80,
21,
12733,
21,
2159,
645,
31,
92,
233,
20,
164,
21,
3053,
16,
14,
1961,
54,
763,
4063,
880,
37,
21,
2741,
8760,
17,
3934,
32,
29,
40,
1961,
54,
763... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Interiting from asp:Image or asp:ImageButton?
===
I got this logic in a control to create a correct url for an image. My control basically needs to diplay an image, but the src is actually a complex string based on different parameters pointing at an image-server.
So we decided to to create a control MyImage derived from asp:Image - it works like a charm. Now i need the same logic but my image now needs to respond to a click. What i mean is - the 'MyImage' is used to display images on the site but in a few rare cases i would like it to be clickable.
I think i got three choices.
1. Change MyImage to derive from asp:ImageButton instead of asp:Image.
2. Copy all the code from MyImage into a new MyClickImage and derive from asp:ImageButton.
3. Wrap logic on MyImage to add a hyperlink, implement IPostbackHandler for that hyperlink and add the logic to handle the event.
Obviously i would very much like to avoid using option 2) since i would have to maintain two almost identically controls. The problem with option 1) *as i see it* (perhaps i'm wrong?) Is that all the images on the site that are not supposed to be clickable will automaticly become clickable. Option 3) seems overly complicated as i would have to maintain state, events and building the link manually.
I'm looking for a quick answer like 'you're stupid, just set property 'x' to false when you don't want it to be clickable' - but if i'm not mistaking it is not that obvious and ofcourse a more elaborate answer would be fine :)
EDIT: Added the 3rd option - i forgot to put that there in the first place :) | 0 | [
2,
1480,
242,
68,
37,
28,
306,
45,
22039,
54,
28,
306,
45,
22039,
811,
444,
60,
800,
3726,
3726,
31,
330,
48,
7085,
19,
21,
569,
20,
1600,
21,
4456,
287,
6362,
26,
40,
1961,
9,
51,
569,
11374,
2274,
20,
926,
5438,
40,
1961,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How to make consistent dll binaries across VS versions ?
===
For instance, winsock libs works great across all versions of the visual studio. But I am having real trouble to provide a consistent binary across all the versions. The dll compiled with VS 2005 won't work when linked to an application written in 2008. I upgraded both 2k5 and 2k8 to SP1, but the results haven't changed much. It works some what ok. But when they include this with a C# app, the C# app gets access violation errors, but with classic C++ application it works fine.
Is there a strategy that I should know when I provide dlls ? | 0 | [
2,
184,
20,
233,
8224,
13,
43,
211,
4511,
11301,
464,
4611,
3281,
13,
60,
800,
3726,
3726,
26,
4851,
15,
4041,
5668,
13,
8326,
18,
693,
374,
464,
65,
3281,
16,
14,
3458,
1120,
9,
47,
31,
589,
452,
683,
2572,
20,
1181,
21,
8224... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 sum up weighted arrays in PHP?
===
Hod do I multiply the values of a multi-dimensional array with weigths and sum up the results into a new array in PHP or in general?
The boring way looks like this:
$weights = array(0.25, 0.4, 0.2, 0.15);
$values = array( array(...), array(...), array(...), array(...));
$result = array();
for($i = 0; $i < count($values[0]); ++$i) {
$result[$i] = 0;
foreach($weigths as $index => $thisWeight) {
$result[$i] += $thisWeight * $values[$index][$i];
}
}
Is there a more elegant solution? | 0 | [
2,
184,
107,
31,
3907,
71,
23350,
7718,
18,
19,
13,
26120,
60,
800,
3726,
3726,
21481,
107,
31,
26314,
14,
4070,
16,
21,
1889,
8,
7865,
7718,
29,
95,
2816,
96,
18,
17,
3907,
71,
14,
1736,
77,
21,
78,
7718,
19,
13,
26120,
54,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Subclassing DropDownList in ASP.NET
===
I want to subclass the built-in DropDownList in ASP.NET so that I can add functionality to it and use it in my pages. I tried doing this with a UserControl but found that it doesn't expose the internal DropDownList (logically, I guess). I've googled for the answer but can't find anything.
I've come as far as writing the actual class, and it's possible to subclass from DropDownList but I'm unable to register the file in my ASP.NET page and use it in the source view. Maybe I'm missing some properties in my class?
Any ideas? | 0 | [
2,
972,
1898,
68,
2804,
2968,
5739,
19,
28,
306,
9,
2328,
800,
3726,
3726,
31,
259,
20,
972,
1898,
14,
392,
8,
108,
2804,
2968,
5739,
19,
28,
306,
9,
2328,
86,
30,
31,
92,
3547,
18548,
20,
32,
17,
275,
32,
19,
51,
4434,
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... |
SQL Query Where Field DOES NOT Contain $x
===
I want to find an SQL query to find rows where field1 does not contain $x. How can I do this? | 0 | [
2,
4444,
255,
25597,
113,
575,
630,
52,
3717,
5579,
396,
800,
3726,
3726,
31,
259,
20,
477,
40,
4444,
255,
25597,
20,
477,
11295,
113,
575,
165,
630,
52,
3717,
5579,
396,
9,
184,
92,
31,
107,
48,
60,
3,
0,
0,
0,
0,
0,
0,
0... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
RCDATA terminator
===
I have a .rc file which is used to include some text data in my executable, like this:
1234 RCDATA myfile.txt
This works fine: the content of the 'myfile.txt' is included in my executable.
The problem is that no 0-terminator is added to the string, and I cannot add it to the file. Is there any way of adding a 0-terminator from within the .rc file? Something like this:
1234 RCDATA { myfile.txt, "\0" } // error RC2104
Note that I already found this solution, but I am looking for something more elegant.
1234 RCDATA myfile.txt
1235 RCDATA { "\0" }
Thanks alot,
eli | 0 | [
2,
16462,
18768,
13,
815,
28607,
800,
3726,
3726,
31,
57,
21,
13,
9,
5453,
3893,
56,
25,
147,
20,
468,
109,
1854,
1054,
19,
51,
1396,
17194,
5924,
15,
101,
48,
45,
390,
3965,
16462,
18768,
51,
16877,
9,
38,
396,
38,
48,
693,
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... |
Binding xml document to gridview doesn't work
===
I have an xml document which looks like this:
<xconnect>
<type>OK</type>
<response/>
<report>
<id>suppressionlist_get</id>
<name>Suppression List Get</name>
<timestamp>24 Oct 08 @ 10:16AM</timestamp>
<records type="user"/>
<records type="client"/>
<records type="group">
<record>
<email>investorrelations@hfh.com</email>
<type>RECIPSELF</type>
<long_type>Recipient self suppressed</long_type>
<created>23 Oct 08 @ 8:53PM</created>
<user>facm</user>
</record>
I have omitted the closing of the document for clarity and to keep this post short.
Anyway, I have a gridview and I want to bind this XML to the gridview so I get table, like:
email type long created user
data data data data data
And so forth.
I was playing with datasets and xmldatadocuments and when stepping through, each attribute seemed to be represented as its own table in a data collection table.
Any ideas on how to achieve the above? I thought it was as simple as just adding a gridview, and xml data source with the data file specified.
Thanks | 0 | [
2,
8728,
23504,
4492,
20,
7354,
4725,
1437,
22,
38,
170,
800,
3726,
3726,
31,
57,
40,
23504,
4492,
56,
1879,
101,
48,
45,
13,
1,
396,
25996,
1,
13,
1,
4474,
1,
3085,
1,
118,
4474,
1,
13,
1,
99,
18,
8782,
870,
118,
1,
13,
1... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How to specify default file extension for Oracle's Pro*COBOL precompiler
===
Is it possible to configure the default file extension that Oracle's Pro*COBOL precompiler assumes for
EXEC SQL INCLUDE filename END-EXEC
statements in which there is no filename specified for the include file?
The docs seem specify that in this case - INCLUDE statement without file extension - the precompiler will use the system default file extension.
| 0 | [
2,
184,
20,
19077,
12838,
3893,
3896,
26,
15759,
22,
18,
895,
2483,
716,
6966,
782,
11103,
49,
1252,
800,
3726,
3726,
25,
32,
938,
20,
1065,
15951,
14,
12838,
3893,
3896,
30,
15759,
22,
18,
895,
2483,
716,
6966,
782,
11103,
49,
12... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 find out about the accepted coding styles
===
Where to read up on (the best-practice in) source code formatting, for individual languages i.e. what are the conventions for naming variables etc., for indentation and where to place braces, how and where to include comments, etc.
For example for C Kernighan and Ritchie's book [The C Programming Language][1] and Linus Torvalds' [Linux kernel coding style guide][2] and for Perl at least [perlstyle - Perl style guide][3].
[1]: http://www.amazon.com/Programming-Language-Prentice-Hall-Software/dp/0131103628/
[2]: http://pantransit.reptiles.org/prog/CodingStyle.html
[3]: http://www.perl.com/doc/manual/html/pod/perlstyle.html | 0 | [
2,
184,
20,
477,
70,
88,
14,
2217,
13,
15458,
6443,
800,
3726,
3726,
113,
20,
1302,
71,
27,
13,
5,
124,
246,
8,
4899,
5183,
3568,
19,
6,
1267,
1797,
2595,
1203,
15,
26,
1359,
2556,
31,
9,
62,
9,
98,
50,
14,
15117,
26,
10929,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 c# how can I extract information about the hard drives present on the local machine.
===
I'm looking to get data such as Size/Capacity, Serial No, Model No, Heads Sectors, Manufacturer and possibly SMART data. | 0 | [
2,
568,
272,
5910,
184,
92,
31,
10962,
676,
88,
14,
552,
10396,
734,
27,
14,
375,
1940,
9,
800,
3726,
3726,
31,
22,
79,
699,
20,
164,
1054,
145,
28,
1072,
118,
29686,
15,
5956,
90,
15,
1061,
90,
15,
4153,
12653,
15,
7094,
17,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
Erlang syntax
===
I'm going to create Erlang language support plugin for an Intellij Idea.
The big and first problem I have is in the JFlex erlang syntax definition. Does anybody know where can I get EBNF or BNF for Erlang? | 0 | [
2,
13,
106,
9949,
22649,
800,
3726,
3726,
31,
22,
79,
228,
20,
1600,
13,
106,
9949,
816,
555,
10922,
108,
26,
40,
19,
4213,
9999,
882,
9,
14,
580,
17,
64,
1448,
31,
57,
25,
19,
14,
487,
19752,
13,
106,
9949,
22649,
5465,
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... |
What is the purpose of zones in sharepoint? (web application zones or authentication zones or how do they call it)
===
I can't understand the concept and, first of all, where it belongs.
Is it solely a Shrepoint concept or more general like of ASP.NET or IIS level?
Does it only affect authentication and if so how does it affect? Or what effect does it have on an application?
I know it is a broad question, but I've googled for about 15 minutes and haven't been able to find the answer. And it is kind a not so critical for me now but I'm curious.
Can you please give a link of a resource with an explanation of this?
Thanks! | 0 | [
2,
98,
25,
14,
2131,
16,
11225,
19,
1891,
3132,
60,
13,
5,
14113,
3010,
11225,
54,
27963,
11225,
54,
184,
107,
59,
645,
32,
6,
800,
3726,
3726,
31,
92,
22,
38,
1369,
14,
2420,
17,
15,
64,
16,
65,
15,
113,
32,
7034,
9,
25,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
XAML : Binding textbox maxlength to Class constant
===
I am attempting to bind a WPF textbox's Maxlength property to a known constant deep within a class. I am using c#.
The class has a structure not too dissimilar to the following:
namespace Blah
{
public partial class One
{
public partial class Two
{
public string MyBindingValue { get; set; }
public static class MetaData
{
public static class Sizes
{
public const int Length1 = 10;
public const int Length2 = 20;
}
}
}
}
}
Yes it is deeply nested, but unfortunately in this instance I can't move things round very much without huge rewrites required.
I was hoping I'd be able to bind the textbox MaxLength to the Length1 or Length2 values but I can't get it to work.
I was expecting the binding to be something like the following:
<Textbox Text="{Binding Path=MyBindingValue}" MaxLength="{Binding Path=Blah.One.Two.MetaData.Sizes.Length1}" />
Any help is appreciated.
Many thanks | 0 | [
2,
13,
6791,
8184,
13,
45,
8728,
1854,
5309,
2049,
6325,
20,
718,
3587,
800,
3726,
3726,
31,
589,
6314,
20,
10193,
21,
619,
7721,
1854,
5309,
22,
18,
2049,
6325,
1354,
20,
21,
167,
3587,
855,
363,
21,
718,
9,
31,
589,
568,
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... |
what is the fastest way to generate a unique set in .net 2
===
I have what is essentially a jagged array of name value pairs - i need to generate a set of unique name values from this. the jagged array is approx 86,000 x 11 values.
It does not matter to me what way I have to store a name value pair (a single string "name=value" or a specialised class for example KeyValuePair).
I am using C# and .NET 2.0 (and the performance is so poor I am thinking that it may be better to push my entire jagged array into a sql database and do a select distinct from there). | 0 | [
2,
98,
25,
14,
7518,
161,
20,
7920,
21,
2619,
309,
19,
13,
9,
2328,
172,
800,
3726,
3726,
31,
57,
98,
25,
7398,
21,
20409,
7718,
16,
204,
1923,
7473,
13,
8,
31,
376,
20,
7920,
21,
309,
16,
2619,
204,
4070,
37,
48,
9,
14,
2... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Confused with aggregates in T-SQL
===
Ok: This is some of my table structure that matters here
CaseStudyID int
Title nvarchar(50)
OverrideTitle nvarchar(50)
Part of my procedure
Declare @Temp table(CaseStudyID int,
Title nvarchar(50))
Insert Into @Temp
SELECT CaseStudyID,Title
FROM CaseStudy
WHERE Visible = 1 AND DisplayOnHomePage = 1
ORDER BY Title
Update @Temp Set Title = TitleOverride
--Here is where im lost if the title occurs more than once
--I need to replace it with the override
--Schoolboy error or leaking brain I cant get it going
Select * From @Temp
Can anyone help? | 0 | [
2,
4230,
29,
8544,
18,
19,
13,
38,
8,
18,
22402,
800,
3726,
3726,
5854,
45,
48,
25,
109,
16,
51,
859,
1411,
30,
4556,
235,
610,
26244,
1340,
19,
38,
581,
13,
103,
3311,
5433,
5,
2290,
6,
84,
11891,
22235,
13,
103,
3311,
5433,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How does your favorite language handle deep recursion?
===
I recently started learning Python and I was rather surprised to find a 1000 deep recursion limit (by default). If you set it high enough, about 30000, it crashes with a segmentation fault just like C. Although, C seems to go quite a lot higher.
(The Python folks are quick to point out that you can always convert recursive functions to iterative ones and that they're always faster. That's 100% true. It's not really what my question is about though.)
I tried the same experiment in Perl and somewhere around 10 million recursions it consumed all of my 4 gigs of ram and I used ^C to stop trying. Clearly Perl doesn't use the C stack, but it does use a ridiculous amount of memory when it recurses -- not terribly shocking considering how much work it has to do to call functions.
I tried in Pike and was completely surprised to get 100,000,000 recursions in about 2 seconds. I have no idea how it did that, but I suspect it flattened the recursion to an iterative process -- it doesn't seem to consume any extra memory while it does it. [note: pike does flatten trivial cases, but segfaults on more complicated ones, or so I'm told.]
I used these otherwise useless functions:
int f(int i, int l) { if(i<l) return f(i+1,l); return i; }
sub f { return f($_[0]+1, $_[1]) if $_[0]<$_[1]; return $_[0] };
def f(i,l):
if i<l:
return f(i+1,l)
return i
I'm very curious how other languages (e.g., PHP, Ruby, Java, Lua, Ocaml, Haskell) handle recursion and why they handle it that way.
| 0 | [
2,
184,
630,
154,
3839,
816,
3053,
855,
26604,
5991,
60,
800,
3726,
3726,
31,
1989,
373,
2477,
20059,
17,
31,
23,
864,
2948,
20,
477,
21,
6150,
855,
26604,
5991,
4496,
13,
5,
779,
12838,
6,
9,
100,
42,
309,
32,
183,
511,
15,
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... |
torun a loop of queries in a access
===
I have a database with a table which is full of conditions and error messages for checking another databse.
I want to run a loop such that each of these conditions is checked against all eth tables in the second database. and generae a report which gives teh errors .
Is this possible in ms access.
eg
querycrit table
id query error
1 speed<25 and speed>56 speed above limit
2 dist<56 or dist >78 dist within limit
i have more than 400 queries like this of different variables.
THe table against which I am runningtge queries is
records table
id speed dist accce decele aaa bbb ccc
1 33 34 44 33 33 33 33
2 45 44 55 55 55 22 23
regards
ttk
| 0 | [
2,
20,
3169,
21,
5293,
16,
9386,
2829,
19,
21,
1381,
800,
3726,
3726,
31,
57,
21,
6018,
29,
21,
859,
56,
25,
503,
16,
2039,
17,
7019,
7561,
26,
9886,
226,
1054,
220,
870,
9,
31,
259,
20,
485,
21,
5293,
145,
30,
206,
16,
158,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 set the Turbo C path in windows?
===
<P>I am <b>Manoj </b>again here to ask my doubts
<p>How to set the turbo c path in windows globally?
<p>so that i can compile and run my c progrmas which are in other drives any where in the command prompt in windows XP.
<p>Can any one tell me how to get commands at evry drive in the command prompt just by typing in<p><b> "c:\tcc"</b>
<p>in command prompt in windows and turbo c environment?
| 0 | [
2,
184,
20,
309,
14,
12036,
272,
2013,
19,
1936,
60,
800,
3726,
3726,
13,
1,
306,
1,
49,
589,
13,
1,
220,
1,
177,
12683,
13,
1,
118,
220,
1,
18762,
235,
20,
1349,
51,
16313,
13,
1,
306,
1,
1544,
20,
309,
14,
12036,
272,
20... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Worst PHP practise found in your experience?
===
What are the worse practises found around in codes ( or you did and then self-complained ) ?
I'd place into list:
<ul>
<li>Use of $array[reference] without single quotes </li>
<li>Istance "hidden" variables into inclusion files, which are needed later </li>
<li>Lots of recursive inclusion not using "_once" functions </li>
</ul>
_Note_: maybe subjective or "fun" if you like. | 0 | [
2,
4126,
13,
26120,
27954,
216,
19,
154,
1496,
60,
800,
3726,
3726,
98,
50,
14,
3105,
27954,
18,
216,
140,
19,
11358,
13,
5,
54,
42,
144,
17,
94,
1119,
8,
11103,
16062,
43,
13,
6,
13,
60,
31,
22,
43,
209,
77,
968,
45,
13,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How to read the datebase table name of a Model instance
===
Given a model's instance object, how can I get the data base table's name?
I don't want to specify names explicitly in the Meta class. | 0 | [
2,
184,
20,
1302,
14,
1231,
8436,
859,
204,
16,
21,
1061,
4851,
800,
3726,
3726,
504,
21,
1061,
22,
18,
4851,
3095,
15,
184,
92,
31,
164,
14,
1054,
1000,
859,
22,
18,
204,
60,
31,
221,
22,
38,
259,
20,
19077,
1817,
13108,
19,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
Can any body tell me the what is list file and map file in c?
===
<p>I am <b>Manoj </b>again here to ask you my doubts.
<p>I heard that in turbo c when we are doing projects with more than one source file
<p>then we can generate <b>list file and map file </b>.
<p>What are they?
<p>what do they contain?
<p>And how to generate them using the commands at MS-DOS command prompt using tcc for turbo c?
<p>How to generate the assembly code for a c file using turbo tcc commands? | 0 | [
2,
92,
186,
358,
494,
55,
14,
98,
25,
968,
3893,
17,
2942,
3893,
19,
272,
60,
800,
3726,
3726,
13,
1,
306,
1,
49,
589,
13,
1,
220,
1,
177,
12683,
13,
1,
118,
220,
1,
18762,
235,
20,
1349,
42,
51,
16313,
9,
13,
1,
306,
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 the Silverlight 2 Bible worth purchasing?
===
Someone on SO mentioned they'd bought a copy and I'm damned if I can find the question again.
[http://www.amazon.co.uk/Silverlight-2-Bible-Brad-Dayley/dp/0470375000/ref=sr_1_2?ie=UTF8&s=books&qid=1224844673&sr=1-2][1]
Has anyone bought this, if so is it worth it? Also, what about the MS book "Introducing Silverlight 2"?:
[http://www.amazon.co.uk/Introducing-Microsoft-Silverlight-Second-PRO-Developer/dp/073562528X/ref=pd_bxgy_b_text_b][2]
Cheers
Kev
[1]: http://www.amazon.co.uk/Silverlight-2-Bible-Brad-Dayley/dp/0470375000/ref=sr_1_2?ie=UTF8&s=books&qid=1224844673&sr=1-2
[2]: http://www.amazon.co.uk/Introducing-Microsoft-Silverlight-Second-PRO-Developer/dp/073562528X/ref=pd_bxgy_b_text_b | 0 | [
2,
25,
14,
1172,
3130,
172,
5095,
2715,
14828,
60,
800,
3726,
3726,
737,
27,
86,
2211,
59,
22,
43,
2448,
21,
4344,
17,
31,
22,
79,
9973,
100,
31,
92,
477,
14,
1301,
188,
9,
636,
21127,
6903,
6483,
9,
3812,
6931,
9,
716,
9,
2... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
how to include the assembly code in my C code in Turbo c?
===
<p>How to include any assembly code lines into my C program ?
<p>In turbo c is there a possibility to add an assembly code file (.asm) to a project of few .c files?
| 0 | [
2,
184,
20,
468,
14,
1475,
1797,
19,
51,
272,
1797,
19,
12036,
272,
60,
800,
3726,
3726,
13,
1,
306,
1,
1544,
20,
468,
186,
1475,
1797,
1560,
77,
51,
272,
625,
13,
60,
13,
1,
306,
1,
108,
12036,
272,
25,
80,
21,
4813,
20,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
What's the 'obj' directory for in .NET?
===
We're having a discussion..what exactly is the purpose of the 'obj' directory in .NET? | 0 | [
2,
98,
22,
18,
14,
13,
22,
111,
11741,
22,
16755,
26,
19,
13,
9,
2328,
60,
800,
3726,
3726,
95,
22,
99,
452,
21,
5460,
9,
9,
608,
1890,
25,
14,
2131,
16,
14,
13,
22,
111,
11741,
22,
16755,
19,
13,
9,
2328,
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... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
Does anyone have any T4 example Templates that can be used to generate a Webservice?
===
Does anyone have any T4 example Templates (or links to same) that can be used to generate a Webservice?
I'm thinking of the fact that I guess the Webservice is not just the Vb or Cs field but also requires an appropriate asmx file.
I'm really not sure how to achieve this
| 0 | [
2,
630,
1276,
57,
186,
13,
38,
300,
823,
22894,
18,
30,
92,
44,
147,
20,
7920,
21,
2741,
11449,
60,
800,
3726,
3726,
630,
1276,
57,
186,
13,
38,
300,
823,
22894,
18,
13,
5,
248,
6271,
20,
205,
6,
30,
92,
44,
147,
20,
7920,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 name meaning "not a singleton"?
===
Is there a name meaning "not a singleton"? | 0 | [
2,
25,
80,
21,
204,
1813,
13,
7,
1270,
21,
345,
444,
7,
60,
800,
3726,
3726,
25,
80,
21,
204,
1813,
13,
7,
1270,
21,
345,
444,
7,
60,
3,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
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... |
.NET: How to check the type within a generic typed class?
===
How do I get the type of a generic typed class within the class?
An example:
I build a generic typed collection implementing *ICollection< T>*. Within I have methods like
public void Add(T item){
...
}
public void Add(IEnumerable<T> enumItems){
...
}
How can I ask within the method for the given type *T*?
The reason for my question is: If *object* is used as *T* the collection uses Add(object item) instead of Add(IEnumerable<object> enumItems) even if the parameter is IEnumerable. So in the first case it would add the whole enumerable collection as one object instead of multiple objects of the enumerable collection.
So i need something like
if (T is object) {
// Check for IEnumerable
}
but of course that cannot work in C#. Suggestions?
Thank you very much!
Michael
| 0 | [
2,
13,
9,
2328,
45,
184,
20,
2631,
14,
1001,
363,
21,
12733,
1001,
43,
718,
60,
800,
3726,
3726,
184,
107,
31,
164,
14,
1001,
16,
21,
12733,
1001,
43,
718,
363,
14,
718,
60,
40,
823,
45,
31,
1895,
21,
12733,
1001,
43,
1206,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
AWT TextArea seems to count cr-lf sequence as one character
===
I have this problem:
The text "ABCD\r\nEFGHJ" loaded from a file is matched with java regex "EFGH". Matcher object of course says start of the matched string is in position 6. The matcher counts \r \n as two positions.
I put the original text in a AWT TextArea Component and then call select(6,10) to highlight the area which was matched. Guess what... it starts highlighting from 'F' letter. One position forward than it should...
If more than 1 pair of crlf precedes matched area then highlighting moves even more forward than it should.
Anyone has any simple solution? | 0 | [
2,
13,
3885,
38,
1854,
17760,
2206,
20,
2468,
6186,
8,
9641,
4030,
28,
53,
925,
800,
3726,
3726,
31,
57,
48,
1448,
45,
14,
1854,
13,
7,
21880,
43,
1,
139,
1,
556,
410,
4780,
728,
7,
8572,
37,
21,
3893,
25,
11265,
29,
8247,
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... |
Can several suites of the same version of Visual Studio be installed Side by Side ?
===
I would like to know if I can install say VIsual Studio 2008 Pro and Visual Studio 2008 standard on the same machine. I have tried to install the pro (trial edition available on MSDN) after the express, and it seems to require them to be installed in the same directory. Is this specific to the express edition ?
The reason why I am asking is to support automatic detection of VS compilers on a given machine for a build tool (scons), and I am not so familiar with non express versions of VS. | 0 | [
2,
92,
238,
6160,
18,
16,
14,
205,
615,
16,
3458,
1120,
44,
4066,
270,
34,
270,
13,
60,
800,
3726,
3726,
31,
83,
101,
20,
143,
100,
31,
92,
16146,
395,
3458,
1120,
570,
895,
17,
3458,
1120,
570,
1236,
27,
14,
205,
1940,
9,
3... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How can I propagate exceptions between threads?
===
We have a function which a single thread calls into (we name this the main thread). Within the body of the function we spawn multiple worker threads to do CPU intensive work, wait for all threads to finish, then return the result on the main thread.
The result is that the caller can use the function naively, and internally it'll make use of multiple cores.
*All good so far..*
The problem we have is dealing with exceptions. We don't want exceptions on the worker threads to crash the application. We want the caller to the function to be able to catch them on the main thread. We must catch exceptions on the worker threads and propagate them across to the main thread to have them continue unwinding from there.
***How can we do this?***
The best I can think of is:
1. Catch a whole variety of exceptions on our worker threads (std::exception and a few of our own ones).
2. Record the type and message of the exception.
3. Have a corresponding switch statement on the main thread which rethrows exceptions of whatever type was recorded on the worker thread.
This has the obvious disadvantage of only supporting a limited set of exception types, and would need modification whenever new exception types were added. | 0 | [
2,
184,
92,
31,
24618,
13392,
128,
20396,
60,
800,
3726,
3726,
95,
57,
21,
1990,
56,
21,
345,
9322,
3029,
77,
13,
5,
458,
204,
48,
14,
407,
9322,
6,
9,
363,
14,
358,
16,
14,
1990,
95,
13,
22860,
1886,
7444,
20396,
20,
107,
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... |
Regular expression find replace
===
I have a comma separated list of strings like the one below.
a,b ,c ,d, , , , ,e, f,g,h .
I want to write a regular expression that will replace the empty values i.e., strings that contain only white spaces to 'NA'. So the result should be
a,b ,c ,d,NA,NA,NA,NA,e, f,g,h .
I tried using ",\s+," to search but it skips the alternate empty strings and results in
a,b ,c ,d,NA, ,NA, ,e, f,g,h .
What's the correct regex to use here ?
| 0 | [
2,
1290,
1803,
477,
3934,
800,
3726,
3726,
31,
57,
21,
11951,
58,
4196,
968,
16,
7887,
101,
14,
53,
1021,
9,
21,
15,
220,
13,
15,
150,
13,
15,
43,
15,
13,
15,
13,
15,
13,
15,
13,
15,
62,
15,
398,
15,
263,
15,
252,
13,
9,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
MySQL update error when special characters are used
===
I was wondering if anyone had come across this one before. I have a customer who uses special characters in their product description field. Updating to a MySQL database works fine if we use their HTML equivalents but it fails if the character itself is used (copied from either character map or Word I would assume).
Has anyone seen this behaviour before? The character in question in this case is ø - and we can't seem to do a replace on it (in ASP at least) as the character comes though to the SQL string as a "?".
Any suggestions much appreciated - thanks! | 0 | [
2,
51,
18,
22402,
11100,
7019,
76,
621,
1766,
50,
147,
800,
3726,
3726,
31,
23,
5712,
100,
1276,
41,
340,
464,
48,
53,
115,
9,
31,
57,
21,
7705,
72,
2027,
621,
1766,
19,
66,
2374,
5318,
575,
9,
71,
43,
1880,
20,
21,
51,
18,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
What is the best way to do Gui in Clojure?
===
What is the best way to do Gui in Clojure?
Is there an example of some functional swing or SWT wrapper?
Or some integration with javafx declarative gui description which could be easily wrapped to s-expressions using some macrology?
Any tutorials? | 0 | [
2,
98,
25,
14,
246,
161,
20,
107,
9457,
19,
7383,
2142,
99,
60,
800,
3726,
3726,
98,
25,
14,
246,
161,
20,
107,
9457,
19,
7383,
2142,
99,
60,
25,
80,
40,
823,
16,
109,
7652,
5587,
54,
8783,
38,
28051,
60,
54,
109,
8078,
29,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
SQL 2005 with SQL 2008 conflicts?
===
I am told that SQL Server 2005 installation with BI tools and SQL Server 2008 with BI tools cant work together on the same computer. Apparantly "some" things stop working. This was told to me by one of my team members. Since Im new to SQL BI, I cant discount what he has said altogether and I dont want to install them both on my dev box and find out later that there is problem.
Has anyone here installed them both, used both sufficiently well and found it to be working fine?
Thanks. | 0 | [
2,
4444,
255,
812,
29,
4444,
255,
570,
10344,
60,
800,
3726,
3726,
31,
589,
470,
30,
4444,
255,
8128,
812,
7758,
29,
1732,
4672,
17,
4444,
255,
8128,
570,
29,
1732,
4672,
2973,
170,
429,
27,
14,
205,
1428,
9,
13,
18303,
7874,
10... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
What is different with window and div widths between firefox and IE
===
I have a web page that uses a scrolling div to display table information. When the window is resized (and also on page load), the display is centered and the div's scrollbar positioned to the right of the page by setting its width. For some reason, the behaviour is different under firefox than IE. IE positions/sizes the div as expected, but firefox seems to make it too wide, such that the scrollbar begins to disappear when the window client width reaches about 800px. I'm using the following methods to set the position and size:
function getWindowWidth() {
var windowWidth = 0;
if (typeof(window.innerWidth) == 'number') {
windowWidth=window.innerWidth;
}
else {
if (document.documentElement && document.documentElement.clientWidth) {
windowWidth=document.documentElement.clientWidth ;
}
else {
if (document.body && document.body.clientWidth) {
windowWidth=document.body.clientWidth;
}
}
}
return windowWidth;
}
function findLPos(obj) {
var curleft = 0;
if (obj.offsetParent) {
curleft = obj.offsetLeft
while (obj = obj.offsetParent) {
curleft += obj.offsetLeft
}
}
return curleft;
}
var bdydiv;
var coldiv;
document.body.style.overflow="hidden";
window.onload=resizeDivs;
window.onresize=resizeDivs;
function resizeDivs(){
bdydiv=document.getElementById('bdydiv');
coldiv=document.getElementById('coldiv');
var winWdth=getWindowWidth();
var rghtMarg = 0;
var colHdrTbl=document.getElementById('colHdrTbl');
rghtMarg = parseInt((winWdth - 766) / 2) - 8;
rghtMarg = (rghtMarg > 0 ? rghtMarg : 0);
coldiv.style.paddingLeft = rghtMarg + "px";
bdydiv.style.paddingLeft = rghtMarg + "px";
var bdydivLft=findLPos(bdydiv);
if ((winWdth - bdydivLft) >= 1){
bdydiv.style.width = winWdth - bdydivLft;
coldiv.style.width = bdydiv.style.width;
}
syncScroll();
}
function syncScroll(){
if(coldiv.scrollLeft>=0){
coldiv.scrollLeft=bdydiv.scrollLeft;
}
}
Note that I've cut out other code which sets height, and other non-relevant parts. The full page can be seen [here][1]. If you go to the link in both IE and firefox, resize width until "800" is displayed in the green box top-right, and resize height until the scrollbar at the right is enabled, you can see the problem. If you then resize the IE width, the scrollbar stays, but if you resize the firefox width wider, the scrollbar begins to disappear. I'm at a loss as to why this is happening....
[1]: http://site1.funddata.com/mozilladivresize.html
| 0 | [
2,
98,
25,
421,
29,
1463,
17,
13,
12916,
9456,
18,
128,
535,
18219,
17,
13,
660,
800,
3726,
3726,
31,
57,
21,
2741,
2478,
30,
2027,
21,
13,
28166,
13,
12916,
20,
3042,
859,
676,
9,
76,
14,
1463,
25,
302,
6560,
13,
5,
290,
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... |
Eclipse: Relocating a git repo from project to workspace
===
I've been working on an Eclipse plug-in project for a while now, and I've run into a situation where I need to split the project up to seperate the test cases from the plug-in package. I'm using git as version control.
To describe this simply, I'm versioning the old project like this:
workspace/
|
+-- myplugin/
|
+-- .git/ <-- Here be the git repository
|
+-- /* Source code, project stuff, etc. */
…and I'm in the situation where I need to work the plugin tests in a seperate project (so that jUnit won't be needed as a required bundle with the plugin). And I'd like the repository to version everything in the workspace. Like this:
workspace/
|
+-- .git/ <-- The repository should be relocated here instead…
|
+-- myplugin/
| |
| +-- /* Source code, project stuff, etc. */
|
+-- myplugin-test/
|
+-- /* Unit tests and stuff… */
Is there a simple way to do this without losing the history of the old project?
| 0 | [
2,
11652,
45,
27777,
21,
13,
10404,
302,
1638,
37,
669,
20,
170,
5582,
800,
3726,
3726,
31,
22,
195,
74,
638,
27,
40,
11652,
10922,
8,
108,
669,
26,
21,
133,
130,
15,
17,
31,
22,
195,
485,
77,
21,
1858,
113,
31,
376,
20,
213... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Detecting 'stealth' web-crawlers
===
*What options are there to detect web-crawlers that do not want to be detected?*
(I know that listing detection techniques will allow the smart stealth-crawler programmer to make a better spider, but I do not think that we will ever be able to block smart stealth-crawlers anyway, only the ones that make mistakes.)
I'm not talking about the nice crawlers such as googlebot and Yahoo! Slurp.
I consider a bot nice if it:
1. identifies itself as a bot in the user agent string
2. reads robots.txt (and obeys it)
I'm talking about the *bad* crawlers, hiding behind common user agents, using my bandwidth and never giving me anything in return.
There are some obvious trapdoors that can be constructed:
1. Adding a directory only listed (marked as disallow) in the robots.txt,
2. Adding invisible links (possibly marked as rel="nofollow"?),
3. detect who doesn't understand CaPiTaLiSaTioN,
4. detect who tries to post replies but always fail the Captcha.
But then there are some crawlers for example that rotate their user agent, come from one netblock and hit my site exactly once every 2:15 minutes; requesting a single, seemingly random, url.
Another example is a crawler that always uses the requested url as the referer but makes only 1 request to the page.
But both do not trigger my bad-bot-trapdoors
**What methods are there to automatically detect the web crawlers trying to mask themselves as normal human visitors.**
| 0 | [
2,
9092,
68,
13,
22,
6100,
192,
96,
22,
2741,
8,
24916,
445,
800,
3726,
3726,
1637,
608,
6368,
50,
80,
20,
9092,
2741,
8,
24916,
445,
30,
107,
52,
259,
20,
44,
11968,
60,
2483,
13,
5,
49,
143,
30,
9554,
11643,
4212,
129,
1655,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
RemoteObject - Cross Domain Issue
===
I am trying to get data from my server, used RemoteObject to accomplish it.
When I run the application on my localhost it works great but when iam using it on my server i get a Channel.Security.Error(Security Error accessing URL).
On the server side logs there is a mention about cross domain .
77.127.194.4 - - [23/Oct/2008 21:15:11] "GET /crossdomain.xml HTTP/1.1" 501
Any one encountered the same problem ? any idea ? | 0 | [
2,
5388,
23793,
13,
8,
919,
4603,
1513,
800,
3726,
3726,
31,
589,
749,
20,
164,
1054,
37,
51,
8128,
15,
147,
5388,
23793,
20,
14570,
32,
9,
76,
31,
485,
14,
3010,
27,
51,
375,
11694,
32,
693,
374,
47,
76,
31,
765,
568,
32,
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... |
always try-catch external resource calls?
===
Should I always wrap external resource calls in a try-catch? (ie. calls to a database or file system) Is there a best practice for error handling when calling external resources? | 0 | [
2,
550,
1131,
8,
18208,
4886,
6577,
3029,
60,
800,
3726,
3726,
378,
31,
550,
8118,
4886,
6577,
3029,
19,
21,
1131,
8,
18208,
60,
13,
5,
660,
9,
3029,
20,
21,
6018,
54,
3893,
329,
6,
25,
80,
21,
246,
1345,
26,
7019,
7988,
76,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
Detect .NET Framework 3.5 SP1 Dependency (cmp. 3.5 w/o SP1)
===
I'm using 3.5 SP1 on my machine, while our customers currently use 3.5 without SP1.
I don't know any way in VS2008 to target the solution or project to 3.5 without SP1, only the 3.5 with SP1 I have installed.
If we use functions or constructors not available in 3.5 w/o SP1 the code will not work properly.
So far we have done testing (in a VM or separate machine) to see if the application breaks, and it does break sometimes when we've used parts of the API not available until SP1. The problem is that it only breaks when the code actually runs, not when the assembly is loaded.
One solution would be to have a machine with VS2008 w/o SP1 and try to compile the project.
However I'd prefer some tool to help me detect a dependency to 3.5 SP1 (due to use of new API, or whatever), either by analyzing the source code, or the assemblies we produce.
My google powers has not been strong enough with this question, any hints? | 0 | [
2,
9092,
13,
9,
2328,
6596,
203,
9,
264,
3782,
165,
26835,
13,
5,
150,
2554,
9,
203,
9,
264,
619,
118,
111,
3782,
165,
6,
800,
3726,
3726,
31,
22,
79,
568,
203,
9,
264,
3782,
165,
27,
51,
1940,
15,
133,
318,
5279,
871,
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,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Generics and Type inference
===
I have an abstract generic class `BLL<T> where T : BusinessObject`. I need to open an assembly that contains a set of concrete BLL classes, and return the tuples (businessObjectType, concreteBLLType) inside a Dictionary. There is the part of the method I could do until now, but I'm having problems to discover T.
protected override Dictionary<Type, Type> DefineBLLs()
{
string bllsAssembly = ConfigurationManager.AppSettings["BLLsAssembly"];
Type[] types = LoadAssembly(bllsAssembly);
Dictionary<Type, Type> bllsTypes = new Dictionary<Type, Type>();
foreach (Type type in types)
{
if (type.IsSubclassOf(typeof(BLL<>)))
/* how to know T in the situation below? */
bllsTypes.Add(??businessObjectType (T)??, type);
}
return bllsTypes;
} | 0 | [
2,
12733,
18,
17,
1001,
25883,
800,
3726,
3726,
31,
57,
40,
8502,
12733,
718,
13,
1,
220,
211,
1,
38,
1,
113,
13,
38,
13,
45,
508,
23793,
1,
9,
31,
376,
20,
368,
40,
1475,
30,
1588,
21,
309,
16,
4105,
334,
211,
2684,
15,
1... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
pass password to su/sudo/ssh
===
I'm writing a C/Shell program that will be doing su or sudo or ssh. They all want their passwords in consol input rather than stdin.
Does anybody know a solution?
Setting up password-less sudo is not an option.
| 0 | [
2,
1477,
20884,
20,
2538,
118,
18,
18601,
118,
18,
1635,
800,
3726,
3726,
31,
22,
79,
1174,
21,
272,
118,
15984,
625,
30,
129,
44,
845,
2538,
54,
13,
18,
18601,
54,
13,
18,
1635,
9,
59,
65,
259,
66,
20884,
18,
19,
1065,
5594,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Assembla no longer free!! :(
===
[http://blog.assembla.com/assemblablog/tabid/12618/bid/6986/Release-2-0-restricting-free-plans-giving-back-with-features-and-pric][1]
I'm very disappointed about this... I use Assembla for my personal projects(commercial) and now I have to move everything to another place!
There are some questions about different free hosting... I extracted some of the sites that offers free hosting for projects:
[http://www.svnhostingcomparison.com/][2]
[http://www.codespaces.com/][3]
If you know about others like assembla please post it!
Cheers from Argentina!
[1]: http://blog.assembla.com/assemblablog/tabid/12618/bid/6986/Release-2-0-restricting-free-plans-giving-back-with-features-and-pric
[2]: http://www.svnhostingcomparison.com/
[3]: http://www.codespaces.com/ | 0 | [
2,
28,
18,
1503,
10754,
90,
1045,
551,
19015,
13,
45,
5,
800,
3726,
3726,
636,
21127,
6903,
220,
5567,
9,
9790,
79,
10754,
9,
960,
118,
9790,
5024,
9086,
5567,
118,
536,
11283,
11698,
22591,
12530,
11283,
118,
3680,
3274,
118,
15202... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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: Hide paths in the "Open resource" dialog
===
Soon its weekend!
Is there any way to define what the "Open resource" dialog in Eclipse should show?
If you work with svn you don't want the *.svn files to show up. ( I know there is a fix out for this one!, but does it exist a more general one? ).
| 0 | [
2,
11652,
45,
3077,
12074,
19,
14,
13,
7,
10157,
6577,
7,
28223,
800,
3726,
3726,
651,
82,
4010,
187,
25,
80,
186,
161,
20,
9267,
98,
14,
13,
7,
10157,
6577,
7,
28223,
19,
11652,
378,
298,
60,
100,
42,
170,
29,
13,
18,
16578,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
jQuery Elementh Swap
===
I have 3 divs where only one is visible by default, they each contain information about a product. Below this divs is a list of 3 images which are images of the products. By default ofcourse the 1st list item is selected and has class="selected". When a different product image is clicks then class="selected" moves to that list item and the div above it changes to hidden and the div containing the other product information needs to appear.
I have searched all over the place for a plugin which can do what I want, they are all limited in some way which stops me doing from doing it. | 0 | [
2,
487,
8190,
93,
4520,
252,
17150,
800,
3726,
3726,
31,
57,
203,
13,
12916,
18,
113,
104,
53,
25,
4560,
34,
12838,
15,
59,
206,
3717,
676,
88,
21,
2374,
9,
1021,
48,
13,
12916,
18,
25,
21,
968,
16,
203,
3502,
56,
50,
3502,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 impact of virtualisation on cryptographically strong random number generators?
===
/dev/random and /dev/urandom use environmental noise to generate randomness.
With a virtualised server there can be multiple instances of an Operating System on one hardware configuration. These operating systems will all be sourcing their randomness from the same environmental noise.
Does this mean as a group the random number generators strength is reduced as all OS instances are basing their calculations of the same input? Or, is the environmental noise partitioned out so that sharing doesn't occur?
If the latter is true, I can see this reducing the effectiveness of /dev/urandom because it reuses its internal pool and with less environmental input, reduces entropy.
/dev/random should be ok because it blocks until enough noise is acquired... unless of course the OS instances are all sharing the input.
So, the question: What is the impact of virtualisation on cryptographically strong random number generators, specifically those that use environmental noise? | 0 | [
2,
98,
25,
14,
2261,
16,
6599,
4330,
27,
16277,
12084,
1326,
966,
5477,
234,
20495,
60,
800,
3726,
3726,
13,
118,
14438,
118,
2195,
5555,
17,
13,
118,
14438,
118,
17692,
5555,
275,
2703,
3406,
20,
7920,
5477,
720,
9,
29,
21,
6599,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
RS232 Communication - Can I use it to create a steady state signal?
===
In all honesty, I think the answer is "no;" however, I want to get a second opinion. Basically, I need one micro-controller device to send a steady signal to another one, but the communicate between them is using RS232. So I think that I have to create/update the communication messages to get it to do what I want.
What do you think? | 0 | [
2,
13,
1224,
20730,
3291,
13,
8,
92,
31,
275,
32,
20,
1600,
21,
5665,
146,
2800,
60,
800,
3726,
3726,
19,
65,
19907,
15,
31,
277,
14,
1623,
25,
13,
7,
251,
73,
7,
207,
15,
31,
259,
20,
164,
21,
153,
4052,
9,
11374,
15,
31,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How to check that a string is a palindrome using regular expressions?
===
That was an interview question that I was unable to answer:
How to check that a string is a palindrome using regular expressions?
p.s. There is already a question "[How to check if the given string is palindrome?][1]" and it gives a lot of answers in different languages, but no answer that uses regular expressions.
[1]: http://stackoverflow.com/questions/52002/how-to-check-if-the-given-string-is-palindrome | 0 | [
2,
184,
20,
2631,
30,
21,
3724,
25,
21,
4370,
108,
22264,
568,
1290,
13832,
60,
800,
3726,
3726,
30,
23,
40,
2421,
1301,
30,
31,
23,
2343,
20,
1623,
45,
184,
20,
2631,
30,
21,
3724,
25,
21,
4370,
108,
22264,
568,
1290,
13832,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 create a menu in HTML without using Javascript?
===
Since many years a GUI-standard are the menu-bars of applications with menus popping up, if you click or hover an entry in the menu-bar. Some websites implement this feature too, but they are using Javascript, as far as I can see. For different reasons Javascript could be a problem, so the question: Is this possible to implement without javascript, only using HTML and CSS? | 0 | [
2,
184,
92,
31,
1600,
21,
11379,
19,
13,
15895,
366,
568,
8247,
8741,
60,
800,
3726,
3726,
179,
151,
122,
21,
9457,
8,
15566,
50,
14,
11379,
8,
1850,
18,
16,
3767,
29,
11379,
18,
24157,
71,
15,
100,
42,
10840,
54,
21350,
40,
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 does SetUnhandledExceptionFilter work in .NET WinForms applications?
===
I am working on a project to enhance our production debugging capabilities. Our goal is to reliably produce a minidump on any unhandled exception, whether the exception is managed or unmanaged, and whether it occurs on a managed or unmanaged thread.
We use the excellent [ClrDump](http://www.debuginfo.com/tools/clrdump.html) library for this currently, but it does not quite provide the exact features we need, and I'd like to understand the mechanisms behind exception filtering, so I set out to try this for myself.
I started out by following this blog article to install an SEH handler myself: <http://blogs.microsoft.co.il/blogs/sasha/archive/2007/12.aspx>. This technique works for console applications, but when I try the same thing from a WinForms application, my filter is not called for any variety of unmanaged exceptions.
What can ClrDump be doing that I'm not doing? ClrDump produces dumps in all cases, so its exception filter must still be called...
Note: I'm aware of ADPlus's capabilities, and we've also considered using the AeDebug registry keys... These are also possibilities, but also have their tradeoffs.
Thanks,
Dave
// Code adapted from <http://blogs.microsoft.co.il/blogs/sasha/archive/2007/12.aspx>
LONG WINAPI MyExceptionFilter(__in struct _EXCEPTION_POINTERS *ExceptionInfo)
{
printf("Native exception filter: %X\n",ExceptionInfo->ExceptionRecord->ExceptionCode);
Beep(1000,1000);
Sleep(500);
Beep(1000,1000);
if(oldFilter_ == NULL)
{
return EXCEPTION_CONTINUE_SEARCH;
}
LONG ret = oldFilter_(ExceptionInfo);
printf("Other handler returned %d\n",ret);
return ret;
}
#pragma managed
namespace SEHInstaller
{
public ref class SEHInstall
{
public:
static void InstallHandler()
{
oldFilter_ = SetUnhandledExceptionFilter(MyExceptionFilter);
printf("Installed handler old=%x\n",oldFilter_);
}
};
}
| 0 | [
2,
184,
630,
309,
1020,
3203,
1294,
10066,
872,
11924,
815,
170,
19,
13,
9,
2328,
628,
4190,
18,
3767,
60,
800,
3726,
3726,
31,
589,
638,
27,
21,
669,
20,
10734,
318,
637,
121,
16254,
2762,
10209,
9,
318,
1195,
25,
20,
13,
19003... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Acceptable memory leak limits
===
I've just started experimenting with SDL in C++, and I thought checking for memory leaks regularly may be a good habit to form early on.
With this in mind, I've been running my 'Hello world' programs through Valgrind to catch any leaks, and although I've removed everything except the most basic `SDL_Init()` and `SDL_Quit()` statements, Valgrind still reports 120 bytes lost and 77k still reachable.
My question is: Is there an acceptable limit for memory leaks, or should I strive to make all my code completely leak-free? | 0 | [
2,
12513,
1912,
11724,
5887,
800,
3726,
3726,
31,
22,
195,
114,
373,
5737,
68,
29,
13,
18,
8643,
19,
272,
20512,
15,
17,
31,
289,
9886,
26,
1912,
11724,
18,
4217,
123,
44,
21,
254,
9474,
20,
505,
274,
27,
9,
29,
48,
19,
594,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
I'm looking for recomendations for ActiveX Components for processing emails.
===
I'm looking for ActiveX components that can easily:
- get and send emails via SMTP and POP3
- strip out and save attachments.
- Convert RTF (Outlook emails) to HTML
- Sanitize HTML.
What components would you recommend? What components do you use? | 0 | [
2,
31,
22,
79,
699,
26,
302,
960,
2451,
7504,
26,
1348,
396,
5090,
26,
5511,
8517,
18,
9,
800,
3726,
3726,
31,
22,
79,
699,
26,
1348,
396,
5090,
30,
92,
2351,
45,
13,
8,
164,
17,
2660,
8517,
18,
1197,
7613,
13726,
17,
1675,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Pass Viewdata as member from other viewdata to RenderPartial makes the first null
===
The strongly typed SearchViewData has a field called Colors that in it's turn is a ColorViewData.
In my /Colors.mvc/search I populate this viewData.Model.Colors based on the given search criteria.
Then, based on several factors, I render one of a set of user controls that are able to render itself with a ColorViewData.
So I will end up with
<%Html.RenderPartial("~/Views/Color/_ColorList.ascx", ViewData.Model.Colors);%>
This used to work just fine, but since the upgrade to the beta1, my user control always ends up with viewdata = null;
Suggestions? | 0 | [
2,
1477,
1418,
18768,
28,
322,
37,
89,
1418,
18768,
20,
16535,
3091,
2815,
1364,
14,
64,
16203,
800,
3726,
3726,
14,
5020,
1001,
43,
2122,
4725,
18768,
63,
21,
575,
227,
5268,
30,
19,
32,
22,
18,
805,
25,
21,
1665,
4725,
18768,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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.