unified_texts stringlengths 32 30.1k | OpenStatus_id int64 0 4 | input_ids list | token_type_ids list | attention_mask list |
|---|---|---|---|---|
Querying machine specs
===
What are some ways that I can query the local machine's specifications (a range of things from CPU specs, OS version, graphics card specs and drivers, etc.) through a programmatic interface? We're writing a simple app in C# to test compatibility of our main app and want to have it dump out some system metrics, but I can't seem to find where to even start, what interfaces to use, libraries, anything.
I've tried all kinds of searches, but can only find programs, and GUI ones at that, which require a user to interact with, or have to install.
Alternatively, a small, command-line program would work just as well, as long as we'd be permitted to distribute it with the test app.
I have found one program that gets some of the specs I'd want, <a href="http://technet.microsoft.com/en-us/sysinternals/bb897550.aspx">PsInfo</a>. However, it seems to require each user to agree to some license when it is first run, even though it's a command line app. Plus, it only deals with OS/CPU info, and I will need more than that. | 0 | [
2,
25597,
68,
1940,
12737,
18,
800,
3726,
3726,
98,
50,
109,
2847,
30,
31,
92,
25597,
14,
375,
1940,
22,
18,
17971,
13,
5,
58,
978,
16,
564,
37,
17578,
12737,
18,
15,
13,
759,
615,
15,
8351,
2056,
12737,
18,
17,
5783,
15,
2722... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
What's a nice way of building a wParam or lParam in C#? (Something friendlier than shift operators?)
===
When the WIN32 docs says something like:
wParam
The low-order word specifies the edit control identifier.
The high-order word specifies the notification message.
What's a nice way of building that wParam?
| 0 | [
2,
98,
22,
18,
21,
2210,
161,
16,
353,
21,
13,
13790,
14309,
54,
6759,
14309,
19,
272,
5910,
60,
13,
5,
9099,
860,
10491,
119,
4471,
9475,
60,
6,
800,
3726,
3726,
76,
14,
628,
3125,
9765,
18,
898,
301,
101,
45,
13,
13790,
1430... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Best Matlab toolbox that implements Support Vector Regression?
===
In [wikipedia article about SVM][1] there are a lot of links to different implementations of Matlab toolboxes for Support Vector Machines. It's hard to understand, which of them worth a try.
What are the best of them?
[1]: http://en.wikipedia.org/wiki/Support_vector_machine#Software | 4 | [
2,
246,
4277,
9086,
5607,
5309,
30,
8713,
18,
555,
7497,
27369,
60,
800,
3726,
3726,
19,
636,
17375,
26132,
2002,
88,
11209,
79,
500,
2558,
165,
500,
80,
50,
21,
865,
16,
6271,
20,
421,
6123,
18,
16,
4277,
9086,
5607,
5309,
160,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Business case for Python
===
How would I make a compelling argument for introducing Python into a windows environment? VBscript or Batch scripts will run on any machine and handle most administrative tasks and Java and .Net are available to handle more complex problems. I understand Python brings a lot to the table, but what specifically could it do that we can't do today? Would it save us money or time? These are the kinds of questions that will need to be answered.
<p>
I've had this discussion with a co-worker of mine who loves Python. From a developer's point of view it may be obvious, but from a business point of view it's not that easy. I'm playing devils advocate to his position in the hopes of building a case for expanding Python's use in our enterprise. | 4 | [
2,
508,
610,
26,
20059,
800,
3726,
3726,
184,
83,
31,
233,
21,
20465,
5476,
26,
11442,
20059,
77,
21,
1936,
2307,
60,
13,
20468,
8741,
54,
13064,
17505,
129,
485,
27,
186,
1940,
17,
3053,
127,
2168,
8674,
17,
8247,
17,
13,
9,
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... |
Is there a convenient way to wrap std::pair as a new type?
===
Often times I find myself using std::pair to define logical groupings of two related quantities as function arguments/return values. Some examples: row/col, tag/value, etc.
Often times I should really be rolling my own class instead of just using std::pair. It's pretty easy to see when things start breaking down - when the code becomes littered with make_pair, first, and second, its very hard to remember what is what - an `std::pair<int, int>` conveys less meaning than a type `Position`.
What have you found are the best ways to wrap the functionality of std::pair in a type that conveys real meaning?
Here are some things I have considered:
typedef std::pair<int, int> Position;
This at least gives the type a meaningful name when passing it around, but the type isn't enforced, its still really just a pair, and most of the same problems still exist. This is however very simple to write.
struct Position : public std::pair<int, int>
{
typedef std::pair<int, int> Base;
Position() : Base() {}
Position(const Position &x) : Base(x) {}
Position(int a, int b) : Base(a, b) {}
int &row() { return first; }
const int &row() const { return first; }
int &col() { return second; }
const int &col() const { return second; }
};
This is better, since we can access the variables via a reasonably descriptive name. The problem here is that you can still access first and second, so its easy for the abstraction to leak. Also, accessing simple variables via functions makes the syntax annoying.
The obvious next step is to make the inheritance private:
struct Position : private std::pair<int, int>
{
typedef std::pair<int, int> Base;
Position() {}
Position(const Position &x) : Base(x) {}
Position(int a, int b) : Base(a, b) {}
int &row() { return first; }
const int &row() const { return first; }
int &col() { return second; }
const int &col() const { return second; }
bool operator<(const Position &x) const { return Base(*this) < Base(x); }
// other forwarding operators as needed...
};
So now at least we have gotten rid of the access to first and second, but now a new problem pops up. When we want to store the type in an std::set, we now don't have access to the operator< overload since we don't have access to first and second. This means we have to define a forwarding function for each operator overload we want. For me this is usually ==, !=, and <, but there could be others that I'd want. Yes I know I probably shouldn't overload operator< just to stick it in an associative container, but it makes everything so darn simple... And defining these operators for each new type is a pain, and we STILL have to access via functions. We can fix that:
struct Position
{
Position() {}
Position(const Position &x) : row(x.row), col(x.col) {}
Position(int row, int col) : row(row), col(col) {}
int row, col;
};
bool operator<(const Position &a, const Position &b)
{
return a.row < b.row || (!(b.row < a.row) && a.col < b.col);
}
// more overloads as needed
So now we have simple variable access, but now defining overloaded operators is even more of a pain, because instead of just forwarding them to the pair's implementation, we actually have to re-implement them each time...
Are there any solutions I have overlooked that make this easy without the drawbacks? If there aren't which would you tend to prefer? | 0 | [
2,
25,
80,
21,
12845,
161,
20,
8118,
354,
43,
45,
45,
306,
2642,
28,
21,
78,
1001,
60,
800,
3726,
3726,
478,
436,
31,
477,
992,
568,
354,
43,
45,
45,
306,
2642,
20,
9267,
11545,
19288,
18,
16,
81,
1597,
13787,
28,
1990,
10553,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Can I get statistics on RSS readership?
===
Is there any way to get numbers on how many people are reading an RSS feed? My understanding of the way feed readers work (e.g. Google Reader) is that they check the feed periodically, cache it, and serve the cached copy to whoever asks for it until it's refreshed - which would imply that there's no way to get reliable numbers on readership. | 0 | [
2,
92,
31,
164,
5818,
27,
13,
1224,
18,
29749,
60,
800,
3726,
3726,
25,
80,
186,
161,
20,
164,
2116,
27,
184,
151,
148,
50,
1876,
40,
13,
1224,
18,
4063,
60,
51,
3260,
16,
14,
161,
4063,
7807,
170,
13,
5,
62,
9,
263,
9,
81... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Automatic Java Error Reporting Systems
===
Does anyone know of a system for automatic error reporting in java? The idea is that the system will phone home with the details of an error to a server, which then enters a bug in our bug tracker. Preferable, this would happen over http. It wouldn't happen for all exceptions, just the more serious and any that are not otherwise handled. | 0 | [
2,
6715,
8247,
7019,
6670,
1242,
800,
3726,
3726,
630,
1276,
143,
16,
21,
329,
26,
6715,
7019,
6670,
19,
8247,
60,
14,
882,
25,
30,
14,
329,
129,
1132,
213,
29,
14,
3289,
16,
40,
7019,
20,
21,
8128,
15,
56,
94,
8104,
21,
6256,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
What is your best resource about generics and their interfaces?
===
I have found many pieces of documentations and recommendations about `IEnumerator`, `IEnumerable`, `ICollection`, `IList` and their generic counterparts. Sadly, I didn't find yet a tutorial or book which explains the whole hierarchy of interfaces, generic implementations of those interfaces **and** the best usage of each type of those.
What was your best source of knowledge about the generics, their interfaces, and examples of recommended usage of those in C#? | 0 | [
2,
98,
25,
154,
246,
6577,
88,
12733,
18,
17,
66,
6573,
18,
60,
800,
3726,
3726,
31,
57,
216,
151,
2491,
16,
13945,
18,
17,
12121,
88,
13,
1,
660,
6336,
106,
3457,
1,
15,
13,
1,
660,
6336,
106,
579,
1,
15,
13,
1,
49,
15015... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 Textbox : Force Uppercase
===
I'm writing an asp.net application. I have a textbox on a webform and I want to force whatever the user types to upper case. I'd like to do this on the front end. You should also note that there is a validation control on this textbox, so I want to make sure the solution doesn't interfere with the asp.net validation. | 0 | [
2,
28,
306,
9,
2328,
1854,
5309,
13,
45,
558,
1508,
10325,
800,
3726,
3726,
31,
22,
79,
1174,
40,
28,
306,
9,
2328,
3010,
9,
31,
57,
21,
1854,
5309,
27,
21,
2741,
4190,
17,
31,
259,
20,
558,
2099,
14,
4155,
2551,
20,
1508,
6... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How do I build two different apps from one Visual C# project?
===
I have a source base that, depending on defined flags at build time, creates two different apps. I can build both of these apps using a Makefile by specifying two different targets, one that compiles with a flag and one that compiles without, and having an aggregate target that builds both.
How do I do the equivalent thing from Visual C# Express on Windows? | 0 | [
2,
184,
107,
31,
1895,
81,
421,
4865,
18,
37,
53,
3458,
272,
5910,
669,
60,
800,
3726,
3726,
31,
57,
21,
1267,
1000,
30,
15,
4758,
27,
2811,
9318,
35,
1895,
85,
15,
9695,
81,
421,
4865,
18,
9,
31,
92,
1895,
156,
16,
158,
486... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Diagnosing application hang in a production .NET desktop program
===
I have trouble. One of the users of an application I'm developing is occasionally, but regularly, experiencing an application hang.
When this happens, we find an entry with a source of "Application Hang" in the machine's Event Log, with the informative message "Hanging application [my app], version [the right version], hang module hungapp, version 0.0.0.0, hang address 0x00000000."
I'm logging all unhandled exceptions that my application throws, and there aren't any entries in my log files when this happens.
My current working hypothesis is that this hang is occurring during the application's call to an unsafe legacy API. This wouldn't astonish me; I've been working with this API for years and while I haven't seen it hang before, it's genuinely crappy code. Also, the user's reporting that the program seems to hang at random times. I don't think this is really true. Not that I don't believe her, but that the code that talks to the legacy API is running inside a method called by a BackgroundWorker. If the background thread were making the application hang, this could very much look to the user like it were happening randomly.
So, I have two questions, one specific, one general.
The specific question: I would expect that if a method running on a non-UI thread were to hang, it would just kill the thread. Would it actually kill the whole application?
The general question:
I'm already logging all unhandled exceptions. My program's already set up to use tracing (though I'm going to need to add instrumentation code to trace activity in suspect methods). Are there other things I should be doing? Are there diagnostic tools that allow some kind of post-crash analysis when a .NET application hangs? Are there mechanisms inside the .NET framework that I can invoke to capture more (and more usable) data? | 0 | [
2,
926,
21887,
18,
68,
3010,
4546,
19,
21,
637,
13,
9,
2328,
17404,
625,
800,
3726,
3726,
31,
57,
2572,
9,
53,
16,
14,
3878,
16,
40,
3010,
31,
22,
79,
3561,
25,
4533,
15,
47,
4217,
15,
15138,
40,
3010,
4546,
9,
76,
48,
5531,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
enter key sometimes not recognized in windows apps under cygwin
===
At work, I use Cygwin a lot because it offers me a small oasis in the vast desert of Windows. I inevitably end up running some non-Cygwin programs through the bash shell, such as build scripts (batch files created in-house) and the Subversion CLI binaries (I have the Windows ones installed). 99% of the time, I don't have any problems using this setup. The other 1%, however, causes a strange issue:
With both the build scripts and SVN, most of the time the enter key is interpreted correctly. For instance, I'll kick off the database creation script and it will prompt me for the server name. I type in "localhost" and hit enter. Everything's fine. Then it gets to the end, if there are errors, and prints things out using `more`. No key that I press is recognized by `more`. I have to Ctrl-C out of it.
Similarly, if I do a Subversion update, normally everything is fine. In the case where the interactive conflict resolution happens, however, I'll usually type in "tf" for "theirs-full" and hit enter, but nothing happens. I have to Ctrl-C out of it and re-run the update with force merge or use TortoiseSVN in Windows to do it.
Any idea why Cygwin seems to randomly not be passing the enter key through to the programs? I considered that it may have something to do with Unix vs Windows style line endings, so I've tried typing those characters manually, but that doesn't seem to make a difference. Thanks. | 0 | [
2,
2830,
1246,
1030,
52,
2124,
19,
1936,
4865,
18,
131,
6728,
263,
4181,
800,
3726,
3726,
35,
170,
15,
31,
275,
6728,
263,
4181,
21,
865,
185,
32,
2486,
55,
21,
284,
21494,
19,
14,
4658,
3703,
16,
1936,
9,
31,
23637,
241,
71,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Regular expression that calls string "a?c" invalid?
===
In my user model, I have an attribute called "nickname" and validates as such:
> validates_format_of :nickname, :with => /[a-zA-Z0-9]$/, :allow_nil => true
However, it is currently letting this string pass as valid:
a?c
I only want to accept alphanumeric strings - does anyone know why my regular expression is failing? If anybody could suggest a better regular expression, I'm all ears. | 0 | [
2,
1290,
1803,
30,
3029,
3724,
13,
7,
58,
60,
150,
7,
16671,
60,
800,
3726,
3726,
19,
51,
4155,
1061,
15,
31,
57,
40,
35,
14755,
227,
13,
7,
6113,
7259,
7,
17,
7394,
7759,
28,
145,
45,
13,
1,
7394,
7759,
1,
23588,
1,
1041,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Sql Server SHRINKDATABASE command
===
When I shrink a sql server database using the GUI (All Tasks->Shrink Database->Accept all defaults, click OK), it finishes quickly.
But if I run this command, it takes a very very long time.
DBCC SHRINKDATABASE('my_database')
What am I missing?
This is in SQL Server 2000. | 0 | [
2,
4444,
255,
8128,
16269,
18768,
8436,
1202,
800,
3726,
3726,
76,
31,
16269,
21,
4444,
255,
8128,
6018,
568,
14,
9457,
13,
5,
1233,
8674,
8,
1,
1635,
10603,
6018,
8,
1,
28050,
65,
12838,
18,
15,
10840,
5854,
6,
15,
32,
13625,
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... |
How to go about copyrights for original progams/games etc?
===
I just finished a game for a certain mobile device. I'm just *entertaining* the idea of copyrighting my work. How does one do this? I really have no idea so any help is great!
A friend who has some patents said that "you automatically own the copyright to anything original that you create." hmm not sure about this.
note: I support OSS, no I don't want to be mean and sue people. I'm just curious.
Thanks! | 0 | [
2,
184,
20,
162,
88,
8398,
18,
26,
501,
895,
7253,
18,
118,
16648,
2722,
60,
800,
3726,
3726,
31,
114,
842,
21,
250,
26,
21,
1200,
3241,
3646,
9,
31,
22,
79,
114,
1637,
13679,
5851,
68,
2483,
14,
882,
16,
8398,
68,
51,
170,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
ASP.NET MVC Preview 5 on Mono
===
Does anyone have any information about getting the current versions of ASP.NET MVC (Preview 5) working on Mono 2.0? There was info on the old versions (Preview 2, maybe Preview 3), but I've seen no details about making Preview 5 actually work.
The [Mono Project Roadmap][1] indicates ASP.NET 3.5 for Mono 2.4 (next year). Any ideas on how to get this useful before then?
[1]: http://www.mono-project.com/Roadmap | 0 | [
2,
28,
306,
9,
2328,
307,
8990,
16121,
331,
27,
4129,
800,
3726,
3726,
630,
1276,
57,
186,
676,
88,
1017,
14,
866,
3281,
16,
28,
306,
9,
2328,
307,
8990,
13,
5,
3515,
4725,
331,
6,
638,
27,
4129,
172,
9,
387,
60,
80,
23,
154... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 capture and log scp output
===
I am trying to capture output from an install script (that uses scp) and log it. However, I am not getting everything that scp is printing out, namely, the progress bar.
screen output:
> Copying
> /user2/cdb/builds/tmp/uat/myfiles/* to
> server /users/myfiles as cdb
>
> cdb@server's password:
> myfile 100% |*****************************| 2503 00:00
log output:
> Copying
> /user2/cdb/builds/tmp/uat/myfiles/* to
> server /users/myfiles as cdb
I'd really like to know that my file got there. Here's what I am trying now to no avail:
> myscript.sh 2>&1 | tee mylogfile.log
Does anyone have a good way to capture scp output and log it?
Thanks.
| 0 | [
2,
184,
20,
3683,
17,
6738,
13,
18,
7439,
5196,
800,
3726,
3726,
31,
589,
749,
20,
3683,
5196,
37,
40,
16146,
3884,
13,
5,
887,
2027,
13,
18,
7439,
6,
17,
6738,
32,
9,
207,
15,
31,
589,
52,
1017,
796,
30,
13,
18,
7439,
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... |
Get FontWeight/FontStyle/TextDecorations fron WPF RichTextBox
===
How can I detect the current text formatting at the cursor position in a WPF RichTextBox? | 0 | [
2,
164,
9978,
8696,
118,
21931,
4381,
118,
11969,
546,
4966,
7504,
398,
2075,
619,
7721,
2042,
11969,
5309,
800,
3726,
3726,
184,
92,
31,
9092,
14,
866,
1854,
2595,
1203,
35,
14,
29588,
649,
19,
21,
619,
7721,
2042,
11969,
5309,
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,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
What are the best practices in your tests ?
===
I would like to know what are your practices when you test your classes.
For example, I like to use inheritance, with my fixtures.
Given two classes BaseClass, SubClass, I make two other classes BaseClassFixture and SubClassFixture (SubClassFixture is a sub class of BaseClassFixture). So I'm sure that I don't break code which use SubClass as a BaseClass (And people who extends my class can be sure if they do things right, by creating another sub class of my fixture).
I do fixture inheritance with interfaces too.
For example, when I create a fixture for IList, I check that any Add, increase Count by one.
When I have a concrete class which implements IList I just create a fixture named MyConcreteClassIListFixture.
In that case, the fixture for my interface is abstract and I let my subclass create the instance for my tests.
I think it's a kind of design by contracts (see Bertrand Meyer), because I check invariant before and after any tests.
I do this especially with published interfaces or classes.
And you... what are your practices ??
| 0 | [
2,
98,
50,
14,
246,
5242,
19,
154,
4894,
13,
60,
800,
3726,
3726,
31,
83,
101,
20,
143,
98,
50,
154,
5242,
76,
42,
1289,
154,
2684,
9,
26,
823,
15,
31,
101,
20,
275,
13852,
15,
29,
51,
19914,
9,
504,
81,
2684,
1000,
1898,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 hard is it to incorporate full text search
===
I am building a C#/ASP.NET app with an SQL backend. I am on deadline and finishing up my pages, out of left field one of my designers incorporated a full text search on one of my pages. My "searches" up until this point have been filters, being able to narrow a result set by certain factors and column values.
Being that I'm on deadline (you know 3 hours sleep a night, at the point where I am looking like something the cat ate and threw up), I was expecting this page to be very similar to be others and I'm trying to decide whether or not to make a stink. I have never done a full text search on a page before.... is this a mountain to climb or is there a simple solution?
thank you. | 0 | [
2,
184,
552,
25,
32,
20,
14710,
503,
1854,
2122,
800,
3726,
3726,
31,
589,
353,
21,
272,
5910,
118,
472,
306,
9,
2328,
4865,
29,
40,
4444,
255,
97,
2451,
9,
31,
589,
27,
15968,
17,
3718,
71,
51,
4434,
15,
70,
16,
225,
575,
5... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
What are the ways to minimize page wait from external javascript callouts?
===
What tricks can be used to stop javascript callouts to various online services from slowing down page loading?
The obvious solution is to do all the javascript calls at the bottom of the page, but some calls need to happen at the top and in the middle. Another idea that comes to mind is using iframes.
Have you ever had to untangle a site full of externally loading javascript that is so slow that it does not release apache and causes outages on high load? Any tips and tricks? | 0 | [
2,
98,
50,
14,
2847,
20,
16713,
2478,
1760,
37,
4886,
8247,
8741,
645,
12638,
60,
800,
3726,
3726,
98,
13747,
92,
44,
147,
20,
747,
8247,
8741,
645,
12638,
20,
617,
2087,
687,
37,
21745,
125,
2478,
12797,
60,
14,
4674,
4295,
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... |
What is gcnew?
===
I stumbled across this code and am to proud to go and ask the author what it means.
Hashtable^ tempHash = gcnew Hashtable(iterators_);
IDictionaryEnumerator^ enumerator = tempHash->GetEnumerator();
What is <code>gcnew</code> and how important is it to use that instead of simply <code>new</code>? (I'm also stumped by the caret; I asked about that [over here](http://stackoverflow.com/questions/202463/what-does-the-caret-mean-in-cnet).) | 0 | [
2,
98,
25,
13,
10362,
2681,
60,
800,
3726,
3726,
31,
10282,
464,
48,
1797,
17,
589,
20,
5944,
20,
162,
17,
1349,
14,
1314,
98,
32,
1108,
9,
19170,
5924,
1,
13,
9577,
25436,
800,
13,
10362,
2681,
19170,
5924,
5,
242,
106,
9922,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
What does the caret mean in C++.NET?
===
I just came across this code and a few Google searches turn up no explanation of this mysterious (to me) syntax.
Hashtable^ tempHash = gcnew Hashtable(iterators_);
IDictionaryEnumerator^ enumerator = tempHash->GetEnumerator();
What the heck does the caret mean? (The <code>gcnew</code> is also new to me, and I asked about that [here](http://stackoverflow.com/questions/202459/what-is-gcnew).) | 0 | [
2,
98,
630,
14,
781,
38,
884,
19,
272,
20512,
9,
2328,
60,
800,
3726,
3726,
31,
114,
281,
464,
48,
1797,
17,
21,
310,
8144,
19994,
805,
71,
90,
5764,
16,
48,
6896,
13,
5,
262,
55,
6,
22649,
9,
19170,
5924,
1,
13,
9577,
25436... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 calculate CRC_B in C#
===
How to calculate CRC_B encoding in C# as described in ISO 14443?
Here is some background info:
> CRC_B encoding
> This annex is provided for explanatory purposes and indicates the bit patterns that will
> exist in the physical layer. It is included for the purpose of checking an ISO/IEC
> 14443-3 Type B implementation of CRC_B encoding. Refer to ISO/IEC 3309 and CCITT X.25
> 2.2.7 and V.42 8.1.1.6.1 for further details. Initial Value = 'FFFF'
- Example 1: for 0x00 0x00 0x00 you should end up with CRC_B of 0xCC 0xC6
- Example 2: for 0x0F 0xAA 0xFF you should end up with CRC_B of 0xFC 0xD1
I tried some random CRC16 libraries but they aren't giving me the same results. I didn't get the same results from online checks either like in [here][1].
[1]: http://www.lammertbies.nl/comm/info/crc-calculation.html | 0 | [
2,
184,
20,
18469,
6186,
150,
1,
220,
19,
272,
5910,
800,
3726,
3726,
184,
20,
18469,
6186,
150,
1,
220,
19608,
19,
272,
5910,
28,
745,
19,
11899,
13,
13365,
4644,
60,
235,
25,
109,
2395,
15404,
45,
13,
1,
6186,
150,
1,
220,
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... |
Does Windows Powershell have a Try/Catch or other error handling mechanism?
===
In a script, when a command-let or other executable statement errors out, is there a try/catch type of mechanism to recover from these errors? I haven't run across one in the documentation. | 0 | [
2,
630,
1936,
414,
15984,
57,
21,
1131,
118,
18208,
54,
89,
7019,
7988,
6534,
60,
800,
3726,
3726,
19,
21,
3884,
15,
76,
21,
1202,
8,
1336,
54,
89,
1396,
17194,
5924,
3331,
11908,
70,
15,
25,
80,
21,
1131,
118,
18208,
1001,
16,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How to use HttpWebRequest (.NET) asychronously?
===
How can I use HttpWebRequest (.NET, C#) asynchronously? | 0 | [
2,
184,
20,
275,
7775,
458,
3692,
10351,
13,
5,
9,
2328,
6,
28,
93,
19973,
13985,
60,
800,
3726,
3726,
184,
92,
31,
275,
7775,
458,
3692,
10351,
13,
5,
9,
2328,
15,
272,
5910,
6,
21,
16023,
13985,
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... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
Automatically increment "minimum required version" in a ClickOnce deployment?
===
Is there a way to automatically increment the "minimum required version" fields in a ClickOnce deployment to always equal the current build number? Basically, I always want my deployment to be automatically updated at launch.
I suspect I'm going to need a some pre-/post-build events, but I hope there's an easier way. | 0 | [
2,
7499,
13,
28461,
13,
7,
6840,
18535,
1390,
615,
7,
19,
21,
10840,
13120,
10475,
60,
800,
3726,
3726,
25,
80,
21,
161,
20,
7499,
13,
28461,
14,
13,
7,
6840,
18535,
1390,
615,
7,
2861,
19,
21,
10840,
13120,
10475,
20,
550,
2747... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Appropriate Tomcat 5.5 start-up parameters to tune JVM for extremely high demand, large heap web application?
===
We have recently migrated a large, high demand web application to Tomcat 5.5 from Tomcat 4 and have noticed some peculiar slowdown behavior that appears to be related to JVM pauses. In order to run our application and support increased load over time on Tomcat 4, many not so standard JVM parameters were set and tuned as per the below, and I am hoping someone with Tomcat JVM tuning experience can comment on anything that would likely be detrimental to a Tomcat 5.5 install. Note also that some of these could be carry over from previous versions of Java (we were running Tomcat 4 on Java 1.6 with these parameters successfully for some time, but some may have been introduced to help garbage collection on Java 1.4 which was the basis of our Tomcat 4 install for a long time, and may now doing more harm than good).
Some notes:
- Application memory footprint is
around 1GB, probably slightly over.
- CPU is not an issue - all machines
serving the app (load balanced) are
< 30% CPU
- Lots of headroom on physical memory on the machines.
- -XX:MaxPermSize=512m was the only parameter added as part of the 5.5 upgrade and was reactive to an outofmemory permgen space issue (which it solved).
- Running on Java 1.6, Solaris OS
-server -Xms1280m -Xmx1280m -XX:MaxPermSize=512m -XX:ParallelGCThreads=20 -XX:+UseConcMarkSweepGC -XX:+UseParNewGC -XX:SurvivorRatio=8 -XX:TargetSurvivorRatio=75 -XX:MaxTenuringThreshold=0 -XX:+AggressiveOpts -XX:+PrintGCDetails -XX:+PrintGCTimeStamps -XX:-TraceClassUnloading -Dsun.io.useCanonCaches=false -Dsun.net.client.defaultConnectTimeout=60000 -Dsun.net.client.defaultReadTimeout=60000 | 0 | [
2,
4593,
2067,
5782,
331,
9,
264,
799,
8,
576,
12905,
20,
6768,
487,
20147,
26,
3898,
183,
3888,
15,
370,
15414,
2741,
3010,
60,
800,
3726,
3726,
95,
57,
1989,
14204,
21,
370,
15,
183,
3888,
2741,
3010,
20,
2067,
5782,
331,
9,
2... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
send text to a dom object with jQuery
===
Rather than population said DOM object with an external page such as html cfm or php, what if I simply want to send text?
i've tried
$("#myDOMObject").val("some text");
No errors, but the object value doesn't update either. | 0 | [
2,
2660,
1854,
20,
21,
11859,
3095,
29,
487,
8190,
93,
800,
3726,
3726,
864,
119,
350,
87,
11859,
3095,
29,
40,
4886,
2478,
145,
28,
13,
15895,
10084,
79,
54,
13,
26120,
15,
98,
100,
31,
1659,
259,
20,
2660,
1854,
60,
31,
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... |
Calling a C# web service from with PHP with a long parameter
===
We have a customer that is trying to call our web service written in C# from PHP code. The web service call takes a long as parameter.
This call works fine for other customers calling from C# or Java but this customer is getting an error back from the call. I haven't debugged their specific call but I am guessing that the 64bit integer is getting truncated somehow from PHP. The customer says they are just making the web service call with a string but is there a wrapper in PHP that does type conversion. Could this be losing the number information?
Thanks for any info. | 0 | [
2,
2555,
21,
272,
5910,
2741,
365,
37,
29,
13,
26120,
29,
21,
175,
18906,
800,
3726,
3726,
95,
57,
21,
7705,
30,
25,
749,
20,
645,
318,
2741,
365,
642,
19,
272,
5910,
37,
13,
26120,
1797,
9,
14,
2741,
365,
645,
1384,
21,
175,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 find out the browser's proxy settings?
===
I am writing a command-line tool for Windows that uses libcurl to download files from the internet.
Obviously, the downloading doesn't work when the user is behind a proxy server, because the proxy needs to be configured. I want to keep my tool as simple as possible however, and not have to burden the user with having to configure the proxy. My tool doesn't even have a config file, so the user would otherwise have to pass in the proxy settings on every command, or set an environment variable or somesuch -- way too much hassle.
So I thought, everyone's browser will usually already be set up properly, proxy configured and everything. This will be true for even the most basic user because otherwise "their internet wouldn't work".
So I figure that I can find out whether to use a proxy by looking at IE's proxy settings.
How do I go about this? More specifically:
* Is there one set of "proxy settings" in Windows, used by all browsers (probably IE's), or would I have to write different routines for IE, Firefox, Opera, etc?
* I know that I can probably read the values directly out of the appropriate registry locations if they are configured manually, but does this also work with "automatically detect proxy server?" Do I even have to bother with that option, or is it (almost) never used? | 0 | [
2,
184,
107,
31,
477,
70,
14,
16495,
22,
18,
27188,
12410,
60,
800,
3726,
3726,
31,
589,
1174,
21,
1202,
8,
1143,
5607,
26,
1936,
30,
2027,
13,
8326,
4734,
255,
20,
7121,
6488,
37,
14,
2620,
9,
4409,
15,
14,
7121,
68,
1437,
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... |
Parsing iCal/vCal/Google calendar files in C++
===
Can anyone recommend a ready-to-use class/library compatible with C/C++/MFC/ATL that would parse iCal/vCal/Google calendar files (with recurrences)? It can be free or commercial.
Thanks in advance! | 0 | [
2,
2017,
18,
68,
13,
4272,
118,
8990,
192,
118,
16111,
4875,
7036,
6488,
19,
272,
20512,
800,
3726,
3726,
92,
1276,
12360,
21,
1451,
8,
262,
8,
3699,
718,
118,
1210,
2559,
622,
14961,
29,
272,
118,
150,
20512,
118,
79,
7061,
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... |
Visual Studio unit tests throw MissingMethodException when assembly is in GAC?
===
My application contains a piece of code that executes inside of Component Services, so we need to register our business rules layer (and its dependencies) in the GAC. One of those dependencies is FooCore.dll, which contains classes and services visible to the entire app.
Everything was working fine, until I added a new method to a class in FooCore. Now, when I run my unit tests, any test that calls this new method throws a MissingMethodException, even if I update the GAC with the latest version of the assembly. The only fix is to remove FooCore from the GAC before running the tests.
I've tried the following things:
- Rebuilt entire solution, refreshed stuff in GAC, then ran tests = failure
- Removed and re-added FooCore assembly reference in test project = failure
- Ensured that FooCore is set as "Copy Local" in properties = failure
What can I do to ensure that VSTS loads referenced assemblies from their explicitly defined location, rather than from the GAC?
| 0 | [
2,
3458,
1120,
1237,
4894,
3814,
2863,
5909,
1807,
43,
10066,
872,
76,
1475,
25,
19,
4369,
150,
60,
800,
3726,
3726,
51,
3010,
1588,
21,
1855,
16,
1797,
30,
15644,
18,
572,
16,
5912,
687,
15,
86,
95,
376,
20,
2243,
318,
508,
176... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 get a pointer to the .text section?
===
How do you get a pointer to the .text section of memory for a program from within that program? I also need the length of the section to do a "Flash to Memory" compare as part of a continuous selftest that runs in the background. | 0 | [
2,
184,
107,
42,
164,
21,
454,
106,
20,
14,
13,
9,
11969,
1050,
60,
800,
3726,
3726,
184,
107,
42,
164,
21,
454,
106,
20,
14,
13,
9,
11969,
1050,
16,
1912,
26,
21,
625,
37,
363,
30,
625,
60,
31,
67,
376,
14,
1476,
16,
14,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
PHP MVC Learning Suggestions
===
Can someone recommend some good resources for learning about MVC in PHP? It doesn't have to be specific to MVC in PHP. In fact, I'm looking for recommendations of materials that focus on the higher level concepts with examples that could port well to any language so even ASP.net books will be tolerated ;-)
Any recommendations for books, websites, blogs, etc would be excellent. | 0 | [
2,
13,
26120,
307,
8990,
2477,
18389,
800,
3726,
3726,
92,
737,
12360,
109,
254,
2566,
26,
2477,
88,
307,
8990,
19,
13,
26120,
60,
32,
1437,
22,
38,
57,
20,
44,
1903,
20,
307,
8990,
19,
13,
26120,
9,
19,
837,
15,
31,
22,
79,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
What is the best absolute width for a webpage?
===
Assuming a fluid layout is not an option (since that is a different discussion all together), what is the recommended width for a site layout? What are the pros and cons of different sizes? | 0 | [
2,
98,
25,
14,
246,
7070,
9456,
26,
21,
2741,
6486,
60,
800,
3726,
3726,
11704,
21,
6250,
9106,
25,
52,
40,
4255,
13,
5,
7412,
30,
25,
21,
421,
5460,
65,
429,
6,
15,
98,
25,
14,
5773,
9456,
26,
21,
689,
9106,
60,
98,
50,
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,
0,
0,
0,
0,
0,
0,
0... |
When should I write Static Methods?
===
So I understand what a static method or field is, I am just wondering when to use them. That is, when writing code what design lends itself to using static methods and fields.
One common pattern is to use static methods as a static factory, but this could just as easily be done by overloading a constructor. Correct? For example:
var bmp = System.Drawing.Bitmap.LoadFromFile("Image01.jpg");
As for static fields, is creating singelton-objects their best use? | 0 | [
2,
76,
378,
31,
2757,
12038,
3195,
60,
800,
3726,
3726,
86,
31,
1369,
98,
21,
12038,
2109,
54,
575,
25,
15,
31,
589,
114,
5712,
76,
20,
275,
105,
9,
30,
25,
15,
76,
1174,
1797,
98,
704,
13866,
18,
1145,
20,
568,
12038,
3195,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Web Browser in a fullscreen Direct3D application
===
I need to have a working web browser in a fullscreen Direct3D application. For example, Valve's Source-based games (sort of) do it in the MotD window when you join a server. Any tips on where to look? | 0 | [
2,
2741,
16495,
19,
21,
503,
7187,
1744,
240,
43,
3010,
800,
3726,
3726,
31,
376,
20,
57,
21,
638,
2741,
16495,
19,
21,
503,
7187,
1744,
240,
43,
3010,
9,
26,
823,
15,
11291,
22,
18,
1267,
8,
1281,
466,
13,
5,
22843,
16,
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... |
Best free Java .class viewer?
===
I've used [DJ Java Decompiler][1], which has a handy GUI, but it seems as if the latest version is only a trial and forces you to purchase the software after some period of days (I recall using an earlier free version about a year ago at a previous job).
I'm aware of Jad and Jadclipse, but what I loved about DJ Java Decompiler was that it integrated with Windows Explorer - so I could simply open up a JAR in something like WinRAR, navigate thru the packages, and double-click on a .class file to view it's decompiled source.
Can anyone suggest other good, free, .class viewers? The criteria I have in mind for these would be:
- GUI-based
- Integrates to Windows Explorer (so I don't have to run some command-line options like with JAD)
- optional - can also show raw JVM bytecode commands
In other words - I'd like to find the closest thing to [.NET Reflector][2] for Java as possible.
[1]: http://members.fortunecity.com/neshkov/dj.html
[2]: http://www.red-gate.com/products/reflector/index.htm | 0 | [
2,
246,
551,
8247,
13,
9,
1898,
16812,
60,
800,
3726,
3726,
31,
22,
195,
147,
636,
14365,
8247,
121,
11103,
49,
1252,
500,
2558,
165,
500,
15,
56,
63,
21,
20277,
9457,
15,
47,
32,
2206,
28,
100,
14,
5736,
615,
25,
104,
21,
217... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 override a .NET client's default timeout on a call to a webservice?
===
I'd like the web service proxy class to wait more than 5 minutes | 0 | [
2,
25,
32,
938,
20,
84,
11891,
21,
13,
9,
2328,
6819,
22,
18,
12838,
85,
1320,
27,
21,
645,
20,
21,
2741,
11449,
60,
800,
3726,
3726,
31,
22,
43,
101,
14,
2741,
365,
27188,
718,
20,
1760,
91,
119,
331,
902,
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... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
Normalizing search text to full text search and where conditions
===
What you want is for users to just type in their search criteria just like they would in Google. Some words, maybe some quoted phrases, maybe a few operators, and have it just work.
A .Net solution is available here:
http://ewbi.blogs.com/develops/2007/05/normalizing_sql.html
I am looking for a pure T-SQL version with where support also. (Or VbScript/javascript)
Example: "dog" food price:20..45
should look like this (for mssql):
select * from table t join containstable(desc, '"dog" and food*') k on k.key=t.id
where t.price between 20 and 45
Operators: and, or, near, "", not, * , etc. | 0 | [
2,
1826,
3335,
2122,
1854,
20,
503,
1854,
2122,
17,
113,
2039,
800,
3726,
3726,
98,
42,
259,
25,
26,
3878,
20,
114,
1001,
19,
66,
2122,
9157,
114,
101,
59,
83,
19,
8144,
9,
109,
715,
15,
913,
109,
9591,
18492,
15,
913,
21,
310... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Repeat String - Javascript
===
What is the best or most concise method for returning a string repeated an arbitrary amount of times?
The following is my best shot so far:
function repeat(s, n){
var a = [];
while(a.length < n){
a.push(s);
}
return a.join('');
}
| 0 | [
2,
6830,
3724,
13,
8,
8247,
8741,
800,
3726,
3726,
98,
25,
14,
246,
54,
127,
29455,
2109,
26,
2485,
21,
3724,
4251,
40,
17237,
2006,
16,
436,
60,
14,
249,
25,
51,
246,
999,
86,
463,
45,
1990,
6830,
5,
18,
15,
13,
103,
6,
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 is the syntax to use a Select statement inside a PL/SQL Trigger?
===
This is what I currently have:
CREATE OR REPLACE TRIGGER MYTRIGGER
AFTER INSERT ON SOMETABLE
DECLARE
v_emplid varchar2(10);
BEGIN
SELECT
personnum into v_emplid
FROM PERSON
WHERE PERSONID = :new.EMPLOYEEID;
dbms_output.put(v_emplid);
/* INSERT STATEMENT HERE*/
END MYTRIGGER;
DBA_ERRORS has this error:
PL/SQL: ORA-00923: FROM keyword not found where expected
| 0 | [
2,
98,
25,
14,
22649,
20,
275,
21,
5407,
3331,
572,
21,
12443,
118,
18,
22402,
7286,
60,
800,
3726,
3726,
48,
25,
98,
31,
871,
57,
45,
1600,
54,
3934,
7286,
51,
3367,
11356,
75,
14692,
27,
109,
5924,
10123,
566,
1,
1503,
15540,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 reuse a command in bash with different parameters?
===
I have two scripts that often need to be run with the same parameter:
$ populate.ksh 9241 && check.ksh 9241
When I need to change the parameter (**9241** in this example), I can go back and edit the line in history. But since I need to change the number in two places, I sometimes make a typo. I'd like to be able to change the parameter just once to change it in both places.
| 0 | [
2,
184,
107,
31,
302,
3699,
21,
1202,
19,
13158,
29,
421,
12905,
60,
800,
3726,
3726,
31,
57,
81,
17505,
30,
478,
376,
20,
44,
485,
29,
14,
205,
18906,
45,
5579,
1675,
12383,
9,
197,
1635,
561,
21658,
279,
1569,
2631,
9,
197,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 detect a null pointer in C#?
===
How do I determine if an object reference is null in C# w/o throwing an exception if it is null?
i.e. If I have a class pointer being passed in and I don't know if it is null or not. | 0 | [
2,
184,
107,
31,
9092,
21,
16203,
454,
106,
19,
272,
5910,
60,
800,
3726,
3726,
184,
107,
31,
3746,
100,
40,
3095,
2801,
25,
16203,
19,
272,
5910,
619,
118,
111,
6033,
40,
5391,
100,
32,
25,
16203,
60,
31,
9,
62,
9,
100,
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... |
Performance of using static methods vs instantiating the class containing the methods
===
I'm working on a project in C#. The previous programmer didn't know object oriented programming, so most of the code is in huge files (we're talking around 4-5000 lines) spread over tens and sometimes hundreds of methods, but only one class. Refactoring such a project is a huge undertaking, and so I've semi-learned to live with it for now.
Whenever a method is used in one of the code files, the class is instantiated and then the method is called on the object instance.
I'm wondering whether there are any noticeable performance penalties in doing it this way? Should I make all the methods static "for now" and, most importantly, will the application benefit from it in any way? | 0 | [
2,
956,
16,
568,
12038,
3195,
4611,
6322,
49,
1880,
14,
718,
3503,
14,
3195,
800,
3726,
3726,
31,
22,
79,
638,
27,
21,
669,
19,
272,
5910,
9,
14,
1158,
17968,
223,
22,
38,
143,
3095,
13,
6800,
3143,
15,
86,
127,
16,
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... |
What is the most effective rhetorical trope you have used or heard that relates something complex to a layperson?
===
For example: Updating the code for that legacy system is like fixing the pluming in an old house. Sometimes it is as easy as changing a fawcet, but sometimes you spend hours working around rotting wood only to find crap flying everywhere. | 0 | [
2,
98,
25,
14,
127,
3140,
28608,
13,
9284,
62,
42,
57,
147,
54,
752,
30,
16429,
301,
1502,
20,
21,
1815,
7276,
60,
800,
3726,
3726,
26,
823,
45,
71,
43,
1880,
14,
1797,
26,
30,
7780,
329,
25,
101,
20047,
14,
11406,
68,
19,
4... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Best asp.net based dynamic forms engine?
===
We have an environment that is heavily dependent on forms for data entry. We currently hand-code every single webform because users have requirements that aren't readily handled by code generation, namely
- conditional blocks on the form (i.e., if answer is yes for one question, another question can be enabled or disabled, etc)
- validation that involves logic checks against existing dynamic data stores
- dynamic content - i.e., certain fields prepopulated with existing data
Ideally we'd like to maintain a metadata repository and have a forms-designer/utility for analysts to design and publish forms, rather than having a developer code one from scratch.
We'd like to use an off the shelf solution if possible, but haven't been able to find any robust implementations.
If we were to go off and design our own, can someone provide any tips/advice on how to proceed? | 0 | [
2,
246,
28,
306,
9,
2328,
432,
7782,
1997,
1406,
60,
800,
3726,
3726,
95,
57,
40,
2307,
30,
25,
2991,
9063,
27,
1997,
26,
1054,
2792,
9,
95,
871,
224,
8,
9375,
352,
345,
2741,
4190,
185,
3878,
57,
4786,
30,
4847,
22,
38,
13563... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 compression
===
From an earlier post about trying to improve my sites performance I have been looking at HTTP compression. I have read about setting it up in IIS but it seems to be a global thing for all IIS application pools I may not be allowed to do this as there is another site running on it as well. I then saw some code to put in global.asax to achieve the same thing on a per website basis.
[See Here ][1]http://www.stardeveloper.com/articles/display.html?article=2007110401&page=1][1]
[1]: http://www.stardeveloper.com/articles/display.html?article=2007110401&page=1
Is this as good as the setup in IIS? How dramatic is the effect? Any known issues? | 0 | [
2,
28,
306,
9,
2328,
14864,
800,
3726,
3726,
37,
40,
1201,
678,
88,
749,
20,
3545,
51,
3259,
956,
31,
57,
74,
699,
35,
7775,
14864,
9,
31,
57,
1302,
88,
2697,
32,
71,
19,
595,
18,
47,
32,
2206,
20,
44,
21,
2062,
584,
26,
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... |
What causes error 4063 - Database ...databasename... has not been opened yet
===
I have an scheduled agent that is trying to access a database on another server. When it runs I get an error 4063 - Database ...databasename... has not been opened yet.
The servers is listed in the ACL as manager.
What some other possible causes for this errors? | 0 | [
2,
98,
4047,
7019,
1417,
3891,
13,
8,
6018,
13,
9,
9,
9,
18768,
8436,
7259,
9,
9,
9,
63,
52,
74,
520,
768,
800,
3726,
3726,
31,
57,
40,
3758,
2267,
30,
25,
749,
20,
1381,
21,
6018,
27,
226,
8128,
9,
76,
32,
1461,
31,
164,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
"Object variable or With block variable not set" when attempting to create COM object
===
I have a VB6 dll that is trying to create a COM object using the following line of code:
Set CreateObj = CreateObject("OPSValuer.OPSValue")
However this fails with the error "Object variable or With block variable not set".
I can see OPSValuer.OPSValue in dcomcnfg and it appears to be registered fine. Does anyone have any ideas about what may be causing the problem? | 0 | [
2,
13,
7,
23793,
7612,
54,
29,
1921,
7612,
52,
309,
7,
76,
6314,
20,
1600,
13,
960,
3095,
800,
3726,
3726,
31,
57,
21,
13,
20468,
379,
13,
43,
211,
30,
25,
749,
20,
1600,
21,
13,
960,
3095,
568,
14,
249,
293,
16,
1797,
45,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
VB6, File Doesn't Exist, How do I handle Gracefully?
===
I am testing an application that checks if a file exists across a network. In my testing, I am purposefully pulling the network plug so the file will not be found. The problem is this causes my app to go unresponsive for at least 15 seconds. I have used both the FileExists() and GetAttr() functions in VB6. Does anyone know how to fix this problem? (No, I can't stop using VB6)
Thanks,
Charlie | 0 | [
2,
13,
20468,
379,
15,
3893,
1437,
22,
38,
3182,
15,
184,
107,
31,
3053,
28138,
60,
800,
3726,
3726,
31,
589,
4431,
40,
3010,
30,
16602,
100,
21,
3893,
5636,
464,
21,
982,
9,
19,
51,
4431,
15,
31,
589,
29532,
3303,
14,
982,
10... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Windows Forms Layout Engines
===
Does anyone have or know best practices for implementing a custom layout engine in WinForms? I've seen the <a href="http://msdn.microsoft.com/en-us/library/ms973821.aspx">windowsclient.net</a> link, but it's a bit dated (Sept 2001). | 0 | [
2,
1936,
1997,
9106,
4016,
800,
3726,
3726,
630,
1276,
57,
54,
143,
246,
5242,
26,
17333,
21,
5816,
9106,
1406,
19,
628,
4190,
18,
60,
31,
22,
195,
541,
14,
13,
1,
58,
746,
14057,
3726,
7,
21127,
6903,
79,
18,
43,
103,
9,
2201... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Converting from Eclipse PDT to Vim
===
I truly love VIM - it's one of only a handful of applications I've every come across that make you feel warm and fuzzy inside. However, for PHP development, I still use PDT Eclipse although I would love to switch.
The reason I can't quite at the moment is the CTRL+SPACE code-assist functionality that I rely on so much - it's so useful, especially when type hinting, or using PHPDoc variable comment blocks.
I know there are cool plugins for VIM out there that can probably replicate this functionality and then some - but what are they? | 0 | [
2,
19583,
37,
11652,
13,
9251,
38,
20,
1790,
79,
800,
3726,
3726,
31,
4574,
339,
1790,
79,
13,
8,
32,
22,
18,
53,
16,
104,
21,
8893,
16,
3767,
31,
22,
195,
352,
340,
464,
30,
233,
42,
583,
2059,
17,
20631,
572,
9,
207,
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... |
Web Apps for Source Code Discussion
===
Are there any web apps that allow for source code collaboration? I'm thinking of something that could look at an SVN repo/local folder/etc. and publish the code with support for threaded discussions under each file or class. Ideally I want to find something that I could deploy/host myself, so being based in PHP would be a huge plus. | 0 | [
2,
2741,
4865,
18,
26,
1267,
1797,
5460,
800,
3726,
3726,
50,
80,
186,
2741,
4865,
18,
30,
1655,
26,
1267,
1797,
4004,
60,
31,
22,
79,
1440,
16,
301,
30,
110,
361,
35,
40,
13,
18,
16578,
302,
1638,
118,
15580,
19294,
118,
1198,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
What is the best way to clone an business object in Silverlight?
===
What is the best way to create a clone of a DTO? There is not an ICloneable interface or a BinaryFormatter class in Silverlight. Is reflection the only way? | 0 | [
2,
98,
25,
14,
246,
161,
20,
13871,
40,
508,
3095,
19,
1172,
3130,
60,
800,
3726,
3726,
98,
25,
14,
246,
161,
20,
1600,
21,
13871,
16,
21,
13,
43,
262,
60,
80,
25,
52,
40,
13,
596,
16285,
579,
6573,
54,
21,
14171,
23588,
815... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0... |
How to make a Delphi TSpeedButton stay pressed if it's the only one in the group
===
I'm not sure why the TSpeedButton has this property but when a TSpeedButton is the only button of a given groupindex, it doesn't stay pressed, whether or not "AllowAllUp" is pressed. Maybe a Jedi control would suffice, but hopefully there's some fix. Any help or anecdotes are appreciated.
BTW, I'm (still) using Delphi 7, not sure if this is an across the board conundrum. | 0 | [
2,
184,
20,
233,
21,
23030,
13,
38,
6708,
811,
444,
1179,
2931,
100,
32,
22,
18,
14,
104,
53,
19,
14,
214,
800,
3726,
3726,
31,
22,
79,
52,
562,
483,
14,
13,
38,
6708,
811,
444,
63,
48,
1354,
47,
76,
21,
13,
38,
6708,
811,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 gtk+ responsible for the awkward look of most linux applications?
===
Now, I know this is completely subjective, so please don't flame me. I've never been entirely satisfied with linux whenever I decided to install a distro like Ubuntu, Fedora etc. because of their awkward positioning and spacing of widgets.
Have a look at [this][1]:
![alt text][2]
![alt text][3]
Notice the awkward spacing of the text field's text.
I've seen many Gnome themes that look good on the surface but it all somehow breaks down, awkward spacings, strange borders. Etc.
The entire linux desktop doesn't have the visual integrity of OSX for instance, and I wonder why. If there is any example of a nice integrated Linux environment, please please please show me, I really WANT to use Linux.
(and I know, there's QT, and other managers like KDE etc. I noticed the same thing, so it probably isn't GTK or Gnome alone)
[1]: http://art.gnome.org/themes/gtk2/?sort_by=popularity&limit=12&view=list&order=DESC
[2]: http://art.gnome.org/images/archive/thumbnails/gtk2/GTK2-Glossy_P-Th.png
[3]: http://art.gnome.org/images/thumbnails/gtk2/GTK2-DarkGilouche-Th.png | 0 | [
2,
25,
9509,
197,
2430,
1864,
26,
14,
9309,
361,
16,
127,
13024,
3767,
60,
800,
3726,
3726,
130,
15,
31,
143,
48,
25,
1524,
22835,
15,
86,
2247,
221,
22,
38,
7025,
55,
9,
31,
22,
195,
243,
74,
2894,
8315,
29,
13024,
6634,
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... |
Huge (20 digits) Primary keys and SQLite
===
If I try to insert data with a 20 digit primary key into a SQLite database I get an error with the second insert statement because it "is not unique".
If I select the values I can see from the SQLite commandprompt that the primary key is written in scientific notation.
The column type is decimal. Is there a way to force SQLite to insert the values "as they are" keeping the precision / "normal representation" even with values that long? | 0 | [
2,
2329,
13,
5,
1323,
19076,
6,
1256,
5534,
17,
4444,
10601,
800,
3726,
3726,
100,
31,
1131,
20,
14692,
1054,
29,
21,
434,
15611,
1256,
1246,
77,
21,
4444,
10601,
6018,
31,
164,
40,
7019,
29,
14,
153,
14692,
3331,
185,
32,
13,
7... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Which free database system is best to store, and compute/analyze large text comparisons out of which the database would make usable statistics?
===
I got to create script that would compare thousands of large texts (to each other). And I'm wondering if MySQL is the best solution for this. Is there any other free databse system I could use to do simple - but processor-time consuming computing?
Please, throw me into your knowledge's pool! | 0 | [
2,
56,
551,
6018,
329,
25,
246,
20,
1718,
15,
17,
23909,
118,
1629,
102,
1734,
370,
1854,
6050,
18,
70,
16,
56,
14,
6018,
83,
233,
182,
579,
5818,
60,
800,
3726,
3726,
31,
330,
20,
1600,
3884,
30,
83,
11590,
3805,
16,
370,
638... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Random Page_Load calls on back button in ASP.NET
===
I'm hoping someone has seen this before because I can't for the life of me find the problem.
I'm trying to do the old "fix the back button" thing in an application and I think i have a pretty decent approach, the problem is that it relies on the application not calling page_load when you hit back and instead loading the cached version of the page.
On about 60% of my pages that's exactly what happens. It loads the cached version and all is well. On the other 40% when i hit the back button page_load calls, forcing a refresh. For reference the call to page_load is NOT in a postback.
Even stranger is that this only occurs in IE (6 & 7). In firefox page_load never gets called.
I am using ASP.NET Ajax framework on both types of pages. Anyone seen anything like this before?
| 0 | [
2,
5477,
2478,
1,
8294,
3029,
27,
97,
5167,
19,
28,
306,
9,
2328,
800,
3726,
3726,
31,
22,
79,
3935,
737,
63,
541,
48,
115,
185,
31,
92,
22,
38,
26,
14,
201,
16,
55,
477,
14,
1448,
9,
31,
22,
79,
749,
20,
107,
14,
315,
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... |
Can the result of a function call be used as a default parameter value?
===
Is there a good method for writing C / C++ function headers with default parameters that are function calls?
I have some header with the function:
int foo(int x, int y = 0);
I am working in a large code base where many functions call this function and depend on this default value. This default value now needs to change to something dynamic and I am looking for a way to do:
int foo(int x, int y = bar());
Where bar() is some function that generates the default value based on some system parameters. Alternatively this function prototype would look like:
int foo(int x, int y = baz.bar());
Where baz is a function belonging to an object that has not been instantiated within the header file.
| 0 | [
2,
92,
14,
829,
16,
21,
1990,
645,
44,
147,
28,
21,
12838,
18906,
1923,
60,
800,
3726,
3726,
25,
80,
21,
254,
2109,
26,
1174,
272,
13,
118,
272,
20512,
1990,
157,
445,
29,
12838,
12905,
30,
50,
1990,
3029,
60,
31,
57,
109,
157... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Coding in Other (Spoken) Languages
===
Something i've always wondered, and I can't find any mention of it anywhere online. When a shop from, say Japan, writes code, would I be able to read it in english? Or do languages, like C, php, anything, have Japanese translations that they write?
I guess what i'm asking is does every single coder in the world know enough english to use the exact same reserved words I do?
Would this code:
If (i < size){
switch
case 1:
print "hi there"
default:
print "no, thank you"
} else {
print "yes, thank you"
}
display the exact same as I'm seeing it right now in english, or would some other non-english-speaking person see the words "if", "switch", "case", "default", "print", and "else" in their native language?
EDIT - yes, this is serious. I didn't know if different localiztions of a language have different keywords. or if there are even different localizations at all. | 0 | [
2,
13,
15458,
19,
89,
13,
5,
18,
1638,
2853,
6,
2556,
800,
3726,
3726,
301,
31,
22,
195,
550,
3519,
15,
17,
31,
92,
22,
38,
477,
186,
3794,
16,
32,
4922,
2087,
9,
76,
21,
2546,
37,
15,
395,
1029,
15,
6215,
1797,
15,
83,
31... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How do I add custom properties to an AD group in Windows?
===
I'd like to know how to scrip this. Also, is there an out of the box GUI tool that will let me do this? | 0 | [
2,
184,
107,
31,
3547,
5816,
3704,
20,
40,
21,
43,
214,
19,
1936,
60,
800,
3726,
3726,
31,
22,
43,
101,
20,
143,
184,
20,
13,
18,
28215,
48,
9,
67,
15,
25,
80,
40,
70,
16,
14,
1649,
9457,
5607,
30,
129,
408,
55,
107,
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,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
Is there a way to set timeouts in tomcat?
===
Can I set timeouts for JSP pages in tomcat either on a per page or server level? | 0 | [
2,
25,
80,
21,
161,
20,
309,
85,
12638,
19,
2067,
5782,
60,
800,
3726,
3726,
92,
31,
309,
85,
12638,
26,
487,
3401,
4434,
19,
2067,
5782,
694,
27,
21,
416,
2478,
54,
8128,
662,
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... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
Is there a human readable programming language?
===
I mean, is there a coded language with human style coding?
For example:
Create an object called MyVar and initizialize it to 10;
Take MyVar and call MyMethod() with parameters. . .
I know it's not so usefull, but it can be interesting to create such a grammar.
| 4 | [
2,
25,
80,
21,
585,
1302,
579,
3143,
816,
60,
800,
3726,
3726,
31,
884,
15,
25,
80,
21,
13,
22254,
816,
29,
585,
1034,
13,
15458,
60,
26,
823,
45,
1600,
40,
3095,
227,
51,
3311,
17,
19,
242,
3186,
2815,
2952,
32,
20,
332,
73... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Design problem: shared, synchronized, data access in application... the best approach?
===
I have a web application (asp.net) where work items are submitted and allocated to users according to their workload.
A user's workload is calculated using an algorithm based on the number of items currently allocated to the user (and some other factors). Each new item is allocated to the user with the lowest current workload, increasing their workload. A user's workload decreases when they finish an item. Items will be submitted, allocated and finished concurrently - hence workload levels will be continually changing. Work items are stored in a SQL database.
I need a way to ensure that every allocation decision is made using an up-to-date picture of workload across the user base.
My idea is to provide a read/write synchronized store of workload information in the Cache.
Is this the best approach? Or should I use the database to control locking? How do I avoid bottle-necks in my application?
Advice much appreciated. | 0 | [
2,
704,
1448,
45,
2592,
15,
27202,
15,
1054,
1381,
19,
3010,
9,
9,
9,
14,
246,
2141,
60,
800,
3726,
3726,
31,
57,
21,
2741,
3010,
13,
5,
472,
306,
9,
2328,
6,
113,
170,
3755,
50,
7368,
17,
11685,
20,
3878,
496,
20,
66,
170,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
CAML query items with the given URLs
===
In SP2007/MOSS I need to run a CAML query against a single list like so:
<Where>
<Or>
<Eq>
<FieldRef Name='URL' />
<Value Type='URL'>/path/item1.aspx</Value>
</Eq>
<Eq>
<FieldRef Name='URL' />
<Value Type='URL'>/path/item4.aspx</Value>
</Eq>
<Eq>
<FieldRef Name='URL' />
<Value Type='URL'>/path/item7.aspx</Value>
</Eq>
</Or>
</Where>
The practical outcome of this would be that I have a SPListItemCollection of the items for which I had the URLs.
However, I am getting an error 'One or more field types are not installed properly. Go to the list settings page to delete these fields.'
Have not found any conclusive info on Google yet. | 0 | [
2,
5373,
255,
25597,
3755,
29,
14,
504,
13,
911,
7532,
800,
3726,
3726,
19,
3782,
2727,
118,
7076,
18,
31,
376,
20,
485,
21,
5373,
255,
25597,
149,
21,
345,
968,
101,
86,
45,
13,
1,
2798,
1,
13,
1,
248,
1,
13,
1,
18550,
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... |
Which writing style do you use when commenting code?
===
I'm really just curious, but if someone wants to make an argument that one is better than another - go for it!
- First Person "I" comments:
//i'm setting this to 1 because it breaks otherwise
- First Person "we" comments:
//we need to set this to 1 - trust me
- 2nd Person:
//you need to set this to 1 so it don't break
- 3rd Person:
//this needs to be set to one | 0 | [
2,
56,
1174,
1034,
107,
42,
275,
76,
17797,
1797,
60,
800,
3726,
3726,
31,
22,
79,
510,
114,
7686,
15,
47,
100,
737,
2846,
20,
233,
40,
5476,
30,
53,
25,
574,
119,
226,
13,
8,
162,
26,
32,
187,
13,
8,
64,
840,
13,
7,
49,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
crystal reports 11 : blank field bombs the report
===
I'm creating a invoice crystal report for sage mas 500 AR module. In it, I'm attempting to add the tarinvoice.balance field with the following formula:
if {tarPrintInvcHdrWrk.Posted} = 1 then
ToText({tarInvoice.Balance})
I'm assuming that when the {tarPrintInvcHdrWrk.Posted} = 1 conditional statement holds FALSE, it doesn't attempt to pull the invoice field because when I remove the formula from the report, the form displays correctly without it. When the conditional statement renders true in the report, the balance fields behaves correctly. However, with the formula present with the conditional FALSE in the CR form, the entire crystal report bombs and displays blank. Any ideas?
thanks in advance | 0 | [
2,
4282,
2813,
547,
13,
45,
6463,
575,
10468,
14,
1330,
800,
3726,
3726,
31,
22,
79,
2936,
21,
19,
13379,
4282,
1330,
26,
9527,
4885,
3033,
13,
512,
12613,
9,
19,
32,
15,
31,
22,
79,
6314,
20,
3547,
14,
2475,
108,
13379,
9,
24... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 performance hit for using UIImage in CALayer?
===
I'm using a whole bunch of CALayers, creating a tile-based image not unlike GoogleMaps (different versions of the same image with more/less detail).
The code I'm using to do this is:
UIImage* image = [self loadImage:obj.fileName zoomLevel:obj.zoomLevel];
[CATransaction setValue:(id)kCFBooleanTrue
forKey:kCATransactionDisableActions];
obj.layerToAddTo.contents = [image CGImage];
[CATransaction commit];
I don't really feel like loading the CGImage from file using CoreGraphics because I'm lazy. But I will if there's a big performance boost! LoadImage just mangles a string to get the right path for loading said image, and obj is a NSObject-struct that holds all the info I need for this thread.
Help? | 0 | [
2,
25,
80,
21,
956,
770,
26,
568,
13,
5661,
22039,
19,
1658,
15187,
60,
800,
3726,
3726,
31,
22,
79,
568,
21,
979,
7653,
16,
1658,
15187,
18,
15,
2936,
21,
13,
9802,
8,
1281,
1961,
52,
2822,
8144,
15022,
18,
13,
5,
15782,
3281... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Searching for marked (selected) text in emacs
===
I use emacs for viewing and editing code and other text files. I wanted to know if there is a way to search forward or backward for text which is marked in the current buffer. Similar to what I can do in notepad or wordpad. As in can I mark some text in the buffer and do a C-s or C-r and be able to search with the marked text without actually typing in the whole search text?
Thank you,
Rohit | 0 | [
2,
5792,
26,
2739,
13,
5,
18,
7138,
6,
1854,
19,
13,
62,
6893,
18,
800,
3726,
3726,
31,
275,
13,
62,
6893,
18,
26,
11244,
17,
9510,
1797,
17,
89,
1854,
6488,
9,
31,
417,
20,
143,
100,
80,
25,
21,
161,
20,
2122,
917,
54,
85... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How can I check WCF address access and avoid AddressAccessDeniedException?
===
Is there a way in the .NET framework to validate that a process has access to a specific WCF address namespace without attempting to call ServiceHost.Open and capturing the resulting AddressAccessDeniedException?
Right now if that exception is thrown I restart the service in elevated (administrator) mode so that I can properly reserve the namespace. But it seems like there should be a way to do that without waiting for the exception to be thrown that is a little easier to read in the code. | 0 | [
2,
184,
92,
31,
2631,
11801,
410,
3218,
1381,
17,
2658,
3218,
20604,
817,
49,
69,
10066,
872,
60,
800,
3726,
3726,
25,
80,
21,
161,
19,
14,
13,
9,
2328,
6596,
20,
7394,
1373,
30,
21,
953,
63,
1381,
20,
21,
1903,
11801,
410,
32... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Adding values to a C# array
===
Probably a really simple one this - I'm starting out with C~ and need to add values to an array, for example:
int[] terms;
for(int runs = 0; runs < 400; runs++)
{
terms[] = value;
}
For those who have used PHP, here's what I'm trying to do in C#:
$arr = array();
for ($i = 0; $i < 10; $i++) {
$arr[] = $i;
}
Thanks,
Ross | 0 | [
2,
4721,
4070,
20,
21,
272,
5910,
7718,
800,
3726,
3726,
910,
21,
510,
1935,
53,
48,
13,
8,
31,
22,
79,
1422,
70,
29,
272,
1,
17,
376,
20,
3547,
4070,
20,
40,
7718,
15,
26,
823,
45,
19,
38,
2558,
500,
1663,
73,
26,
5,
6391... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 evaluate dependency properties in silverlight/WPF from S.O.S. ?
===
This question is fairly straightforward -- I am trying to debug a memory leak in a silverlight application using s.o.s. I was able to get some good info using !gcroot to determine what objects have open references to the one that should be getting cleared; but in these cases they tend to be core UI elements (like grid and storyboard), and I can't really differentiate them without the ability to see the values of their dependency properties (like name). Trying to look through the dependency properties with !dumpobj is a total wild goose chase for me, they are all static classes (the properties that is) that reference each other and I just end up going in circles. At no point was I ever able to find a single actual value for a dependency property anywhere.
I googled about this quite a bit, but was only able to find other people asking the question, or speculation not leading to an answer. http://blogs.msdn.com/tess/archive/2008/09/16/q-a-reader-emails-about-net-memory-leaks-and-random-questions.aspx is one such page without answer.
Thanks in advance for any help! | 0 | [
2,
184,
107,
31,
13,
15599,
26835,
3704,
19,
1172,
3130,
118,
499,
7721,
37,
13,
18,
9,
111,
9,
18,
9,
13,
60,
800,
3726,
3726,
48,
1301,
25,
6647,
22262,
13,
8,
8,
31,
589,
749,
20,
121,
16254,
21,
1912,
11724,
19,
21,
1172... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Open Source .Net Reporting Tool
===
I am looking for a reporting service/tool for visual Studio. My only restraint is my web server is off limits to me as far as installing ANYTHING. So I need something I can just include in my project.
My users need to be able to export a report to PDF and without being able to use Crystal I am pretty much lost.
Any ideas? | 0 | [
2,
368,
1267,
13,
9,
2328,
6670,
5607,
800,
3726,
3726,
31,
589,
699,
26,
21,
6670,
365,
118,
20799,
26,
3458,
1120,
9,
51,
104,
18058,
25,
51,
2741,
8128,
25,
168,
5887,
20,
55,
28,
463,
28,
25429,
602,
9,
86,
31,
376,
301,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
What is an example of a non-relational database? Where/how are they used?
===
I have been working with relational databases for sometime, but it only recently occurred to me that there must be other types of databases that are **non**-relational.
What are some examples of non-relational databases, and where/how are they used in the real world? Why would you choose to use a non-relational database over relational databases? | 0 | [
2,
98,
25,
40,
823,
16,
21,
538,
8,
99,
10832,
192,
6018,
60,
113,
118,
1544,
50,
59,
147,
60,
800,
3726,
3726,
31,
57,
74,
638,
29,
5827,
192,
6018,
18,
26,
8530,
15,
47,
32,
104,
1989,
2437,
20,
55,
30,
80,
491,
44,
89,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Starting/Stopping a service on Windows 2008 Server from the command line - access denied
===
I am trying to start a service from the command line using "net start SERVICENAME" and I get an access denied error.
I am an administrator on this server since I am in a domain group that are admins on the server. I **can** start/stop the service from the Services tool.
I am new to 2008/Vista so maybe I am just missing something.. | 0 | [
2,
1422,
118,
7318,
3181,
21,
365,
27,
1936,
570,
8128,
37,
14,
1202,
293,
13,
8,
1381,
5265,
800,
3726,
3726,
31,
589,
749,
20,
799,
21,
365,
37,
14,
1202,
293,
568,
13,
7,
2328,
799,
365,
7259,
7,
17,
31,
164,
40,
1381,
52... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Integrate WPF and Windows Forms
===
I am learning WPF and was wondering if there is a way to show a WPF Window from an existing C# WinForm without 'hosting' WinForm in WPF?
I tried using myWPFWindow.show() on button click event for displaying the Window. The window is getting displayed but the textboxes displayed in the window are preventing me from typing. Can someone point me in the right direction on how to get this working?
Thanks. | 0 | [
2,
18399,
619,
7721,
17,
1936,
1997,
800,
3726,
3726,
31,
589,
2477,
619,
7721,
17,
23,
5712,
100,
80,
25,
21,
161,
20,
298,
21,
619,
7721,
1463,
37,
40,
3149,
272,
5910,
628,
4190,
366,
13,
22,
11694,
68,
22,
628,
4190,
19,
6... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Using telnet in a C Program
===
I am working on a robot automation project and I have run into a road block. To control the robot, one needs to connect with it wirelessly via telnet and send commands through the tcp/ip protocol. (ex. The 'Mabc' command moves it forward based on the left wheel speed (a), the right wheel speed (b) and time (c)). What I am trying to do is do some calculations in a C program and then send a message to the robot based on the value of the calculation.
How can send commands via tcp/ip protocol in a C program?
Thanks!
Erik | 0 | [
2,
568,
6757,
2328,
19,
21,
272,
625,
800,
3726,
3726,
31,
589,
638,
27,
21,
8288,
23217,
669,
17,
31,
57,
485,
77,
21,
383,
1921,
9,
20,
569,
14,
8288,
15,
53,
2274,
20,
6379,
29,
32,
10149,
102,
1197,
6757,
2328,
17,
2660,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Flash AS2.0 - Increase Label's Font Size
===
I know this sounds like a really obvious question, but it's proving harder to figure out than I thought. I'm developing in Flash 8/ActionScript 2.0.
I have a label component, and I'm dynamically assigning it text from an xml document. For example:
label.text = "<b>" + xml_node.firstChild + "</b>";
This successfully changes the label's text to whatever is in that XML node, and since I enabled HTML, it makes it bold. However, I want to increase the size of the label's font, and using `<font>` tags won't work.
Am I missing something? How do I make the font larger? ActionScript is just so wonky! | 0 | [
2,
4433,
28,
135,
9,
387,
13,
8,
1839,
1899,
22,
18,
9978,
1072,
800,
3726,
3726,
31,
143,
48,
2795,
101,
21,
510,
4674,
1301,
15,
47,
32,
22,
18,
15333,
5229,
20,
1465,
70,
119,
31,
289,
9,
31,
22,
79,
3561,
19,
4433,
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... |
Are code generators bad?
===
I use MyGeneration along with nHibernate to create the basic POCO objects and XML mapping files. I have heard some people say they think code generators are not a good idea. What is the current best thinking? Is it just code generation is bad when it generates thousands of lines of not understandable code? | 0 | [
2,
50,
1797,
20495,
896,
60,
800,
3726,
3726,
31,
275,
51,
12546,
303,
29,
12109,
15191,
8820,
20,
1600,
14,
2125,
2353,
716,
3916,
17,
23504,
13305,
6488,
9,
31,
57,
752,
109,
148,
395,
59,
277,
1797,
20495,
50,
52,
21,
254,
88... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 text_field with no method associated
===
i'm having a problem to create a text_field without a method association. Maybe i even don't need it :-)
I have two radio_buttons associated to the same method:
"<%= radio_button :comment, :author, "anonymous" %> Anonymous <br>"
"<%= radio_button :comment, :author, "real_name" %> Name <br>"
What i would like to do is to have an text_field which when the user click on the radio_button "real_name" i can verify the value in this new text_field.
Basically my Controller would be something like:
@comment = Comment.new(params[:comment])
if @comment.author == "real_name"
@comment.author = "value-from-the-new-textfield
end
There is any way to do it?
Regards,
Victor | 0 | [
2,
2240,
18,
1854,
1,
1109,
29,
90,
2109,
1598,
800,
3726,
3726,
31,
22,
79,
452,
21,
1448,
20,
1600,
21,
1854,
1,
1109,
366,
21,
2109,
607,
9,
913,
31,
166,
221,
22,
38,
376,
32,
13,
45,
8,
6,
31,
57,
81,
603,
1,
811,
4... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Is it possible to read the first line of a file only with Actionscript
===
I've got a PHP-based site where we allow users to upload a comma-separated text file of data to be imported by some server side scripts. However, sometimes we need to adjust the column order of the data that is uploaded, and it would be immensely helpful if we could identify the columns in the CSV file *before* the upload takes place.
The only way I can think of to access local file I/O is with a Java plugin or an embedded Flash script, and I'd much prefer the latter. Is there any way in Flash to select a text file on the local hard drive, and then use ActionScript to examine **only** the first line (which corresponds to the column headings, in this example)?
Sometimes these files can be >100 MB, so loading the whole thing into memory and then throwing out all but the first line probably wouldn't work efficiently, so I'm wondering if there's syntax in ActionScript to limit the amount of data read in at a time. | 0 | [
2,
25,
32,
938,
20,
1302,
14,
64,
293,
16,
21,
3893,
104,
29,
1028,
8741,
800,
3726,
3726,
31,
22,
195,
330,
21,
13,
26120,
8,
1281,
689,
113,
95,
1655,
3878,
20,
71,
8294,
21,
11951,
58,
8,
18,
14189,
7432,
1854,
3893,
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... |
which python framework to use?
===
I'm looking for a framework which is appropriate for beginners (in Python and web development).
I already found out about Django and web.py.
I think that one of the most important things for me is good documentation.
Thanks for the help,
Dan
| 0 | [
2,
56,
20059,
6596,
20,
275,
60,
800,
3726,
3726,
31,
22,
79,
699,
26,
21,
6596,
56,
25,
4593,
26,
26931,
18,
13,
5,
108,
20059,
17,
2741,
522,
6,
9,
31,
614,
216,
70,
88,
3857,
14541,
17,
2741,
9,
6448,
9,
31,
277,
30,
53... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Unit tests framework for databases
===
I´m looking for a unit tests framework for database development. I´m currently developing for SQL Server 2000, 2005 and 2008. Do you know of any good frameworks with similar functionality as JUnit and NUnit?
Perhaps it´s better to ask, what do you use to unit test your stored procedures and user defined functions? | 0 | [
2,
1237,
4894,
6596,
26,
6018,
18,
800,
3726,
3726,
31,
307,
699,
26,
21,
1237,
4894,
6596,
26,
6018,
522,
9,
31,
307,
871,
3561,
26,
4444,
255,
8128,
824,
15,
812,
17,
570,
9,
107,
42,
143,
16,
186,
254,
6596,
18,
29,
835,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
MS Access query design hangs on connection to SQL Server
===
Microsoft Access is a slick way to access data in a MS SQL Server backend database, but I've always had problems accessing (so to speak) large tables of data, especially when trying to toggle between results and design mode in Access.
Access gives me a number of nifty things, not the least of which is Crosstabs, but this hung connection to the server drives me a little crazy!
Does any MS Access gurus know how to optimize the ODBC connection so it isn't doing what appears to be full table scans when I just want to tweak and build my queries? | 0 | [
2,
4235,
1381,
25597,
704,
4546,
18,
27,
2760,
20,
4444,
255,
8128,
800,
3726,
3726,
7099,
1381,
25,
21,
12544,
161,
20,
1381,
1054,
19,
21,
4235,
4444,
255,
8128,
97,
2451,
6018,
15,
47,
31,
22,
195,
550,
41,
1716,
1381,
68,
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... |
Missing ComponentOne licenses.licx file
===
I'm working on an application that makes extensive use of ComponentOne's C1FlexGrid. Of the dozens we use, three are missing their licenses.licx file and cause the demo splash screen to pop up while I'm starting the application.
Is there any way to determine which forms are causing this behavior. Short of checking hundreds of directories by hand, I don't see a way. | 0 | [
2,
2863,
5912,
849,
3962,
18,
9,
4663,
396,
3893,
800,
3726,
3726,
31,
22,
79,
638,
27,
40,
3010,
30,
1364,
3386,
275,
16,
5912,
849,
22,
18,
272,
165,
19752,
16375,
9,
16,
14,
10273,
95,
275,
15,
132,
50,
2863,
66,
3962,
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... |
How do I connect to a MSSQL database using Perl's DBI module in Windows?
===
How do I connect to a MSSQL database using Perl's DBI module in Windows? | 0 | [
2,
184,
107,
31,
6379,
20,
21,
4235,
18,
22402,
6018,
568,
416,
255,
22,
18,
13,
43,
2161,
12613,
19,
1936,
60,
800,
3726,
3726,
184,
107,
31,
6379,
20,
21,
4235,
18,
22402,
6018,
568,
416,
255,
22,
18,
13,
43,
2161,
12613,
19... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
Formula or API for calulating desktop icon spacing on Windows XP.
===
I've built a simple application that applies grid-lines to an image or just simple colors for use as desktop wallpaper. The idea is that the desktop icons can be arranged within the grid. The problem is that depending on more things than I understand the actual spacing in pixels seems to be different from system to system. I've learned that at least these things play a factor:
- Resolution (duh)
- Taskbar size and placement
- Fonts
There has to be more than this. Maybe there's some api call that I don't know about?
| 0 | [
2,
3729,
54,
21,
2159,
26,
3550,
10038,
17404,
9801,
29177,
27,
1936,
23045,
9,
800,
3726,
3726,
31,
22,
195,
392,
21,
1935,
3010,
30,
13169,
7354,
8,
7939,
20,
40,
1961,
54,
114,
1935,
5268,
26,
275,
28,
17404,
28129,
9,
14,
88... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
What is your version control and deployment workflow with Rails?
===
Especially when considering a fresh Rails project, what does your version control and deployment workflow look like? What tools do you use?
I'm interested in answers for Mac, *nix and Windows work machines. Assume a *nix server.
I'll edit for clarity if need be. | 0 | [
2,
98,
25,
154,
615,
569,
17,
10475,
170,
9990,
29,
2240,
18,
60,
800,
3726,
3726,
1118,
76,
5154,
21,
3180,
2240,
18,
669,
15,
98,
630,
154,
615,
569,
17,
10475,
170,
9990,
361,
101,
60,
98,
4672,
107,
42,
275,
60,
31,
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... |
Is there really no way to follow up dataset parent relation in xaml binding?
===
Suppose I have a dataset with those two immortal tables: Employee & Order <br/>
__Emp__ -> ID, Name <br/>
__Ord__ -> Something, Anotherthing, EmpID <br/>
And relation __Rel__: Ord (EmpID) -> Emp (ID) <br/>
It works great in standard master/detail scenario <br/>
(show employees, follow down the relation, show related orders), <br/>
but what when I wan't to go the opposite way (show Ord table with Emp.Name)? <br/>
Something like this:<br/>
<code>
`<stackpanel`> <- with datacontext set from code to dataset.tables["ord"] <br/>
`<TextBox Text="{Binding Something}"/`> <br/>
`<TextBox Text="{Binding Anotherthing}"/`> <br/>
`<TextBox Text="{Binding ???}"/`> <- that's my problem, how to show related Emp.Name <br/>
`</stackpanel`> <br/> <br/>
</code>
Any ideas? I can create value converter, but if I wan't to use dataset instance which I get from parent module it gets tricky.
| 0 | [
2,
25,
80,
510,
90,
161,
20,
1740,
71,
1054,
3554,
4766,
5827,
19,
13,
6791,
8184,
8728,
60,
800,
3726,
3726,
5787,
31,
57,
21,
1054,
3554,
29,
273,
81,
10163,
7484,
45,
7362,
279,
389,
13,
1,
5145,
118,
1,
13,
1,
62,
2554,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Formatted input box in VB.NET
===
Is there a control or method to accept formatted input in VB.NET?
i.e. It accepts input in a given format ##/##/## or similar? | 0 | [
2,
13,
29850,
6367,
1649,
19,
13,
20468,
9,
2328,
800,
3726,
3726,
25,
80,
21,
569,
54,
2109,
20,
3440,
13,
29850,
6367,
19,
13,
20468,
9,
2328,
60,
31,
9,
62,
9,
32,
16548,
6367,
19,
21,
504,
2595,
6926,
5910,
118,
5910,
5910... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
Log4j usage - how to customize the event ID when logging to Windows Event Log?
===
I'm adding windows event logging functionality to an existing Java application and I'd like to utilize event ids(our admin is using them already). Is there a way to specify the event ID when logging with NTEventLogAppender? | 0 | [
2,
6738,
300,
728,
7514,
13,
8,
184,
20,
5816,
2952,
14,
807,
4924,
76,
13,
13919,
20,
1936,
807,
6738,
60,
800,
3726,
3726,
31,
22,
79,
4721,
1936,
807,
13,
13919,
18548,
20,
40,
3149,
8247,
3010,
17,
31,
22,
43,
101,
20,
131... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Counting instances of a class in the AppDomain
===
I wonder if there is a way to either programatically or using a third party tool (profiler?) get an overview of how many instances of a class are currently active in the AppDomain (including or excluding derived classes), and even better, where they are allocated (not sure if that is even possible).
I know that I could change my own classes to include some running counter somehow, but I also want this for (managed) classes that I do not control.
Is that even possible? Some hints or keywords would be helpful :) | 0 | [
2,
11195,
13946,
16,
21,
718,
19,
14,
4865,
537,
6232,
800,
3726,
3726,
31,
2666,
100,
80,
25,
21,
161,
20,
694,
625,
721,
8438,
54,
568,
21,
422,
346,
5607,
13,
5,
14503,
139,
60,
6,
164,
40,
21598,
16,
184,
151,
13946,
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... |
Reasons to learn MSIL
===
Learning MSIL is fun and all that. Understanding what is going on "under the hood" can in many ways improve how you write your code performance-wise. However, the IL that is produced by the compiler is quite verbose and does not tell the whole story since JIT will optimize away a lot of the code.
I, personally, have had good use of my very basic IL understanding when I've had to make a small fix in an assembly I do not have the source code for. But, I could as well have used Reflector to generate C# code.
I would like to know if you've ever had good use of MSIL understanding and/or why you think it is worth learning it (except for the fun in it, of course). I'd also like to know if you think one should *not* learn it and why. | 0 | [
2,
2932,
20,
2484,
307,
8556,
800,
3726,
3726,
2477,
307,
8556,
25,
2414,
17,
65,
30,
9,
3260,
98,
25,
228,
27,
13,
7,
4579,
14,
6124,
7,
92,
19,
151,
2847,
3545,
184,
42,
2757,
154,
1797,
956,
8,
10474,
9,
207,
15,
14,
6317... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How can I capture the HTML from a ViewResult and return it as a ContentResult
===
I'm writing a simple CMS and I want to capture the HTML from a ViewResult and do some simple string substitution on some custom tags, and then fire the HTML back out as a ContentResult - what's the best way to do this? | 0 | [
2,
184,
92,
31,
3683,
14,
13,
15895,
37,
21,
1418,
29955,
17,
788,
32,
28,
21,
2331,
29955,
800,
3726,
3726,
31,
22,
79,
1174,
21,
1935,
2390,
18,
17,
31,
259,
20,
3683,
14,
13,
15895,
37,
21,
1418,
29955,
17,
107,
109,
1935,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
XHTML in Crystal Reports
===
It is possible to display XHTML fully in Crystal Reports?
I have a field which I set to display with HTML tags, but it ignores many of the tags I need, such as <li>. It would be nice if the font was set by the XHTML as well.
If not, is there a reporting tool with the features of Crystal Reports but is better at rendering XHTML? | 0 | [
2,
993,
15895,
19,
4282,
2813,
800,
3726,
3726,
32,
25,
938,
20,
3042,
993,
15895,
2337,
19,
4282,
2813,
60,
31,
57,
21,
575,
56,
31,
309,
20,
3042,
29,
13,
15895,
3383,
18,
15,
47,
32,
7174,
18,
151,
16,
14,
3383,
18,
31,
3... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How do I list files in Java, sorted by Date Modified?
===
I want to get a list of files in a directory, but I want to sort it such that the oldest files are first. My solution was to call File.listFiles and just resort the list based on File.lastModified, but I was wondering if there was a better way. | 0 | [
2,
184,
107,
31,
968,
6488,
19,
8247,
15,
22554,
34,
1231,
5372,
60,
800,
3726,
3726,
31,
259,
20,
164,
21,
968,
16,
6488,
19,
21,
16755,
15,
47,
31,
259,
20,
2058,
32,
145,
30,
14,
2976,
6488,
50,
64,
9,
51,
4295,
23,
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... |
File security attributes getting screwed up on file copy
===
I've a windows service that updates our product. It copies the product files into a temp directory, usually "C:\Windows\Temp", patches the binaries, and then uses MoveFileEx to copy the files back to the install directory on a reboot, usually "C:\Program Files\Product". The files in the install directory are inheriting their security attributes from the parent folder. After the copy, patch, and reboot, the files in the install directory are missing some ACLs. Specifically the files don't have the ACL for the Users group anymore so users can no longer run the program after the reboot.
Can anyone explain whats going on here? It seems that copying from the install directory to the temp directory, the files inherit the ACLs of the temp directory. On the MoveFileEx/Reboot, though, the files only inherit the ACLs that both the install and temp directories have in common. | 0 | [
2,
3893,
1221,
13422,
1017,
16456,
71,
27,
3893,
4344,
800,
3726,
3726,
31,
22,
195,
21,
1936,
365,
30,
16779,
318,
2374,
9,
32,
3298,
14,
2374,
6488,
77,
21,
13,
9577,
16755,
15,
951,
13,
7,
150,
45,
1,
27508,
18,
1,
9577,
7,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.