unified_texts stringlengths 32 30.1k | OpenStatus_id int64 0 4 | input_ids list | token_type_ids list | attention_mask list |
|---|---|---|---|---|
How do I make a script in SQL Management Studio 2005?
===
I have a table in an MSSQL db. I want to create a script that will put the table and all records into another db. So I right-click the table in Management Studio and select Create-To new query editor... but all I get is the table structure.
How exactly do I get the values too? | 0 | [
2,
184,
107,
31,
233,
21,
3884,
19,
4444,
255,
1097,
1120,
812,
60,
800,
3726,
3726,
31,
57,
21,
859,
19,
40,
4235,
18,
22402,
13,
9007,
9,
31,
259,
20,
1600,
21,
3884,
30,
129,
442,
14,
859,
17,
65,
742,
77,
226,
13,
9007,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 join another MySQL table when using Master/Detail Sample Form in Netbeans?
===
I am trying to implement an application by using MySQL/JAVA and I found this tool in netbeans to easily create a new form for an existing table. (edit, insert, delete etc.)
Is there an easy way to modify the code to join another table to display fields from that table.
Example:
I have an employee table that has a foreign key TitleID and another table called Title that has TitleID and TitleName.
I want to display TitleName instead of TitleID in the master table employee. | 0 | [
2,
184,
20,
1865,
226,
51,
18,
22402,
859,
76,
568,
1129,
118,
546,
8682,
5717,
505,
19,
4275,
863,
5950,
60,
800,
3726,
3726,
31,
589,
749,
20,
8713,
40,
3010,
34,
568,
51,
18,
22402,
118,
1004,
1385,
17,
31,
216,
48,
5607,
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... |
Force look and feel on NetBeans 6.5
===
How do you for a specific look and feel on NetBeans 6.5? I mean by passing flags to the netbeans script (on Ubuntu) or by modifying the netbeans script or by some setup. | 0 | [
2,
558,
361,
17,
583,
27,
4275,
863,
5950,
400,
9,
264,
800,
3726,
3726,
184,
107,
42,
26,
21,
1903,
361,
17,
583,
27,
4275,
863,
5950,
400,
9,
264,
60,
31,
884,
34,
2848,
9318,
20,
14,
4275,
863,
5950,
3884,
13,
5,
218,
287... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 retrieve data from dynamically added textboxes?
===
Im adding textboxes (not a fixed number of textboxes) dynamically to a form on ASP.NET page, how do i read back data from these textboxes? | 0 | [
2,
184,
20,
11917,
1054,
37,
7782,
1326,
905,
1854,
5309,
160,
60,
800,
3726,
3726,
797,
4721,
1854,
5309,
160,
13,
5,
1270,
21,
3535,
234,
16,
1854,
5309,
160,
6,
7782,
1326,
20,
21,
505,
27,
28,
306,
9,
2328,
2478,
15,
184,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0... |
How do you compress objects stored in session / cache?
===
Scott Hanselman recently posted a [blog article][1] describing how to compress strings stored in the session / cache. This looks fairly promising, but the majority of data that I am storing in the session / cache are not strings but custom classes. How would you go about compressing these?
My initial thought would be to utilize the BinaryFormatter to serialize the object first (just like the ASP.NET framework would do normally when storing custom class objects into the session / cache), then compress the resulting byte array. However, this has the adverse side effect that the retrieved data from the session / cache would be readonly (since decompressing and deserializing would create a new in-memory object).
In other words, if my code currently looks like the following, is there a way to compress its storage into the session?
MyClass foo = new MyClass();
Session["foo"] = foo;
MyClass retrievedFoo1 = (MyClass) Session["foo"];
retrievedFoo1.Property1 = "property 1";
// retrievedFoo2.Property1 should equal "property 1"!
MyClass retrievedFoo2 = (MyClass) Session["foo"];
[1]: http://www.hanselman.com/blog/TheWeeklySourceCode35ZipCompressingASPNETSessionAndCacheState.aspx | 0 | [
2,
184,
107,
42,
26060,
3916,
8214,
19,
3723,
13,
118,
16522,
60,
800,
3726,
3726,
1824,
4800,
19965,
1989,
6054,
21,
636,
220,
5567,
2002,
500,
2558,
165,
500,
7153,
184,
20,
26060,
7887,
8214,
19,
14,
3723,
13,
118,
16522,
9,
48... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
QR code (2D barcode) coding and decoding algorithms?
===
Looking for free/opensource code or description of algorithms to code (simple) and decode (hard) the 2D barcode [QR code][1].
It doesn't seem like a trivial problem, but it's so popular in Japan that there must be something already available...
-Adam
[1]: http://en.wikipedia.org/wiki/QR_Code | 0 | [
2,
2593,
139,
1797,
13,
5,
135,
43,
748,
9375,
6,
13,
15458,
17,
121,
15458,
15935,
60,
800,
3726,
3726,
699,
26,
551,
118,
10157,
12097,
1797,
54,
5318,
16,
15935,
20,
1797,
13,
5,
24629,
6,
17,
121,
9375,
13,
5,
6011,
6,
14,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How do I Monitor Text File Changes with C++? Difficulty: No .NET
===
Use case: 3rd party application wants to programatically monitor a text file being generated by another program. Text file contains data you want to analyze as it's being updated.
I'm finding a lot of answers to this question wrapped around FileSystemWatcher but let's say you are writing an application for a Windows machine and can't guarantee .NET is installed.
Are there any libraries out there available for this, or am I just going to have to roll my own solution then?
Thanks. | 0 | [
2,
184,
107,
31,
7626,
1854,
3893,
1693,
29,
272,
20512,
60,
6967,
45,
90,
13,
9,
2328,
800,
3726,
3726,
275,
610,
45,
203,
897,
346,
3010,
2846,
20,
625,
721,
8438,
7626,
21,
1854,
3893,
142,
6756,
34,
226,
625,
9,
1854,
3893,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Microsoft and the Windows API War
===
This question was inspired by two interesting articles: "[How Microsoft Lost the API War][1]" by SO's very own Joel Spolsky, written in 2004, and "[From Win32 to Cocoa: a Windows user's conversion to Mac OS X][2]" by ArsTechnica's Peter Bright in 2008. These two authors believe that Microsoft has lost its focus on the API that made it the platform of choice for developers. As Spolsky writes:
> Microsoft's crown strategic jewel, the
> Windows API, is lost. The cornerstone
> of Microsoft's monopoly power and
> incredibly profitable Windows and
> Office franchises, which account for
> virtually all of Microsoft's income
> and covers up a huge array of
> unprofitable or marginally profitable
> product lines, the Windows API is no
> longer of much interest to developers.
Bright says:
> Windows is dying, Windows applications
> suck, and Microsoft is too blinkered
> to fix any of it—that's the argument.
> The truth is that Windows is hampered
> by 25-year old design decisions. These
> decisions mean that it's clunky to use
> and absolutely horrible to write
> applications for. The applications
> that people do write are almost
> universally terrible. They're ugly,
> they're inconsistent, they're
> disorganized; there's no finesse, no
> care lavished on them.
> Microsoft—surely the company with the
> greatest interest in making Windows
> and Windows applications exude
> quality—is, in fact, one of the worst
> perpetrators.
Considering Microsoft's recent software offerings with the Vista API, .NET 3.5, LINQ, and WPF, would you say this still true? Or does Microsoft's future lie with ASP.NET and MVC, and Silverlight (aka WPF Everywhere)?
In other words, if you could start a brand-new project from scratch, with no dependencies or old code to support, what would you choose to develop with (WPF, .NET, Cocoa, ASP.NET, etc?)? Is Microsoft winning or losing the API war?
[1]: http://www.joelonsoftware.com/articles/APIWar.html
[2]: http://arstechnica.com/articles/culture/what-microsoft-could-learn-from-apple.ars | 0 | [
2,
7099,
17,
14,
1936,
21,
2159,
176,
800,
3726,
3726,
48,
1301,
23,
3054,
34,
81,
4883,
3376,
45,
13,
7,
2558,
1544,
7099,
529,
14,
21,
2159,
176,
500,
2558,
165,
500,
7,
34,
86,
22,
18,
253,
258,
8873,
13,
18,
7332,
2397,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 a type followed by _t (underscore-t) represent?
===
This seems like a simple question, but I can't find it with the Stack Overflow search or Google. What does a type followed by a `_t` mean? Such as
int_t anInt;
I see it a lot in C code meant to deal closely with hardware—I can't help but think that they're related. | 0 | [
2,
98,
630,
21,
1001,
709,
34,
13,
1,
38,
13,
5,
4579,
15077,
8,
38,
6,
3501,
60,
800,
3726,
3726,
48,
2206,
101,
21,
1935,
1301,
15,
47,
31,
92,
22,
38,
477,
32,
29,
14,
7566,
20285,
2122,
54,
8144,
9,
98,
630,
21,
1001,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Intensive programming reduces communication skills?
===
This is one of those meta-programming questions that may or may not belong on SO, but here goes...
Have any other programmers out there noticed that their ability to communicate with people (technical or otherwise) almost disappears during and after a period of intense programming?
I normally think of myself as a relatively good communicator. However, last night after staying late to work on some relatively challenging programming tasks, I found even ordering a takeaway meal was very difficult: my words got tied up before they left my mouth. This is not the first time this has happened ...
Has anyone else experienced this phenomenon? Is there a name for it? | 0 | [
2,
13633,
3143,
16335,
3291,
3207,
60,
800,
3726,
3726,
48,
25,
53,
16,
273,
7618,
8,
19746,
3863,
2346,
30,
123,
54,
123,
52,
6219,
27,
86,
15,
47,
235,
1852,
9,
9,
9,
57,
186,
89,
17968,
18,
70,
80,
2711,
30,
66,
2165,
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... |
can somebody explain me the python yield statement?
===
In plain english, please...
I'm trying to understand this code:
def node._get_child_candidates(self, distance, min_dist, max_dist):
if self._leftchild and distance - max_dist < self._median:
yield self._leftchild
if self._rightchild and distance + max_dist >= self._median:
yield self._rightchild
And this is the code of the caller:
result, candidates = list(), [self]
while candidates:
node = candidates.pop()
distance = node._get_dist(obj)
if distance <= max_dist and distance >= min_dist:
result.extend(node._values)
candidates.extend(node._get_child_candidates(distance, min_dist, max_dist))
return result
Can you explain me what is happening when the method _get_child_candidates_ is being called?
It returns a list?, a single element? is called again? what is the effect of the yield keyword in this case?
| 0 | [
2,
92,
8861,
3271,
55,
14,
20059,
11537,
3331,
60,
800,
3726,
3726,
19,
3748,
486,
15,
2247,
9,
9,
9,
31,
22,
79,
749,
20,
1369,
48,
1797,
45,
6312,
15421,
9,
1,
3060,
1,
11287,
1,
1245,
3052,
7759,
5,
8411,
15,
1583,
15,
42... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Better to develop cross-browser code up front or develop for one browser and go back and make it work in the others later?
===
I'm looking for feedback on peoples experiences with developing sites that work across browsers. It seems to me there are at least two obvious ways to approach the task of making your site/webapp work across browser:
1. Constantly test across all supported browsers every step of the way; or
2. Pick a browser, get everything working in it as a reference implementation and then make all the other browsers match the reference implementation.
Each approach has an obvious drawback -- the problem with #1 is that you end up doing a lot of unnecessary work -- especially if you are developing a webapp that is going through a lot of iterations/prototyping/spikes etc. You will make a bunch of stuff work across browsers that will subsequently be discarded/removed.
The disadvantage to approach #2 is that while it makes the initial development much quicker and more painful it makes it much harder to figure out where some of the specific errors arose, especially for more complex issues -- whereas if you had been developing for all browsers at once you should catch it right away and know what change(s) introduced the problems.
A somewhat obvious third option would be a hybrid approach, but it seems to me that you would end up losing more by experiencing both of the problems with #1 and #2 than you would gain from the benefits of doing both.
What have you found to be the most effective way(s) to approach this challenge?
| 0 | [
2,
574,
20,
2803,
919,
8,
25699,
4104,
1797,
71,
431,
54,
2803,
26,
53,
16495,
17,
162,
97,
17,
233,
32,
170,
19,
14,
654,
138,
60,
800,
3726,
3726,
31,
22,
79,
699,
26,
13111,
27,
148,
18,
5513,
29,
3561,
3259,
30,
170,
464... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
.NET compact framework and ActiveSync
===
Is there a way that my .NET CF app running on a Windows CE device can know when the device is docked/synced with the PC? | 0 | [
2,
13,
9,
2328,
8285,
6596,
17,
1348,
9507,
150,
800,
3726,
3726,
25,
80,
21,
161,
30,
51,
13,
9,
2328,
10084,
4865,
946,
27,
21,
1936,
4000,
3646,
92,
143,
76,
14,
3646,
25,
6120,
69,
118,
9507,
11014,
29,
14,
5168,
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... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
Will Oracle retire 10gAS in favor of WebLogic?
===
Oracle purchased BEA and their WebLogic suite of tools. They still have a competing product in their own 10gAS Application Server. Both are J2EE, enterprise grade, servers. While it make take some time due to maintenance agreements, it would be unusual for them to continue to produce two products within the same architectural space. So...
1. Do you believe that they will retire
their previous application server in
favor of WebLogic?
2. Do you believe that WebLogic is the
one that will be retired?
3. How long of a process is this likely
to be? Years? | 0 | [
2,
129,
15759,
10097,
332,
6927,
19,
3654,
16,
2741,
24268,
60,
800,
3726,
3726,
15759,
2432,
44,
58,
17,
66,
2741,
24268,
6160,
16,
4672,
9,
59,
174,
57,
21,
5649,
2374,
19,
66,
258,
332,
6927,
3010,
8128,
9,
156,
50,
487,
135,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
What is "DefInstance" and should I remove it from a WinForms app?
===
I am working on a VB.NET WinForms app that was "upgraded" by Visual Studio (originally 1.0 or 1.1) from VB6 code (which was itself upgraded from VB5). Except for the few new forms I've created since taking over maintenance of this app, all of the forms in the application have a method called DefInstance which allows you to grab an in-memory copy of the form if there is one. What I can't figure out is why: when would I ever need to reference a form object in memory when it's not immediately in scope where I'm working. To my mind this violates all kinds of sound programming principles and seems like an invitation for memory leaks or worse.
The questions: (1) is this DefInstance thing an merely unfortunate remnant of the VB6 heritage of this app, and (2) should I make a point of removing DefInstance methods throughout the application? | 0 | [
2,
98,
25,
13,
7,
13862,
108,
384,
2416,
7,
17,
378,
31,
4681,
32,
37,
21,
628,
4190,
18,
4865,
60,
800,
3726,
3726,
31,
589,
638,
27,
21,
13,
20468,
9,
2328,
628,
4190,
18,
4865,
30,
23,
13,
7,
576,
8031,
43,
7,
34,
3458,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 handle huge result sets from database
===
I'm designing a multi-tiered database driven web application – SQL relational database, Java for the middle service tier, web for the UI. The language doesn't really matter.
The middle service tier performs the actual querying of the database. The UI simply asks for certain data and has no concept that it's backed by a database.
The question is how to handle large data sets? The UI asks for data but the results might be huge, possibly too big to fit in memory. For example, a street sign application might have a service layer of:
StreetSign getStreetSign(int identifier)
Collection<StreetSign> getStreetSigns(Street street)
Collection<StreetSign> getStreetSigns(LatLonBox box)
The UI layer asks to get all street signs meeting some criteria. Depending on the criteria, the result set might be huge. The UI layer might divide the results into separate pages (for a browser) or just present them all (serving up to Goolge Earth). The potentially huge result set could be a performance and resource problem (out of memory).
One solution is not to return fully loaded objects (StreetSign objects). Rather return some sort of result set or iterator that lazily loads each individual object.
Another solution is to change the service API to return a subset of the requested data:
Collection<StreetSign> getStreetSigns(LatLonBoundingBox box, int pageNumber, int resultsPerPage)
Of course the UI can still request a huge result set:
getStreetSigns(box, 1, 1000000000)
I'm curious what is the standard industry design pattern for this scenario?
| 0 | [
2,
184,
20,
3053,
2329,
829,
3415,
37,
6018,
800,
3726,
3726,
31,
22,
79,
15026,
21,
1889,
8,
5259,
69,
6018,
5355,
2741,
3010,
13,
10,
4444,
255,
5827,
192,
6018,
15,
8247,
26,
14,
772,
365,
7197,
15,
2741,
26,
14,
13,
5661,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
MySQL if statement
===
Alright, so I have a query that looks like this:
SELECT
`orders`.*,
GROUP_CONCAT(
CONCAT(
`menu_items`.`name`,
' ($',
FORMAT(`menu_items`.`price`,2),
')'
) SEPARATOR '<br>'
) as `items`,
SUM(`menu_items`.`price`) as `additional`,
`children`.`first_name`,
`children`.`last_name`,
`organizations`.`base_price`
FROM
`orders`, `order_items`, `menu_items`, `children`, `organizations`
WHERE
`order_items`.`menu_item_id` = `menu_items`.`id` AND
`order_items`.`order_id` = `orders`.`id` AND
`orders`.`added_by` = {$user_id} AND
`orders`.`date` > '{$cutoff}' AND
`children`.`id` = `orders`.`child_id` AND
`organizations`.`id` = `children`.`organization_id`
GROUP BY
`orders`.`id`
I know it's a monstrosity and that some people will die before not using explicit joins. Ignoring that, however, what I wish to do is to only use the `CONCAT` inside the `GROUP_CONCAT` if the `menu_items.price` is greater than 0, otherwise only return `menu_items.name`. I have had, however, no success trying to throw an `IF` in there. I've read the manual but all the ways that I've tried aren't working and I'm pretty sure I'm missing something on the whole conditional statements thing. | 0 | [
2,
51,
18,
22402,
100,
3331,
800,
3726,
3726,
11885,
15,
86,
31,
57,
21,
25597,
30,
1879,
101,
48,
45,
5407,
13,
1,
7861,
18,
1,
9,
2483,
15,
214,
1,
1126,
5782,
5,
1065,
5782,
5,
13,
1,
755,
291,
1,
2119,
79,
18,
1,
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... |
Python inheritance - how to disable a functionn
===
In C++ you can disable a function in parent's class by declaring it as private in the child class. How can this be done in Python? I.E. How can I remove parent's function from child's public interface?
| 0 | [
2,
20059,
13852,
13,
8,
184,
20,
1460,
579,
21,
1990,
103,
800,
3726,
3726,
19,
272,
20512,
42,
92,
1460,
579,
21,
1990,
19,
4766,
22,
18,
718,
34,
15594,
32,
28,
932,
19,
14,
850,
718,
9,
184,
92,
48,
44,
677,
19,
20059,
60... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Why am I getting a "double response" from HttpWebResponse?
===
The follow code (running in ASP.Net 2.0) displays the contents of the requested URL **twice**. I only want it to display the contents of the requested URL once. I can't figure out what I'm doing wrong. The URL requested is returning XML and if I visit the URL directly, it works fine.
HttpWebRequest request = (HttpWebRequest)WebRequest.Create(url);
byte[] postDataBytes = Encoding.UTF8.GetBytes(postData);
request.Method = "POST";
request.ContentType = "application/xml";
request.ContentLength = postDataBytes.Length;
Stream requestStream = request.GetRequestStream();
requestStream.Write(postDataBytes, 0, postDataBytes.Length);
requestStream.Close();
// get response and write to console
response = (HttpWebResponse) request.GetResponse();
StreamReader responseReader = new StreamReader(response.GetResponseStream(), Encoding.UTF8);
try {
Response.Write(responseReader.ReadToEnd());
}
finally {
responseReader.Close();
}
response.Close();
| 0 | [
2,
483,
589,
31,
1017,
21,
13,
7,
14368,
1627,
7,
37,
7775,
458,
3692,
18,
8782,
870,
60,
800,
3726,
3726,
14,
1740,
1797,
13,
5,
11325,
19,
28,
306,
9,
2328,
172,
9,
387,
6,
9412,
14,
8478,
16,
14,
6602,
287,
6362,
13,
1409... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How can I have MySQL write outfiles as a different user?
===
I'm working with a MySQL query that writes into an outfile. I run this query once every day or two and so I want to be able to remove the outfile without having to resort to su or sudo. The only way I can think of making that happen is to have the outfile written as owned by someone other than the mysql user. Is this possible?
If it helps:<pre>
mysql --version
mysql Ver 14.12 Distrib 5.0.32, for pc-linux-gnu (x86_64) using readline 5.2
</pre> | 0 | [
2,
184,
92,
31,
57,
51,
18,
22402,
2757,
70,
16877,
18,
28,
21,
421,
4155,
60,
800,
3726,
3726,
31,
22,
79,
638,
29,
21,
51,
18,
22402,
25597,
30,
6215,
77,
40,
70,
16877,
9,
31,
485,
48,
25597,
382,
352,
208,
54,
81,
17,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
C++ two or more data types in declaration
===
I'm getting a strange error from `g++` in the following code:
#include <bitset>
#include <string>
using namespace std;
template <int N, int M>
bitset<N> slice_bitset(const bitset<M> &original, size_t start) {
string str = original.to_string<char, char_traits<char>, allocator<char> >();
string newstr = str.substr(start, N);
return bitset<N>(newstr);
}
The error is as follows:
<pre>
In function `std::bitset<_Nb> slice_bitset(const std::bitset<M>&, unsigned int)':
syntax error before `,' token
`char_traits<char>' specified as declarator-id
two or more data types in declaration of `char_traits<char>'
`allocator<char>' specified as declarator-id
two or more data types in declaration of `allocator<char>'
syntax error before `>' token
</pre>
It has to be something really silly, but I've already told it to my rubber duck and a friend to no avail.
Thanks, Lazyweb. | 0 | [
2,
272,
20512,
81,
54,
91,
1054,
2551,
19,
7098,
800,
3726,
3726,
31,
22,
79,
1017,
21,
2578,
7019,
37,
13,
1,
263,
20512,
1,
19,
14,
249,
1797,
45,
6926,
22640,
13,
1,
3326,
3554,
1,
6926,
22640,
13,
1,
11130,
1,
568,
204,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
WS* vs REST = horses for courses ... or not?
===
Ok so I've implemented both REST and SOAP services and I like both depending on the context. For me, WS* is great when I want an explicit contract between the server and the client e.g. for sensitive information or for mission critical stuff. REST on the other hand whilst flexible in terms of the schema definition, is in my mind more ideal for content services or data which is not required to undergo any serious business logic.
REST seems to be very much the flavour of the day, and I was somewhat put out when Martin Fowler et al from Thoughworks gave this podcast: [http://www.thoughtworks.com/what-we-say/podcasts.html][1] on REST and were derisive toward WS*. Whilst the man himself is well respected, am I right in thinking that there still is very much a place for SOAP and pinch of salt is required here? And has anyone used REST in a serious business application?
[1]: http://www.thoughtworks.com/what-we-say/podcasts.html | 0 | [
2,
619,
18,
2483,
4611,
760,
800,
3837,
26,
4392,
13,
9,
9,
9,
54,
52,
60,
800,
3726,
3726,
5854,
86,
31,
22,
195,
6807,
156,
760,
17,
6447,
687,
17,
31,
101,
156,
4758,
27,
14,
4141,
9,
26,
55,
15,
619,
18,
2483,
25,
374,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Force windows to refresh a disk FAT
===
I have a separate partition on my disk formatted with FAT32. When I hibernate windows, I want to be able to load another OS, create/modify files that are on that partition, then bring Windows out of hibernation and be able to see the changes that I've made.
I know what you're going to type, "Well, you're not supposed to do that!" and then link me to some specs about how what I'm trying to do is wrong/impossible/going to break EVERYTHING. However, I'm sure there's some way I can get around that. :)
I don't need the FAT32 partition in Windows, except to read the files that were written there, then I'm done - so whatever the solution is, it's acceptable for the disk to be completely inaccessible for a period of time. Unfortunately, I can't take the entire physical disk offline because it is just a partition of the same physical device that windows is installed on -- just the partition.
These are the things I've tried so far...
0. Google it. I got at least one "this is NEVER going to happen" answer. Unacceptable! :)
1. Unmount the disk before hibernating. Mount after coming out of hibernation. This seems to have no effect. Windows still thinks the FAT is the same as it was before, so whatever data I wrote to disk is lost, and any files I resized are corrupted. If any of the file was cached, it's even worse.
2. Use DeviceIoControl to call IOCTL\_DISK\_UPDATE\_PROPERTIES to try and refresh the disk (but the partition table hasn't changed, so this doesn't really do anything).
Is there any way to invalidate the disk/volume read cache to force windows to go back to the disk?
I thought about opening the partition and reading/writing directly by using libfat and bypassing the cache or something is overkill. | 0 | [
2,
558,
1936,
20,
24905,
21,
8582,
4211,
800,
3726,
3726,
31,
57,
21,
1725,
10711,
27,
51,
8582,
13,
29850,
29,
4211,
3125,
9,
76,
31,
4148,
2102,
8820,
1936,
15,
31,
259,
20,
44,
777,
20,
6305,
226,
13,
759,
15,
1600,
118,
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... |
Complex model binding to a list
===
I have been trying out the NameValueDeserializer from MVCContrib, which will take a IList as a parameter to a controller and bind a form and its elements to it, but I was just wondering if MVC Beta had any way of doing this??
I know you can bind a strongly typed Object but I want to bind a List of these Objects for some bulk editing situations.
eg.
public void Save(IList<Item> items)
{
foreach (Item i in items)
{
//Save item
}
}
Is this possible in MVC Beta??
Thanks in Advance. | 0 | [
2,
1502,
1061,
8728,
20,
21,
968,
800,
3726,
3726,
31,
57,
74,
749,
70,
14,
204,
15165,
3196,
106,
2815,
11907,
37,
307,
8990,
1126,
38,
17980,
15,
56,
129,
247,
21,
31,
5739,
28,
21,
18906,
20,
21,
9919,
17,
10193,
21,
505,
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... |
Violation reading location in std::map operator[]
===
I encountered a problem when running some old code that was handed down to me. It works 99% of the time, but once in a while, I notice it throwing a "Violation reading location" exception. I have a variable number of threads potentially executing this code throughout the lifetime of the process. The low occurrence frequency may be indicative of a race condition, but I don't know why one would cause an exception in this case. Here is the code in question:
<pre><code>MyClass::Dostuff()
{
static map<char, int> mappedChars;
if (mappedChars.empty())
{
for (char c = '0'; c <= '9'; ++c)
{
mappedChars[c] = c - '0';
}
}
// More code here
}
</code></pre>
The exception is thrown in the map's operator[] implementation, on the very first call to the operator[] (Using the VS2005 implementation of STL.)
<pre><code>
mapped_type& operator[](const key_type& _Keyval)
{
iterator _Where = this->lower_bound(_Keyval); //exception thrown on the first line
// More code here
}
</code></pre>
I already tried freezing threads in operator[] and trying to get them to all run through it at the same time, but I was unable to reproduce the exception using that methodology.
Can you think of any reason why that would throw, and only some of the time?
(Yes, I know STL is not thread-safe and I'll need to make changes here. I am mostly curious as to WHY I'm seeing the behavior I described above.) | 0 | [
2,
12120,
1876,
1474,
19,
354,
43,
45,
45,
15022,
6022,
2558,
500,
800,
3726,
3726,
31,
8208,
21,
1448,
76,
946,
109,
315,
1797,
30,
23,
3988,
125,
20,
55,
9,
32,
693,
13,
26014,
16,
14,
85,
15,
47,
382,
19,
21,
133,
15,
31,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Confused about BackgroundWorker events not firing
===
This may seem like a somewhat contrived example, but I'm left scratching my head.
Ok, I have a console app that instantiates a WindowsForm and calls a method called DoSomeWork() on the form.
class Program
{
static void Main(string[] args)
{
Form1 form = new Form1();
form.DoSomeWork();
}
}
Form1 looks like this...
public partial class Form1 : Form
{
public Form1()
{
InitializeComponent();
}
public void DoSomeWork()
{
OuterClass outerClass = new OuterClass();
outerClass.DoSomeWork();
}
}
Outer class, in turn, looks like this...
public class OuterClass
{
public void DoSomeWork()
{
InnerClass innerClass = new InnerClass();
innerClass.DoSomeWork();
}
}
And finally InnerClass looks like this...
public class InnerClass
{
private BackgroundWorker _backgroundWorker = new BackgroundWorker();
public InnerClass()
{
_backgroundWorker.WorkerReportsProgress = true;
_backgroundWorker.DoWork += new DoWorkEventHandler(BackgroundWorker_DoWork);
_backgroundWorker.ProgressChanged += new ProgressChangedEventHandler(BackgroundWorker_ProgressChanged);
}
void BackgroundWorker_ProgressChanged(object sender, ProgressChangedEventArgs e)
{
throw new NotImplementedException();
}
void BackgroundWorker_DoWork(object sender, DoWorkEventArgs e)
{
BackgroundWorker worker = sender as BackgroundWorker;
worker.ReportProgress(42);
}
public void DoSomeWork()
{
_backgroundWorker.RunWorkerAsync();
}
}
For a reason unknown (to me), the BacgroundWorker in InnerClass never seems to fire the **ProgressChanged** event. If I replace
Form1 form = new Form1();
with
OuterClass outerClass = new OuterClass()
in class Program, it works fine. So why is that my events don't fire when I'm calling the same methods through a Form?
Thanks! | 0 | [
2,
4230,
88,
2395,
22560,
963,
52,
7139,
800,
3726,
3726,
48,
123,
2260,
101,
21,
4131,
1065,
3367,
4763,
823,
15,
47,
31,
22,
79,
225,
22202,
51,
157,
9,
5854,
15,
31,
57,
21,
8650,
4865,
30,
6322,
15882,
18,
21,
1936,
4190,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 2.0 MVC?
===
Does ASP.Net 2.0 and Visual Studio 2005 has the possibility of working with MVC or I have to move to VS2008 and asp.net 3.5? | 0 | [
2,
28,
306,
9,
2328,
172,
9,
387,
307,
8990,
60,
800,
3726,
3726,
630,
28,
306,
9,
2328,
172,
9,
387,
17,
3458,
1120,
812,
63,
14,
4813,
16,
638,
29,
307,
8990,
54,
31,
57,
20,
780,
20,
4611,
2753,
17,
28,
306,
9,
2328,
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,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
What does "yield break;" do in C#?
===
I have seen this syntax in MSDN, but I don't know what it does. Does anyone know? | 0 | [
2,
98,
630,
13,
7,
93,
8487,
43,
1442,
73,
7,
107,
19,
272,
5910,
60,
800,
3726,
3726,
31,
57,
541,
48,
22649,
19,
4235,
43,
103,
15,
47,
31,
221,
22,
38,
143,
98,
32,
630,
9,
630,
1276,
143,
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,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
How much to log within an applicaiton??? How much is too much...
===
Just wondering how much people log within their applications???
I have seen this:
> "I typically like to use the ERROR log
> level to log any exceptions that are
> caught by the application. I will use
> the INFO log level as a "first level"
> debugging scheme to show whenever I
> enter or exit a method. From there I
> use the DEBUG log level to trace
> detailed information. The FATAL log
> level is used for any exceptions that
> I have failed to catch in my web based
> applications."
Which had this code sample with it:
Public Class LogSample
Private Shared ReadOnly Log As log4net.ILog = log4net.LogManager.GetLogger(GetType(LogSample))
Public Function AddNumbers(ByVal Number1 As Integer, ByVal Number2 As Integer) As Integer
Dim intResults As Integer
Log.Info("Starting AddNumbers Method...")
Log.Debug("Number1 Specified: " & Number1)
Log.Debug("Number2 Specified: " & Number2)
intResults = Number1 + Number2
Try
intResults = Number1 + Number2
Catch ex As Exception
Log.Error("Error Adding Nubmers.", ex)
End Try
Log.Info("AddNumbers Method Complete.")
Return intResults
End Function
End Class
But this just seems to add so much to the method. For instance a class that would normally be maybe 7 lines of code suddenly becomes 12 lines of code. The method also loses some of its clarity and simplicity.
But in saying that the benefit of having the logging in place can be good. For instance performance monitoring in a production system, chasing down aberrant bugs in production (not that you would have all this logging turned on all the time.
Hence i am wondering what people do?
Cheers
Anthony | 0 | [
2,
184,
212,
20,
6738,
363,
40,
4865,
16904,
49,
444,
60,
60,
60,
184,
212,
25,
266,
212,
9,
9,
9,
800,
3726,
3726,
114,
5712,
184,
212,
148,
6738,
363,
66,
3767,
60,
60,
60,
31,
57,
541,
48,
45,
13,
1,
13,
7,
49,
2442,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 difference between sigaction and signal?
===
I was about to add an extra signal handler to an app we have here and I noticed that the author had used sigaction to set up the other signal handlers. I was going to use signal. To follow convention I should use sigaction but if I was writing from scratch, which should I choose? | 0 | [
2,
98,
25,
14,
2841,
128,
8858,
8645,
17,
2800,
60,
800,
3726,
3726,
31,
23,
88,
20,
3547,
40,
2230,
2800,
24641,
20,
40,
4865,
95,
57,
235,
17,
31,
2711,
30,
14,
1314,
41,
147,
8858,
8645,
20,
309,
71,
14,
89,
2800,
24641,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Integer Contains
===
This originally was a problem I ran into at work, but is now something I'm just trying to solve for my own curiosity.
I want to find out if int 'a' contains the int 'b' in the most efficient way possible. This method will be called millions and millions of times, so its important that it be very fast. I wrote some code, but it seems no matter what I write, parsing it into a string and then using indexOf is twice as fast as doing it mathematically.
Memory is not an issue (within reason), just sheer processing speed.
This is the code I have written to do it mathematically:
private static int[] exponents = {10, 100, 1000, 10000, 100000, 1000000, 10000000, 100000000, 1000000000 };
private static boolean findMatch(int a, int b) {
if (b > a) return false;
if (a == b) return true;
int needleLength = getLength(b);
int exponent = exponents[needleLength];
int subNum;
while (a >= 1) {
subNum = a % exponent;
if (subNum == b)
return true;
a /= 10;
}
return false;
}
private static int getLength(int b) {
int len = 0;
while (b >= 1) {
len++;
b /= 10;
}
return len;
}
Originally I had getLength look like this:
private static int getLength(int a) {
return a < 10 ? 1 : (int) Math.ceil(Math.log10(a));
}
But log and Math.ceil are fairly expensive, and the getLength() method listed previously seems to be more efficient.
Here's the string method I'm using, which seems to trump the mathematical method above:
private static boolean findStringMatch(int a, int b) {
return String.valueOf(a).indexOf(String.valueOf(b)) != -1;
}
According to the test I'm using (pasted below), String is always about twice as fast. Now, maybe this is just how it's supposed to work, but it just boggles my mind that parsing it into a String and then doing an indexOf is faster than just doing calculations.
So although this isn't really required for me to complete my work, I was just wondering if anyone could think of any way to further optimize my way of doing it mathematically, or an entirely new approach altogether. Again memory is no problem, I am just shooting for sheer speed.
I used the doWrite() function to generate a test file and doRead() to test it.
private static void doRead() {
File file = new File("testNumbers.txt");
int testIncrement = 1000;
int testNumber = 2343;
BufferedReader bw = null;
FileReader writer = null;
long totalTime = 0;
long x = 0;
List<Integer> list = new ArrayList<Integer>();
try {
writer = new FileReader(file);
bw = new BufferedReader(writer);
String line = "";
while ((line = bw.readLine()) != null) {
x++;
list.add(Integer.parseInt(line));
if (x % testIncrement == 0) {
Iterator<Integer> iter = list.iterator();
long currentTime = System.currentTimeMillis();
while (iter.hasNext()) {
doesMatch(iter.next(), testNumber);
}
long doneTime = System.currentTimeMillis();
System.out.println(x + " numbers parsed");
list.clear();
totalTime += (doneTime - currentTime);
}
}
} catch (Exception e) {
e.printStackTrace();
} finally {
try { bw.close(); } catch (Exception e) { }
try { writer.close(); } catch (Exception e) { }
}
double time = (totalTime * 1.0) / (x / testIncrement);
System.out.println("Average processing time for " + testIncrement + " numbers: " + time + " milliseconds");
System.out.println(x + " total numbers processed");
}
private static void doesMatch(int a, int b) {
findMatch(a, b);
}
private static void doWrite() {
File file = new File("testNumbers.txt");
Random rand = new Random(System.currentTimeMillis());
BufferedWriter bw = null;
FileWriter writer = null;
try {
writer = new FileWriter(file);
bw = new BufferedWriter(writer);
for (int x = 0; x < 3467970; x++) {
int a = rand.nextInt(10000000);
if (a > 0) bw.write(String.valueOf(a) + "\r\n");
}
} catch (Exception e) {
e.printStackTrace();
} finally {
try { bw.close(); } catch (Exception e) { }
try { writer.close(); } catch (Exception e) { }
}
}
I'm really interested to see or hear anything anyone has to offer on this.
Thanks in advance! | 0 | [
2,
13820,
1588,
800,
3726,
3726,
48,
912,
23,
21,
1448,
31,
717,
77,
35,
170,
15,
47,
25,
130,
301,
31,
22,
79,
114,
749,
20,
8402,
26,
51,
258,
11581,
9,
31,
259,
20,
477,
70,
100,
19,
38,
13,
22,
58,
22,
1588,
14,
19,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
SharePoint - ASP.Net Controls Integration
===
I have basically two separate sites, a SharePoint collaboration site, and an ASP.Net application site. The only linkage between the two are the hyperlinks going back and forth, and the user validation on the behalf of the SharePoint site. The user will enter and be authenticated through the SharePoint site and then may browse to the ASP.Net application.
What is the best way to integrate the two sites together? Is there an easy way to give the users a seamless experience while maintaining two sites? | 0 | [
2,
1891,
3132,
13,
8,
28,
306,
9,
2328,
8671,
8078,
800,
3726,
3726,
31,
57,
11374,
81,
1725,
3259,
15,
21,
1891,
3132,
4004,
689,
15,
17,
40,
28,
306,
9,
2328,
3010,
689,
9,
14,
104,
26215,
128,
14,
81,
50,
14,
5443,
6258,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
What's the best python soap stack for consuming Amazon Web Services WSDL?
===
Python has a [number of soap stacks](http://stackoverflow.com/questions/206154/whats-the-best-soap-client-library-for-python-and-where-is-the-documentation-fo); as near as I can tell, all have substantial defects.
Has anyone had luck consuming <i>and</i> using WSDL for S3, EC2, and SQS in python?
My experience is that suds fails when constructing a Client object; after some wrangling, ZSI generates client code that doesn't work; etc.
Finally, I'm aware of [boto](http://code.google.com/p/boto/) but as it is a hand-rolled wrapper around AWS, it is (1) incomplete and (2) never up-to-date with the latest AWS WSDL.
| 0 | [
2,
98,
22,
18,
14,
246,
20059,
6447,
7566,
26,
13,
17601,
8059,
2741,
687,
619,
18,
8643,
60,
800,
3726,
3726,
20059,
63,
21,
636,
16299,
16,
6447,
7566,
18,
500,
5,
21127,
6903,
25325,
2549,
9990,
9,
960,
118,
24652,
18,
118,
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... |
Animating inline elements with JQuery
===
I am trying to show and hide an inline element (eg a span) using jquery. If I just use toggle(), it works as expected but if I use toggle("slow") to give it an animation, it turns the span into a block element and therefore inserts breaks. Is animation possible with inline elements?
Thanks.
<script type="text/javascript">
$(function(){
$('.toggle').click(function() { $('.hide').toggle("slow") });
});
</script>
<p>Hello <span class="hide">there</span> jquery</p>
<button class="toggle">Toggle</button>
| 0 | [
2,
14487,
1203,
19,
1143,
2065,
29,
487,
8190,
93,
800,
3726,
3726,
31,
589,
749,
20,
298,
17,
3077,
40,
19,
1143,
4520,
13,
5,
5431,
21,
6289,
6,
568,
487,
8190,
93,
9,
100,
31,
114,
275,
20,
263,
4875,
5,
6,
15,
32,
693,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 disruptive thing in a developer's day
===
What things interrupt developers during the day and really derail your progress?
Phone calls,
OS issues,
Email,
change control,
meetings,
etc.
Which in particular make you change gears to the point that it takes a significant amount of time to return to a programming task. | 2 | [
2,
98,
25,
14,
127,
14668,
1284,
584,
19,
21,
10058,
22,
18,
208,
800,
3726,
3726,
98,
564,
15811,
10168,
112,
14,
208,
17,
510,
121,
7301,
154,
3455,
60,
1132,
3029,
15,
13,
759,
1549,
15,
8517,
15,
753,
569,
15,
5637,
15,
27... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
AOP for winforms . .
===
what is the best way to capture user clicks in my winform application with out making the code very complicated. is AOP the answer ? any good links or examples of this to track instrumentations . . | 0 | [
2,
21,
2594,
26,
628,
4190,
18,
13,
9,
13,
9,
800,
3726,
3726,
98,
25,
14,
246,
161,
20,
3683,
4155,
10840,
18,
19,
51,
628,
4190,
3010,
29,
70,
544,
14,
1797,
253,
8343,
9,
25,
21,
2594,
14,
1623,
13,
60,
186,
254,
6271,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
How do I do advanced printing from a web application?
===
I have been researching options for printing report-like data via a web application. Some options that are viable are writing PDFs, Excel XML, dumping HTML to Excel, or using a tool like activePDF webGrabber. I suppose the question is, what are some solution that give control over print from a browser (IE in my case) yet doesn't have a huge development time. Though I don't have experience with it myself, I have seen some horrid code for generating PDFs.
The features I'm looking for in particular are to print landscape or portrait without user intervention. Also, having control over basic styling is important to translate the basic look/feel of the web app to the printed format.
Any advice (especially from experience) is appreciated. | 0 | [
2,
184,
107,
31,
107,
2255,
7312,
37,
21,
2741,
3010,
60,
800,
3726,
3726,
31,
57,
74,
527,
68,
6368,
26,
7312,
1330,
8,
1403,
1054,
1197,
21,
2741,
3010,
9,
109,
6368,
30,
50,
17347,
50,
1174,
13,
11124,
18,
15,
20700,
23504,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
C# string to HtmlDocument
===
For the moment the best way that I have found to be able to manipulate DOM from a string that contain HTML is :
WebBrowser webControl = new WebBrowser();
webControl.DocumentText = html;
HtmlDocument doc = webControl.Document;
The problem is 2 things : 1- Require the WebBrowser object! 2- This can't be used with multiple thread... I need something that would work on different thread (different of the main thread).
Any idea? | 0 | [
2,
272,
5910,
3724,
20,
13,
15895,
28132,
800,
3726,
3726,
26,
14,
688,
14,
246,
161,
30,
31,
57,
216,
20,
44,
777,
20,
18468,
11859,
37,
21,
3724,
30,
3717,
13,
15895,
25,
13,
45,
10192,
5417,
4104,
2741,
12898,
800,
78,
10192,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Will Django be a good choice for a permissions based web-app?
===
I've been exploring the details of Django for about a week now and like what I see. However I've come upon some.. negativity in relation to fine-grained control of permissions to the CRUD interface.
What I'm writing is an Intranet client management web-app. The organisation is about 6 tiers, and I need to restrict access to client groups based on tiers. Continually expanding. I have a fairly good idea how I'm going to do this, but am not sure if I'll be able to integrate it well into the pre-built admin interface.
I've done absolutely zero Django development otherwise I'd probably have a better idea on whether this would work or not. I probably won't use Django if the generated admin interface is going to be useless to this project - but like I said, there is a heavy reliance on fine-grained custom permissions.
Will Django let me build custom permissions/rules and integrate it seamlessly into the admin CRUD interface? | 0 | [
2,
129,
3857,
14541,
44,
21,
254,
1837,
26,
21,
5572,
18,
432,
2741,
8,
7753,
60,
800,
3726,
3726,
31,
22,
195,
74,
11748,
14,
3289,
16,
3857,
14541,
26,
88,
21,
877,
130,
17,
101,
98,
31,
196,
9,
207,
31,
22,
195,
340,
685,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 Manage Infragistics WebGrid Data from JavaScript/Ajax code?
===
I am working on a project that I need to use the Infragistics WebGrid control for some lists of data. I am loading the data on the client-side using JavaScript for display on a Map, and then I need to display that same data within multiple WebGrids. All the data available will be displayed in the WebGrids, but only a subset of the data (only that which is currently within view) will be plotted on the Map at any given time. Since I am loading the data using JavaScript/Ajax, I would like to only load it once, and use the same mechanism to populate the WebGrid control with data too.
Does anyone have any tips/pointers on working with the WebGrid completely from within client-side JavaScript/Ajax code?
| 0 | [
2,
184,
107,
42,
4705,
19,
22133,
3771,
18,
2741,
16375,
1054,
37,
8247,
8741,
118,
6881,
7522,
1797,
60,
800,
3726,
3726,
31,
589,
638,
27,
21,
669,
30,
31,
376,
20,
275,
14,
19,
22133,
3771,
18,
2741,
16375,
569,
26,
109,
7227... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
C++ Parent class calling a child virtual function
===
I want a pure virtual parent class to call a child implementation of a function like so:
class parent
{
public:
void Read() { //read stuff }
virtual void Process() = 0;
parent()
{
Read();
Process();
}
}
class child : public parent
{
public:
virtual void Process() { //process stuff }
child() : parent() { }
}
int main()
{
child c;
}
This should work, but I get an unlinked error :/ This is using VC++ 2k3
Or shouldn't it work, am I wrong? | 0 | [
2,
272,
20512,
4766,
718,
2555,
21,
850,
6599,
1990,
800,
3726,
3726,
31,
259,
21,
4267,
6599,
4766,
718,
20,
645,
21,
850,
6123,
16,
21,
1990,
101,
86,
45,
718,
4766,
13,
1,
317,
45,
11364,
1302,
5,
6,
13,
1,
12894,
10647,
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... |
How do you promot joint code ownership?
===
A strong Agile concept is Joint Code Ownership - no single member of the team owns a piece of code, but rather the entire team. This means the code is up for editing, improvement, refactoring...
How do you promote this concept? How do you deal with a team member that has trust issues regarding his code, and remains suspicious of other people messing with it? | 2 | [
2,
184,
107,
42,
19959,
38,
2266,
1797,
5074,
60,
800,
3726,
3726,
21,
966,
27475,
2420,
25,
2266,
1797,
5074,
13,
8,
90,
345,
322,
16,
14,
173,
258,
18,
21,
1855,
16,
1797,
15,
47,
864,
14,
1078,
173,
9,
48,
1108,
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... |
Can you reformat date parameter values in Reporting Services?
===
Is it possible to transform the format of a date value that is passed to the query? I am trying to create a report that interfaces with a SAP back-end, but the query uses a different format for date objects. I need to take the selected date and reformat it to "yyyy.mm.dd" (including the quotes). Is this possible? I can do it as a textbox, but this is a bit ugly. Any advice would be appreciated. | 0 | [
2,
92,
42,
3202,
721,
1231,
18906,
4070,
19,
6670,
687,
60,
800,
3726,
3726,
25,
32,
938,
20,
8007,
14,
2595,
16,
21,
1231,
1923,
30,
25,
1100,
20,
14,
25597,
60,
31,
589,
749,
20,
1600,
21,
1330,
30,
6573,
18,
29,
21,
7508,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 submit RESTful partial updates?
===
Sam Ruby, author of "RESTful Web Services" seems to come out against the use of HTTP PUT for partial updates: http://intertwingly.net/blog/2008/02/15/Embrace-Extend-then-Innovate
What isn't clear is how partial updates *should* take place. As I commented near the bottom of his blog, it isn't clear how using HTTP PATCH is any better than using a "patch document" against HTTP PUT.
It is worth noting that although Sam comes out against misusing HTTP PUT he doesn't seem to advocate the use of HTTP PATCH either.
How should one submit RESTful partial updates? | 0 | [
2,
184,
20,
12298,
760,
1566,
7284,
16779,
60,
800,
3726,
3726,
1113,
10811,
15,
1314,
16,
13,
7,
11466,
1566,
2741,
687,
7,
2206,
20,
340,
70,
149,
14,
275,
16,
7775,
442,
26,
7284,
16779,
45,
7775,
6903,
6280,
38,
3546,
102,
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... |
Debugging greasemonkey-like scripts
===
I'm writing javascript code that is read in as a string and executed via eval() by a firefox extension. Firebug does "see" my script so I am not able to use breakpoints, see objects, etc.
I am currently using Firefox's error console which I'm starting to find limiting. What are my other options? Ideally, I would be able to use Firebug or something similar to it. How do people generally debug Greasemonkey scripts?
I've tried using Lint and other validators, but my script uses a lot of objects and functions provided by the extension environment, making of a lot of the errors reported irrelevant. Also, the output tends to be too nitpicky (focusing of spacing issues, etc). | 0 | [
2,
121,
16254,
2762,
21167,
2111,
4237,
8,
1403,
17505,
800,
3726,
3726,
31,
22,
79,
1174,
8247,
8741,
1797,
30,
25,
1302,
19,
28,
21,
3724,
17,
5557,
1197,
13,
62,
3377,
5,
6,
34,
21,
535,
18219,
3896,
9,
535,
16254,
630,
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... |
Add elements between elements with Jython and dom4j
===
Just playing with dom4j, excellent. I was a PHP developer for a year and half, just got a new job and started playing around with Jython now I have spare time, its a great language. Was thinking about trying to add a element in between element, example below:
<div id="content">
<p>Some text in here</p>
<!--New p tag here-->
<p>Some text in here</p>
</div>
Is it possible to insert another **p** tag in between the two without converting the DOM to a string and back to DOM again as this is the only way I have been able to do it? | 0 | [
2,
3547,
2065,
128,
2065,
29,
487,
93,
11570,
17,
11859,
300,
728,
800,
3726,
3726,
114,
791,
29,
11859,
300,
728,
15,
5977,
9,
31,
23,
21,
13,
26120,
10058,
26,
21,
159,
17,
519,
15,
114,
330,
21,
78,
1205,
17,
373,
791,
140,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 solution for deploying IIS websites that's similar to Capistrano?
===
[Capistrano][1] is a great solution for building scripts that automatically deploy a website and/or a database. But, it's also very *nix centric, and from I've read it would probably be more trouble than it's worth to get it working with a Windows server. Is there a similar solution that would allow me to deploy an ASP.Net website to an IIS server and a SQL Server database?
What I'm looking for is something that would allow the same kind of flexibility that Capistrano allows, as far customizing how I want the site to be deployed, what version control system I want to pull from, how it will handle rollbacks to a previous version of a site, etc. So far, I haven't been able to find a free solution that has the same sort of functionality that Capistrano has.
[1]: http://www.capify.org/ | 0 | [
2,
25,
80,
21,
4295,
26,
17617,
68,
595,
18,
13931,
30,
22,
18,
835,
20,
2605,
702,
17555,
60,
800,
3726,
3726,
636,
4666,
702,
17555,
500,
2558,
165,
500,
25,
21,
374,
4295,
26,
353,
17505,
30,
7499,
17617,
21,
2271,
17,
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... |
MessageBox.Show-- font change?
===
I'm using the MessageBox class to show errors to users, and while that might not be the right behavior, it's very convenient. This is a touchscreen application, however, so I need the 'ok' button to be much larger than it is (curse my inordinately large fingers!).
I think that if I increase the font size in the dialog box, I should be ok. Is there a way to do that? Or really, is there any way to increase the dialog size?
Thanks | 0 | [
2,
2802,
5309,
9,
9303,
8,
8,
9978,
753,
60,
800,
3726,
3726,
31,
22,
79,
568,
14,
2802,
5309,
718,
20,
298,
11908,
20,
3878,
15,
17,
133,
30,
530,
52,
44,
14,
193,
3257,
15,
32,
22,
18,
253,
12845,
9,
48,
25,
21,
1723,
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... |
Does Delphi have any equivalent to C's volatile variable?
===
In C and C++ a variable can be marked as [**volatile**][1], which means the compiler will not optimize it because it may be modified external to the declaring object. Is there an equivalent in Delphi programming? If not a keyword, maybe a work around?
My thought was to use **Absolute**, but I wasn't sure, and that may introduce other side effects.
[1]: http://en.wikipedia.org/wiki/Volatile_variable | 0 | [
2,
630,
23030,
57,
186,
4602,
20,
272,
22,
18,
24208,
7612,
60,
800,
3726,
3726,
19,
272,
17,
272,
20512,
21,
7612,
92,
44,
2739,
28,
636,
1409,
5847,
58,
9802,
1409,
500,
2558,
165,
500,
15,
56,
1108,
14,
21486,
129,
52,
22864,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Common WCF Exception : Connection Unexpectedly Closed
===
I have three projects. One is a WCF Services Project, one is a WPF Project, and one is a Microsoft Unit Testing Project. I setup the WCF Services project with a data object that looks like this:
[DataContract]
public enum Priority
{
Low,
Medium,
High
}
[DataContract]
public struct TimeInfo
{
[DataMember]
public Int16 EstimatedHours { get; set; }
[DataMember]
public Int16 ActualHours { get; set; }
[DataMember]
public DateTime StartDate { get; set; }
[DataMember]
public DateTime EndDate { get; set; }
[DataMember]
public DateTime CompletionDate { get; set; }
}
[DataContract]
public class Task
{
[DataMember]
public string Title { get; set; }
[DataMember]
public string Description { get; set; }
[DataMember]
public Priority Priority { get; set; }
[DataMember]
public TimeInfo TimeInformation { get; set; }
[DataMember]
public Decimal Cost { get; set; }
}
My contract looks like this:
[ServiceContract]
public interface ITaskManagement
{
[OperationContract]
List<Task> GetTasks();
[OperationContract]
void CreateTask(Task taskToCreate);
[OperationContract]
void UpdateTask(Task taskToCreate);
[OperationContract]
void DeleteTask(Task taskToDelete);
}
When I try to use the service in either the WPF Application or the Unit Test Project with this code:
var client = new TaskManagementClient();
textBox1.Text = client.GetTasks().ToString();
client.Close();
I get the following error: "The underlying connection was closed: The connection was closed unexpectedly."
The app.config for the WPF and Unit Test Projects look like this:
<system.serviceModel>
<bindings>
<wsHttpBinding>
<binding name="WSHttpBinding_ITaskManagement" closeTimeout="00:01:00"
openTimeout="00:01:00" receiveTimeout="00:10:00" sendTimeout="00:01:00"
bypassProxyOnLocal="false" transactionFlow="false" hostNameComparisonMode="StrongWildcard"
maxBufferPoolSize="524288" maxReceivedMessageSize="65536"
messageEncoding="Text" textEncoding="utf-8" useDefaultWebProxy="true"
allowCookies="false">
<readerQuotas maxDepth="32" maxStringContentLength="8192" maxArrayLength="16384"
maxBytesPerRead="4096" maxNameTableCharCount="16384" />
<reliableSession ordered="true" inactivityTimeout="00:10:00"
enabled="false" />
<security mode="Message">
<transport clientCredentialType="Windows" proxyCredentialType="None"
realm="" />
<message clientCredentialType="Windows" negotiateServiceCredential="true"
algorithmSuite="Default" establishSecurityContext="true" />
</security>
</binding>
</wsHttpBinding>
</bindings>
<client>
<endpoint address="http://localhost:9999/TaskManagement.svc"
binding="wsHttpBinding" bindingConfiguration="WSHttpBinding_ITaskManagement"
contract="TaskManagement.ITaskManagement" name="WSHttpBinding_ITaskManagement">
<identity>
<dns value="localhost" />
</identity>
</endpoint>
</client>
</system.serviceModel>
and the web.config of the WCF Service looks like this:
<system.serviceModel>
<behaviors>
<serviceBehaviors>
<behavior name="InternetBasedWcfServices.TaskManagementBehavior">
<serviceMetadata httpGetEnabled="true" />
<serviceDebug includeExceptionDetailInFaults="false" />
</behavior>
<behavior name="InternetBasedWcfServices.ScheduleManagementBehavior">
<serviceMetadata httpGetEnabled="true" />
<serviceDebug includeExceptionDetailInFaults="false" />
</behavior>
</serviceBehaviors>
</behaviors>
<services>
<service behaviorConfiguration="InternetBasedWcfServices.TaskManagementBehavior"
name="InternetBasedWcfServices.TaskManagement">
<endpoint address="" binding="wsHttpBinding" contract="InternetBasedWcfServices.ITaskManagement">
<identity>
<dns value="localhost" />
</identity>
</endpoint>
<endpoint address="mex" binding="mexHttpBinding" contract="IMetadataExchange" />
</service>
<service behaviorConfiguration="InternetBasedWcfServices.ScheduleManagementBehavior"
name="InternetBasedWcfServices.ScheduleManagement">
<endpoint address="" binding="wsHttpBinding" contract="InternetBasedWcfServices.IScheduleManagement">
<identity>
<dns value="localhost" />
</identity>
</endpoint>
<endpoint address="mex" binding="mexHttpBinding" contract="IMetadataExchange" />
</service>
</services>
</system.serviceModel>
This is not the first time this has happened, and I'm guessing it is a configuration issue. But each time I've usually just blown away my service and put it back or created a new service project. Then everything works wonderfully. If anyone has any ideas, that would be awesome. Thx. | 0 | [
2,
757,
11801,
410,
5391,
13,
45,
2760,
16044,
827,
800,
3726,
3726,
31,
57,
132,
2314,
9,
53,
25,
21,
11801,
410,
687,
669,
15,
53,
25,
21,
619,
7721,
669,
15,
17,
53,
25,
21,
7099,
1237,
4431,
669,
9,
31,
18161,
14,
11801,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Shell extension for selected file
===
Is there a way to know which file is being selected in windows explorer? I've been looking at the tutorial posted here <a href="http://stackoverflow.com/questions/140312/tutorial-for-windows-shell-extensions">Idiots guide to ...</a> but the actions described are:
hover
context
menu properties
drag
drag and drop
I wonder if is there a method that get invoked when a file is selected. For instance to create a thumbnail view of the file.
Thanks. | 0 | [
2,
3593,
3896,
26,
1704,
3893,
800,
3726,
3726,
25,
80,
21,
161,
20,
143,
56,
3893,
25,
142,
1704,
19,
1936,
8520,
60,
31,
22,
195,
74,
699,
35,
14,
29724,
6054,
235,
13,
1,
58,
746,
14057,
3726,
7,
21127,
6903,
25325,
2549,
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... |
Addin extra properties to MembershipProvider
===
I am using SqlMemberShipProvider and it works well, but I wish that the MembershipUser had some additional properties such as FirstName, LastName, Phone Number, etc. What is the best way to go about this? Do I have to create a custom membership provider or is there a better way to add additional functionality to users? | 0 | [
2,
3547,
108,
2230,
3704,
20,
4363,
26735,
139,
800,
3726,
3726,
31,
589,
568,
4444,
255,
6990,
2418,
26735,
139,
17,
32,
693,
134,
15,
47,
31,
2536,
30,
14,
4363,
16704,
41,
109,
1351,
3704,
145,
28,
64,
7259,
15,
236,
7259,
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... |
Image Slider with Silverlight
===
I have a requirement of creating an Image slider using Silverlight. I need to display 5 images at first. There will be two buttons previous and next. When I'll click the next button another new 5 images will be shown in place of previously diplayed images. Would it be possible for anyone to tell me the solution for this?
Someone please help me. | 0 | [
2,
1961,
3295,
106,
29,
1172,
3130,
800,
3726,
3726,
31,
57,
21,
8981,
16,
2936,
40,
1961,
3295,
106,
568,
1172,
3130,
9,
31,
376,
20,
3042,
331,
3502,
35,
64,
9,
80,
129,
44,
81,
12861,
1158,
17,
328,
9,
76,
31,
22,
211,
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... |
Is TFS's source control just a beefed up VSS or is it significantly different?
===
My workplace is planning on moving to Team Foundation Server and it's not a moment too soon - anything to get away from the cancer that is Visual SourceSafe.
However, I must ask - is the source control in TFS significantly different (and better) than VSS or is it just a "beefed up" version of the same thing?
I ask this now since this is probably my last window to suggest something like Subversion. | 0 | [
2,
25,
13,
11720,
18,
22,
18,
1267,
569,
114,
21,
12500,
69,
71,
4611,
18,
54,
25,
32,
5085,
421,
60,
800,
3726,
3726,
51,
16932,
25,
2334,
27,
1219,
20,
173,
1304,
8128,
17,
32,
22,
18,
52,
21,
688,
266,
651,
13,
8,
602,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Extra backslashes being added in PHP
===
My <sub>crappy</sub> web host did some upgrades the other day and some settings have gone awry, because looking at our company's wiki (MediaWiki), every quote is being escaped with a backslashes. It's not even just data which is being posted (ie: the articles) which are affected, but also the standard MediaWiki text. eg:
>You\'ve followed a link to a page that doesn\'t exist yet. To create the page, start typing in the box below (see the help page for more info). If you are here by mistake, just click your browser\'s \'\'\'back\'\'\' button.
The first thing I did was disable `magic_quotes_gpc` AND `magic_quotes_runtime` using a `.htaccess` file, but this is still occurring. My `php_info()` reports this:
Setting Local Value Master Value
magic_quotes_gpc Off On
magic_quotes_runtime Off On
magic_quotes_sybase Off Off
Any ideas? | 0 | [
2,
2230,
97,
18,
9545,
160,
142,
905,
19,
13,
26120,
800,
3726,
3726,
51,
13,
1,
7563,
1,
7519,
17129,
1,
118,
7563,
1,
2741,
2015,
144,
109,
9483,
18,
14,
89,
208,
17,
109,
12410,
57,
1042,
13,
3885,
622,
15,
185,
699,
35,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Stored Procedures - End of days.
===
I’m listening to the Hanselminutes Podcast; "StackOverflow uses ASP.NET MVC - Jeff Atwood and his technical team". During the course of the Podcast they are speaking about SQL server and say something along the lines of 'The days of the Stored Procedure are over'.
Now I'm not a DBA but this has taken me a bit by surprise. I always assumed that SPs were the way to go for speed (as they are complied) and security not to mention scalability and maintainability. If this is not the case and SPs are on their last legs, what will replace them or what should we be doing in the future? | 0 | [
2,
8214,
8876,
13,
8,
241,
16,
509,
9,
800,
3726,
3726,
31,
1,
79,
4948,
20,
14,
4800,
532,
5556,
18,
15124,
73,
13,
7,
25325,
2549,
9990,
2027,
28,
306,
9,
2328,
307,
8990,
13,
8,
3292,
35,
1208,
17,
33,
2447,
173,
7,
9,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How do I get a count of each value, based from another table?
===
I have a volunteers_2009 table that lists all the volunteers and a venues table that lists the venues that a volunteer can be assigned to, they are only assigned to one.
What I want to do, is print out the number of volunteers assigned to each venue.
I want it to print out like this:
Name of Venue: # of volunteers
table: volunteers_2009
columns: id, name, `venue_id`
table: venues
columns: id, venue_name
They relate by `volunteers_2009.venue_id = venues.id`
This is what I have but it is not working properly.
$sql = "SELECT venues.venue_name as 'Venue', COUNT(volunteers_2009.id) as 'Number Of
Volunteers' FROM venues ven JOIN volunteers_2009 vol ON
(venues.id=volunteers_2009.venue_id) GROUP BY venues.venue_name ORDER BY
venues.venue_name ASC";
$result = mysql_query($sql);
while(list($name,$vols) = mysql_fetch_array($result)) {
print '<p>'.$name.': '.$vols.'</p>';
} | 0 | [
2,
184,
107,
31,
164,
21,
2468,
16,
206,
1923,
15,
432,
37,
226,
859,
60,
800,
3726,
3726,
31,
57,
21,
6592,
1,
2849,
859,
30,
7227,
65,
14,
6592,
17,
21,
9771,
859,
30,
7227,
14,
9771,
30,
21,
5599,
92,
44,
2467,
20,
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... |
UTF8 LAMP Resources
===
At work, I'm beginning to have some issues with character encoding. I'd like to make our web app use UTF-8 all the way around. After a few hours of googling, I've only found a few sites with information on a UTF-8 LAMP setup. Does anyone know of any good resources online about UTF-8, Linux, Apache, MySql and PHP? I'll post what I've found in the answers. | 0 | [
2,
287,
11720,
457,
6792,
2566,
800,
3726,
3726,
35,
170,
15,
31,
22,
79,
997,
20,
57,
109,
1549,
29,
925,
19608,
9,
31,
22,
43,
101,
20,
233,
318,
2741,
4865,
275,
287,
11720,
8,
457,
65,
14,
161,
140,
9,
75,
21,
310,
974,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Debugging Multi-Project (C++) Solutions in Visual Studio 2005
===
I'm currently developing an application that is comprised of five separate executables that communicate via ActiveMQ. I have a Visual Studio Solution that contains the five executable projects. One of the projects (the launcher.exe) launches the other four projects from their local folders as separate processes. As such, the launcher project is set as the "Startup Project" and, as a result, it's the only one I can set break points in and debug due to my limited knowledge of VS2005.
Is there a way to set multiple breakpoints across my five c++ projects in my single VS solution and debug them at the same time if the launcher project is the only project executed from VS?
***Note:*** *Manually starting new instances of each project via Visual Studio is not an option since their execution needs to be synchronized by the launcher.exe.*
I apologize if this is convoluted, it's the best I can explain it. Thanks in advance for your help! | 0 | [
2,
121,
16254,
2762,
1889,
8,
21011,
13,
5,
150,
20512,
6,
6776,
19,
3458,
1120,
812,
800,
3726,
3726,
31,
22,
79,
871,
3561,
40,
3010,
30,
25,
12650,
16,
355,
1725,
1396,
17194,
5924,
18,
30,
8709,
1197,
1348,
79,
1251,
9,
31,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How to do Makefile dependencies for python code.
===
I have a bunch of C files that are generated by a collection of python programs that have a number of shared python modules and I need to account for this in my make system.
It is easy enough to enumerate which python program need to be run to generate each C file. What I can't find a good solution for is determining which other python files those programs depend on. I need this so make will know what needs regenerating if one of the shared python files changes.
Is there a good system for producing make style dependency rules from a collection of python sources? | 0 | [
2,
184,
20,
107,
233,
16877,
29411,
26,
20059,
1797,
9,
800,
3726,
3726,
31,
57,
21,
7653,
16,
272,
6488,
30,
50,
6756,
34,
21,
1206,
16,
20059,
1726,
30,
57,
21,
234,
16,
2592,
20059,
17113,
17,
31,
376,
20,
2176,
26,
48,
19,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Why does Apache return a 503 error for ant's get task, but not for my browser?
===
I'm trying to get a file with ant, using the get property. I'm running apache 2, and I can get the file from the indicated URL using wget and firefox, but ant gives me the following error:
[get] Error opening connection java.io.IOException:
Server returned HTTP response code: 503 for URL: http://localhost/jars/jai_core.jar
This is what I'm doing in my build.xml:
<get src="http://localhost/jars/jai_core.jar"
dest="${build.dir}/lib/jai_core.jar"
usetimestamp="true"/>
Any idea what could be going wrong?
| 0 | [
2,
483,
630,
17140,
788,
21,
1222,
240,
7019,
26,
40,
38,
22,
18,
164,
3005,
15,
47,
52,
26,
51,
16495,
60,
800,
3726,
3726,
31,
22,
79,
749,
20,
164,
21,
3893,
29,
40,
38,
15,
568,
14,
164,
1354,
9,
31,
22,
79,
946,
17140... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
looking at client controls on the server
===
I'm just starting out with the whole ajax thing and I need some help. I have a form where the users will have the ability to add multiple e-mail addresses to a record. When the user clicks add a new e-mail address, I am going to perform an ajax call that will insert the email address and then get the current e-mails to be displayed for editing. Sounds fine, but the only problem I have is when the form submits I want to be able to access those values server side, as well as store the sequence numbers from the db so the emails can be updated on the final submit. In a repeater, I'd store the sequence number in a hidden field and then loop through the items, but I can't do that when I'm not using a repeater. I'd like to avoid using the update panel because of the large network traffic. I suppose I could use request.forms collection, but how would I store the sequence numbers in such a way that the users couldn't see them? Am I totally off base? | 0 | [
2,
699,
35,
6819,
8671,
27,
14,
8128,
800,
3726,
3726,
31,
22,
79,
114,
1422,
70,
29,
14,
979,
20624,
584,
17,
31,
376,
109,
448,
9,
31,
57,
21,
505,
113,
14,
3878,
129,
57,
14,
2165,
20,
3547,
1886,
13,
62,
8,
8079,
12636,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 a Linq Expression Tree that does this?
===
I have an IQueryable<T> and an object of type T.
I want to do IQueryable<T>().Where(o => o.GetProperty(fieldName) == objectOfTypeT.GetProperty(fieldName))
so ...
public IQueryable<T> DoWork<T>(string fieldName)
where T : EntityObject
{
...
T objectOfTypeT = ...;
....
return SomeIQueryable<T>().Where(o => o.GetProperty(fieldName) == objectOfTypeT.GetProperty(fieldName));
}
Am I having a Friday afternoon brain melt or is this a complex thing to do?
| 0 | [
2,
184,
107,
31,
1895,
21,
6294,
1251,
1803,
1541,
30,
630,
48,
60,
800,
3726,
3726,
31,
57,
40,
13,
5312,
622,
579,
1,
38,
1,
17,
40,
3095,
16,
1001,
13,
38,
9,
31,
259,
20,
107,
13,
5312,
622,
579,
1,
38,
1,
5,
6,
9,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
The morning after a TFS Baseless Merge
===
My understanding of a baseless merge in TFS was that it was a one-time deal, and merges afterwards could be made without having to be baseless:
from <a href="http://msdn.microsoft.com/en-us/library/bd6dxhfy(VS.80).aspx">http://msdn.microsoft.com/en-us/library/bd6dxhfy(VS.80).aspx</a>
> /baseless - Performs a merge without a basis version. That is, allows the user to merge files and folders that do not have a merge relationship. After a baseless merge, a merge relationship exists and future merges do not have to be baseless.
However, I tried it this evening with the following setup:
<pre>
/Trunk
|
- Dev
|
- QA
|
- Stage
</pre>
<pre>
tf merge C:\src\Project\Branch\Dev\ C:\src\Project\Branch\QA /baseless /recursive
</pre>
The command ran fine, and the files were merged. However, if I go back into Source Control Explorer and right-click and choose merge on the Dev branch, QA is not an option - only trunk is.
So did I misunderstand the docs and what they were really saying was that you always had to do it command-line, but just didn't have to include the /baseless switch? | 0 | [
2,
14,
959,
75,
21,
13,
11720,
18,
1000,
923,
12666,
800,
3726,
3726,
51,
3260,
16,
21,
1000,
923,
12666,
19,
13,
11720,
18,
23,
30,
32,
23,
21,
53,
8,
891,
1183,
15,
17,
12666,
18,
4601,
110,
44,
117,
366,
452,
20,
44,
1000... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Amazon EC2 for Windows worth it?
===
Amazon announced cloud hosting for Windows goes public beta today.
<a href="http://aws.amazon.com/windows/">EC2 Windows Pricing</a>
The pricing doesn't seem that cheap over colocation of your own server. Is this a revolutionary step towards the obvious future of hosting?
Does anyone have any first hand experience using .net on an amazon virtual box?
Cheapest pricing btw is 12.5 cents per hour.
| 0 | [
2,
8059,
6695,
135,
26,
1936,
2715,
32,
60,
800,
3726,
3726,
8059,
703,
4005,
10637,
26,
1936,
1852,
317,
8434,
786,
9,
13,
1,
58,
746,
14057,
3726,
7,
21127,
6903,
3885,
18,
9,
3812,
6931,
9,
960,
118,
27508,
18,
118,
7,
1,
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... |
IE borders breaking navigation
===
another issue in IE... [link][1]
The navbar link list has a border applied to the left side of each element.
In fireforx/safari this matches up with the navbar background but in IE the border/element spills out below the navbar ( the border sticks out the bottom).
EDIT: ALSO, the navbar is the entire length of the blue header in IE, when it should only be as big as the navigations links inside it! arg!
Any ideas? thanks.
[1]: http://plwd.co.uk/rangers | 0 | [
2,
13,
660,
5878,
3892,
8368,
800,
3726,
3726,
226,
1513,
19,
13,
660,
9,
9,
9,
636,
6258,
500,
2558,
165,
500,
14,
16048,
1850,
3508,
968,
63,
21,
1862,
2435,
20,
14,
225,
270,
16,
206,
4520,
9,
19,
535,
1106,
396,
118,
18,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
What message or event is raised which I invoke CListCtrl::InsertItem() method?
===
I was planning to implememt owner-drawn of CListCtrl. I thought that drawing an item is after the item is inserted into the control. So my method is declare a class which is derived from CListCtrl and override its DrawItem() method. The problem is DrawItem is never invoked after inserting an item. Is there anything wrong with my method?
Thank you! | 0 | [
2,
98,
2802,
54,
807,
25,
1127,
56,
31,
28371,
272,
5739,
4812,
6362,
45,
45,
108,
18,
6767,
2119,
79,
5,
6,
2109,
60,
800,
3726,
3726,
31,
23,
2334,
20,
5420,
10388,
1503,
38,
2410,
8,
19950,
16,
272,
5739,
4812,
6362,
9,
31,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Binary "tail" a file
===
I would guess most people on this site are familiar with tail, if not - it provides a "follow" mode that as text is appended to the file tail will dump those characters out to the terminal.
What I am looking for (and possibly to write myself if necessary) is a version of tail that works on binary files. Basically I have a wireless link that I would like to trickle a file across as it comes down from another network link. Looking over the tail source code it wouldn't be too hard to rewrite, but I would rather not invent the wheel! This wouldn't strictly be "tail" as I would like the entire file to be copied, but it would watch as new bytes were added and stream those.
Ideas? | 0 | [
2,
14171,
13,
7,
8682,
7,
21,
3893,
800,
3726,
3726,
31,
83,
2321,
127,
148,
27,
48,
689,
50,
3694,
29,
3424,
15,
100,
52,
13,
8,
32,
1927,
21,
13,
7,
19184,
7,
3740,
30,
28,
1854,
25,
4865,
10726,
20,
14,
3893,
3424,
129,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 LINQ library for C++?
===
Are there any Platform agnostic (not CLI) movements to get LINQ going for C++ in some fashion?
I mean a great part of server frameworks around the world run on flavors of UNIX and having access to LINQ for C++ on UNIX would probably make lots of people happy!
| 0 | [
2,
25,
80,
21,
6294,
1251,
1248,
26,
272,
20512,
60,
800,
3726,
3726,
50,
80,
186,
2452,
21,
21944,
13,
5,
1270,
19391,
6,
4889,
20,
164,
6294,
1251,
228,
26,
272,
20512,
19,
109,
3161,
60,
31,
884,
21,
374,
141,
16,
8128,
659... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
What's the best method to use / store encryption keys in MySQL
===
I plan on using MySQL and it's built-in encryption functionality to encrypt / decrypt certain columns in certain tables. The concern I have is that I need to store the key somewhere. I could certainly store the key in a file and control the permissions of that file and the permissions of the application that accesses it, but is that enough?
I am in a small shop where I would be the only one (possibly one other person) that would have access to the machine that the application was on. **Edit: I should add that there is a web facing part of this application that would need to decrypt the data unless I added a tier.**
I have looked ad nauseum, but no one seems to have a bulletproof answer.
Is this one of those problems where you have to settle for good enough? Given that I am using MySQL and PHP (possibly Python) is there a better way to approach this? | 0 | [
2,
98,
22,
18,
14,
246,
2109,
20,
275,
13,
118,
1718,
24420,
5534,
19,
51,
18,
22402,
800,
3726,
3726,
31,
944,
27,
568,
51,
18,
22402,
17,
32,
22,
18,
392,
8,
108,
24420,
18548,
20,
1957,
11435,
13,
118,
121,
11435,
1200,
749... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
public key email encryption
===
Who has their email fully encrypted ?
I would like to encrypt my email but I am not sure how to start. If I use encrypted email and I send an email to someone who does not encrypt his email how can the receiver read the email ?
What email client would you recommend to run on a windows systems for encrypted email ? I am using Thunderbird at the moment.
As I understand you have to generate 2 keys (one public and one private) but how do you generate this key? I also think that you have to put your key somewhere to download but I don't understand how you can trust the downloaded keys.
Any links to a good (not too complicated) guide about the working an implementing of email encryption would be very much appreciated.
kind regards
wim hendrix
anatak | 0 | [
2,
317,
1246,
8517,
24420,
800,
3726,
3726,
72,
63,
66,
8517,
2337,
29403,
13,
60,
31,
83,
101,
20,
1957,
11435,
51,
8517,
47,
31,
589,
52,
562,
184,
20,
799,
9,
100,
31,
275,
29403,
8517,
17,
31,
2660,
40,
8517,
20,
737,
72,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
What's the best way to return a random line in a text file using C?
===
What's the best way to return a random line in a text file using C? It has to use the standard I/O library (`<stdio.h>`) because it's for Nintendo DS homebrew. | 0 | [
2,
98,
22,
18,
14,
246,
161,
20,
788,
21,
5477,
293,
19,
21,
1854,
3893,
568,
272,
60,
800,
3726,
3726,
98,
22,
18,
14,
246,
161,
20,
788,
21,
5477,
293,
19,
21,
1854,
3893,
568,
272,
60,
32,
63,
20,
275,
14,
1236,
31,
118... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How to get a thumbnail from a Image file more faster
===
I used gdi+'s Image class to decode image files.
But I found if I open a Image, then use GetThumbnail()Method, It is really slow, especially for high resolution images.<p>
Is there any method for get a thumbnail more faster?
<p>
Or is there any lib designed especially for fastly retriving thumbnails for most image formats.
Many thanks! | 0 | [
2,
184,
20,
164,
21,
5078,
325,
947,
37,
21,
1961,
3893,
91,
4233,
800,
3726,
3726,
31,
147,
489,
1115,
2430,
22,
18,
1961,
718,
20,
121,
9375,
1961,
6488,
9,
47,
31,
216,
100,
31,
368,
21,
1961,
15,
94,
275,
164,
96,
723,
2... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How can I clone clean environments for testing an installer
===
I'd like to continually test the installer for a DirectX game I wrote on a clean, bare bones, WindowsXP environment (meaning no .Net, no DirectX, no Visual Studio, no game, etc.) to ensure the installer is covering all bases. I only have one clean test machine to use for this. Since my installer still needs a lot of work and testing, it doesn't effectively uninstall everything and I don't feel like searching and manually removing left over files everytime. Is there a good way to clone/reproduce the clean state of the computer I'm using?
I looked into VMWare as a solution to create multiple instances of a clean WindowsXP environment, but its hardware emulation prevents my Graphics from rendering.
Any ideas? Thanks in advance for your help! | 0 | [
2,
184,
92,
31,
13871,
2745,
11246,
26,
4431,
40,
16146,
106,
800,
3726,
3726,
31,
22,
43,
101,
20,
16609,
1289,
14,
16146,
106,
26,
21,
1744,
396,
250,
31,
738,
27,
21,
2745,
15,
4856,
4915,
15,
1936,
396,
306,
2307,
13,
5,
1... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How do you debug Qt layout problems
===
I've got a complex dialog, and it is full of whitespace and I can't shrink it. In Designer, it has lots of components that then get dynamically hidden, and a few which are dynamically added. I've added dumping of size policies, size hints, and minimum sizes, but still can't figure out why Qt won't let me drag it smaller.
There must be some tools or techniques for troubleshooting this.
Please share. | 0 | [
2,
184,
107,
42,
121,
16254,
2593,
38,
9106,
1716,
800,
3726,
3726,
31,
22,
195,
330,
21,
1502,
28223,
15,
17,
32,
25,
503,
16,
359,
5582,
17,
31,
92,
22,
38,
16269,
32,
9,
19,
4742,
15,
32,
63,
7503,
16,
5090,
30,
94,
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... |
How to Mount a Linux directory from a different PC to your local Linux PC?
===
Is there a way to mount a Linux directory from a different PC to your local Linux PC? How? | 0 | [
2,
184,
20,
2149,
21,
13024,
16755,
37,
21,
421,
5168,
20,
154,
375,
13024,
5168,
60,
800,
3726,
3726,
25,
80,
21,
161,
20,
2149,
21,
13024,
16755,
37,
21,
421,
5168,
20,
154,
375,
13024,
5168,
60,
184,
60,
3,
0,
0,
0,
0,
0,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
OpenGL textures with multiple display contexts
===
I have an undefined number of display context and each will display a texture. When I call glGenTextures I get the same name returned across all display contexts. Will this work? Even though they have the same name will they still store and display different textures? If not what should do to get around this?
| 0 | [
2,
368,
8430,
12714,
18,
29,
1886,
3042,
4141,
18,
800,
3726,
3726,
31,
57,
40,
367,
13439,
234,
16,
3042,
4141,
17,
206,
129,
3042,
21,
12714,
9,
76,
31,
645,
13,
8430,
7685,
1706,
6418,
18,
31,
164,
14,
205,
204,
587,
464,
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... |
x86 question about bit comparisons
===
Im having a problem with a final part of my assignment. We get in a stream of bits, etc etc, in the stream is an integer with the number of 1's in the text portion. I get that integer and its 24 which is correct, now i loop through the text data i get and i try to count all the 1's in there. But my proc is always returning zero.
I was able to make sure it was looping properly and it is.
The text = Hello
which is 16 1's, here is my proc for looping through that text to count the number of ones in it.
sub AX,AX
sub SI,SI
mov bx,[bp+6] ;get message offset
@@mainLoop:
mov cx,8
mov dh,80h
cmp byte ptr [bx + si],0
je @@endChecker
@@innerLoop:
test byte ptr [bx + si],dh
jz @@zeroFound
inc AX
@@zeroFound:
shr bh,1
loop @@innerLoop
@@continue:
inc si
jmp @@mainLoop
the rest of the proc is just push/pops. What im wanting this to actually do is use TEST to compare 100000000 to a byte, if its a 1 inc AX else shift right the mask by 1 and loop a whole byte, than inc to next byte and do again.
| 0 | [
2,
993,
3274,
1301,
88,
1142,
6050,
18,
800,
3726,
3726,
797,
452,
21,
1448,
29,
21,
426,
141,
16,
51,
8427,
9,
95,
164,
19,
21,
3766,
16,
10181,
15,
2722,
2722,
15,
19,
14,
3766,
25,
40,
13820,
29,
14,
234,
16,
137,
22,
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... |
Text overflow when using nvarchar(max)?
===
I've run into a strange situation that seems to involve long text overflowing. I'm using `fn_pcre_replace` (from the [xp_pcre extended stored procedure](http://www.codeproject.com/KB/database/xp_pcre.aspx)) on an `nvarchar(max)` column, and when I replace with more characters than were there originally, it returns NULL if the original string was over 8000 characters long.
For example, this
Select master.dbo.fn_pcre_replace(Overview,'a', 'X')
from ProjectContent
works as expected, but this
Select master.dbo.fn_pcre_replace(Overview,'a', 'XXX')
from ProjectContent
returns NULL in most cases (apparently, wherever `Len(Overview)>8000`).
Is this a limitation of `xp_pcre`, or is there something I can do in my SQL to make this work?
| 0 | [
2,
1854,
20285,
76,
568,
13,
103,
3311,
5433,
5,
8304,
6,
60,
800,
3726,
3726,
31,
22,
195,
485,
77,
21,
2578,
1858,
30,
2206,
20,
8847,
175,
1854,
20285,
68,
9,
31,
22,
79,
568,
13,
1,
19035,
1,
5779,
99,
1,
99,
5119,
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... |
So you think you know pointers?
===
I was shown this recently, and thought this was a really cool piece of code. Assume 32-bit architecture.
<pre>#include <stdio.h>
int main(void) {
int x[4];
printf("%p\n", x);
printf("%p\n", x + 1);
printf("%p\n", &x);
printf("%p\n", &x + 1);
}
</pre>
Without compiling the program, what does it output, and why? If you think that a certain output will be arbitrary, say so, invent a value, and then pretend that was the value that was output. | 0 | [
2,
86,
42,
277,
42,
143,
454,
445,
60,
800,
3726,
3726,
31,
23,
1721,
48,
1989,
15,
17,
289,
48,
23,
21,
510,
2700,
1855,
16,
1797,
9,
7158,
2512,
8,
3326,
2607,
9,
13,
1,
3515,
1,
5910,
22640,
279,
255,
38,
73,
384,
6921,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Silverlight image: load URL dynamically?
===
I'm tinkering with Silverlight 2.0.
I have some images, which I currently have a static URL for the image source.
Is there a way to dynamically load the image from a URL path for the site that is hosting the control?
Alternatively, a configuration setting, stored in a single place, that holds the base path for the URL, so that each image only holds the filename? | 0 | [
2,
1172,
3130,
1961,
45,
6305,
287,
6362,
7782,
1326,
60,
800,
3726,
3726,
31,
22,
79,
25438,
68,
29,
1172,
3130,
172,
9,
387,
9,
31,
57,
109,
3502,
15,
56,
31,
871,
57,
21,
12038,
287,
6362,
26,
14,
1961,
1267,
9,
25,
80,
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... |
Checked exception catching in C#
===
Java requires that you catch all possible exceptions or declare them as thrown in the method signature. This isn't the case with C# but I still feel that it is a good practice to catch all exceptions. Does anybody know of a tool which can process a C# project and point out places where an exception is thrown but not caught? | 0 | [
2,
6505,
5391,
9436,
19,
272,
5910,
800,
3726,
3726,
8247,
4781,
30,
42,
2949,
65,
938,
13392,
54,
10123,
105,
28,
6027,
19,
14,
2109,
7810,
9,
48,
2532,
22,
38,
14,
610,
29,
272,
5910,
47,
31,
174,
583,
30,
32,
25,
21,
254,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Interprocess communication in .NET
===
I have a core .NET application that needs to spawn an abitrary number of sub processes. These processes need to be able to access some form of state object in the core application.
What is the best technique? I'll be moving a large amount of data between processes (Bitmaps), so it needs to be fast.
| 0 | [
2,
1480,
16835,
3291,
19,
13,
9,
2328,
800,
3726,
3726,
31,
57,
21,
2884,
13,
9,
2328,
3010,
30,
2274,
20,
13,
22860,
40,
21,
3326,
139,
1857,
234,
16,
972,
5102,
9,
158,
5102,
376,
20,
44,
777,
20,
1381,
109,
505,
16,
146,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 long should SET READ_COMMITTED_SNAPSHOT ON take?
===
How long should it take to run
ALTER Database [razorsite] SET READ_COMMITTED_SNAPSHOT ON
I just ran it and its takin 10 minutes.
How can I check if it is applied? | 0 | [
2,
184,
175,
378,
309,
1302,
1,
960,
18568,
43,
1,
18,
325,
306,
7868,
27,
247,
60,
800,
3726,
3726,
184,
175,
378,
32,
247,
20,
485,
7835,
6018,
636,
13932,
248,
9097,
500,
309,
1302,
1,
960,
18568,
43,
1,
18,
325,
306,
7868,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Adaptive Design Patterns
===
I have been thinking about design patterns that are 'adaptive.' I am familiar with GoF designed to deal with known problems. What I am thinking about are the new, evolving technologies that the code I write will need to adapt to so that it can interact with evolving apis, programming languages, etc.
What do you know about adaptive design patterns? | 0 | [
2,
22142,
704,
6282,
800,
3726,
3726,
31,
57,
74,
1440,
88,
704,
6282,
30,
50,
13,
22,
27576,
1284,
9,
22,
31,
589,
3694,
29,
162,
410,
1006,
20,
1183,
29,
167,
1716,
9,
98,
31,
589,
1440,
88,
50,
14,
78,
15,
22363,
5740,
30... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Ignoring exceptions
===
I have some code which ignores a specific exception.
try
{
foreach (FileInfo fi in di.GetFiles())
{
collection.Add(fi.Name);
}
foreach (DirectoryInfo d in di.GetDirectories())
{
populateItems(collection, d);
}
}
catch (UnauthorizedAccessException ex)
{
//ignore and move onto next directory
}
of course this results in a compile time warning as ex is unused. Is there some standard accept noop which should be used to remove this warning? | 0 | [
2,
9321,
13392,
800,
3726,
3726,
31,
57,
109,
1797,
56,
7174,
18,
21,
1903,
5391,
9,
1131,
13,
1,
26,
14322,
13,
5,
16877,
108,
4120,
6028,
19,
926,
9,
3060,
16877,
18,
5,
6,
6,
13,
1,
1206,
9,
14854,
5,
1707,
9,
7259,
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 add-in/workbench framework is the best .NET alternative to Eclipse RCP?
===
I'm looking for a plugin-based application framework that is comparable to the Eclipse Plugin Framework, which to my simple mind consists of:
1. a core **plugin management framework** (Equinox / OSGI), which provides the ability to declare extension endpoints and then discover and load plugins that service those endpoints. (this is different than Dependency Injection, but admittedly the difference is subtle - configuration is highly de-centralized, there are versioning concerns, it might involve an online plugin repository, and most importantly to me, it should be easy for the **user** to add plugins without needing to know anything about the underlying architecture / config files)
2. many layers of plugins that provide a **basic workbench shell** with concurrency support, commands, preference sheets, menus, toolbars, key bindings, etc.
That is just scratching the surface of the RCP, which itself is meant to serve as the foundation of your application, which you build by writing / assembling even **more** plugins.
----------
Here's what I've gleaned from the internet in the past couple of days...
As far as I can tell, there is nothing in the .NET world that remotely approaches the robustness and maturity of the Eclipse RCP for Java but there are several contenders that do either #1 or #2 pretty well.
(I should also mention that I have not made a final decision on WinForms vs WPF, so I'm also trying to understand the level of UI coupling in any candidate framework. I'm also wondering about platform coupling and source code licensing)
I must say that the open-source stuff is generally less-documented but easier to understand, while the MS stuff typically has more documentation but is less accessible, so that with many of the MS technologies, I'm left wondering what they actually do, in a practical sense.
These are the libraries I have found:
SharpDevelop
----------------
The first thing I looked at was SharpDevelop, which does both #1 and also #2 in a basic way (no insult to SharpDevelop, which is admirable - I just mean *more basic* than Eclipse RCP). However, SharpDevelop is an application more than a framework, and there are basic assumptions and limitations there (i.e. being somewhat coupled to WinForms). Still, there are some articles on CodeProject explaining how to use it as the foundation for an application.
System.Addins
-------------
It appears that System.Addins is meant to provide a robust add-in loading framework, with some sophisticated options for loading assemblies with varying levels of trusts and even running the out of process. It appears to be primarily code-based, and pretty code-heavy, with lots of assemblies that serve to insulate against versioning issues., using Guidance Automation to generate a good deal of code.
So far I haven't found many System.AddIns articles that illustrate how it could be used to build something like an Eclipse RCP, and many people seem to be wringing their hands about its complexity.
Mono.Addins
-----------
It appears that Mono.Addins was influenced by System.Addins, SharpDevelop, and MonoDevelop. It seems to provide the basics from System.Addins, with less sophisticated options for plugin loading, but more simplicity, with attribute-based registration, XML manifests, and the infrastructure for online plugin repositories.
It has a pretty good FAQ and documentation, as well as a fairly robust set of examples that really help paint a picture of how to develop an architecture like that of SharpDevelop or Eclipse. The examples use GTK for UI, but the framework itself is not coupled to GTK. So it appears to do #1 (add-in loading) pretty well and points the way to #2 (workbench framework). It appears that Mono.Addins was derived from MonoDevelop, but I haven't actually looked at whether MonoDevelop provides a good core workbench framework.
Managed Extensibility Framework
-------------------------------
This is what everyone's talking about at the moment, and it's slowly getting clearer what it does, but I'm still pretty fuzzy, even after reading several posts on SO. The official word is that it "can live side-by-side" with System.Addins. However, it doesn't reference it and it appears to reproduce some of its functionality. It seems to me, then, that it is a simpler, more accessible alternative to System.Addins.
It appears to be more like Mono.Addins in that it provides attribute-based wiring. It provides "catalogs" that can be attribute-based or directory-based. It does not seem to provide any XML or manifest-based wiring. So far I haven't found much documentation and the examples seem to be kind of "magical" and more reminiscent of attribute-based DI, despite the clarifications that MEF is not a DI container.
Its license just got opened up, but it does reference WindowsBase -- not sure if that means it's coupled to Windows.
Acropolis
---------
I'm not sure what this is. Is it MEF, or something that is still coming?
Composite Application Blocks
----------------------------
There are WPF and Winforms Composite Application blocks that seem to provide much more of a workbench framework. I have very little experience with these but they appear to rely on Guidance Automation quite a bit are obviously coupled with the UI layers. There are a few examples of combining MEF with these application blocks.
----------
I've done the best I could to answer my own question here, but I'm really only scratching the surface, and I don't have experience with any of these frameworks. Hopefully some of you can add more detail about the frameworks you have experience with. It would be great if we could end up with some sort of comparison matrix. | 0 | [
2,
98,
3547,
8,
108,
118,
3783,
26359,
6596,
25,
14,
246,
13,
9,
2328,
2676,
20,
11652,
761,
7439,
60,
800,
3726,
3726,
31,
22,
79,
699,
26,
21,
10922,
108,
8,
1281,
3010,
6596,
30,
25,
14109,
20,
14,
11652,
10922,
108,
6596,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Auto-updater
===
In many programs, you will see that occasionally the program looks online for updates, and then downloads and applies any updates that are found. Program bugs are fixed, supporting files are modified, and things are (usually) made better.
Unfortunately no matter how hard I look, I can't find information on this anywhere. It seems like the auto-updaters that have been implemented have either been proprietary or not considered important.
How can I implement such a system? What are the different approaches and pros and cons of each (Just downloading files and replacin old ones with the new ones, running a migration script that was downloaded, monkey patching parts of the system, etc.)? Language agnostic is preferred, but examples in Java, C, Python, Ruby, Lisp, etc. would be appreciated. | 0 | [
2,
3108,
8,
576,
593,
815,
800,
3726,
3726,
19,
151,
1726,
15,
42,
129,
196,
30,
4533,
14,
625,
1879,
2087,
26,
16779,
15,
17,
94,
7121,
18,
17,
13169,
186,
16779,
30,
50,
216,
9,
625,
13925,
50,
3535,
15,
3134,
6488,
50,
5372... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 do intra-application communication in .NET
===
What's the best way to pass data from one Windows Forms app (an office plugin) to another (exe written in C#) in C#? | 0 | [
2,
184,
20,
107,
14369,
8,
2552,
20669,
3291,
19,
13,
9,
2328,
800,
3726,
3726,
98,
22,
18,
14,
246,
161,
20,
1477,
1054,
37,
53,
1936,
1997,
4865,
13,
5,
210,
488,
10922,
108,
6,
20,
226,
13,
5,
1706,
62,
642,
19,
272,
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... |
How do I sort a two-dimensional array in C#?
===
I have a two-dimensional array (of Strings) which make up my data table (of rows and columns). I want to sort this array by any column. I tried to find an algorithm for doing this in C#, but have not been successful.
Any help is appreciated. | 0 | [
2,
184,
107,
31,
2058,
21,
81,
8,
7865,
7718,
19,
272,
5910,
60,
800,
3726,
3726,
31,
57,
21,
81,
8,
7865,
7718,
13,
5,
1041,
7887,
6,
56,
233,
71,
51,
1054,
859,
13,
5,
1041,
11295,
17,
7498,
6,
9,
31,
259,
20,
2058,
48,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How do I restrict foreign keys choices to related objects only in django
===
I have a two way foreign relation similar to the following
class Parent(models.Model):
name = models.CharField(max_length=255)
favoritechild = models.ForeignKey("Child", blank=True, null=True)
class Child(models.Model):
name = models.CharField(max_length=255)
myparent = models.ForeignKey(Parent)
How do I restrict the choices for Parent.favoritechild to only children whose parent is itself? I tried
class Parent(models.Model):
name = models.CharField(max_length=255)
favoritechild = models.ForeignKey("Child", blank=True, null=True, limit_choices_to = {"myparent": "self"})
but that causes the admin interface to not list any children.
| 0 | [
2,
184,
107,
31,
15436,
1228,
5534,
10978,
20,
1597,
3916,
104,
19,
3857,
14541,
800,
3726,
3726,
31,
57,
21,
81,
161,
1228,
5827,
835,
20,
14,
249,
718,
4766,
5,
13998,
18,
9,
13998,
6,
45,
204,
800,
2761,
9,
5433,
1109,
5,
8... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Dynamic Arrays
===
I'm just starting to learn C++ so excuse me for this simple question. What I'm doing is reading in numbers from a file and then trying to add them to an array. My problem is how do you increase the size of the array? For example I thought might be able to just do:
#include <iostream>
using namespace std;
int main() {
double *x;
x = new double[1];
x[0]=5;
x = new double[1];
x[1]=6;
cout << x[0] << "," << x[1] << endl;
return 0;
}
But this obviously just overwrites the value, 5, that I initially set to x[0] and so outputs 0,6. How would I make it so that it would output 5,6?<br /><br />Please realize that for the example I've included I didn't want to clutter it up with the code reading from a file or code to get numbers from a user. In the actual application I won't know how big of an array I need at compile time so please don't tell me to just make an array with two elements and set them equal to 5 and 6 respectively.<br /><br />Thanks for your help. | 0 | [
2,
7782,
7718,
18,
800,
3726,
3726,
31,
22,
79,
114,
1422,
20,
2484,
272,
20512,
86,
6658,
55,
26,
48,
1935,
1301,
9,
98,
31,
22,
79,
845,
25,
1876,
19,
2116,
37,
21,
3893,
17,
94,
749,
20,
3547,
105,
20,
40,
7718,
9,
51,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Applications using Decimal versus double . . .
===
I wanted to see if folks were using decimal for financial applications instead of double. I have seen lots of folks using double all over the place with unintended consequences . .
Do you see others making this mistake . . . | 0 | [
2,
3767,
568,
26380,
5706,
1494,
13,
9,
13,
9,
13,
9,
800,
3726,
3726,
31,
417,
20,
196,
100,
14563,
46,
568,
26380,
26,
1553,
3767,
700,
16,
1494,
9,
31,
57,
541,
7503,
16,
14563,
568,
1494,
65,
84,
14,
209,
29,
367,
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... |
is it possible use/require script without evaling?
===
I need to add unit testing to some old scripts, the scripts are all basically in the form of
#!/usr/bin/perl
# Main code
foo();
bar();
# subs
sub foo {
}
sub bar {
}
if I try to 'require' this code in a unit test, the main section of the code will run, where as I want to be able to just test "foo" in isolation.
Is there any way to do this without moving foo,bar into a seperate .pm file?
| 0 | [
2,
25,
32,
938,
275,
118,
99,
3003,
99,
3884,
366,
6805,
802,
60,
800,
3726,
3726,
31,
376,
20,
3547,
1237,
4431,
20,
109,
315,
17505,
15,
14,
17505,
50,
65,
11374,
19,
14,
505,
16,
6926,
187,
118,
267,
139,
118,
4772,
118,
14... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How to set up a by-directionally encrypted email server?
===
**Encrypted email - sounds like a great thing, right?** Problem already solved, right? Well... I don't think so and I'm hoping I'm wrong!
To understand what I'm asking, **please understand what I'm NOT asking**: I am not asking how I encrypt and sign messages sent over public networks. This is a bit different.
I want to set up a mail server where email clients can both read and post and their messages to the mail server encrypted in both directions, preferably using standard clients available at internet cafes, etc, without requirement for specialized software or encrypted port-forwarding a-la SSH.
The key here is that there is a trusted mail server which can deliver email to a community using a local-delivery-agent. One can then send email to and receive from anyone and everyone who also uses that same system without concern for the security of their communications. There's no need to encrypt every message using the public key of every recipient - what pain THAT would be! - and instead all we're talking about here is a bidirectional communication that's encrypted from clients to this system.
Of course, public messages come in unencrypted via the usual port 25 process to all participants of the email server. They may or may not be encrypted as they were - we're not worried about them. Email Clients connect from anywhere and encrypt those messages for reading, even though they were sent through the public network in plain text already... This much I can already get fairly easily with encrypting IMAP servers like Dovecot.
What I want to add to this is that connected email clients can _send_ email, encrypted, back to the system of which they are a client wherein that system forwards externally unencrypted, wherever it needs to go. If it's a local mailbox, the message is delivered via a local delivery agent. No keys involved there. The advantage of this design is that there's NO exposure of the email to external, untrusted systems or networks, and if the delivery is local, it's effectively protected end-to-end WITHOUT having a point-to-point hassle of encrypting individual messages in the more typical use.
This would be "god send" because as it is now, it's impossible to send secured mail through clients on the public internet to groups of people within an internal network.
I guess another way to phrase what I’m asking for is: Has someone created a package that gives us the other half of the encryption that IMAP (and POP?) servers already do – that distant clients on untrusted networks can hand-off out-bound unencrypted email through an encrypted link to the server on the other end?
ANOTHER ALTERNATIVE occurred to me: Encrypting SMTP / ESMTP servers that talk mail server to mail server in an encrypted form. (Similarly, clients should be able to hand off unencrypted email through an encrypted link, much as https works.) Anybody know of such a package? This is not quite as good, but an important part of email architecture...
If this doesn’t exist today, it should!
Thanks for your thoughts, pointers, etc.
| 0 | [
2,
184,
20,
309,
71,
21,
34,
8,
19393,
102,
29403,
8517,
8128,
60,
800,
3726,
3726,
13,
1409,
219,
11435,
69,
8517,
13,
8,
2795,
101,
21,
374,
584,
15,
193,
60,
1409,
1448,
614,
15091,
15,
193,
60,
134,
9,
9,
9,
31,
221,
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... |
Best Lisp IDE
===
I've used Slime within Emacs as my primary development environment for Lisp (or Aquamacs on OS X), but are there other compelling choices out there? I've heard about Lispworks, but is that [or something else] worth looking at? Or does anyone have tips to getting the most out of Emacs (e.g., hooking it up to the hyperspec for easy reference)? | 4 | [
2,
246,
2093,
3401,
13,
3448,
800,
3726,
3726,
31,
22,
195,
147,
8824,
62,
363,
13,
62,
6893,
18,
28,
51,
1256,
522,
2307,
26,
2093,
3401,
13,
5,
248,
14299,
6893,
18,
27,
13,
759,
993,
6,
15,
47,
50,
80,
89,
20465,
10978,
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... |
How to configure security when calling WCF Service from .Net 2.0 Client
===
I have a WCF service up and running and am able to communicate between the service and a .Net 2.0 Client using basicHttpBinding.
I now need to lock down the WCF service so that it can only be called by authenticated clients.
I have control over the clients that will be calling my service. The clients are part of a product that will be installed in the wild and "phoning home" to push and pull data. The client app is written for .Net 2.0 framework and cannot be upgraded to 3.0 or 3.5 at this time. I cannot add windows user accounts to the client machines.
What are my options for securing the WCF Service and being able to authenticate from my .Net 2.0 clients? Also, data needs to be passed over https.
I've been searching the web, and feel like I'm on a wild goose chase.
| 0 | [
2,
184,
20,
1065,
15951,
1221,
76,
2555,
11801,
410,
365,
37,
13,
9,
2328,
172,
9,
387,
6819,
800,
3726,
3726,
31,
57,
21,
11801,
410,
365,
71,
17,
946,
17,
589,
777,
20,
8709,
128,
14,
365,
17,
21,
13,
9,
2328,
172,
9,
387,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Redmine best practices
===
What tips and "standards" do you use in your Redmine project management process?
Do you have a standard wiki insert template you could share or a standard way to work a project using bugs features tasks and support issues?
Do you let issues and updates get emailed into Redmine?
Do you use the forums?
Do you use SVN repository?
Do you use Mylyn in eclipse to work the task lists?
I'm trying to drag our dept. into some web based PM instead of emailed Word docs of vague requirements followed by Word docs explaining how to QA and Deploy that all get lost in a pile of competing updates and projects so that by the time I have to fix something, no one can find any documentation on how it works.
| 0 | [
2,
402,
7640,
246,
5242,
800,
3726,
3726,
98,
11034,
17,
13,
7,
15566,
18,
7,
107,
42,
275,
19,
154,
402,
7640,
669,
1097,
953,
60,
107,
42,
57,
21,
1236,
13,
17375,
14692,
22894,
42,
110,
1891,
54,
21,
1236,
161,
20,
170,
21,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
UI Design : Solid border or dotted border? When to use which?
===
I am currently using dotted border for certain UI stuff such as instruction, notes, error box etc.
But recently i change to solid due to requirement but i just find it kind of strange.
It seens like making it solid kind of put too much emphasis on these kind of stuff which is just for informational.
What are your views? | 0 | [
2,
13,
5661,
704,
13,
45,
2941,
1862,
54,
23696,
1862,
60,
76,
20,
275,
56,
60,
800,
3726,
3726,
31,
589,
871,
568,
23696,
1862,
26,
1200,
13,
5661,
3217,
145,
28,
7304,
15,
2434,
15,
7019,
1649,
2722,
9,
47,
1989,
31,
753,
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... |
UI Form Design : Having different background color for field label TD and field form element TD
===
Should we have background color for form input? Or this is really a subjective matter?
For me personally i thought having background color for form kind of make it more organized and clean then not having.
What are your views on this? | 0 | [
2,
13,
5661,
505,
704,
13,
45,
452,
421,
2395,
1665,
26,
575,
1899,
15596,
17,
575,
505,
4520,
15596,
800,
3726,
3726,
378,
95,
57,
2395,
1665,
26,
505,
6367,
60,
54,
48,
25,
510,
21,
22835,
1161,
60,
26,
55,
7200,
31,
289,
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... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.