unified_texts stringlengths 32 30.1k | OpenStatus_id int64 0 4 | input_ids list | token_type_ids list | attention_mask list |
|---|---|---|---|---|
Asp.net c# and logging ip access on every page and frequency
===
Are there any prebuilt modules for this? Is there an event thats called everytime a page is loaded? I'm just trying to secure one of my more important admin sections. | 0 | [
2,
28,
306,
9,
2328,
272,
5910,
17,
13,
13919,
15735,
1381,
27,
352,
2478,
17,
5328,
800,
3726,
3726,
50,
80,
186,
782,
8607,
17113,
26,
48,
60,
25,
80,
40,
807,
30,
18,
227,
352,
891,
21,
2478,
25,
8572,
60,
31,
22,
79,
114... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
Direct Path Load of TimeStamp Data With SQL*LDR
===
The SQL-LDR documentation states that you need to do a convetional Path Load:
> When you want to apply SQL functions
> to data fields. SQL functions are not
> available during a direct path load
I have TimeStamp data stored in a CSV file that I'm loading with SQL-LDR by describing the fields as such:
STARTTIME "To_TimeStamp(:STARTTIME,'YYYY-MM-DD HH24:MI:SS.FF6')",
COMPLETIONTIME "To_TimeStamp(:COMPLETIONTIME,'YYYY-MM-DD HH24:MI:SS.FF6')"
So my question is: Can you load timestamp data without a function, or is it the case that you can not do a Direct Path Load when Loading TimeStamp data?
| 0 | [
2,
1744,
2013,
6305,
16,
436,
38,
10158,
1054,
29,
4444,
255,
2483,
255,
3807,
800,
3726,
3726,
14,
4444,
255,
8,
255,
3807,
13945,
202,
30,
42,
376,
20,
107,
21,
1065,
195,
3309,
192,
2013,
6305,
45,
13,
1,
76,
42,
259,
20,
5... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
WCF service for recieving image
===
What is the best way to create a webservice for accepting an image.
The image might be quite big and I do not want to change the default recieve size for the web application.
I have written one that accepts a binary image but that I feel that there has to be a better alternative. | 0 | [
2,
11801,
410,
365,
26,
13,
15110,
2443,
68,
1961,
800,
3726,
3726,
98,
25,
14,
246,
161,
20,
1600,
21,
2741,
11449,
26,
10894,
40,
1961,
9,
14,
1961,
530,
44,
1450,
580,
17,
31,
107,
52,
259,
20,
753,
14,
12838,
302,
10486,
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 aren't Java Collections remove methods generic?
===
Why isn't [Collection.remove(Object o)][1] generic?
Seems like `Collection<E>` could have `boolean remove(E o);`
Then, when you accidentally try to remove (for example) `Set<String>` instead of each individual String from a `Collection<String>`, it would be a compile time error instead of a debugging problem later.
[1]: http://java.sun.com/javase/6/docs/api/java/util/Collection.html#remove(java.lang.Object) | 0 | [
2,
483,
4847,
22,
38,
8247,
5721,
4681,
3195,
12733,
60,
800,
3726,
3726,
483,
2532,
22,
38,
636,
15015,
872,
9,
99,
16598,
5,
23793,
635,
6,
500,
2558,
165,
500,
12733,
60,
2206,
101,
13,
1,
15015,
872,
1,
62,
1,
110,
57,
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... |
Reduce startup time of .NET windows form app running off of a networked drive
===
I have a simple .NET 2.0 windows form app that runs off of a networked drive (e.g. \\MyServer\MyShare\app.exe). It's very basic, and only loads the bare minimum .NET libraries. However, it still takes ~6-10 seconds to load. People think something must be wrong that app so small takes so long to load.
Are there any suggestions for improving the startup speed? | 0 | [
2,
4136,
20205,
85,
16,
13,
9,
2328,
1936,
505,
4865,
946,
168,
16,
21,
982,
69,
1493,
800,
3726,
3726,
31,
57,
21,
1935,
13,
9,
2328,
172,
9,
387,
1936,
505,
4865,
30,
1461,
168,
16,
21,
982,
69,
1493,
13,
5,
62,
9,
263,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Winform application profiling CPU usage / spikes . .
===
I have a winforms application that normally is at about 2-4% CPU. We are seeing some spikes up to 27% of CPU for limited number of times. What is the best profiling tool to determine what is actually causing this spike. We use dottrace but i dont see how to map that to exactly the CPU spikes?
Appreciate the help | 0 | [
2,
628,
4190,
3010,
8721,
49,
802,
17578,
7514,
13,
118,
6734,
18,
13,
9,
13,
9,
800,
3726,
3726,
31,
57,
21,
628,
4190,
18,
3010,
30,
4147,
25,
35,
88,
172,
8,
2708,
17578,
9,
95,
50,
2078,
109,
6734,
18,
71,
20,
13,
25633,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Rails Sessions over servers
===
I'd like to have some rails apps over different servers sharing the same session. I can do it within the same server but don't know if it is possible to share over different servers. Anyone already did or knows how to do it?
Thanks | 0 | [
2,
2240,
18,
5763,
84,
17595,
800,
3726,
3726,
31,
22,
43,
101,
20,
57,
109,
2240,
18,
4865,
18,
84,
421,
17595,
6126,
14,
205,
3723,
9,
31,
92,
107,
32,
363,
14,
205,
8128,
47,
221,
22,
38,
143,
100,
32,
25,
938,
20,
1891,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
Default Printer in Unmanaged C++
===
I'm looking for a way to find the name of the Windows default printer using unmanaged C++ (found plenty of .NET examples, but no success unmanaged). Thanks. | 0 | [
2,
12838,
12925,
19,
367,
177,
8030,
272,
20512,
800,
3726,
3726,
31,
22,
79,
699,
26,
21,
161,
20,
477,
14,
204,
16,
14,
1936,
12838,
12925,
568,
367,
177,
8030,
272,
20512,
13,
5,
12235,
7062,
16,
13,
9,
2328,
3770,
15,
47,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
C#: Test if string is a guid without throwing exceptions?
===
i want to try to convert a string to a Guid, but i don't want to rely on catching exceptions (for performance reasons - exceptions are expensive). In other words the code:
public static Boolean TryStrToGuid(String s, out Guid value)
{
try
{
value = new Guid(s);
return true;
}
catch
{
value = Guid.Empty;
return false;
}
}
is not suitable.
i would try using RegEx, but since the guid can be parenthesis wrapped, brace wrapped, none wrapper, makes it hard.
Additionally, i thought certain Guid values are invalid(?) | 0 | [
2,
272,
5910,
45,
1289,
100,
3724,
25,
21,
9457,
43,
366,
6033,
13392,
60,
800,
3726,
3726,
31,
259,
20,
1131,
20,
8406,
21,
3724,
20,
21,
9457,
43,
15,
47,
31,
221,
22,
38,
259,
20,
12139,
27,
9436,
13392,
13,
5,
1106,
956,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
"SetPropertiesRule" warning message when starting Tomcat from Eclipse
===
When I start Tomcat (6.0.18) from Eclipse (3.4), I receive this message (first in the log):
> WARNING:
> [SetPropertiesRule]{Server/Service/Engine/Host/Context}
> Setting property 'source' to
> 'org.eclipse.jst.jee.server: (project name)'
> did not find a matching property.
Seems this message does not have any severe impact, however, does anyone know how to get rid of it? | 0 | [
2,
13,
7,
3554,
10890,
106,
3915,
16154,
7,
3590,
2802,
76,
1422,
2067,
5782,
37,
11652,
800,
3726,
3726,
76,
31,
799,
2067,
5782,
13,
5,
379,
9,
387,
9,
1087,
6,
37,
11652,
13,
5,
240,
9,
300,
6,
15,
31,
2588,
48,
2802,
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... |
Looking for C# registry class
===
Looking for C# class which wraps calls to do the following:
read and write a key value
read & write a key entry
enumerate the entries in a key. This is important. For example, need to list all entries in:
HKEY_LOCAL_MACHINE\SOFTWARE\ODBC\ODBC.INI\ODBC Data Sources
(I scanned through some codeproject.com registry classes and they didn't enumerate) | 0 | [
2,
699,
26,
272,
5910,
18269,
718,
800,
3726,
3726,
699,
26,
272,
5910,
718,
56,
8118,
18,
3029,
20,
107,
14,
249,
45,
1302,
17,
2757,
21,
1246,
1923,
1302,
279,
2757,
21,
1246,
2792,
26940,
62,
14,
11399,
19,
21,
1246,
9,
48,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
PHP :: Emulate <form method="post">, forwarding user to page
===
I'm working on a PHP application that links into the Protx VSP Direct payment gateway. To handle "3D Secure" requests from the credit card processing company, I need to forward the user to a different website, mimicking a form that has been posted. I'm trying to use the cURL libraries, but seem to have hit a problem. My code is the following:
<?php
$ch = curl_init();
// Set the URL
curl_setopt($ch, CURLOPT_URL, 'http://www.google.com/');
// Perform a POST
curl_setopt($ch, CURLOPT_POST, 1);
// If not set, curl prints output to the browser
curl_setopt($ch, CURLOPT_RETURNTRANSFER, 0);
// Set the "form fields"
curl_setopt($ch, CURLOPT_POSTFIELDS, $fields);
$output = curl_exec($ch);
curl_close($ch);
?>
All this does is grab the content of the URL passed through, and doesn't forward the user anywhere. I've tried Googling and reading up as much as I can, but can't figure out what i'm missing. Any ideas? I don't want to have to create a HTML form that auto-submits itself if I can avoid it.
Thanks for any help :-) | 0 | [
2,
13,
26120,
13,
45,
45,
23804,
13,
1,
4190,
2109,
3726,
7,
6962,
7,
1,
15,
917,
68,
4155,
20,
2478,
800,
3726,
3726,
31,
22,
79,
638,
27,
21,
13,
26120,
3010,
30,
6271,
77,
14,
895,
38,
396,
4611,
306,
1744,
7582,
12171,
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... |
Automating interaction with a HTML game using C#?
===
There are some HTML based games (ie bootleggers.us) that have a simple login form and after that your entire game experience revolves around submitting various forms and reading information from the website itself.
My Question is, **what is the best way to go about writing a bot / automate the html-based game using C#**?
My initial thought is to use the System.Net.HttpRequest and WebRequest classes to get the source html and parse using regexs to get the desired information.
However, I would like to avoid this if it is at all possible. Are there any solutions that abstract away some of this and make automating website interaction easier? Ie filling out forms, submitting forms, reading values from the website, etc? Some library? | 0 | [
2,
3108,
79,
1880,
7754,
29,
21,
13,
15895,
250,
568,
272,
5910,
60,
800,
3726,
3726,
80,
50,
109,
13,
15895,
432,
466,
13,
5,
660,
26096,
11896,
9,
267,
6,
30,
57,
21,
1935,
6738,
108,
505,
17,
75,
30,
154,
1078,
250,
1496,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Dealing with the rate of change in software development
===
It seems as though the rate of change is picking up speed these days.
I am primarily a .NET developer, and in that sphere alone there are probably close to a dozen fascinating emerging technologies, some of them real game-changers, that I just don't have time to delve into. It would literally take months, and of course I have work to do.
A few examples of new technologies that should probably be a part of my arsenal include:
1. Entity Framework
2. Windows Workflow Foundation
3. Silverlight 2
4. ADO.NET Data Services
5. SQL Server 2008
6. IIS 7
...And that's just off the top of my head.
I read an article by Rocky Lhotka (.NET legend, inventor of CSLA, etc) where he mentioned, almost in passing, that last year he felt very overwheled by the rate of change. If a genius like Llhotka feels the pressure, that isn't good news for us mortals!
So, how do you guys stay on top of this? Do you just chalk it up to the fact that development is vast, and it's more important to be able to find things quickly than to learn it all? Or do you have a continuing education strategy that actually allows you to stay close to the cutting edge? | 0 | [
2,
5746,
29,
14,
1684,
16,
753,
19,
2306,
522,
800,
3726,
3726,
32,
2206,
28,
362,
14,
1684,
16,
753,
25,
7833,
71,
1362,
158,
509,
9,
31,
589,
2257,
21,
13,
9,
2328,
10058,
15,
17,
19,
30,
9228,
1056,
80,
50,
910,
543,
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 do I remove loadbalancer pollution from my access logs
===
I have a pair of Sun web servers (iws6) sitting behind a load balancer. It likes to know if the web servers are up and continually asks for /alive.html.
That is fine but how do I not log that in my access log?
Failing that, how could I have the archiver strip out that accesses when it roles the file over?
I would prefer something more elegant that cron calling grep -v alive.html | 0 | [
2,
184,
107,
31,
4681,
6305,
24140,
139,
11483,
37,
51,
1381,
18893,
800,
3726,
3726,
31,
57,
21,
2146,
16,
939,
2741,
17595,
13,
5,
49,
10268,
379,
6,
1805,
439,
21,
6305,
4468,
139,
9,
32,
101,
18,
20,
143,
100,
14,
2741,
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... |
Sharing binary folders in Visual Studio
===
For a long time i have tried to work out the best way to access certain site files which i don't wish to be apart of a project or to ease integration with multiple developers (and talents, e.g. designers) on a single project.
A lot of sites i have created have had folders with large amounts of images and other binary files which i have not wanted to include in a visual studio project and/or source control mainly due to the constant updating of their contents. I have seen some people use virtual directories however there is no way to use virtual directories if you are using visual studio's built in web server.
As far as i see it, ideally, folders containing binaries could be located on a central server and mapped to a project. Alernatively i have considered creating separate sub-domains for each project with which all images / binaries can be refereced via, e.g. `http://project.client.customer.com/images`
Any thoughts? | 0 | [
2,
6126,
14171,
19294,
18,
19,
3458,
1120,
800,
3726,
3726,
26,
21,
175,
85,
31,
57,
794,
20,
170,
70,
14,
246,
161,
20,
1381,
1200,
689,
6488,
56,
31,
221,
22,
38,
2536,
20,
44,
2629,
16,
21,
669,
54,
20,
6378,
8078,
29,
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... |
Command Pattern : How to pass parameters to a command ?
===
My question is related to the command pattern, where we have the following abstraction (C# code) :
public interface ICommand
{
Execute();
}
Let's take a simple concrete command, which aims to delete an entity from our application. A `Person` instance, for example.
I'll have a `DeletePersonCommand`, which implements `ICommand`. This command needs the `Person` to delete as a parameter, in order to delete it when `Execute` method is called.
What is the best way to manage parametrized commands ? How to pass parameters to commands, before executing them ?
| 0 | [
2,
1202,
3732,
13,
45,
184,
20,
1477,
12905,
20,
21,
1202,
13,
60,
800,
3726,
3726,
51,
1301,
25,
1597,
20,
14,
1202,
3732,
15,
113,
95,
57,
14,
249,
23907,
13,
5,
150,
5910,
1797,
6,
13,
45,
317,
6573,
31,
16239,
13,
1,
156... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 .NET performance counter to show the rate of p/invoke calls being made?
===
Is there a .NET performance counter to show the rate of p/invoke calls made? I've just noticed that the application I'm debugging was making a call into native code from managed land within a tight loop. The intended implementation was for a p/invoke call to be made once and then cached. I'm wondering if I could have noticed this mistake via a CLR Interop or Remoting .NET performance counter. Any ideas? | 0 | [
2,
25,
80,
21,
13,
9,
2328,
956,
2105,
20,
298,
14,
1684,
16,
351,
118,
108,
2625,
1048,
3029,
142,
117,
60,
800,
3726,
3726,
25,
80,
21,
13,
9,
2328,
956,
2105,
20,
298,
14,
1684,
16,
351,
118,
108,
2625,
1048,
3029,
117,
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... |
Position An HTML Element Relative to its Container Using CSS
===
I'm trying to create a horizontal 100% stacked-bar graph using HTML and CSS. I'd like to create the bars using DIVs with background colors and percentage widths depending on the values I want to graph. I also want to have a grid lines to mark an arbitrary position along the graph.
In my experimentation, I've already gotten the bars to stack horizontally by assigning the css property float: left. However, I'd like to avoid that, as it really seems to mess with the layout in confusing ways. Also, the grid lines don't seem to work very well when the bars are floated.
I think that CSS positioning should be able to handle this, but I don't yet know how to do it. I want to be able to specify the position of several elements relative to the top-left corner of their container. I run into this sort of issue regularly (even outside of this particular graph project), so I'd like a method that's:
1. Cross-browser (ideally without too many browser hacks)
1. Runs in Quirks mode
1. As clear/clean as possible, to facilitate customizations
1. Done without Javascript if possible. | 0 | [
2,
649,
40,
13,
15895,
4520,
4543,
20,
82,
12147,
568,
272,
18,
18,
800,
3726,
3726,
31,
22,
79,
749,
20,
1600,
21,
10095,
12849,
20054,
8,
1850,
7210,
568,
13,
15895,
17,
272,
18,
18,
9,
31,
22,
43,
101,
20,
1600,
14,
6062,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Testing Abstract Class Concrete Methods
===
How would design and organize tests for the concrete methods of an abstract class? Specifically in .NET. | 0 | [
2,
4431,
8502,
718,
4105,
3195,
800,
3726,
3726,
184,
83,
704,
17,
9213,
4894,
26,
14,
4105,
3195,
16,
40,
8502,
718,
60,
3524,
19,
13,
9,
2328,
9,
3,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
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... |
What is the best way to inspect STL containers in Visual Studio debugging?
===
If I have a std::vector or std::map variable, and I want to see the contents, it's a big pain to see the nth element while debugging. Is there a plugin, or some trick to making it easier to watch STL container variables while debugging (VS2003/2005/2008)? | 0 | [
2,
98,
25,
14,
246,
161,
20,
19,
7350,
354,
255,
18988,
19,
3458,
1120,
121,
16254,
2762,
60,
800,
3726,
3726,
100,
31,
57,
21,
354,
43,
45,
45,
28033,
54,
354,
43,
45,
45,
15022,
7612,
15,
17,
31,
259,
20,
196,
14,
8478,
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... |
ORM tools for Haskell
===
What is the best way to interact with a database using Haskell? I'm accustomed to using some sort of ORM (Django's ORM, hibernate, etc.) and something similar would be nice when creating apps with [HAppS][1].
[1]: http://www.happs.org/ | 0 | [
2,
54,
79,
4672,
26,
63,
16507,
800,
3726,
3726,
98,
25,
14,
246,
161,
20,
10001,
29,
21,
6018,
568,
63,
16507,
60,
31,
22,
79,
20946,
20,
568,
109,
2058,
16,
54,
79,
13,
5,
14365,
14541,
22,
18,
54,
79,
15,
4148,
2102,
8820... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 implement a two-pass scanner using GNU Flex?
===
As a pet-project, I'd like to attempt to implement a basic language of my own design that can be used as a web-scripting language. It's trivial to run a C++ program as an Apache CGI, so the real work lies in how to parse an input file containing non-code (HTML/CSS markup) and server-side code.
In my undergrad compiler course, we used [Flex][1] and [Bison][2] to generate a scanner and a parser for a simple language. We were given a copy of the grammar and wrote a parser that translated the simple language to a simple assembly for a virtual machine. The flex scanner tokenizes the input, and passes the tokens to the Bison parser.
The difference between that and what I'd like to do is that like PHP, this language could have plain HTML markup and the scripting language interspersed like the following:
<p>Hello,
<? echo "World ?>
</p>
Am I incorrect in assuming that it would be efficient to parse the input file as follows:
1. Scan input until a script start tag is found ('<?' used as an arbitray example above')
2. Second scanner tokenizes the server-side script section of the input file (from the open tag: '<?' to the close tag: '?>') and passes the token to the parser, which has no need to know about the markup in the file.
3. Control is returned to the first scanner that continues this general pattern.
Basically, the first scanner only differentiates between Markup (which is returned directly to the browser unmodified) and code, which is passed to the second scanner, which in turn tokenizes the code and passes the tokens to the parser.
If this is *not* a solid design pattern, how do languages such as PHP handle scanning input and parsing code efficiently?
[1]: http://www.gnu.org/software/flex/
[2]: http://www.gnu.org/software/bison/ | 0 | [
2,
184,
107,
31,
8713,
21,
81,
8,
6201,
23195,
568,
26092,
14409,
60,
800,
3726,
3726,
28,
21,
3170,
8,
21011,
15,
31,
22,
43,
101,
20,
1735,
20,
8713,
21,
2125,
816,
16,
51,
258,
704,
30,
92,
44,
147,
28,
21,
2741,
8,
8741,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 use LGPL library in BSD/X11 licensed project?
===
I am writing a small general purpose library, which i would like to use in my BSD/X11 licensed project. I want to include globalisation support in it, specifficaly, i would like to use [Glib::ustring](http://www.gtkmm.org/docs/glibmm-2.4/docs/reference/html/classGlib_1_1ustring.html) from glibmm, which is licensed under LGPL. Here comes the question: With regards to BSD/X11 being more permissive than LGPL, can i use this piece of code in my BSD/X11 licensed library? | 0 | [
2,
92,
31,
275,
13,
10641,
5727,
1248,
19,
334,
18,
43,
118,
396,
1306,
6392,
669,
60,
800,
3726,
3726,
31,
589,
1174,
21,
284,
297,
2131,
1248,
15,
56,
31,
83,
101,
20,
275,
19,
51,
334,
18,
43,
118,
396,
1306,
6392,
669,
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 Help: Selecting Rows That Appear A Certain Number Of Times
===
I have a table with a "Date" column. Each Date may appear multiple times. How do I select only the dates that appear < k number of times? | 0 | [
2,
4444,
255,
25597,
448,
45,
20764,
11295,
30,
1893,
21,
1200,
234,
16,
436,
800,
3726,
3726,
31,
57,
21,
859,
29,
21,
13,
7,
8209,
7,
4698,
9,
206,
1231,
123,
1893,
1886,
436,
9,
184,
107,
31,
5407,
104,
14,
4076,
30,
1893,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
ReSharper giving C# 3.0 Code Inspection Warnings to .NET 2.0 Projects
===
When I am working in .NET 2.0 projects with the newest version of ReSharper (4.1) I am getting warnings about using the var keyword and lambadas etc.. Any idea how I can disable this only for .NET 2.0 projects? | 0 | [
2,
302,
23646,
106,
1438,
272,
5910,
203,
9,
387,
1797,
9762,
3590,
18,
20,
13,
9,
2328,
172,
9,
387,
2314,
800,
3726,
3726,
76,
31,
589,
638,
19,
13,
9,
2328,
172,
9,
387,
2314,
29,
14,
17175,
615,
16,
302,
23646,
106,
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... |
Please explain thread local storage for Python.
===
In Python specifically, how do variables get shared between threads?
Although I have used threading.Thread before I never really understood or saw examples of how variables got shared. Are they shared between the main thread and the children or only among the children?
I have seen many warnings about synchronizing access to shared data among threads by using locks but I have yet to see a really good example of the problem.
Thanks in advance! | 0 | [
2,
2247,
3271,
9322,
375,
4326,
26,
20059,
9,
800,
3726,
3726,
19,
20059,
3524,
15,
184,
107,
12157,
164,
2592,
128,
20396,
60,
419,
31,
57,
147,
9322,
68,
9,
96,
10647,
115,
31,
243,
510,
4014,
54,
441,
3770,
16,
184,
12157,
33... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Do you test private method?
===
I have read the post about how to test private (http://stackoverflow.com/questions/34571/whats-the-best-way-of-unit-testing-private-methods) method because I usually do not test them, I always thought it's more fast to only test public method that will be called from the external of the object.
Do you test private method? or Should I always test private method? | 0 | [
2,
107,
42,
1289,
932,
2109,
60,
800,
3726,
3726,
31,
57,
1302,
14,
678,
88,
184,
20,
1289,
932,
13,
5,
21127,
6903,
25325,
2549,
9990,
9,
960,
118,
24652,
18,
16842,
26999,
8197,
608,
18,
8,
124,
8,
4936,
8,
1443,
8,
1041,
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... |
C++ 'mutable' keyword
===
A while ago I came across some code that marked a member variable of a class with the 'mutable' keyword. As far as I can see it simply allows you to modify a variable in a 'const' method:
class Foo
{
private:
mutable bool done_;
public:
void doSomething() const { ...; done_ = true; }
};
Is this the only use of this keyword or is there more to it than meets the eye? I have since used this technique in a class, marking a boost::mutex as mutable allowing const functions to lock it for thread-safety reasons, but, to be honest, it feels like a bit of a hack. | 0 | [
2,
272,
20512,
13,
22,
7903,
579,
22,
1246,
9587,
800,
3726,
3726,
21,
133,
1464,
31,
281,
464,
109,
1797,
30,
2739,
21,
322,
7612,
16,
21,
718,
29,
14,
13,
22,
7903,
579,
22,
1246,
9587,
9,
28,
463,
28,
31,
92,
196,
32,
165... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How do you resolve crashing Windbg Logger on Vista?
===
I would like to use the [Logger][1] tool that ships with the [Microsoft Debugging Tools for Windows][2]. However, on Vista it crashes even with built-in Vista applications:
> logger calc
or
> logger notepad
The issue occurs if I run the tool from a command prompt with or without administrator rights. I'm using version 3.01 (3/20/2008).
The last thing the Logger output window shows is "Verbose log Enabled".
If I attach a debugger I see that an "Access violation writing location 0x000000" error has occurred with the following call stack:
logexts.dll!_LogGetCategory@20() + 0xb bytes
logger.exe!PopulateLogextsSettings() + 0x31 bytes
logger.exe!SettingsDlgProc() + 0x48 bytes
user32.dll!_InternalCallWinProc@20() + 0x23 bytes
user32.dll!_UserCallDlgProcCheckWow@32() - 0x19bc bytes
user32.dll!_DefDlgProcWorker@20() + 0x7f bytes
user32.dll!_DefDlgProcA@16() + 0x22 bytes
user32.dll!_InternalCallWinProc@20() + 0x23 bytes
user32.dll!_UserCallWinProcCheckWow@32() + 0xb3 bytes
user32.dll!_SendMessageWorker@20() + 0xd5 bytes
user32.dll!_InternalCreateDialog@28() + 0x700 bytes
user32.dll!_InternalDialogBox@24() + 0xa3 bytes
user32.dll!_DialogBoxIndirectParamAorW@24() + 0x36 bytes
user32.dll!_DialogBoxParamA@20() + 0x4c bytes
logger.exe!ChooseSettings() + 0x24 bytes
logger.exe!InitLogexts() + 0x84 bytes
logger.exe!DebuggerLoop() + 0x210 bytes
logger.exe!_WinMain@16() + 0x215 bytes
logger.exe!__initterm_e() + 0x1a1 bytes
kernel32.dll!@BaseThreadInitThunk@12() + 0x12 bytes
ntdll.dll!___RtlUserThreadStart@8() + 0x27 bytes
ntdll.dll!__RtlUserThreadStart@8() + 0x1b bytes
Anybody encountered this issue and know how to fix it?
[1]: http://msdn.microsoft.com/en-us/library/cc266316.aspx
[2]: http://www.microsoft.com/whdc/DevTools/Debugging/default.mspx
| 0 | [
2,
184,
107,
42,
9854,
14604,
1511,
19924,
13,
29480,
27,
13520,
60,
800,
3726,
3726,
31,
83,
101,
20,
275,
14,
636,
29480,
500,
2558,
165,
500,
5607,
30,
2034,
29,
14,
636,
22019,
12980,
121,
16254,
2762,
4672,
26,
1936,
500,
255... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
MSI installer: Adding multiple properties to SecureCustomProperties
===
I'm looking for a way to add multiple properties to the SecureCustomProperties value in my .msi installer's property table. I've tried comma delimiting, semi-colon delimiting, and even space delimiters. None of the above seem to work.
Hints? | 0 | [
2,
4235,
49,
16146,
106,
45,
4721,
1886,
3704,
20,
4315,
4636,
6015,
10890,
106,
3915,
800,
3726,
3726,
31,
22,
79,
699,
26,
21,
161,
20,
3547,
1886,
3704,
20,
14,
4315,
4636,
6015,
10890,
106,
3915,
1923,
19,
51,
13,
9,
79,
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... |
C# - How do you get total amount of RAM the computer has?
===
I'm wanting to get the total amount of RAM my computer has using C#.
Using the PerformanceCounter I can get the amount of Available ram, by setting:
counter.CategoryName = "Memory";
counter.Countername = "Available MBytes";
But I can't seem to find a way to get the total amount of memory. How would I go about doing this? | 0 | [
2,
272,
5910,
13,
8,
184,
107,
42,
164,
600,
2006,
16,
2843,
14,
1428,
63,
60,
800,
3726,
3726,
31,
22,
79,
4638,
20,
164,
14,
600,
2006,
16,
2843,
51,
1428,
63,
568,
272,
5910,
9,
568,
14,
956,
24416,
31,
92,
164,
14,
2006,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How to create a GUID in Javascript?
===
I'm trying to create globally-unique identifiers in Javascript. I'm not sure what routines are available on all browsers, how "random" and seeded the built-in random number generator is, etc..
The GUID's should be at least 32 characters and should stay in the ASCII range to avoid trouble when passing them around. | 0 | [
2,
184,
20,
1600,
21,
9457,
43,
19,
8247,
8741,
60,
800,
3726,
3726,
31,
22,
79,
749,
20,
1600,
18861,
8,
1020,
5312,
25570,
18,
19,
8247,
8741,
9,
31,
22,
79,
52,
562,
98,
8275,
18,
50,
904,
27,
65,
16495,
18,
15,
184,
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... |
What are the best design patterns books you have read?
===
What are your favorite ones? | 4 | [
2,
98,
50,
14,
246,
704,
6282,
964,
42,
57,
1302,
60,
800,
3726,
3726,
98,
50,
154,
3839,
53,
18,
60,
3,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
How can I run associate .sh files with Cygwin?
===
I'd like to run a long rsync command in Cygwin by double clicking on a .sh file in Windows. It must start in the file's containing directory (e.g. /cygdrive/c/scripts/) so that relative paths work. Anyone gotten this to work? | 0 | [
2,
184,
92,
31,
485,
4169,
13,
9,
1635,
6488,
29,
6728,
263,
4181,
60,
800,
3726,
3726,
31,
22,
43,
101,
20,
485,
21,
175,
761,
9507,
150,
1202,
19,
6728,
263,
4181,
34,
1494,
25590,
27,
21,
13,
9,
1635,
3893,
19,
1936,
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... |
What are some good techniques to convert an Ms Access application to a .Net Application?
===
We have a 12-year-old Ms Access app that we use for our core inventory warehousing and invoicing system. It IS already running on an SQL Server backend, but all the "logic", forms and reports are in Access. After experiencing the massive amounts of maintenance sludge it took to turn inventory transactions from non-temporal to temporal, I realized that I need to someday convert this thing into code so I can better manage the logic in a much more maintainable and testable environment.
What are some techniques that would allow me to convert it into a .Net application in a manageable and efficient manner?
One idea was to convert the queries to stored procedures, then convert the app into an Adp project.But I am still clueless as to how to handle the forms and reports.
Also, I am the only developer for my company, if that matters. | 0 | [
2,
98,
50,
109,
254,
4212,
20,
8406,
40,
4235,
1381,
3010,
20,
21,
13,
9,
2328,
3010,
60,
800,
3726,
3726,
95,
57,
21,
390,
8,
731,
8,
1218,
4235,
1381,
4865,
30,
95,
275,
26,
318,
2884,
13875,
176,
4362,
1291,
68,
17,
19,
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... |
Are locks unnecessary in multi-threaded Python code because of the GIL?
===
If you are relying on an implementation of Python that has a Global Interpreter Lock (i.e. CPython) and writing multithreaded code, do you really need locks at all?
If the GIL doesn't allow multiple instructions to be executed in parallel, wouldn't shared data be unnecessary to protect?
sorry if this is a dumb question, but it is something I have always wondered about Python on multi-processor/core machines.
same thing would apply to any other language implementation that has a GIL. | 0 | [
2,
50,
12941,
16435,
19,
1889,
8,
96,
10647,
69,
20059,
1797,
185,
16,
14,
4730,
60,
800,
3726,
3726,
100,
42,
50,
21760,
27,
40,
6123,
16,
20059,
30,
63,
21,
2062,
19336,
3991,
13,
5,
49,
9,
62,
9,
9750,
93,
11570,
6,
17,
1... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
CSS: Display differences
===
What is the difference between display:block and display:inline | 0 | [
2,
272,
18,
18,
45,
3042,
4921,
800,
3726,
3726,
98,
25,
14,
2841,
128,
3042,
45,
12048,
17,
3042,
45,
108,
1143,
3,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
What is the most interresting design pattern you've ever met ?
===
Most of us have already used the casual patterns such as MVC, strategy, etc.
But there must be some unusual solutions to unusal problems, and I'd like to hear about it. | 0 | [
2,
98,
25,
14,
127,
1480,
11466,
68,
704,
3732,
42,
22,
195,
462,
798,
13,
60,
800,
3726,
3726,
127,
16,
182,
57,
614,
147,
14,
10093,
6282,
145,
28,
307,
8990,
15,
4427,
15,
2722,
9,
47,
80,
491,
44,
109,
4706,
6776,
20,
36... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
Production Logging in Flex
===
Is there any way to capture the trace statements of your Flex app while not running in debug mode?
Or is there any other way to output logging information when not running a debugger?
Currently I'm trying to fix a bug that only presents itself in very specific deployment scenario, but I could see this being useful in some instances for customers to send logs to tech support when they are reporting bugs or other problems. | 0 | [
2,
637,
13,
13919,
19,
14409,
800,
3726,
3726,
25,
80,
186,
161,
20,
3683,
14,
5565,
9015,
16,
154,
14409,
4865,
133,
52,
946,
19,
121,
16254,
3740,
60,
54,
25,
80,
186,
89,
161,
20,
5196,
13,
13919,
676,
76,
52,
946,
21,
121,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 an easy way to get Apache Tomcat to reboot automatically after a deployment?
===
Our project uses Cruise Control to both build and hot deploy a web application to a remote server (via FTP) running Tomcat in the form of a .war file. Unfortunately, "hot" deploys don't appear to work properly, causing us to reboot Tomcat in response to each deployment. We would really like to do this auto-magically, much like the build itself. Is there an easy way to do this?
| 0 | [
2,
25,
80,
40,
2010,
161,
20,
164,
17140,
2067,
5782,
20,
25312,
7499,
75,
21,
10475,
60,
800,
3726,
3726,
318,
669,
2027,
6581,
569,
20,
156,
1895,
17,
1047,
17617,
21,
2741,
3010,
20,
21,
5388,
8128,
13,
5,
5034,
1187,
306,
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... |
Why use windbg vs the Visual Studio (VS) debugger ?
===
What are the major reasons for using Windbg vs the Visual Studio debugger? | 0 | [
2,
483,
275,
1511,
19924,
4611,
14,
3458,
1120,
13,
5,
710,
18,
6,
121,
2345,
11356,
13,
60,
800,
3726,
3726,
98,
50,
14,
394,
2932,
26,
568,
1511,
19924,
4611,
14,
3458,
1120,
121,
2345,
11356,
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,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
How do you deal with configuration management of Database Tables?
===
How do you deal with source control management and automated deployment (configuration management) of database tables. I work in a SQL Server environment and it's pretty easy to script out drop and create files for stored procedures/triggers/functions even jobs. It's also easy to handle scripting out the creation of a new db table. However, if at a later point you want to modify that table, you can't necessarily just drop it and recreate it with the new field for fear of losing data. Is there an automated way to deal with this problem? Do you script out a temp table and backfill after updating the new changed table? (could be rough if there is a lot of data)
Any suggestions would be greatly appreciated. | 0 | [
2,
184,
107,
42,
1183,
29,
8091,
1097,
16,
6018,
7484,
60,
800,
3726,
3726,
184,
107,
42,
1183,
29,
1267,
569,
1097,
17,
14904,
10475,
13,
5,
1126,
13549,
857,
1097,
6,
16,
6018,
7484,
9,
31,
170,
19,
21,
4444,
255,
8128,
2307,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Ruby Soap4R Web Service, .NET Consumer
===
Does anyone know how to generate WSDL from a Web Service in Ruby using Soap4R. I have a fairly simple Web Service (SOAP::RPC::StandaloneServer) and would like to consume from .NET .
Thanks | 0 | [
2,
10811,
6447,
300,
139,
2741,
365,
15,
13,
9,
2328,
6461,
800,
3726,
3726,
630,
1276,
143,
184,
20,
7920,
619,
18,
8643,
37,
21,
2741,
365,
19,
10811,
568,
6447,
300,
139,
9,
31,
57,
21,
6647,
1935,
2741,
365,
13,
5,
656,
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... |
Locking in C#
===
I'm still a little unclear and when to wrap some code around a lock. My general rule-of-thumb is to wrap an operation in a lock when it reads or writes to a static variable. But when a static variable is ONLY read (e.g. it's a readonly that is set during type initialization), accessing it doesn't need to be wrapped in a lock statement, right? I recently saw some code that looked like the following example, and it made me think there may be some gaps in my multithreading knowledge:
class Foo
{
private static readonly string bar = "O_o";
private bool TrySomething()
{
string bar;
lock(Foo.objectToLockOn)
{
bar = Foo.bar;
}
// Do something with bar
}
}
That just doesn't make sense to me--why would there by concurrency issues with READING a register?
Also, this example brings up another question. Is one of these better than the other? I suppose I could disassemble the MSIL...
class Foo
{
private static string joke = "yo momma";
private string GetJoke()
{
lock(Foo.objectToLockOn)
{
return Foo.joke;
}
}
}
vs.
class Foo
{
private static string joke = "yo momma";
private string GetJoke()
{
string joke;
lock(Foo.objectToLockOn)
{
joke = Foo.joke;
}
return joke;
}
}
| 0 | [
2,
17538,
19,
272,
5910,
800,
3726,
3726,
31,
22,
79,
174,
21,
265,
11293,
17,
76,
20,
8118,
109,
1797,
140,
21,
3991,
9,
51,
297,
1828,
8,
1041,
8,
96,
723,
220,
25,
20,
8118,
40,
1453,
19,
21,
3991,
76,
32,
11137,
54,
6215... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
LINUX Recursively list all files in a directory including files in symlink directories
===
Suppose i have a directory /dir inside which there are 3 symlinks to other directories
/dir/dir11, /dir/dir12 , /dir/dir13 etc., I want to list all the files in dir including the ones in dir11, dir12 and dir13.
To be more generic, i want to list all files including the ones in the directories which are symlinks. "find ." , ls -R etc., stop at the symlink without navigating into them to list further. | 0 | [
2,
13024,
302,
24244,
102,
968,
65,
6488,
19,
21,
16755,
215,
6488,
19,
13,
7261,
6258,
559,
1596,
800,
3726,
3726,
5787,
31,
57,
21,
16755,
13,
118,
9035,
572,
56,
80,
50,
203,
13,
7261,
6258,
18,
20,
89,
559,
1596,
13,
118,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
What opensource CMS: generates clean xhtml, is skinable with css, and has a lightweight markup content editor?
===
See title. By lightweight markup I mean something like markdown or wikitext. | 0 | [
2,
98,
368,
12097,
2390,
18,
45,
7920,
18,
2745,
993,
15895,
15,
25,
1188,
579,
29,
272,
18,
18,
15,
17,
63,
21,
13613,
943,
576,
2331,
1835,
60,
800,
3726,
3726,
196,
581,
9,
34,
13613,
943,
576,
31,
884,
301,
101,
943,
2968,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
Perl as a web language
===
I am currently in the process of designing a database driven website to manage various personal data and some business data. This is primarily a personal app, however it will be used by a few clients to retrieve and update information. My question is: Is perl still a viable language to code a website with the newer .NET options, Python, etc. available? | 0 | [
2,
416,
255,
28,
21,
2741,
816,
800,
3726,
3726,
31,
589,
871,
19,
14,
953,
16,
15026,
21,
6018,
5355,
2271,
20,
4705,
617,
1319,
1054,
17,
109,
508,
1054,
9,
48,
25,
2257,
21,
1319,
4865,
15,
207,
32,
129,
44,
147,
34,
21,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How do I convert between big-endian and little-endian values in C++?
===
How do I convert between big-endian and little-endian values in C++? | 0 | [
2,
184,
107,
31,
8406,
128,
580,
8,
2451,
806,
17,
265,
8,
2451,
806,
4070,
19,
272,
20512,
60,
800,
3726,
3726,
184,
107,
31,
8406,
128,
580,
8,
2451,
806,
17,
265,
8,
2451,
806,
4070,
19,
272,
20512,
60,
3,
0,
0,
0,
0,
0... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
How to create a custom template for WCSF?
===
I'm new to the WCSF and can't seem to find anything related to "building a custom template" for creating the views/presenters/code-behinds/etc with your own flavor ...
Can anyone point me in the right direction? | 0 | [
2,
184,
20,
1600,
21,
5816,
22894,
26,
11801,
18,
410,
60,
800,
3726,
3726,
31,
22,
79,
78,
20,
14,
11801,
18,
410,
17,
92,
22,
38,
2260,
20,
477,
602,
1597,
20,
13,
7,
11783,
21,
5816,
22894,
7,
26,
2936,
14,
4146,
118,
391... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Thinking of learning Maven
===
I have a side project I do = in Java. It's a pretty straight-forward webapp. It runs in Tomcat on a Linux Server and uses a MySQL database. The majority of the code was written with the Spring Framework. It has a lot of Unit Tests in place. When I'm coding it's in Eclipse. When I deploy the application I run a few shell scripts to move a WAR file to the web server, do Database updates, and make changes to apache configs. I'm the only developer working on it, and right now it's only deployed to 1 environment(production), although some day I might want to have a testing or staging environment as well. I use SVN version control, via the Eclipse plug-in.
I'm always hearing about people using Maven for their projects. Since so many people are using it, I'm saying to myself it must be good. I'd like to learn it in my spare time. The only thing is I'm not quite sold on why I'd want to use Maven? Does my first paragraph sound like a project appropriate for Maven? Does it have any specific advantages for a project that interacts with a Database? | 0 | [
2,
1440,
16,
2477,
1216,
3124,
800,
3726,
3726,
31,
57,
21,
270,
669,
31,
107,
800,
19,
8247,
9,
32,
22,
18,
21,
1772,
1599,
8,
21216,
2741,
7753,
9,
32,
1461,
19,
2067,
5782,
27,
21,
13024,
8128,
17,
2027,
21,
51,
18,
22402,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Need a mod_rewrite thingy
===
I want to take the url:
http://www.mydomain.com/signup-12345
And actually give them:
http://www.mydomain.com/signup/?aff=12345
I have NO history with mod_rewrite, HELP! | 0 | [
2,
376,
21,
7226,
1,
99,
23716,
584,
93,
800,
3726,
3726,
31,
259,
20,
247,
14,
287,
6362,
45,
7775,
6903,
6483,
9,
915,
537,
6232,
9,
960,
118,
11255,
576,
8,
918,
21997,
17,
1121,
590,
105,
45,
7775,
6903,
6483,
9,
915,
537,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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'd my generic ActionLink go?
===
Moved from preview 2 to preview 5 and now my Html.ActionLink calls are all failing. It appears that the generic version has been replaced with a non-type safe version.
// used to work
<li>
<%= Html.ActionLink<HomeController>(c => c.Index(), "Home")%>
</li>
// what appears I can only do now
<li>
<%= Html.ActionLink<HomeController>("Index", "Home")%>
</li>
Why did The Gu do this? Has it been moved to Microsoft.Web.Mvc or somewhere else as a "future"? Is there a replacement that is generic? Halp!
| 0 | [
2,
113,
22,
43,
51,
12733,
1028,
6258,
162,
60,
800,
3726,
3726,
385,
37,
16121,
172,
20,
16121,
331,
17,
130,
51,
13,
15895,
9,
8645,
6258,
3029,
50,
65,
7250,
9,
32,
1780,
30,
14,
12733,
615,
63,
74,
1141,
29,
21,
538,
8,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
What are Table-Driven Methods
===
What are Table-Driven methods as mentioned by Bill Gates on Vista commercial on http://www.youtube.com/watch?v=gBWPf1BWtkw | 0 | [
2,
98,
50,
859,
8,
14489,
3195,
800,
3726,
3726,
98,
50,
859,
8,
14489,
3195,
28,
2211,
34,
1071,
5596,
27,
13520,
1439,
27,
7775,
6903,
6483,
9,
245,
19302,
9,
960,
118,
9054,
60,
710,
3726,
11400,
499,
7721,
165,
220,
499,
38,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
Gsoap Error in C++
===
I am using gsoap to create a soap server in C++. Messages are routed through a bus written in java. Both the server and the bus are multithreaded. Everything works well sending one message at a time through the system. If i start 3 clients each sending messages as fast as possible everything is fine for about 3500 messages. Then i begin receiving periodic "Only one socket connection allowed at a time." errors from the gsoap code. Typical about 3950 of 4000 messages make it through ok. With all 50 failures happening in the last 500 sends.
1. Why would these errors occur after many sends, but not at the beginning of the sending. The rate of send does not increase?
2. What is it talking about? I cannot find any explanation of the error, and it's meaning is not clear to me.
Here is my server code.
long WINAPI threadGO(soap *x);
int main(int argc, char* argv[])
{
HANDLE thread1;
int m, s; /* master and slave sockets */
struct soap *soap = soap_new();
if (argc < 2)
soap_serve(soap); /* serve as CGI application */
else
{
m = soap_bind(soap, NULL, atoi(argv[1]), 100);
if (m < 0)
{
soap_print_fault(soap, stderr);
exit(-1);
}
fprintf(stderr, "Socket connection successful: master socket = %d\n", m);
for (;;)
{
s = soap_accept(soap);
thread1 = CreateThread(NULL,0,(LPTHREAD_START_ROUTINE)threadGO,soap_copy(soap),0,NULL);
}
}
soap_done(soap);
free(soap);
return 0;
}
long WINAPI threadGO(soap *x)
{
soap_serve(x);
soap_end(x);
return 0
;
}
| 0 | [
2,
489,
656,
2552,
7019,
19,
272,
20512,
800,
3726,
3726,
31,
589,
568,
489,
656,
2552,
20,
1600,
21,
6447,
8128,
19,
272,
20512,
9,
7561,
50,
858,
43,
120,
21,
1683,
642,
19,
8247,
9,
156,
14,
8128,
17,
14,
1683,
50,
1889,
96... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Automated way to detect tests that can't fail, checked in to get by minmum code coverage?
===
I have a dev, that will get around our code coverage by writing tests that never fail.
The code is just atrocious, but the tests never catch it because they assert(true).
I code review, but I can't do everyones work for them, all the time. How do you get people like this motivated to make good software?
Is there a build plugin for detecting tests that can't fail?
C#, mbUnit tests.
| 0 | [
2,
14904,
161,
20,
9092,
4894,
30,
92,
22,
38,
7476,
15,
6505,
19,
20,
164,
34,
4232,
18535,
1797,
5245,
60,
800,
3726,
3726,
31,
57,
21,
9664,
15,
30,
129,
164,
140,
318,
1797,
5245,
34,
1174,
4894,
30,
243,
7476,
9,
14,
1797... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 Java-based acoustic ray path model?
===
I am looking for an open-source Java-based raytracing system suitable for use in modeling underwater ray-based acoustics. Such a package might be similar to the Comprehensive Acoustic System Simulation (CASS) with the Gaussian Ray Bundle (GRAB) but I would prefer an open-source, free-to-use or free-to-modify model that I can use in presentations to an open forum (e.g., JavaOne).
The best model for my needs would provide ray path modeling based on an environmental model, bathymetry (also known as ocean bottom topography) and emitter frequency spectra. Note: multipath effects (including reflection and refraction) are my primary points of interest so the best package would provide that right out of the box. | 0 | [
2,
25,
80,
21,
8247,
8,
1281,
5402,
2375,
2013,
1061,
60,
800,
3726,
3726,
31,
589,
699,
26,
40,
368,
8,
12097,
8247,
8,
1281,
2375,
1939,
6302,
329,
6445,
26,
275,
19,
12807,
12577,
2375,
8,
1281,
5402,
18,
9,
145,
21,
6030,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Bash prompt in OS X terminal broken
===
I am using bash in os X Terminal app, and my custom $PS1 breaks when I scroll through my history.
PS1="${BLUE}\u${CYAN}@${RED}\h${BLUE}\w\n\[${red}\$${NC}\]"
also tried
PS1="${BLUE}\u${CYAN}@${RED}\h${BLUE}\w\r\n\[${red}\$${NC}\]"
The problem seems to be in the newline. I have used this bash prompt on Slackware no prob. | 0 | [
2,
13158,
11443,
4417,
19,
13,
759,
993,
3855,
2023,
800,
3726,
3726,
31,
589,
568,
13158,
19,
13,
759,
993,
3855,
4865,
15,
17,
51,
5816,
5579,
1919,
165,
7947,
76,
31,
12159,
120,
51,
447,
9,
8613,
165,
3726,
7,
4403,
1,
6997,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
ODBC Connection Pool
===
I'm having trouble with ODBC connection pool
I've read the article [Frequently Asked Questions About ODBC Connection Pooling][1] and setup everything to make use of ODBC connection pool.
The problem is, after I **release the connection it is not returned to the pool**. Instead it is hard closed. I check it using Performance monitor utility in Windows Server 2003
[1]: http://support.microsoft.com/kb/169470/en | 0 | [
2,
12340,
7229,
2760,
3067,
800,
3726,
3726,
31,
22,
79,
452,
2572,
29,
12340,
7229,
2760,
3067,
31,
22,
195,
1302,
14,
2002,
636,
22840,
102,
411,
2346,
88,
12340,
7229,
2760,
3067,
68,
500,
2558,
165,
500,
17,
18161,
796,
20,
23... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
C#: How to enumerate an enum?
===
How can you enumerate a enum in C#?
e.g. the following does not compile:
public enum Suits
{
Spades,
Hearts,
Clubs,
Diamonds
}
public void PrintAllSuits()
{
foreach (Suits suit in *Suits*)
{
System.Console.WriteLine(suit.ToString());
}
}
It gives the compile time error: 'Suits' is a 'type' but is used like a 'variable'
It fails on the *Suits* keyword, the 2nd one.
| 0 | [
2,
272,
5910,
45,
184,
20,
26940,
62,
40,
1957,
723,
60,
800,
3726,
3726,
184,
92,
42,
26940,
62,
21,
1957,
723,
19,
272,
5910,
60,
13,
62,
9,
263,
9,
14,
249,
630,
52,
26561,
45,
317,
1957,
723,
12702,
13,
1,
19606,
18,
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... |
How do you store/share online your personal documents ?
===
For photos, I use Flickr. But for other documents...Which web based online application (hosted or to install on your personal web site) do you use for PDF or word files ? If there is a user management it would be also great (for example you decide that some persons, or everyone, can see some of your documents...). | 2 | [
2,
184,
107,
42,
1718,
118,
16608,
2087,
154,
1319,
4374,
13,
60,
800,
3726,
3726,
26,
7064,
15,
31,
275,
12407,
139,
9,
47,
26,
89,
4374,
9,
9,
9,
2140,
2741,
432,
2087,
3010,
13,
5,
25219,
54,
20,
16146,
27,
154,
1319,
2741,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 indexes and how can I use them to optimize queries in my database?
===
I am maintaining a pretty sizable application and database and am noticing some poor database performance in a few of our stored procedures...
I always hear that "adding an index" can be done to help performance...I am certainly no DBA, and I do not understand what indexes are, why the help, and how to create them...
I basically need an indexes 101...can anyone help me out / give me resources so that I can learn?
Thanks. | 0 | [
2,
98,
50,
4348,
160,
17,
184,
92,
31,
275,
105,
20,
22864,
9386,
2829,
19,
51,
6018,
60,
800,
3726,
3726,
31,
589,
8215,
21,
1772,
27836,
3010,
17,
6018,
17,
589,
18130,
109,
1696,
6018,
956,
19,
21,
310,
16,
318,
8214,
8876,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
3rd party controls for MS SQL 2005 Reporting Services
===
Can anyone recommend a good 3rd party control(s) for MS SQL 2005 Reporting Services. If you know some open library or implementation of such controls that could be very useful too. | 0 | [
2,
203,
897,
346,
8671,
26,
4235,
4444,
255,
812,
6670,
687,
800,
3726,
3726,
92,
1276,
12360,
21,
254,
203,
897,
346,
569,
5,
18,
6,
26,
4235,
4444,
255,
812,
6670,
687,
9,
100,
42,
143,
109,
368,
1248,
54,
6123,
16,
145,
867... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
What port is a given program using?
===
Greetings,
I want to be able to figure out what port a particular program is using. Are there any programs available online or that come with windows that will tell me which processes are using which ports on my computer?
PS - before you downmod this for not being a programming question, I'm looking for the program to test some networking code. | 0 | [
2,
98,
1295,
25,
21,
504,
625,
568,
60,
800,
3726,
3726,
13769,
18,
15,
31,
259,
20,
44,
777,
20,
1465,
70,
98,
1295,
21,
1498,
625,
25,
568,
9,
50,
80,
186,
1726,
904,
2087,
54,
30,
340,
29,
1936,
30,
129,
494,
55,
56,
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 do you maintain separate webservices for dev/stage/production
===
We want to maintain 3 webservices for the different steps of deployment, but how do we define in our application which service to use? Do we just maintain 3 web references and ifdef the uses of them somehow? | 0 | [
2,
184,
107,
42,
4027,
1725,
2741,
11449,
18,
26,
9664,
118,
9098,
118,
11386,
800,
3726,
3726,
95,
259,
20,
4027,
203,
2741,
11449,
18,
26,
14,
421,
2382,
16,
10475,
15,
47,
184,
107,
95,
9267,
19,
318,
3010,
56,
365,
20,
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,
0... |
How to set proxy with credentials to generated WCF client?
===
I have a problem to connect to my WCF service if customer is using proxy with credentials. I'm unable to find the way to set credential to generated client proxy.
If I use the web service, then it is possible to set proxy. | 0 | [
2,
184,
20,
309,
27188,
29,
5059,
43,
10107,
18,
20,
6756,
11801,
410,
6819,
60,
800,
3726,
3726,
31,
57,
21,
1448,
20,
6379,
20,
51,
11801,
410,
365,
100,
7705,
25,
568,
27188,
29,
5059,
43,
10107,
18,
9,
31,
22,
79,
2343,
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... |
Is there any performance benefit with "inline" statements in .NET
===
When retrieving a lookup code value from a table, some folks do this...
Dim dtLookupCode As New LookupCodeDataTable()
Dim taLookupCode AS New LookupCodeTableAdapter()
Dim strDescription As String
dtLookupCode = taLookupCode.GetDataByCodeAndValue("EmpStatus", "FULL")
strDescription = dtLookupCode.Item(0).Meaning
...however, I've also seen things done "inline" like this...
strDescription = taLookupCode.GetDataByCodeAndValue("EmpStatus", "FULL").Item(0).Meaning
...which bypasses having a lookup code data table in the first place since the table adapter knows what the structure of its result set looks like.
Does using the "inline" method save the overhead of creating the data table object, or does it effectively get created anyway in order to properly handle the .Item(0).Meaning statement?
Note: Feel free to modify the "inline" with the proper term for what I'm describing. I just can't think of it at the moment. 8^D | 0 | [
2,
25,
80,
186,
956,
4234,
29,
13,
7,
108,
1143,
7,
9015,
19,
13,
9,
2328,
800,
3726,
3726,
76,
13,
6239,
3272,
8397,
21,
361,
576,
1797,
1923,
37,
21,
859,
15,
109,
14563,
107,
48,
9,
9,
9,
5937,
13,
43,
38,
5810,
576,
93... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Compartment items not displayed in DSL diagram
===
<p>OK, so things have progressed significantly with my DSL since I asked <a href="http://stackoverflow.com/questions/82776/how-do-i-reference-a-diagram-in-a-dsl-t4-template">this question</a> a few days ago.</p>
<p>As soon as I've refactored my code, I'll post my own answer to that one, but for now, I'm having another problem.</p>
<p>I'm dynamically generating sub-diagrams from a DSL-created model, saving those diagrams as images and then generating a Word document with those images embedded. So far, so good.</p>
<p> But where my shapes have compartments (for examples, Operations on a Service Contract - can you guess what it is, yet?), the compartment header is displayed but <b>none of the items</b>.</p>
<p>If I examine my shape object, it has a single nested child - an ElementListCompartment which in turn, has a number of items that I'm expecting to be displayed. The ElementListCompartment.IsExpanded property is set to true (and the compartment header has a little 'collapse' icon on it) but where, oh where, are my items?</p>
<p>The shape was added to the diagram using</p>
parentShape.FixupChildShapes(modelElement);
<p>So, can anyone guide me on my merry way?</p>
| 0 | [
2,
13083,
3755,
52,
6115,
19,
13,
43,
18,
255,
14161,
800,
3726,
3726,
13,
1,
306,
1,
3085,
15,
86,
564,
57,
13684,
5085,
29,
51,
13,
43,
18,
255,
179,
31,
411,
13,
1,
58,
746,
14057,
3726,
7,
21127,
6903,
25325,
2549,
9990,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
ASP.NET Grid Controls with minimal HTML output?
===
Looking to identify an asp.net grid control that has more functionality and ease of use than the standar asp.net grid control but doesn't punish you wiht excessive html or javscript code. Currently using infragistics but the html for a page is typically in the 90k range and the js that is parsed/downloaded is about 250k. This seems excessive. Anyone have recommendations for a happier medium ? | 0 | [
2,
28,
306,
9,
2328,
7354,
8671,
29,
8663,
13,
15895,
5196,
60,
800,
3726,
3726,
699,
20,
5808,
40,
28,
306,
9,
2328,
7354,
569,
30,
63,
91,
18548,
17,
6378,
16,
275,
119,
14,
1261,
512,
28,
306,
9,
2328,
7354,
569,
47,
1437,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
VmWare Primary HDD Expansion
===
I have a VmWare virtual machine that is coming dangerously close to it's primarry HDD's limit and I need to extend it. How do I do this? I'm working with VmWare Workstation 6.0.5 | 0 | [
2,
13,
20147,
5011,
1256,
8590,
43,
3233,
800,
3726,
3726,
31,
57,
21,
13,
20147,
5011,
6599,
1940,
30,
25,
880,
23853,
543,
20,
32,
22,
18,
14542,
139,
622,
8590,
43,
22,
18,
4496,
17,
31,
376,
20,
7206,
32,
9,
184,
107,
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... |
Top reason for using EJBs again?
===
So your webapp is up and running and it's relying heavily on EJBs. If you could redo the whole system from scratch, would you use EJBs again? If yes, would your top reason be the transaction handling, persistence, scalability or something else?
I'm curious since in my own experience EJBs have not been worth the extra effort involved. I'm comparing with using POJOs in a war, without EJBs or comparable frameworks like Spring. What real, actual problem did EJBs solve for you? | 0 | [
2,
371,
1215,
26,
568,
13,
10022,
4562,
188,
60,
800,
3726,
3726,
86,
154,
2741,
7753,
25,
71,
17,
946,
17,
32,
22,
18,
21760,
2991,
27,
13,
10022,
4562,
9,
100,
42,
110,
402,
111,
14,
979,
329,
37,
12395,
15,
83,
42,
275,
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... |
XAMPP and WAMP in the LAMP, whats the best ?
===
We have got loads of options for php + MySQL + Apache combo... Which is the best pack among these ?
Lets confine our ideas to WAMP vs XAMPP, is there a better option to go for ? | 0 | [
2,
993,
765,
3421,
17,
619,
10158,
19,
14,
6792,
15,
98,
18,
14,
246,
13,
60,
800,
3726,
3726,
95,
57,
330,
19069,
16,
6368,
26,
13,
26120,
2754,
51,
18,
22402,
2754,
17140,
22621,
9,
9,
9,
56,
25,
14,
246,
3607,
497,
158,
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... |
What will cause java.io.CharConversionException: EOF or java.io.CharConversionException: isHexDigit in Tomcat 5.1.3 catalina log?
===
This exception peppers our production logs on a simple 'getParameter()' call.
<pre>
WARNING: Parameters: Character decoding failed. Parameter skipped.
java.io.CharConversionException: EOF
at org.apache.tomcat.util.buf.UDecoder.convert(UDecoder.java:82)
at org.apache.tomcat.util.buf.UDecoder.convert(UDecoder.java:48)
at org.apache.tomcat.util.http.Parameters.urlDecode(Parameters.java:411)
at org.apache.tomcat.util.http.Parameters.processParameters(Parameters.java:393)
at org.apache.tomcat.util.http.Parameters.processParameters(Parameters.java:509)
at org.apache.tomcat.util.http.Parameters.handleQueryParameters(Parameters.java:266)
at org.apache.catalina.connector.Request.parseParameters(Request.java:2361)
at org.apache.catalina.connector.Request.getParameter(Request.java:1005)
at org.apache.catalina.connector.RequestFacade.getParameter(RequestFacade.java:353)
at javax.servlet.ServletRequestWrapper.getParameter(ServletRequestWrapper.java:158)
</pre>
Or Sometimes:
<pre>
java.io.CharConversionException: isHexDigit
at org.apache.tomcat.util.buf.UDecoder.convert(UDecoder.java:87)
at org.apache.tomcat.util.buf.UDecoder.convert(UDecoder.java:48)
at org.apache.tomcat.util.http.Parameters.urlDecode(Parameters.java:411)
at org.apache.tomcat.util.http.Parameters.processParameters(Parameters.java:393)
at org.apache.tomcat.util.http.Parameters.processParameters(Parameters.java:509)
at org.apache.tomcat.util.http.Parameters.handleQueryParameters(Parameters.java:266)
at org.apache.catalina.connector.Request.parseParameters(Request.java:2361)
at org.apache.catalina.connector.Request.getParameter(Request.java:1005)
at org.apache.catalina.connector.RequestFacade.getParameter(RequestFacade.java:353)
at javax.servlet.ServletRequestWrapper.getParameter(ServletRequestWrapper.java:158)
</pre> | 0 | [
2,
98,
129,
1679,
8247,
9,
1963,
9,
5433,
1126,
10898,
10066,
872,
45,
13,
62,
1041,
54,
8247,
9,
1963,
9,
5433,
1126,
10898,
10066,
872,
45,
13,
1595,
1706,
23904,
19,
2067,
5782,
331,
9,
165,
9,
240,
24954,
6738,
60,
800,
3726... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Is it possible to build following SQL query
===
The original query looks like this (MySQL):
select * from books where title like "%text%" or description like "%text%" order by date
Would it be possible to rewrite it (without unions or procedures), so that result will look like this:
- list of books where title matches query ordered by date, followed by:
- list of books where description matches query ordered by date
So basically just give a higher priority to matching titles over descriptions.
Thanks. | 0 | [
2,
25,
32,
938,
20,
1895,
249,
4444,
255,
25597,
800,
3726,
3726,
14,
501,
25597,
1879,
101,
48,
13,
5,
915,
18,
22402,
6,
45,
5407,
1637,
37,
964,
113,
581,
101,
13,
7,
11881,
11969,
11881,
7,
54,
5318,
101,
13,
7,
11881,
119... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 RTOS is best for working on the same PC with Windows?
===
What RTOS is best for working on the same PC with Windows?
I know about RTX and INtime, but have not used them. Are there any others? Which one is your favorite and why? | 0 | [
2,
98,
761,
262,
18,
25,
246,
26,
638,
27,
14,
205,
5168,
29,
1936,
60,
800,
3726,
3726,
98,
761,
262,
18,
25,
246,
26,
638,
27,
14,
205,
5168,
29,
1936,
60,
31,
143,
88,
13,
5256,
396,
17,
19,
891,
15,
47,
57,
52,
147,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
A script to change all tables and fields to the utf-8-bin collation in MYSQL
===
Is there a SQL or PHP script that I can run that will change the default collation in all tables and fields in a database?
I can write one myself, but I think that this should be something that readily available at a site like this. If I can come up with one myself before somebody posts one, I will post it myself. | 0 | [
2,
21,
3884,
20,
753,
65,
7484,
17,
2861,
20,
14,
287,
11720,
8,
457,
8,
4772,
9470,
857,
19,
51,
18,
22402,
800,
3726,
3726,
25,
80,
21,
4444,
255,
54,
13,
26120,
3884,
30,
31,
92,
485,
30,
129,
753,
14,
12838,
9470,
857,
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... |
Need refactoring ideas for Arrow Anti-Pattern
===
I have inherited a monster.
It is masquerading as a .NET 1.1 application processes text files that conform to Healthcare Claim Payment (ANSI 835) standards, but it's a monster. The information being processed relates to healthcare claims, EOBs, and reimbursements. These files consist of records that have an identifier in the first few positions and data fields formatted according to the specs for that type of record. Some record ids are Control Segment ids, which delimit groups of records relating to a particular type of transaction.
To process a file, my little monster reads the first record, determines the kind of transaction that is about to take place, then begins to process other records based on what kind of transaction it is currently processing. To do this, it uses a nested if. Since there are a number of record types, there are a number decisions that need to be made. Each decision involves some processing and 2-3 other decisions that need to be made based on previous decisions. That means the nested if has a lot of nests. That's where my problem lies.
This one nested if is 715 lines long. Yes, that's right. Seven-Hundred-And-Fif-Teen Lines. I'm no code analysis expert, so I downloaded a couple of freeware analysis tools and came up with a McCabe Cyclomatic Complexity rating of 49. They tell me that's a pretty high number. High as in pollen count in the Atlanta area where 100 is the standard for high and the news says "Today's pollen count is 1,523". This is one of the finest examples of the Arrow Anti-Pattern I have ever been priveleged to see. At its highest, the indentation goes 15 tabs deep.
My question is, what methods would you suggest to refactor or restructure such a thing?
I have spent some time searching for ideas, but nothing has given me a good foothold. For example, substituting a guard condition for a level is one method. I have only one of those. One nest down, fourteen to go.
Perhaps there is a design pattern that could be helpful. Would Chain of Command be a way to approach this? Keep in mind that it must stay in .NET 1.1.
Thanks for any and all ideas. | 0 | [
2,
376,
302,
17455,
68,
3478,
26,
7409,
1082,
8,
5972,
8766,
800,
3726,
3726,
31,
57,
7179,
21,
5100,
9,
32,
25,
4885,
8190,
1283,
68,
28,
21,
13,
9,
2328,
137,
9,
165,
3010,
5102,
1854,
6488,
30,
13620,
20,
9809,
2632,
7582,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 revoke some database privileges from MediaWiki after installation?
===
I've just installed MediaWiki on a web server. Obviously it needs lots of privileges during installation to set up its database correctly. Now that it's installed can I safely revoke some privileges (e.g. create table, drop table?) Or might it need to create more tables later (when they are first needed?) If not then I would prefer to grant it as few privileges as possible. | 0 | [
2,
92,
31,
3867,
8416,
109,
6018,
15977,
37,
941,
17375,
75,
7758,
60,
800,
3726,
3726,
31,
22,
195,
114,
4066,
941,
17375,
27,
21,
2741,
8128,
9,
4409,
32,
2274,
7503,
16,
15977,
112,
7758,
20,
309,
71,
82,
6018,
12044,
9,
130,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 Extend Blogengine.Net to collect statistics of visitors?
===
I love BlogEngine. But from what I can se it does not collect the standard information about the visitors I would like to see (referrer, browser-type and so on).
When I log in as Admin I have a menu item named "Referrer". I can choose a weekday and then I'll be presented with 1 or 2 rows with
"google.com 4 hits, "itmaskinen.se 6 hits" and so on, But that's not what I want to se, I want to se where my visitors come from, country, IP if possible, how many visitors and so on.
If someone of you are familiar with Blogengine.Net and can point me in the right direction to where I would put my own log-code or if you know any visitor-statistic-extension that can do it for me, I would be really happy to know. I prefer an extension, because if I make changes myself to BlogEngine it may break later updates I install.
Blogengine.Net is a blog software made in .Net found here: http://www.dotnetblogengine.net/
And yes, I prefer to take this question here rather then in the Blogengine.Net forum, you know why. ;)
(Anyone, feel free to edit my (bad) english in this post and after that delete this sentence)
| 0 | [
2,
184,
107,
31,
7206,
8146,
16847,
9,
2328,
20,
5543,
5818,
16,
4531,
60,
800,
3726,
3726,
31,
339,
8146,
16847,
9,
47,
37,
98,
31,
92,
1353,
32,
630,
52,
5543,
14,
1236,
676,
88,
14,
4531,
31,
83,
101,
20,
196,
13,
5,
99,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 need a helper method to compare a char Enum and a char boxed to an object
===
I have an enum that looks as follows:
public enum TransactionStatus { Open = 'O', Closed = 'C'};
and I'm pulling data from the database with a single character indicating - you guessed it - whether 'O' the transaction is open or 'C' the transaction is closed.
now because the data comes out of the database as an object I am having a heck of a time writing comparison code.
The best I can do is to write:
protected bool CharEnumEqualsCharObj(TransactionStatus enum_status, object obj_status) {
return ((char)enum_status).ToString() == obj_status.ToString();
}
However, this is not the only character enum that I have to deal with, I have 5 or 6 and writting the same method for them is annoying to say the least. [Supposedly all enums inherit from System.Enum][1] but if I try to set that as the input type I get compilation errors. This is also in .NET 1.1 so generics are out of the question.
I've been struggling with this for a while. Does anyone have a better way of writing this method? Also, can anyone clarify the whole enums inherit from System.Enum but are not polymorphic thing?
[1]: http://blogs.msdn.com/abhinaba/archive/2006/01/14/enumerting-all-values-of-an-enum.aspx | 0 | [
2,
31,
376,
21,
448,
106,
2109,
20,
11590,
21,
4892,
1957,
723,
17,
21,
4892,
1649,
69,
20,
40,
3095,
800,
3726,
3726,
31,
57,
40,
1957,
723,
30,
1879,
28,
2415,
45,
317,
1957,
723,
13147,
38,
8796,
13,
1,
368,
800,
13,
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... |
VSTO Excel 2007 PivotTable, having a PivotField in more than one column
===
I am using VSTO with Excel 2007 to generate PivotTables and PivotCharts dynamically.
I am having a problem when I need to have a PivotField in more than one column.
To accomplish this I create a PivotTable in Excel and serialize its properties into an XML document, which I then use to rebuild the PivotTable.
Ie: as a Value and as a Column
This is possible when building the PivotTable in Excel. Has found a way to do this using C# ?
[Creating a PivotTable Programmatically][1]
[1]: http://blogs.msdn.com/andreww/archive/2008/07/25/creating-a-pivottable-programmatically.aspx | 0 | [
2,
4611,
262,
20700,
624,
20670,
5924,
15,
452,
21,
20670,
1109,
19,
91,
119,
53,
4698,
800,
3726,
3726,
31,
589,
568,
4611,
262,
29,
20700,
624,
20,
7920,
20670,
5924,
18,
17,
20670,
5433,
38,
18,
7782,
1326,
9,
31,
589,
452,
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... |
Can XPath return only nodes that have a child of X?
===
Is it possible to use XPath to select only the nodes that have a particular child elements? For example, from this XML I only want the elements in pets that have a child of 'bar'. So the resulting dataset would contain the lizard and pig elements.
<pets>
<cat>
<foo>don't care about this</foo>
</cat>
<dog>
<foo>not this one either</foo>
</dog>
<lizard>
<bar>lizard should be returned, because it has a child of bar</bar>
</lizard>
<pig>
<bar>return pig, too</bar>
</pig>
</pets>
This Xpath gives me all pets: "/pets/*", but I only want the pets that have a child node of 'bar'. | 0 | [
2,
92,
993,
8353,
788,
104,
16272,
30,
57,
21,
850,
16,
993,
60,
800,
3726,
3726,
25,
32,
938,
20,
275,
993,
8353,
20,
5407,
104,
14,
16272,
30,
57,
21,
1498,
850,
2065,
60,
26,
823,
15,
37,
48,
23504,
31,
104,
259,
14,
2065... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Timeout exception for a query using ADO.Net
===
This is a sample code for executing a query. Sometimes, while executing time consuming queries, it throws a timeout exception.
I cannot use any of these techniques:
1) Increase timeout.
2) Run it asynchronously with a callback. This needs to run in a synchronous manner.
please suggest any other techinques to keep the connection alive while executing a time consuming query?
private static void CreateCommand(string queryString,
string connectionString)
{
using (SqlConnection connection = new SqlConnection(
connectionString))
{
SqlCommand command = new SqlCommand(queryString, connection);
command.Connection.Open();
command.ExecuteNonQuery();
}
} | 0 | [
2,
85,
1320,
5391,
26,
21,
25597,
568,
21,
537,
9,
2328,
800,
3726,
3726,
48,
25,
21,
5717,
1797,
26,
25836,
21,
25597,
9,
1030,
15,
133,
25836,
85,
13,
17601,
9386,
2829,
15,
32,
13566,
21,
85,
1320,
5391,
9,
31,
1967,
275,
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... |
Injecting a user account into mySQL
===
Tackling a strange scenario here.
We use a proprietary workstation management application which uses mySQL to store its data. Within the application they provide number of reports, such as which user logged into which machine at what time, all the software products installed on the monitored machines, so on and so forth. We are looking to do a different set of reports, however, they do not support custom reports.
Since their data is being stored in mySQL, I gather I can do the reporting manually. I don't have valid credentials to connect to the mySQL server though. <b>Is there anyway for me to create a user account in the mySQL server?</b> I do not want to reset the root password or anything account that might be in there, as it might break the application.
Thanks for your help.
| 0 | [
2,
20316,
68,
21,
4155,
2176,
77,
51,
18,
22402,
800,
3726,
3726,
15586,
802,
21,
2578,
12705,
235,
9,
95,
275,
21,
18856,
170,
10839,
1097,
3010,
56,
2027,
51,
18,
22402,
20,
1718,
82,
1054,
9,
363,
14,
3010,
59,
1181,
234,
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... |
Wordpress.. Is it a CMS?
===
I recently was contacted by a client who simply wanted to increase their organic rankings in Google. My approach was to do the following:
A) Take them off of their overpriced host and move them to a nicer, cheaper, more feature-rich hosting solution which included a simple Wordpress install.
B) Apply a theme to WordPress which followed the look and feel of their existing website.
C) Train my client on how to login to their copy of Wordpress and create/manage pages/posts.
This took me very little time.. Most of the work in converting asp forms into php and tweaking a theme to fit their design.
Now my client is able to create/manage as many pages or posts as they desire.
I believe, for this purpose, Worpress was the easiest solution.
Would you categorize Wordpress as a CMS? | 2 | [
2,
833,
5890,
9,
9,
25,
32,
21,
2390,
18,
60,
800,
3726,
3726,
31,
1989,
23,
12842,
34,
21,
6819,
72,
1659,
417,
20,
1839,
66,
6976,
11213,
19,
8144,
9,
51,
2141,
23,
20,
107,
14,
249,
45,
21,
6,
247,
105,
168,
16,
66,
84,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 wstring in gdb
===
How can I print wstring in gdb? | 0 | [
2,
184,
20,
4793,
619,
11130,
19,
489,
9007,
800,
3726,
3726,
184,
92,
31,
4793,
619,
11130,
19,
489,
9007,
60,
3,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
int matrix with pointers in C - memory allocation confusion
===
I'm having some issues with producing an int matrix without creating memory leaks. I want to be able to make a given (global) matrix into any size dynamically via read_matrix(). But then i want to be able to free the memory later on. So in my main method the second printf should result in a bus error since it should not have any memory allocated to it. How would i go about creating this?
int** first_matrix;
int** second_matrix;
int** result_matrix;
int** read_matrix(int size_x, int size_y)
{
int** matrix;
matrix = calloc(size_x, sizeof(int*));
for(int i = 0;i<size_x;i++) {
matrix[i] = calloc(size_y, sizeof(int));
}
for(int i = 0;i<size_x;i++) {
for(int j = 0;j<size_y;j++) {
matrix[i][j] = i*10+j;
}
}
return matrix;
}
int main(int stackc, char** stack)
{
first_matrix = read_matrix(10,10);
printf("9:3 %d - 4:6 %d \n", first_matrix[9][3], first_matrix[4][6]);
free(*first_matrix);
free(first_matrix);
printf("9:3 %d - 4:6 %d \n", first_matrix[9][3], first_matrix[4][6]);
}
| 0 | [
2,
19,
38,
8187,
29,
454,
445,
19,
272,
13,
8,
1912,
16840,
5677,
800,
3726,
3726,
31,
22,
79,
452,
109,
1549,
29,
4081,
40,
19,
38,
8187,
366,
2936,
1912,
11724,
18,
9,
31,
259,
20,
44,
777,
20,
233,
21,
504,
13,
5,
26763,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 one grab a stack trace in C?
===
I know there's no standard C function to do this. I was wondering what are the techniques to to this on Windows and *nix? (Windows XP is my most important OS to do this on right now.)
Thanks for the help! | 0 | [
2,
184,
92,
53,
4931,
21,
7566,
5565,
19,
272,
60,
800,
3726,
3726,
31,
143,
80,
22,
18,
90,
1236,
272,
1990,
20,
107,
48,
9,
31,
23,
5712,
98,
50,
14,
4212,
20,
20,
48,
27,
1936,
17,
1637,
14064,
60,
13,
5,
27508,
18,
230... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
(any == System.DBNull.Value) vs (any is System.DBNull)
===
Does any one have a preference on how to check if a value is DBNull? I've found these two statements give me the results I want, but just wondering if there's a preference?
if (any is System.DBNull)
...
same as:
if (any == System.DBNull.Value)
...
Thanks!
Ricardo. | 0 | [
2,
13,
5,
6001,
800,
3726,
329,
9,
9007,
4215,
211,
9,
15165,
6,
4611,
13,
5,
6001,
25,
329,
9,
9007,
4215,
211,
6,
800,
3726,
3726,
630,
186,
53,
57,
21,
9808,
27,
184,
20,
2631,
100,
21,
1923,
25,
13,
9007,
4215,
211,
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... |
Get a list of all computers on a network w/o DNS
===
Greetings,
I need a way (either via C# or in a .bat file) to get a list of all the computers on a given network. Normally, I use "net view", but this tends to work (from my understanding) only within your domain. I need the names (or at least the IP Addresses) of all computers available on my network.
Being able to get all computers on a domain that isn't mine (in which case I'd use WORKGROUP, or whatever the default is) would also work.
Your help much appreciated :).
Alexey | 0 | [
2,
164,
21,
968,
16,
65,
7774,
27,
21,
982,
619,
118,
111,
13,
43,
2172,
800,
3726,
3726,
13769,
18,
15,
31,
376,
21,
161,
13,
5,
18840,
1197,
272,
5910,
54,
19,
21,
13,
9,
4900,
3893,
6,
20,
164,
21,
968,
16,
65,
14,
7774... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
TCP send queue depth
===
How do I discover how many bytes have been sent to a TCP socket but have not yet been put on the wire?
Looking at the diagram here:
<IMG SRC=http://www.tcpipguide.com/free/diagrams/tcpswpointers.png>
I would like to know the total of Categories 2, 3, and 4 or the total of 3 and 4. This is in C(++) and on both Windows and Linux. Ideally there is a ioctl that I could use, but there doesn't seem to be any. | 0 | [
2,
13,
38,
7439,
2660,
22521,
5204,
800,
3726,
3726,
184,
107,
31,
6297,
184,
151,
34,
3231,
57,
74,
795,
20,
21,
13,
38,
7439,
18482,
47,
57,
52,
768,
74,
442,
27,
14,
6511,
60,
699,
35,
14,
14161,
235,
45,
13,
1,
1660,
263... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How do I delete a bad commit, while keeping later commits?
===
Let's say I have these commits in chronological order:
1. a
2. b
3. c
Now, I want to get rid of `b` but keep c, so that I have:
1. a
2. c
How do I do this?
*(there are no conflicts between `b` and `c`)* | 0 | [
2,
184,
107,
31,
27448,
21,
896,
9686,
15,
133,
2882,
138,
9686,
18,
60,
800,
3726,
3726,
408,
22,
18,
395,
31,
57,
158,
9686,
18,
19,
22075,
389,
45,
137,
9,
21,
172,
9,
334,
203,
9,
272,
130,
15,
31,
259,
20,
164,
6681,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Deleting from a small table referenced by a large table
===
Imagine a database that tracks payments between customers.
Say I've got a Customer table:
Customer
----------
CustomerID
Name
and a Transaction table
Transaction
------------
BuyerID
SellerID
Amount
Where BuyerID and SellerID are both Foreign Key references to the CustomerID column of the Customer table.
In my current (analogous) situation, the Transaction table is large (500 Million Rows), even though the Transaction table is small (2000 rows). Deleting a row from the Customer table, however, takes a very long time, because the database has to scan the Transaction table to see whether the Customer has any referencing Transactions (In fact, it has to do it twice - one to check for BuyerID and one for SellerID).
I know I can drop all the foreign key constraints, delete the rows, and then re-add the constraints. Will that be any faster than just doing the `DELETE FROM` with the foreign keys enabled? Are there any other ways to speed up the delete operation that I'm missing.
| 0 | [
2,
121,
1336,
68,
37,
21,
284,
859,
17571,
34,
21,
370,
859,
800,
3726,
3726,
4382,
21,
6018,
30,
1633,
11161,
128,
5279,
9,
395,
31,
22,
195,
330,
21,
7705,
859,
45,
7705,
13,
8,
8,
8,
8,
8,
8,
8,
8,
8,
8,
7705,
1340,
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... |
Mapping extension content types in Apache CXF JAX-RS
===
JAX-RS offers a wonderful way to specify content types in `@Produces`, and the framework will automatically determine the best content type from the client's HTTP `Accept` header and, wonder of wonders, even convert your object to that type (e.g. XML using JAXB or JSON using Jackson) when returning information to the caller.
My (work) client, as clients often do, made a simple job more difficult by requesting I specify the content type by the extension in the URL, e.g. `api/widgets.json`. This would force me to have various `getWidgetsXXX()` methods, one with `@Produces("application/json")`, another with `@Produces("application/xml")`, etc.
But I'm using Apache CXF and I was delighted to find that I could [configure CXF][1] to map various extensions to content types using the `jaxrs.extensions` init parameter!
<!-- registers extension mappings -->
<init-param>
<param-name>jaxrs.extensions</param-name>
<param-value>
xml=application/xml
json=application/json
</param-value>
</init-param>
But I can find absolutely no documentation on how this works in the real world. I naively thought I could just annotate a method with a path with an extension and it would mimic the `Accepts` header:
@Path("/widgets.{extension}")
@GET
@Produces({ "application/json", "application/xml" })
public List<Widget> getWidgets();
So I call it using `api/widgets.json`, and it returns XML! Which is particularly odd, because JAX-RS specifies that the default content type is the first one listed.
Where can I find out how to use CXF extension content type mapping?
P.S. I am not using Spring.
[1]: http://cxf.apache.org/docs/jaxrs-services-configuration.html | 0 | [
2,
13305,
3896,
2331,
2551,
19,
17140,
272,
396,
410,
11712,
8,
1224,
800,
3726,
3726,
11712,
8,
1224,
2486,
21,
5934,
161,
20,
19077,
2331,
2551,
19,
13,
1,
2740,
16041,
18,
1,
15,
17,
14,
6596,
129,
7499,
3746,
14,
246,
2331,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Calling MySQL functions in Lithium
===
How it's possible to call MySQL function (like **GeomFromText()** or **SELECT AS**) in the [Lithium Framework's](http://www.lithify.me/) CRUD? Using _database->read()_ is to inconvenient (I often change the database columns) and including the function in the variable's value only ends up being escaped. | 0 | [
2,
2555,
51,
18,
22402,
3719,
19,
24707,
800,
3726,
3726,
184,
32,
22,
18,
938,
20,
645,
51,
18,
22402,
1990,
13,
5,
1403,
13,
1409,
834,
2636,
2665,
11969,
5,
6,
1409,
54,
13,
1409,
18,
16964,
28,
1409,
6,
19,
14,
636,
12278,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Facebook Auth Dialog - Adjusting the text displayed
===
Just wondering if someone could point me in the right direction of how to change some text on the Facebook Auth Dialog. I've attached a screenshot of the information I wish to change, which I know is possible as I've seen it done on applications such as the Pinterest app.
Can't seem to see that section highlighted anywhere on https://developers.facebook.com/docs/opengraph/authentication/
Thanks in advance. | 0 | [
2,
9090,
10343,
96,
28223,
13,
8,
22209,
14,
1854,
6115,
800,
3726,
3726,
114,
5712,
100,
737,
110,
454,
55,
19,
14,
193,
1400,
16,
184,
20,
753,
109,
1854,
27,
14,
9090,
10343,
96,
28223,
9,
31,
22,
195,
3638,
21,
2324,
7868,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Learn python the hard way exercise 43, nothing happens
===
Currently going through Zed Shaw's Learn Python The Hard Way and have reached exercise 43.
I thought I understood everything until I tried to run my script ... nothing happens. No error messages, nothing. I've been trying to go through my code but can't seem to find out why this is.
Here's my code, hope someone can help me:
**ex43_engine.py**
http://ideone.com/cCAao
**ex43_rooms.py**
http://ideone.com/pJXkj
Thanks in advance!
| 3 | [
2,
2484,
20059,
14,
552,
161,
5935,
5016,
15,
626,
5531,
800,
3726,
3726,
871,
228,
120,
13,
10590,
6779,
22,
18,
2484,
20059,
14,
552,
161,
17,
57,
664,
5935,
5016,
9,
31,
289,
31,
4014,
796,
163,
31,
794,
20,
485,
51,
3884,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 driving me loop(y)
===
Pardon the pun in my title (heh) but this is seriously driving me nuts!
This is my code:
for ($i=0;$i < $a;$i++){
$total = (array)$orders -> Total -> Line[$i];
echo '<pre>';
print_r($total);
echo '</pre>';
}
...It outputs the following:
Array
(
[@attributes] => Array
(
[type] => Subtotal
[name] => Subtotal
)
[0] => 299.99
)
Array
(
[@attributes] => Array
(
[type] => Shipping
[name] => Shipping
)
[0] => 13.36
)
Array
(
[@attributes] => Array
(
[type] => Tax
[name] => Tax
)
[0] => 0.00
)
Array
(
[@attributes] => Array
(
[type] => GiftCertificate
[name] => Gift certificate discount (117943:@CAC7HXPXFUNNJ3MTGC:63.35 117372:@DK9T9TMTCTCTUWF9GC:250.00)
)
[0] => -313.35
)
Array
(
[@attributes] => Array
(
[type] => Total
[name] => Total
)
[0] => 0.00
)
My question is: how do I save each dollar amount [0] into a respective variable named according to the array['type']? | 0 | [
2,
7718,
2891,
55,
5293,
5,
93,
6,
800,
3726,
3726,
13526,
14,
11582,
19,
51,
581,
13,
5,
438,
252,
6,
47,
48,
25,
4818,
2891,
55,
13771,
187,
48,
25,
51,
1797,
45,
26,
13,
5,
4403,
49,
3726,
387,
73,
4403,
49,
13,
1,
5579... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Read whole file in blocks in c#
===
I have a file from bank that is structure in very special way. Where there is account number (25), account balance start (60F), account balance stop (62F), and transactions (61 for transaction and 86 for this transaction details).
:20:STARTSUM
:25:/PL2321109943011
:28C:0330/001
:60F:C100PLN38,74
:62F:C103PLN38,74
-
:20:STARTSUM
:25:/PL24160011982002123456001
:28C:0403/001
:60F:C030403PLN36000,00
:61:0304030403CN100,00S723NONREF//CENT30403H000200
:86:723>00PRZELEW OTRZYMANY ELIXIR>20Fakt VAT 1 nr 00911/03
:86:723>3010501445>3125-00001201467436
:86:723>32Firma XXXXXXXXXXă>33Krakow
:61: 0304030403DN1000,00S223NONREF//CENT30403H002342
:86:223>00PRZEL KRAJ MULTICASH>20000004020 20021224 Fa. 0095
:86:223>21007203-FIRMA SP. Z O>308510101010>311234567890123456
:86:223>32FRIMA XXXXXXXXXX UL. GNI>33EZNIENSKA 1
:86:223>3885101010101234567890123456
:86:223>6085101010101234567890123456
:61:0304030403CN100,00S723NONREF//CENT30403H000230
:86:723>00PRZELEW OTRZYMANY ELIXIR>20Fakt VAT 1 nr 00911/03
:86:723>308510101010>311234567890123456
:86:723>32Firma XXXXXXXXXXă>33Krakow
:86:223>3885101010101234567890123456
:86:223>6085101010101234567890123456
:62F:C030403PLN35200,00
-
:20:STARTSUM
:25:/PL2321109944011
:28C:0330/001
:60F:C120330PLN43,45
:62F:C120330PLN43,45
-
:20:STARTSUM
:25:/PL1109945011
:28C:0330/001
:60F:C1230PLN3,50
:62F:C1230PLN3,50
-
It always has 2 lines of breaks between each block. I would like to put those blocks into an object that I create.
string[] test = File.ReadAllLines(file);
foreach (var s in test) {
}
How can I approach it the proper way? Normally I would go by `foreach` line and try to split the blocks by empty 2 lines then go further by doing multiple if/else statements. But maybe there's simple/better approach to this? | 0 | [
2,
1302,
979,
3893,
19,
5198,
19,
272,
5910,
800,
3726,
3726,
31,
57,
21,
3893,
37,
965,
30,
25,
1411,
19,
253,
621,
161,
9,
113,
80,
25,
2176,
234,
13,
5,
1811,
6,
15,
2176,
4468,
799,
13,
5,
3374,
410,
6,
15,
2176,
4468,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Will else-is resolve if the if statement above it is chosen?
===
In this set of statements:
if(robot1Count < 12) {
robot1Count++;
}
else if(robot1Count < 24) {
robot1Count++;
}
else if(robot1Count < 36) {
robot1Count++;
}
else if(robot1Count < 48) {
robot1Count++;
}
else {
robot1Count = 0;
}
Imagine this is in an infinite loop, would this loop traverse from 0 to 48, change to 0. The thing I'm wondering is if the first block is executed, would all the following blocks be ignored? Or should I change the second to else if(robot1Count < 24 && robot1Count >= 12) ? Or does that not matter? | 0 | [
2,
129,
962,
8,
403,
9854,
100,
14,
100,
3331,
784,
32,
25,
2519,
60,
800,
3726,
3726,
19,
48,
309,
16,
9015,
45,
100,
5,
661,
6813,
165,
16549,
13,
1,
390,
6,
13,
1,
8288,
165,
16549,
20512,
73,
13,
1,
962,
100,
5,
661,
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... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.