unified_texts stringlengths 32 30.1k | OpenStatus_id int64 0 4 | input_ids list | token_type_ids list | attention_mask list |
|---|---|---|---|---|
What is the difference between Obfusaction, Hashing, and Encryption?
===
What is the difference between Obfusaction, Hashing, and Encryption?
Here is my understanding:
- Hashing is a one-way algorithm; cannot be reversed
- Obfusaction is similar to encryption but doesn't require any "secret" to understand (ROT13 is one example)
- Encryption is reversible but a "secret" is required to do so | 0 | [
2,
98,
25,
14,
2841,
128,
5122,
13735,
8645,
15,
19170,
68,
15,
17,
24420,
60,
800,
3726,
3726,
98,
25,
14,
2841,
128,
5122,
13735,
8645,
15,
19170,
68,
15,
17,
24420,
60,
235,
25,
51,
3260,
45,
13,
8,
19170,
68,
25,
21,
53,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Vista Window Focus Problem
===
I have an application that manages patient demographic information. Along with this data a user can scan a picture of a patient and assign that picture to a patient. When the user clicks the scan button a separate application is opened as a dialog in order to scan the image. When running this on XP everything worked fine. The imaging application loaded up fine and gained focus. On Vista however occasionally the imaging application will not gain focus and will popup behind the main application. When running full screen or through 2008 Application Server you cannot see the application, you only get a locked screen and it appears nothing has happened. Is there any way to change the window focus management on Vista to work the way XP did? I'm looking for a way to solve this without making changes to the actual application if possible. | 0 | [
2,
13520,
1463,
1776,
1448,
800,
3726,
3726,
31,
57,
40,
3010,
30,
9118,
4836,
14220,
676,
9,
303,
29,
48,
1054,
21,
4155,
92,
8313,
21,
2151,
16,
21,
4836,
17,
13952,
30,
2151,
20,
21,
4836,
9,
76,
14,
4155,
10840,
18,
14,
83... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 purpose of sequental uniqueidentifier in PK of MS SQL?
===
I know that primary keys based on Guids do not have the best performance (due to the fragmentation), but they are globally unique and allow replication scenarios.
Integral identifiers, on the other side, have greater performance at the cost of scalability.
But in what scenarios would someone want to use sequential uniqueidentifier as the primary key? I think, that it beats the purpose of GUID, but still I see mentioning of the sequentals now and then.
What do I miss here? | 0 | [
2,
98,
22,
18,
14,
2131,
16,
1353,
16694,
3663,
2619,
13384,
16292,
19,
13,
17244,
16,
4235,
4444,
255,
60,
800,
3726,
3726,
31,
143,
30,
1256,
5534,
432,
27,
9457,
43,
18,
107,
52,
57,
14,
246,
956,
13,
5,
12633,
20,
14,
2869... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 of sharepoint
===
In a previous question I asked [what sharepoint was][1] mostly because I have been asked to explorer sharepoint at work to see if its a viable option for us.
Is there a project or a how to or what not out there were I can demonstrate the best features of Sharepoint? I am looking for a project out there that I can build to show all the great features of sharepoint. Again, since I know nothing of sharepoint I am hoping for a tutorial of sorts.I do not think we will be touching upon office so MOSS is out, for now.
[1]: http://stackoverflow.com/questions/89101/what-is-microsoft-sharepoint | 4 | [
2,
246,
16,
1891,
3132,
800,
3726,
3726,
19,
21,
1158,
1301,
31,
411,
636,
608,
1891,
3132,
23,
500,
2558,
165,
500,
1555,
185,
31,
57,
74,
411,
20,
8520,
1891,
3132,
35,
170,
20,
196,
100,
82,
21,
17347,
4255,
26,
182,
9,
25,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
XDebug and PHP Debugging
===
How do you setup a multi-developer XDebug PHP environment. I have a linux machine with Apache and Xdebug loaded and a php.ini file that I think is correct. I found a python proxy script that I'm using to proxy the calls from the PDT Eclipse IDE's my developers are using to the Apache/Xdebug running on the same web server. I set the idekey in php.ini to "ECLIPSE_DBGP" and for Xdebug to autostart but from the log information from the proxy it says that there is no server with the key "ECLIPSE_DBGP" and it stops the request. Has anybody run into this or has a step by step setup to get this to work? I have exhausted what I have found using google. | 0 | [
2,
993,
546,
16254,
17,
13,
26120,
121,
16254,
2762,
800,
3726,
3726,
184,
107,
42,
18161,
21,
1889,
8,
26051,
106,
993,
546,
16254,
13,
26120,
2307,
9,
31,
57,
21,
13024,
1940,
29,
17140,
17,
993,
546,
16254,
8572,
17,
21,
13,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
What is the best HTML Rendering Engine to embed in an application?
===
At the moment, our application uses the Trident Win32 component, but we want to move away from that for a few reasons, chief among them being our desire to go cross-platform.
We're looking at [WebKit][1] and [Gecko][2], but I'd love to get some feedback before I make a decision. Here are some of the most important requirements:
1. It should be relatively fast, with a small footprint. Ideally, we would be able to trim away anything we don't need without too much effort.
2. Decent documentation is important. I don't anticipate needing to do anything too unusual with it, but you never know.
3. We're using C++, and would like to work with a well-designed object-oriented architecture, if possible.
4. Cross-platform is a must, and good performance would be helpful in the long run (we may end up porting to mobile platforms).
Are there any considerations I need to take into account before making a decision? Has anyone worked with WebKit or Gecko before? If so, are there any articles or tutorials I might find useful?
[1]: http://webkit.org/
[2]: http://developer.mozilla.org/en/Gecko | 0 | [
2,
98,
25,
14,
246,
13,
15895,
15307,
1406,
20,
11911,
69,
19,
40,
3010,
60,
800,
3726,
3726,
35,
14,
688,
15,
318,
3010,
2027,
14,
26084,
628,
3125,
5912,
15,
47,
95,
259,
20,
780,
229,
37,
30,
26,
21,
310,
2932,
15,
903,
4... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
What is the best free PHP framework working on shared hosting and why?
===
I tried symfony only. It was a little tricky (also because there is no command line or ssh connection in my hosting plan) to rearrange directory and linking in order to work on my hosting service, I did the same tricks on the local version to make the deployment easy but sometimes (don't know if is a cache problem or what) there were different result from the same version running on the server and on my machine.
I'm not saying I gave up with symfony but I'd like to know if there is something better before continue learning symfony.
I'm using shared hosting, so I can't use python/asp/everything else :D
The question is just the one of the title:
What is the best free PHP framework working on shared hosting and why? | 0 | [
2,
98,
25,
14,
246,
551,
13,
26120,
6596,
638,
27,
2592,
10637,
17,
483,
60,
800,
3726,
3726,
31,
794,
13,
7261,
10229,
93,
104,
9,
32,
23,
21,
265,
5514,
93,
13,
5,
2573,
185,
80,
25,
90,
1202,
293,
54,
13,
18,
1635,
2760,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
NSAutoreleasePool in NSOperation main?
===
The documentation for NSThread + (void)detachNewThreadSelector:(SEL)aSelector toTarget:(id)aTarget withObject:(id)anArgument says: For non garbage-collected applications, the method aSelector is responsible for setting up an autorelease pool for the newly detached thread and freeing that pool before it exits.
My question is do I need to create my own NSAutoreleasePool in the NSOperation main method or is the creation of the NSAutoreleasePool handled by NSOperation? | 0 | [
2,
13,
2172,
18042,
15202,
13378,
19,
13,
2172,
11377,
407,
60,
800,
3726,
3726,
14,
13945,
26,
13,
2172,
96,
10647,
2754,
13,
5,
2625,
1340,
6,
546,
38,
3211,
2681,
96,
10647,
3434,
19932,
45,
5,
3434,
6,
472,
16964,
248,
20,
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... |
Execute action for automatically unchecked button in Delphi
===
I have one action I want to perform when a TSpeedButton is pressed and another I want to perform when the same button is "unpressed". I know there's no onunpress event, but is there any easy way for me to get an action to execute when a different button is pressed?
procedure ActionName.ActionNameExecute(Sender: TObject);
begin
PreviousActionName.execute(Sender);
//
end;
Seems to clunky. | 0 | [
2,
15644,
1028,
26,
7499,
367,
12542,
69,
5167,
19,
23030,
800,
3726,
3726,
31,
57,
53,
1028,
31,
259,
20,
2985,
76,
21,
13,
38,
6708,
811,
444,
25,
2931,
17,
226,
31,
259,
20,
2985,
76,
14,
205,
5167,
25,
13,
7,
1020,
5890,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Outlook PropertyFrom MAPI Schema Property ID
===
I am looking to get the actual property name from a MAPI schema property. I'm obtaining the MAPI Schema property "http://schemas.microsoft.com/mapi/proptag/0x67AA000B" but I would like to know what field this corresponds to (I.E. Anniversary, BusinessAddress, etc). Any insight would be appreciated. | 0 | [
2,
19837,
1354,
2665,
2942,
49,
23874,
1354,
4924,
800,
3726,
3726,
31,
589,
699,
20,
164,
14,
3463,
1354,
204,
37,
21,
2942,
49,
23874,
1354,
9,
31,
22,
79,
12114,
14,
2942,
49,
23874,
1354,
13,
7,
21127,
6903,
7526,
5250,
9,
2... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Converting XML to plain text using XSLT --- how should I ignore/handle whitespace in the XSLT?
===
I'm trying to convert an XML file into the markup used by dokuwiki, using XSLT. This actually works to some degree, but the indentation in the XSL file is getting inserted into the results. At the moment, I have two choices: abandon this XSLT thing entirely, and find another way to convert from XML to dokuwiki markup, or delete about 95% of the whitespace from the XSL file, making it nigh-unreadable and a maintenance nightmare.
Is there some way to keep the indentation in the XSL file without passing all that whitespace on to the final document?
Background: I'm migrating an autodoc tool from static HTML pages over to dokuwiki, so the API developed by the server team can be further documented by the applications team whenever the apps team runs into poorly-documented code. The logic is to have a section of each page set aside for the autodoc tool, and to allow comments anywhere outside this block. I'm using XSLT because we already have the XSL file to convert from XML to XHTML, and I'm assuming it will be faster to rewrite the XSL than to roll my own solution from scratch. | 0 | [
2,
19583,
23504,
20,
3748,
1854,
568,
993,
18,
255,
38,
13,
8,
8,
8,
184,
378,
31,
7174,
118,
3203,
413,
359,
5582,
19,
14,
993,
18,
255,
38,
60,
800,
3726,
3726,
31,
22,
79,
749,
20,
8406,
40,
23504,
3893,
77,
14,
943,
576,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 ways to document use of an API?
===
What are the best ways that you have found to document the use of an API?
Comments on classes and methods, such as JavaDoc comments, are useful for learning about how a particular class or method works, but I'm asking about how people document higher-level concepts that show how to actually _use_ the API.
Comments that include code samples are often too buried to be findable or useful. External documentation quickly gets out of date.
| 0 | [
2,
246,
2847,
20,
4492,
275,
16,
40,
21,
2159,
60,
800,
3726,
3726,
98,
50,
14,
246,
2847,
30,
42,
57,
216,
20,
4492,
14,
275,
16,
40,
21,
2159,
60,
7534,
27,
2684,
17,
3195,
15,
145,
28,
8247,
13799,
7534,
15,
50,
4811,
26,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Tax Service Recommendation for a Rails App?
===
I'm developing a cart that needs to calculate tax and am looking for a 3rd party tax service to handle the calculations.
I've used Avalara in another app, but it's somewhat miserable since I have to use the Rjb gem with their java library.
Does anyone have a recommendation for a tax service that works well with rails? | 2 | [
2,
2225,
365,
14066,
26,
21,
2240,
18,
4865,
60,
800,
3726,
3726,
31,
22,
79,
3561,
21,
6420,
30,
2274,
20,
18469,
2225,
17,
589,
699,
26,
21,
203,
897,
346,
2225,
365,
20,
3053,
14,
19186,
9,
31,
22,
195,
147,
21,
3377,
2704,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Access Alter Table "Allow Zero Length"
===
I'm working with an old Access database (yes, it's very ugly and I hate it). I need to modify some of the columns from a VB app that I'm creating. I have most the modifications setup correctly, but I'm fighting with the fact that modifying a column to text has it default to "Allow Zero Length" to false.
SO
ALTER TABLE [Applicant Table] ALTER COLUMN [Applicant ID] Text(255)
I need that alter to have "Allow Zero Length" set to true.
I have tried
ALTER TABLE [Applicant Table] ALTER COLUMN [Applicant ID] Text(255) NULL
but that doesn't seem to work either. I've looked all over for the solution, but can't seem to find a straight answer.
Any ideas?
Thanks,
Ryan. | 0 | [
2,
1381,
7835,
859,
13,
7,
17976,
4606,
1476,
7,
800,
3726,
3726,
31,
22,
79,
638,
29,
40,
315,
1381,
6018,
13,
5,
1714,
15,
32,
22,
18,
253,
9212,
17,
31,
3223,
32,
6,
9,
31,
376,
20,
17579,
109,
16,
14,
7498,
37,
21,
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... |
Mate actionscript only version, does it exist?
===
Hey there, I'm looking into using Mate, but the projects I work on do not require the majority of the functionality of the Flex framework. My workmate said that he heard of an Actionscript version, but I can find no information on the main site about this, only that they have removed some dependencies on the Flex framework.
Does anyone know if their is an effort to move Mate towards a state that it can be used without the Flex framework? | 0 | [
2,
5252,
1028,
8741,
104,
615,
15,
630,
32,
3182,
60,
800,
3726,
3726,
8409,
80,
15,
31,
22,
79,
699,
77,
568,
5252,
15,
47,
14,
2314,
31,
170,
27,
107,
52,
4077,
14,
1698,
16,
14,
18548,
16,
14,
14409,
6596,
9,
51,
170,
528... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
EnumPorts() returns strange error on some machines
===
I maintain an application that uses the win32 EnumPorts() function to help determine the set of serial ports installed on the computer. I have seen cases on some computers where the call to get this information fails with a GetLastError() code of 1722 (RPC server is unavailable). I assume that this has something to do with either registry settings or a required service being disabled but my search so far has been rather fruitless. Has anyonw else encountered this issue? | 0 | [
2,
1957,
723,
1993,
18,
5,
6,
4815,
2578,
7019,
27,
109,
6035,
800,
3726,
3726,
31,
4027,
40,
3010,
30,
2027,
14,
628,
3125,
1957,
723,
1993,
18,
5,
6,
1990,
20,
448,
3746,
14,
309,
16,
5956,
9551,
4066,
27,
14,
1428,
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... |
Is there an equivalent to SHA1() in MS-SQL?
===
Converting a couple stored procedures from MySQL to Microsoft SQL server. Everything is going well, except one procedure used the MySQL SHA1() function. I cannot seem to find an equivalent to this in MS-SQL.
Does anyone know a valid equivalent for SHA1() on MS-SQL? | 0 | [
2,
25,
80,
40,
4602,
20,
4116,
165,
5,
6,
19,
4235,
8,
18,
22402,
60,
800,
3726,
3726,
19583,
21,
1335,
8214,
8876,
37,
51,
18,
22402,
20,
7099,
4444,
255,
8128,
9,
796,
25,
228,
134,
15,
1613,
53,
7004,
147,
14,
51,
18,
224... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Simple but powerful programming language for a hobby software project
===
Long time back, I used to do some home projects in Basic. It was fun and I could get things done without reading tons of documentation (or whatever documentation was
available at that time).
I guess it is the not the same anymore. Now a days, programming languages comes with a heavy baggage of framework, environment setup etc. Even for writing a simple program, it
is not easy to get going within a day.
I agree a good knowledge of concepts is important.
But, my question is this: Is there any easy simple to use programming language out there for some hobby projects. I have some free time available next month and I dont
want to spend half the time learning how to write programs.
Since this is for windows, I could have used Visual Basic but looking for something in keeping with modern trends and for some knowledge enhancement.
Would love to hear your thoughts even if it is for other platforms. | 4 | [
2,
1935,
47,
2177,
3143,
816,
26,
21,
18229,
2306,
669,
800,
3726,
3726,
175,
85,
97,
15,
31,
147,
20,
107,
109,
213,
2314,
19,
2125,
9,
32,
23,
2414,
17,
31,
110,
164,
564,
677,
366,
1876,
5278,
16,
13945,
13,
5,
248,
2099,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Multiple DB Updates:
===
Replaces Question: http://stackoverflow.com/questions/184096/update-multiple-rows-into-sql-table
Here's a Code Snippet to update an exam results set.
DB structure is as given, but I can submit Stored Procedures for inclusion (Which are a pain to modify, so I save that until the end.)
The question: Is there a better way using SQL server v 2005.,net 2.0 ?
string update = @"UPDATE dbo.STUDENTAnswers
SET ANSWER=@answer
WHERE StudentID =@ID and QuestionNum =@qnum";
SqlCommand updateCommand = new SqlCommand( update, conn );
conn.Open();
string uid = Session["uid"].ToString();
for (int i= tempStart; i <= tempEnd; i++)
{
updateCommand.Parameters.Clear();
updateCommand.Parameters.AddWithValue("@ID",uid);
updateCommand.Parameters.AddWithValue("@qnum",i);
updateCommand.Parameters.AddWithValue("@answer", Request.Form[i.ToString()]);
try
{
updateCommand.ExecuteNonQuery();
}
catch { }
} | 0 | [
2,
1886,
13,
9007,
16779,
45,
800,
3726,
3726,
3934,
18,
1301,
45,
7775,
6903,
25325,
2549,
9990,
9,
960,
118,
24652,
18,
118,
25545,
4060,
118,
576,
8209,
8,
21531,
5106,
8,
5417,
18,
8,
108,
262,
8,
18,
22402,
8,
5924,
235,
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... |
Powershell Generic Collections
===
I have been pushing into the .Net framework in powershell and I have hit something that I don't understand. This works fine:
13# $foo = New-Object "System.Collections.Generic.Dictionary``2[System.String,System.String]"
14# $foo.Add("FOO", "BAR")
15# $foo
Key Value
--- -----
FOO BAR
This however does not:
16# $bar = New-Object "System.Collections.Generic.SortedDictionary``2[System.String,System.String]"
New-Object : Cannot find type [System.Collections.Generic.SortedDictionary`2[System.String,System.String]]: make sure t
he assembly containing this type is loaded.
At line:1 char:18
+ $bar = New-Object <<<< "System.Collections.Generic.SortedDictionary``2[System.String,System.String]"
THey are both in the same assembly, so what am I missing? | 0 | [
2,
414,
15984,
12733,
5721,
800,
3726,
3726,
31,
57,
74,
5076,
77,
14,
13,
9,
2328,
6596,
19,
414,
15984,
17,
31,
57,
770,
301,
30,
31,
221,
22,
38,
1369,
9,
48,
693,
1123,
45,
539,
5910,
5579,
4120,
111,
800,
78,
8,
23793,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
enter multiple variables into table, assigning to each appropriate record
===
I display data into an html table, w/ a drop down box with a list of venues. Each volunteer will be assigned a venue. I envision being able to go down thru the html table and assigning each volunteer a venue. The drop down box contains all the possible venues that they can be assigned to.
<select>
<option value="1">Setup</option>
<option value="2">Check in</option>
etc...
</select>
Then once I am done assigning each volunteer, I want to hit submit and it will assign the appropriate value for each volunteer.
How would I go about doing that, I know how to do that, but only one at a time. | 0 | [
2,
2830,
1886,
12157,
77,
859,
15,
13952,
68,
20,
206,
4593,
571,
800,
3726,
3726,
31,
3042,
1054,
77,
40,
13,
15895,
859,
15,
619,
118,
21,
2804,
125,
1649,
29,
21,
968,
16,
9771,
9,
206,
5599,
129,
44,
2467,
21,
5704,
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... |
What is an intuitive way to move and XmlNode from one XmlDocument to another?
===
I have two XmlDocuments and I would like to move an XmlNode selected from one of the documents and append it at a particular location in the other document.
The naively intuitive approach of simply calling AppendNode(xmlNodeFromDocument1) at the appropriate place of document 2, of course doesn't work because the method does not take care of manipulating the owning document.
I finally found the answer literally as I was writing up this question, but since it took so long for us to find it in the System.Xml classes, I figured I'd post it here to assist anyone else stuck searching for it. | 0 | [
2,
98,
25,
40,
13,
24392,
161,
20,
780,
17,
23504,
251,
546,
37,
53,
23504,
28132,
20,
226,
60,
800,
3726,
3726,
31,
57,
81,
23504,
28132,
18,
17,
31,
83,
101,
20,
780,
40,
23504,
251,
546,
1704,
37,
53,
16,
14,
4374,
17,
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 to get an image stored as an oracle blob into an Image object
===
I am trying to retrieve an image stored in an oracle blob and place it in a new System.Drawing.Image instance. I know I can write the stream to a temp.bmp file on the disk and read it from there but thats just not l33t enough for me. How do I convert the blob object directly to an image?
| 0 | [
2,
184,
20,
164,
40,
1961,
8214,
28,
40,
15759,
334,
10904,
77,
40,
1961,
3095,
800,
3726,
3726,
31,
589,
749,
20,
11917,
40,
1961,
8214,
19,
40,
15759,
334,
10904,
17,
209,
32,
19,
21,
78,
329,
9,
3030,
3546,
9,
22039,
4851,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Java Applet, AWT Refresh problem Mac OS X 10.4
===
We have a Java Applet built using AWT. This applet lets you select pictures from your hard drive and upload them to a server. The applet includes a scrollable list of pictures, which works fine in Windows, Linux and Mac OS X 10.5. We launch this applet via Java Web Start or within a web page.
Our applet does not behave properly in Mac OS X 10.4, regardless of the version of Java (1.4 or 1.5). You can find a screenshot of the incorrect behaviour, when scrolling, here:
http://www.lavablast.com/tmp/ui_error.png
Simply put, sometimes when scrolling the pictures end up overlapping the header or footer of the application. This behaviour does not occur on other platforms. On Mac OS X 10.4, it shows the pictures in the incorrect location when scrolling, which would not be so bad if it refreshed the screen after painting the image at that location. However, it does not appear that the application knows it painted it incorrectly and thus does not refresh.
If the window is minimized, resized or even moved, the application is refreshed and the incorrectly positioned elements vanish and the application resumes normally. I spent quite some time trying to force a refresh of the background image unsuccessfully. (the repaint the image directly, repaint all children of a few panels, etc. ) Thus, I am looking for any tips that would help me resolve this problem under Mac OS X 10.4 or, in the worst case, simply simulate a full applet refresh.
Until recently, everything was compatible with Java 1.1 but this has changed in a few locations which now require 1.4. I don't feel these changes created the issue, I am just providing this as extra information. If you are interested in implementation details of the scroll panel, I will investigate, but I am assuming this is a common platform bug for which workarounds must be known.
To replicate the problem, open the following Java Web Start application:
http://www.lavablast.com/tmp/opal-webstart.php.jnlp
Select a folder containing lots of images and play with the scrollbar. At some point (fairly quickly), you should get the refresh problem.
| 0 | [
2,
8247,
4037,
38,
15,
13,
3885,
38,
24905,
1448,
1572,
13,
759,
993,
332,
9,
300,
800,
3726,
3726,
95,
57,
21,
8247,
4037,
38,
392,
568,
13,
3885,
38,
9,
48,
4037,
38,
6884,
42,
5407,
3104,
37,
154,
552,
1493,
17,
71,
8294,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
On a unix/linux system how can I learn more about a mylib.a archive?
===
In this particular case I'm trying to discover if a mylib.a file is 32 or 64 bit compatible. I'm familiar with ldd for shared objects (mylib.so) but how do I inspect a regular .a archive? | 0 | [
2,
27,
21,
22540,
118,
1226,
7147,
329,
184,
92,
31,
2484,
91,
88,
21,
51,
8326,
9,
58,
9250,
60,
800,
3726,
3726,
19,
48,
1498,
610,
31,
22,
79,
749,
20,
6297,
100,
21,
51,
8326,
9,
58,
3893,
25,
2512,
54,
4384,
1142,
14961... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Create GUI similar to Windows Explorer using WPF
===
How would you implement a GUI similar to the "My Computer" view in Windows Explorer?
In particular the "Icons" view mode. Including the grouping of different item types (as Files Stored on This Computer/Hard Disk Drives/Devices with Removable Storage groups in Windows Explorer)
In WinForms I would use a ListView for this thing but in WPF the only thing that has even come close is a listbox with a custom ControlTemplate but it seems like to much effort!
| 0 | [
2,
1600,
9457,
835,
20,
1936,
8520,
568,
619,
7721,
800,
3726,
3726,
184,
83,
42,
8713,
21,
9457,
835,
20,
14,
13,
7,
915,
1428,
7,
1418,
19,
1936,
8520,
60,
19,
1498,
14,
13,
7,
49,
12124,
7,
1418,
3740,
9,
215,
14,
19288,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
ListBox keep selection after losing focus
===
I have a ListBox that when in focus, and when I have an item selected returns a valid SelectedIndex. If I have a valid SelectedIndex and I click on a TextBox on the same Forum, the SelectedIndex now becomes -1. However I want it to keep its SelectedIndex from changing. How would I go about doing this? | 0 | [
2,
968,
5309,
643,
3155,
75,
2281,
1776,
800,
3726,
3726,
31,
57,
21,
968,
5309,
30,
76,
19,
1776,
15,
17,
76,
31,
57,
40,
9101,
1704,
4815,
21,
7394,
1704,
25671,
9,
100,
31,
57,
21,
7394,
1704,
25671,
17,
31,
10840,
27,
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... |
Fuzzy .png in Flash CS3
===
PNG images appear "fuzzy" in flash CS3. They are very blocky and appear unanti-aliased (if that is a word) Does anyone have a fix for this? Is there some setting I'm missing? | 0 | [
2,
20631,
13,
9,
306,
2723,
19,
4433,
272,
18,
240,
800,
3726,
3726,
351,
2723,
3502,
1893,
13,
7,
4096,
5092,
93,
7,
19,
4433,
272,
18,
240,
9,
59,
50,
253,
1921,
93,
17,
1893,
367,
5578,
8,
10060,
18,
69,
13,
5,
821,
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... |
How are people using Google App-Engine apps with their own domains?
===
I've been fooling around with the Google App Engine for a few days and I have a little hobby application that I want to write and deploy.
However I'd like it to **not** be accessed via appspot.com.
Is hosting it through Google Apps and then pointing it at my own domain the only way to go? I looked at that a little bit and it seemed like a pain to implement but maybe I'm just missing something.
My other thought was to write the app-engine piece as a more generic web-service. Then I could have the user-facing piece be hosted anywhere written in any language.
Anyone have any luck with the web-service approach? | 0 | [
2,
184,
50,
148,
568,
8144,
4865,
8,
16847,
4865,
18,
29,
66,
258,
15544,
60,
800,
3726,
3726,
31,
22,
195,
74,
5345,
68,
140,
29,
14,
8144,
4865,
1406,
26,
21,
310,
509,
17,
31,
57,
21,
265,
18229,
3010,
30,
31,
259,
20,
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... |
What do I need to do to upgrade an application to the latest Rails version?
===
I am currently using Rails 2.1.0 and want to upgrade to Rails 2.1.1. After issuing the following command
gem update rails
I suppose that I need to change this line
RAILS_GEM_VERSION = '2.1.0' unless defined? RAILS_GEM_VERSION
in environment.rb
What other actions should I take to ensure that my application is using the latest version? Are there some other files that need an update?
| 0 | [
2,
98,
107,
31,
376,
20,
107,
20,
9483,
40,
3010,
20,
14,
5736,
2240,
18,
615,
60,
800,
3726,
3726,
31,
589,
871,
568,
2240,
18,
172,
9,
165,
9,
387,
17,
259,
20,
9483,
20,
2240,
18,
172,
9,
165,
9,
165,
9,
75,
17502,
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 monitor MySQL space?
===
I downloaded a VM image of a web application that uses MySQL.
How can I monitor it's space consumption and know when additional space must be added? | 0 | [
2,
184,
20,
7626,
51,
18,
22402,
726,
60,
800,
3726,
3726,
31,
23887,
21,
13,
20147,
1961,
16,
21,
2741,
3010,
30,
2027,
51,
18,
22402,
9,
184,
92,
31,
7626,
32,
22,
18,
726,
8330,
17,
143,
76,
1351,
726,
491,
44,
905,
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,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
Checkstyle vs. PMD
===
We are introducing static analysis tools into the build system for our Java product. We are using Maven2 so Checkstyle and PMD integration come for free. However it looks like there is a large overlap in functionality between these two tools, in terms of enforcing basic style rules.
Is there a benefit from utilizing both of these? I don't want to maintain 2 tools if one will work. If we choose one, which one should we use and why?
We are also planning on using FindBugs. Are there other static analysis tools we should look at? | 0 | [
2,
2631,
4381,
4611,
9,
6736,
43,
800,
3726,
3726,
95,
50,
11442,
12038,
2495,
4672,
77,
14,
1895,
329,
26,
318,
8247,
2374,
9,
95,
50,
568,
1216,
3124,
135,
86,
2631,
4381,
17,
6736,
43,
8078,
340,
26,
551,
9,
207,
32,
1879,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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: How to convert <A> or HtmlAnchor to static text?
===
i have a repeater that will output a series of items:
<asp:repeater ... runat="Server">
<itemtemplate>
<a href="<%# GetItemLink(...) %>"><%# GetItemText %></a>
<itemtemplate>
<asp:repeater>
But some items will not have an associated link, so i don't want them to be clickable. i tried making it a `runat=server` `HtmlAnchor`, and set the `htmlAnchor.Disabled = true` for the items are should not actually have a link - but they can still be clicked (it just makes the text gray)
i know how i'd do it in the olden days:
<% If IsLink Then %>
<A href="<% =GetItemLink%">
<% End If %>
<% =GetItemText %>
<% If IsLink Then %>
</A>
<% End If %>
But that's the messy mixing code and html ASP way. What's the ASP.NET way?
| 0 | [
2,
28,
306,
9,
2328,
45,
184,
20,
8406,
13,
1,
58,
1,
54,
13,
15895,
210,
11840,
20,
12038,
1854,
60,
800,
3726,
3726,
31,
57,
21,
6830,
106,
30,
129,
5196,
21,
231,
16,
3755,
45,
13,
1,
472,
306,
45,
99,
306,
9834,
13,
9,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How to append binary values in VBScript
===
If I have two variables containing binary values, how do I append them together as one binary value? VBScript complains of a type mismatch when you try to join with the '&' operator. | 0 | [
2,
184,
20,
4865,
2451,
14171,
4070,
19,
13,
20468,
8741,
800,
3726,
3726,
100,
31,
57,
81,
12157,
3503,
14171,
4070,
15,
184,
107,
31,
4865,
2451,
105,
429,
28,
53,
14171,
1923,
60,
13,
20468,
8741,
15310,
18,
16,
21,
1001,
2462,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
System.NotSupportedException error in compact framework pictureBox control. How do I make a picture button in Compact framework?
===
I'm trying to make a picture button in the compact framework. I made a usercontrol and added a picturebox. I saw you could over ride the text and font for normal windows forms. but don't seem able to do it for compact. It crashes VS2008. Has anyone done this? | 0 | [
2,
329,
9,
1270,
24909,
10066,
872,
7019,
19,
8285,
6596,
2151,
5309,
569,
9,
184,
107,
31,
233,
21,
2151,
5167,
19,
8285,
6596,
60,
800,
3726,
3726,
31,
22,
79,
749,
20,
233,
21,
2151,
5167,
19,
14,
8285,
6596,
9,
31,
117,
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... |
Is there a Perl-compatible regular expression to remove whitespace from both sides of a string?
===
Is there a way to do this in one line?
$x =~ s/^\s+//;
$x =~ s/\s+$//;
In other words, remove all leading and trailing whitespace from a string. | 0 | [
2,
25,
80,
21,
416,
255,
8,
20049,
1290,
1803,
20,
4681,
359,
5582,
37,
156,
2570,
16,
21,
3724,
60,
800,
3726,
3726,
25,
80,
21,
161,
20,
107,
48,
19,
53,
293,
60,
5579,
396,
800,
1,
13,
18,
118,
1,
18,
2430,
118,
118,
73... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
MINUS in MySQL?
===
I have topics(id*) and tags(id*,name) and a linking table topic_tags(topicFk*,tagFk*).
Now I want to select every single topic, that has all of the good tags (a,b,c) but none of the bad tags (d,e,f).
How do I do that?
| 0 | [
2,
13,
15495,
19,
51,
18,
22402,
60,
800,
3726,
3726,
31,
57,
7569,
5,
1340,
2483,
6,
17,
3383,
18,
5,
1340,
2483,
15,
7259,
6,
17,
21,
12585,
859,
8303,
1,
8628,
18,
5,
3880,
596,
410,
197,
2483,
15,
8628,
410,
197,
2483,
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... |
Has and belongs to many relationship with multiple databases
===
I have a situation where I have two models, companies and permissions, where companies is in a separate database from my permissions database. This is a has and belongs to many relationship because each company can have many permissions and each permission can belong to many companies.
The reason the two databases are split is because the company database runs a high demand production application and the permissions database controls the permissions for another application.
With rails, it looks for the join table in the same database as the primary table. For instance, if I do company.permissions, it looks in the company database for company_permissions. If I do permission.companies it looks in the permissions database.
What is the best solution to using a has and belongs to many relationship with multiple databases? | 0 | [
2,
63,
17,
7034,
20,
151,
1429,
29,
1886,
6018,
18,
800,
3726,
3726,
31,
57,
21,
1858,
113,
31,
57,
81,
2761,
15,
1532,
17,
5572,
18,
15,
113,
1532,
25,
19,
21,
1725,
6018,
37,
51,
5572,
18,
6018,
9,
48,
25,
21,
63,
17,
70... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 reassigning a variable in every iteration of a loop affect performance?
===
Consider the following two ways of writing a loop to see if a list contains a given value:
###Style 1
boolean found = false;
for(int i = 0; i < list.length && !found; i++)
{
if(list[i] == testVal)
found = true;
}
###Style 2
boolean found = false;
for(int i = 0; i < list.length && !found; i++)
{
found = (list[i] == testVal);
}
The two are equivalent, but I always use style 1 because 1) I find it more readable, and 2) I am assuming that reassigning `found` to `false` hundreds of times feels like it would take more time. I am wondering: is this second assumption true?
<h3>Nitpicker's corner</h3>
* I am well aware that this is a case of premature optimization. That doesn't mean that it isn't something that is useful to know.
* I don't care which style you think is more readable. I am only interested in whether one has a performance penalty compared to the other.
* I know that style 1 has the advantage of allowing you to also put a `break;` statement in the `if` block, but I don't care. Again, this question is about performance, not style. | 0 | [
2,
129,
302,
472,
11255,
68,
21,
7612,
19,
352,
23534,
16,
21,
5293,
6245,
956,
60,
800,
3726,
3726,
3563,
14,
249,
81,
2847,
16,
1174,
21,
5293,
20,
196,
100,
21,
968,
1588,
21,
504,
1923,
45,
6926,
5910,
5910,
4381,
137,
9827,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
What is the best comment in source code you have ever encountered?
===
What is the best comment in source code you have ever encountered? | 4 | [
2,
98,
25,
14,
246,
6484,
19,
1267,
1797,
42,
57,
462,
8208,
60,
800,
3726,
3726,
98,
25,
14,
246,
6484,
19,
1267,
1797,
42,
57,
462,
8208,
60,
3,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
Concating arbitrary number of rows of strings in mysql
===
I have a mysql table with albums. Each album can be a top level album, or a child album of another album. Each album has a foldername which is the name of the folder its pictures are in. Each album also has a field called parent which is the id of the parent album. So, if I have a path to an image like this:
root/album1/album2/image1.jpg
then the album table in the database will look like this:
id parent foldername
1 NULL root
2 1 album1
3 2 album2
The question is then, how do I get the path printed earlier from this table with only mysql? | 0 | [
2,
1065,
150,
1880,
17237,
234,
16,
11295,
16,
7887,
19,
51,
18,
22402,
800,
3726,
3726,
31,
57,
21,
51,
18,
22402,
859,
29,
2675,
9,
206,
244,
92,
44,
21,
371,
662,
244,
15,
54,
21,
850,
244,
16,
226,
244,
9,
206,
244,
63,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
What is the best way to copy a list in Python?
===
lst1 = ['one', 2, 3]
// What is the best way of the following -- or is there another way?
lst2 = list(lst1)
lst2 = lst1[:]
import copy
lst2 = copy.copy(lst1) | 0 | [
2,
98,
25,
14,
246,
161,
20,
4344,
21,
968,
19,
20059,
60,
800,
3726,
3726,
13,
24239,
165,
800,
636,
22,
849,
22,
15,
172,
15,
203,
500,
12894,
98,
25,
14,
246,
161,
16,
14,
249,
13,
8,
8,
54,
25,
80,
226,
161,
60,
13,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
What is the best way to handle change management?
===
My organization's main project went live on Monday. That was my third day here. Now that I've been here almost a week, I'm tasked with creating a change management plan for the maintenance of the application and preparation for phase 2, which will commence "someday." We're a Microsoft shop but open-minded.
I'm looking for some suggestions on CM techniques and *especially tools* that will help with this. I'm familiar with ITIL and I've been considering how its concept of CM could apply to this project, but admittedly this one is a lot smaller than I'm used to (< 100 users versus thousands). I'm not exactly sure how, or if, ITIL can be pared down to such a small project. Or maybe I'm thinking too small.
How does your organization manage change at the system level? Does it work for you? How could it be improved?
| 2 | [
2,
98,
25,
14,
246,
161,
20,
3053,
753,
1097,
60,
800,
3726,
3726,
51,
1165,
22,
18,
407,
669,
296,
515,
27,
5745,
9,
30,
23,
51,
422,
208,
235,
9,
130,
30,
31,
22,
195,
74,
235,
557,
21,
877,
15,
31,
22,
79,
14605,
29,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
SharePoint Lists vs Database Tables performance...
===
1. We are looking to store transactional data in SharePoint lists. The lists will easily grow to 100,000+ items.
2. How would the query performance be compared with queries on a database table with these columns?
Queries:
Select by Id
Select Where ColumnValue = X
Group By OrderId
Group By Date
The SP List will be 6 columns wide: Id, Date, OrderId (Lookup), Quanity, ItemName, Title
Kind regards,
Ashish Shharma | 0 | [
2,
1891,
3132,
7227,
4611,
6018,
7484,
956,
9,
9,
9,
800,
3726,
3726,
137,
9,
95,
50,
699,
20,
1718,
12799,
192,
1054,
19,
1891,
3132,
7227,
9,
14,
7227,
129,
2351,
3213,
20,
9600,
2430,
3755,
9,
172,
9,
184,
83,
14,
25597,
95... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 keep automated tests fast?
===
Automated tests MUST be fast to reflect real time project state. The idea is that:
1. after any commit to repository automated build is performed (as fast as it can be done).
2. if build succeeded automated tests are started. MUST be fast.
This is the best way i know to find out if your changes brake anything.
At first it seamed that making a build fast is hard, but we managed to keep it around 100 sec. for a solution of 105(!) projects (MSVS 2008 C#).
Tests appeared to be not that simple (we use NUnit FW). Unit testing is not a big problem. It is integration tests that kills us. And not the fact that they are slower (any ideas on how to make them faster are much appreciated) but the fact that the environment must be set up which is MUCH slower(atm ~1000 sec)!
Our integration tests use web/win services (19 so far) that needs to be redeployed in order to reflect latest changes. That includes restarting services and a lot of HDD R/W activity.
Can anyone share the experience on how environment and the work flow should/can be organized/optimized to fasten automated testing phase. What are the "low level" bottlenecks and workarounds.
P.S. books and broad articles are welcome, but real world working solutios are much more appreciated. | 0 | [
2,
184,
20,
643,
14904,
4894,
1512,
60,
800,
3726,
3726,
14904,
4894,
491,
44,
1512,
20,
6907,
683,
85,
669,
146,
9,
14,
882,
25,
30,
45,
137,
9,
75,
186,
9686,
20,
24869,
14904,
1895,
25,
986,
13,
5,
472,
1512,
28,
32,
92,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Should I change my utilities.pl to a utilities.pm module?
===
In our product we have a big utilities file that we require (with do) at the beginning of a lot of our files. Is there a reason *not* to turn this into a module? For example, instead of doing this:
do '../dbi_utilities.pl';
our ($db,$user,$pw,$attr);
my $Data = DBI->connect($db,$user,$pw,$attr) or die "Could not connect to database: $DBI::errstr";
Couldn't I just do this?:
use AppUtil;
my $Data = AppUtil->connect();
What are the pros and cons of each style? | 0 | [
2,
378,
31,
753,
51,
19817,
9,
5727,
20,
21,
19817,
9,
5576,
12613,
60,
800,
3726,
3726,
19,
318,
2374,
95,
57,
21,
580,
19817,
3893,
30,
95,
4077,
13,
5,
1410,
107,
6,
35,
14,
997,
16,
21,
865,
16,
318,
6488,
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... |
How can you validate Elements based on an attribute Value using a Schema?
===
The XML I'm trying to validate is as follows:
<root>
<element attribute="foo">
<bar/>
</element>
<element attribute="hello">
<world/>
</element>
</root>
How can this be validated using a Schema?
Note:
**element** can only contain **bar** when **attribute="foo"**.
**element** can only contain **world** when **attribute="hello"** | 0 | [
2,
184,
92,
42,
7394,
1373,
2065,
432,
27,
40,
35,
14755,
1923,
568,
21,
23874,
60,
800,
3726,
3726,
14,
23504,
31,
22,
79,
749,
20,
7394,
1373,
25,
28,
2415,
45,
13,
1,
14032,
1,
13,
1,
27567,
35,
14755,
3726,
7,
4120,
111,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Should I practice "mockist" or "classical" TDD?
===
I've read (and re-read) Martin Fowler's [Mocks Aren't Stubs][1]. In it, he defines [two different approaches to TDD: "Classical" and "Mockist"][2]. He attempts to answer the question "[So should I be a classicist or a mockist?][3]", but he admits that he has never tried mockist TDD on "anything more than toys." So I thought I'd ask the question here. Good answers may repeat Fowler's arguments (but hopefully more clearly) or add arguments that he didn't think of or that others have come up with since Fowler last updated the essay back in January 2007.
[1]: http://martinfowler.com/articles/mocksArentStubs.html
[2]: http://martinfowler.com/articles/mocksArentStubs.html#ClassicalAndMockistTesting
[3]: http://martinfowler.com/articles/mocksArentStubs.html#SoShouldIBeAClassicistOrAMockist | 0 | [
2,
378,
31,
1345,
13,
7,
79,
5668,
702,
7,
54,
13,
7,
24031,
7,
15596,
43,
60,
800,
3726,
3726,
31,
22,
195,
1302,
13,
5,
290,
302,
8,
10647,
6,
1189,
16973,
22,
18,
636,
79,
5668,
18,
4847,
22,
38,
21354,
18,
500,
2558,
1... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How to make a hotfix deployment using Visual Studio?
===
Let's say that you have a product that is written in Visual Studio and you provide your customers and users with an installer for that product.
Then, you have some minor changes that you want to deploy to your users; you don't want your users to have to go through an uninstall process, backing up the configuration and then reinstalling the product again and restoring the configuration.
Instead, you want to provide a "hot-fix" that the users can simply copy over the already installed product. Using Visual Studio or some Microsoft tools, how would you go about this?
I don't know if it matters, but lets say that the product is 1) partially a web application, 2) partially a windows service and 3) partially a windows application. | 0 | [
2,
184,
20,
233,
21,
1047,
18594,
10475,
568,
3458,
1120,
60,
800,
3726,
3726,
408,
22,
18,
395,
30,
42,
57,
21,
2374,
30,
25,
642,
19,
3458,
1120,
17,
42,
1181,
154,
5279,
17,
3878,
29,
40,
16146,
106,
26,
30,
2374,
9,
94,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How do I learn C?
===
I'm interested in learning C better. I have read [K & R][1], and I have even done some simple C extension work in R and Python. What's a worthwhile project idea for doing something more substantial with C? Any good online resources, similar to [Dive Into Python][2]? In particular, resources focused on programmers of newer languages who are trying to learn C would be helpful (that mention things like "Asking an array for its length is nonsense in C, you lazy Pythonista").
My background:
Math/stats, day to day programming in Python, R, mostly around natural-language-processing, algorithms, and the like.
[1]: http://en.wikipedia.org/wiki/The_C_Programming_Language_(book)
[2]: http://diveintopython.org | 0 | [
2,
184,
107,
31,
2484,
272,
60,
800,
3726,
3726,
31,
22,
79,
3158,
19,
2477,
272,
574,
9,
31,
57,
1302,
636,
197,
279,
761,
500,
2558,
165,
500,
15,
17,
31,
57,
166,
677,
109,
1935,
272,
3896,
170,
19,
761,
17,
20059,
9,
98,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
why is this parsing this date string throwing an unparseable date exception?
===
I'm using SimpleDateFormat with the pattern "EEE MM/dd hh:mma", passing in the date String "Thu 10/9 08:15PM" and it's throwing an Unparseable date exception. Why? I've used various patterns with SimpleDateFormat before so I'm fairly familiar with its usage. Maybe I'm missing something obvious from staring at it too long.
The other possibility is funky (technical term) whitespace. The context is a screen-scraping app, where I'm using HtmlCleaner to tidy up the messy html. While I've found HtmlCleaner to be pretty good overall, I've noticed strange issues with characters that look like whitespace but aren't recognized as such with a StringTokenizer, for example. I've mostly worked around it and haven't dug into the character encoding or anything like that but am starting to wonder. | 0 | [
2,
483,
25,
48,
2017,
18,
68,
48,
1231,
3724,
6033,
40,
367,
3574,
870,
579,
1231,
5391,
60,
800,
3726,
3726,
31,
22,
79,
568,
1935,
8209,
23588,
29,
14,
3732,
13,
7,
62,
2851,
1620,
118,
8096,
13,
10681,
45,
11651,
7,
15,
284... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 vs typeof
===
Which of these pieces of code is faster?
if (obj is ClassA) {}
if (obj.GetType() == typeof(ClassA)) {}
| 0 | [
2,
25,
4611,
1001,
1041,
800,
3726,
3726,
56,
16,
158,
2491,
16,
1797,
25,
4233,
60,
100,
13,
5,
111,
11741,
25,
718,
58,
6,
13,
1,
100,
13,
5,
111,
11741,
9,
3060,
4474,
5,
6,
800,
3726,
1001,
1041,
5,
1898,
58,
6,
6,
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,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
Play Audio from a Stream using C#
===
Is there a way in C# to play audio (e.g. MP3) direcly from a Stream (I mean the real .NET class) that for instance was returend from a WebRequest without saving the data temporarily to the disk? | 0 | [
2,
418,
4023,
37,
21,
3766,
568,
272,
5910,
800,
3726,
3726,
25,
80,
21,
161,
19,
272,
5910,
20,
418,
4023,
13,
5,
62,
9,
263,
9,
4628,
240,
6,
18473,
150,
102,
37,
21,
3766,
13,
5,
49,
884,
14,
683,
13,
9,
2328,
718,
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... |
w3wp is using lots of memory and the process is not responding.
===
Can someone give me step by step instructions or point to the correct references in the correct order so I can determine the root cause of this issue? | 0 | [
2,
619,
240,
13790,
25,
568,
7503,
16,
1912,
17,
14,
953,
25,
52,
15887,
9,
800,
3726,
3726,
92,
737,
590,
55,
1424,
34,
1424,
7650,
54,
454,
20,
14,
4456,
7231,
19,
14,
4456,
389,
86,
31,
92,
3746,
14,
5900,
1679,
16,
48,
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,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
Compare Strings given in $_POST with php
===
I have a form that is sending in sizes of things, and I need to see what the strings are equal to so that I can set the price accordingly. When i try to do this, it says that they are not equal, and i get no prices. This is the code i'm using:
if ($_POST['sizes'] == "Small ($30)"){$total = "30";}
if ($_POST['sizes'] == "Medium ($40)"){$total = "40";}
if ($_POST['sizes'] == "Large ($50)"){$total = "50";}
else {$total = $_POST['price'];}
What am i doing wrong here? I can echo $_POST['sizes'] and it gives me exactly one of those things. | 0 | [
2,
11590,
7887,
504,
19,
5579,
1,
6962,
29,
13,
26120,
800,
3726,
3726,
31,
57,
21,
505,
30,
25,
4907,
19,
13403,
16,
564,
15,
17,
31,
376,
20,
196,
98,
14,
7887,
50,
2747,
20,
86,
30,
31,
92,
309,
14,
2162,
12932,
9,
76,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Is it possible to detect if an exception occurred before I entered a finally block?
===
In Java, is there an elegant way to detect if an exception occured prior to running the finally block? When dealing with "close()" statements, it's common to need exception handling within the finally block. Ideally, we'd want to maintain both exceptions and propogate them up (as both of them may contain useful information). The only way I can think of to do this is to have a variable outside the try-catch-finally scope to save a reference to a thrown exception. Then propogate the "saved" exception up with any that occur in the finally block.
Is there a more elegant way of doing this? Perhaps an API call that will reveal this?
Here's some rough code of what I'm talking about:
Throwable t = null;
try {
stream.write(buffer);
} catch(IOException e) {
t = e; //Need to save this exception for finally
throw e;
} finally {
try {
stream.close(); //may throw exception
} catch(IOException e) {
//Is there something better than saving the exception from the exception block?
if(t!=null) {
//propogate the read exception as the "cause"--not great, but you see what I mean.
throw new IOException("Could not close in finally block: " + e.getMessage(),t);
} else {
throw e; //just pass it up
}
}//end close
}
Obivously, there are a number of other similar kludges that might involve saving the exception as an member variable, returning it from a method, etc... but I'm looking for something a bit more elegant.
This question actually spawned from comments in [another question][1] that raised an interesting question.
[1]: http://stackoverflow.com/questions/183499/is-there-a-preference-for-nested-trycatch-blocks#183572 | 0 | [
2,
25,
32,
938,
20,
9092,
100,
40,
5391,
2437,
115,
31,
1297,
21,
722,
1921,
60,
800,
3726,
3726,
19,
8247,
15,
25,
80,
40,
11614,
161,
20,
9092,
100,
40,
5391,
3744,
69,
1313,
20,
946,
14,
722,
1921,
60,
76,
5746,
29,
13,
7... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Does repeated loading and saving of a compressed audio file reduce quality?
===
Like it is the case with jpeg images for example?
What's about mp3 or ogg vorbis audio files? | 0 | [
2,
630,
4251,
12797,
17,
7599,
16,
21,
18472,
4023,
3893,
4136,
2190,
60,
800,
3726,
3726,
101,
32,
25,
14,
610,
29,
487,
20427,
3502,
26,
823,
60,
98,
22,
18,
88,
4628,
240,
54,
7096,
263,
11150,
10056,
4023,
6488,
60,
3,
0,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
What is the difference between a deep copy and a shallow copy?
===
What is the difference between a deep copy and a shallow copy? | 0 | [
2,
98,
25,
14,
2841,
128,
21,
855,
4344,
17,
21,
7258,
4344,
60,
800,
3726,
3726,
98,
25,
14,
2841,
128,
21,
855,
4344,
17,
21,
7258,
4344,
60,
3,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
Why would I ever choose to store and manipulate XML in a database?
===
Modern RDBMS's have support for XML column types and functionality for dealing with XML in stored procedures. Historically I would always have mapped hierarchical data (whether of OO objects or XML) to relational tables. Given the widespread database support for XML should I change my ways? | 0 | [
2,
483,
83,
31,
462,
3538,
20,
1718,
17,
18468,
23504,
19,
21,
6018,
60,
800,
3726,
3726,
773,
13,
897,
13178,
18,
22,
18,
57,
555,
26,
23504,
4698,
2551,
17,
18548,
26,
5746,
29,
23504,
19,
8214,
8876,
9,
6246,
31,
83,
550,
5... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
As a "mockist" TDD practitioner, should I mock other methods in the same class as the method under test?
===
After reading Martin Fowler's [Mocks Aren't Stubs][1], I've discovered I've been practicing TDD in the "mockist" fashion.
But I'm wondering if even in mockist TDD if one can take mocking too far.
Here's an example in Python-style pseudo-code:
def a_method_to_test(self, object_of_a_different_class):
self.a()
object_of_a_different_class.x()
self.b()
When testing this method, I'd clearly want to pass in a mock of the object passed into the method. But what about the a() and b() methods in the same class as the method under test? Note that a\_method\_to\_test() doesn't return a result, so to confirm correct behavior I'd either have to mock a() and b(), or (eventually) mock other methods (in other classes, called perhaps through instance variables) that should be called by a() and b(). Are there pros and cons of these two alternatives? Or is there one clear-cut right way to do it?
Please don't answer the question by explaining that I should be practicing "classical" TDD instead. That's an answer to another question: [Should I practice mockist or classical TDD?][2]
[1]: http://martinfowler.com/articles/mocksArentStubs.html
[2]: http://stackoverflow.com/questions/184666/should-i-practice-mockist-or-classical-tdd | 0 | [
2,
28,
21,
13,
7,
79,
5668,
702,
7,
15596,
43,
21103,
15,
378,
31,
10506,
89,
3195,
19,
14,
205,
718,
28,
14,
2109,
131,
1289,
60,
800,
3726,
3726,
75,
1876,
1189,
16973,
22,
18,
636,
79,
5668,
18,
4847,
22,
38,
21354,
18,
5... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
What is a good CMS written in Python (and not Plone)?
===
I've been doing CMS sites for clients using Joomla for a while now, but I've been migrating a lot of my coding over to Python and have been looking for a good CMS solution that's written in Python.
Most of what I've seen so far is either Zope based (Plone) or Django based. I'm not totally opposed to something written in a Python framework such as Django, but I don't want to use Zope (seems to me to have too much "bloat" for something like this).
Is there anything in the Python community like Joomla? I know I could always "roll my own", but I'd rather use something pre-built (if there is such a thing).
Thanks for your time,
Seth | 0 | [
2,
98,
25,
21,
254,
2390,
18,
642,
19,
20059,
13,
5,
290,
52,
351,
16285,
6,
60,
800,
3726,
3726,
31,
22,
195,
74,
845,
2390,
18,
3259,
26,
7421,
568,
2640,
2636,
531,
26,
21,
133,
130,
15,
47,
31,
22,
195,
74,
28749,
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... |
Skype & Terminal Services information exchange?
===
We have sales reps who access our 'system' via terminal services. In our system we would like to enable clicking the number of a client and launching skype on their local machine not in the terminal services session.
We see two potential ways of this working...
1. Clicking on a URL ( eg skype:01234569?call ) and it works locally but we need to click the url in the TS session but having that url opened on the local computer.
2. Or something like skype@IP_address:01234569?call to make a target skype client make the call?
One last thing, the local machine might be a Mac or Windows PC.
Thanks Again | 0 | [
2,
1661,
1664,
279,
3855,
687,
676,
1950,
60,
800,
3726,
3726,
95,
57,
2598,
9411,
18,
72,
1381,
318,
13,
22,
10724,
22,
1197,
3855,
687,
9,
19,
318,
329,
95,
83,
101,
20,
9240,
25590,
14,
234,
16,
21,
6819,
17,
13762,
1661,
1... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How to read XML data from a server using Flex?
===
I believe the simplest way to request data from a server in XML format is to have a PHP/JSP/ASP.net page which actually generates XML based on HTTP GET params, and to somehow call/load this page from Flex.
How exactly can this be achieved using the Flex library classes? | 0 | [
2,
184,
20,
1302,
23504,
1054,
37,
21,
8128,
568,
14409,
60,
800,
3726,
3726,
31,
985,
14,
24384,
161,
20,
3772,
1054,
37,
21,
8128,
19,
23504,
2595,
25,
20,
57,
21,
13,
26120,
118,
728,
3401,
118,
472,
306,
9,
2328,
2478,
56,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 / Workflow: Changing same property on multiple objects
===
I am looking for a general UI design / work-flow for changing the same property across multiple objects.
Suppose I have an object class called Person. The Person class has a property called City. I want to select 5 Person objects and change the City property on all 5 to "New York" in one action in the UI.
This is not difficult to accomplish programatically, but I am having a difficult time coming up with an intuitive UI work-flow. One thought is to use a modal like the one used in iTunes to change information about multiple selected songs. I would like to come up with another work-flow, as this idea has already gotten push-back at work.
Thoughts? Ideas? | 0 | [
2,
13,
5661,
704,
13,
118,
170,
9990,
45,
4226,
205,
1354,
27,
1886,
3916,
800,
3726,
3726,
31,
589,
699,
26,
21,
297,
13,
5661,
704,
13,
118,
170,
8,
9990,
26,
4226,
14,
205,
1354,
464,
1886,
3916,
9,
5787,
31,
57,
40,
3095,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Passing data between C++ (MFC) app and C#
===
We have a monolithic MFC GUI app that is nearing the end of it's life in C++. We are planning to build new functionality in C# and pass data between each app.
Question is: What is the best approach for passing data between C++ and C#?
Notes:<br/>
Both ends will have a GUI front end and will probably only need to pass simple data like Id's and possibly have a mechanism where it indicates to the other app what process/functionality to use. <br/>
Eg One of the applications will be a CRM system in C# that when a row in a grid is double clicked would pass say the customerId and a message to open that customer in the Customer Form of the MFC app.
I have done a little bit of research, the options seem to be Windows Messaging, Memory Mapping, Named Pipes or something like Windows Sockets. At this stage we are leaning towards Named Pipes, but would really appreciate other advice or tips or other peoples experiences. | 0 | [
2,
2848,
1054,
128,
272,
20512,
13,
5,
79,
7061,
6,
4865,
17,
272,
5910,
800,
3726,
3726,
95,
57,
21,
4129,
17865,
307,
7061,
9457,
4865,
30,
25,
424,
68,
14,
241,
16,
32,
22,
18,
201,
19,
272,
20512,
9,
95,
50,
2334,
20,
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... |
ASP.NET Session Timeout Testing
===
I'm a doing some blackbox testing of a ASP.Net website and I need to test different session timeout scenarios.
I'm not sure they fully encapsulated session timeouts. Other then leaving a page open for 20 minutes is there an easier way to force a session timeout? | 0 | [
2,
28,
306,
9,
2328,
3723,
85,
1320,
4431,
800,
3726,
3726,
31,
22,
79,
21,
845,
109,
319,
5309,
4431,
16,
21,
28,
306,
9,
2328,
2271,
17,
31,
376,
20,
1289,
421,
3723,
85,
1320,
19611,
9,
31,
22,
79,
52,
562,
59,
2337,
1957... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Adding to a Coldfusion classpath running on an instanced JRun server
===
I'm having some trouble getting my Coldfusion server classpath to recognize my custom java jars. The classpath is not reading my jvm.config file correctly (I assume out of my JRun server which is where the CF instance is running out of, it's a production server with multiple sites attached). I have been banging my head against the wall for hours on this. All the other sites I have run perfectly with these jar files. One of them is basically a clone of this one, but for some reason this one won't recognize just this one part. The rest of the site works fine but when it tries to access this jar (it's an image resizer) it cannot find it and when I looked in the CF admin the classpath does not show the path (at all) for the java directory like all the other sites.
There also isn't a service associated with this site (well, there is a running service that appears on the JRun manager, but not in the services listing in windows). When I added one manually and attempted to start it, it said it was already running. I've restarted the coldfusion server but to no avail. Should I restart the Jrun server? (it will take down production sites) What can I do here to get this piece working? | 0 | [
2,
4721,
20,
21,
1191,
9818,
718,
8353,
946,
27,
40,
4851,
43,
487,
3169,
8128,
800,
3726,
3726,
31,
22,
79,
452,
109,
2572,
1017,
51,
1191,
9818,
8128,
718,
8353,
20,
5844,
51,
5816,
8247,
5112,
18,
9,
14,
718,
8353,
25,
52,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How do I stop visitors directly accessing the directories in my website?
===
I have a (Wordpress powered) website, and Google is indexing some of the sub-directories. How can I stop Apache from showing users the directory listing? I know I can edit .htaccess to password-protect a directory, but I would prefer a 403 / custom redirect if possible. | 0 | [
2,
184,
107,
31,
747,
4531,
1703,
1381,
68,
14,
559,
1596,
19,
51,
2271,
60,
800,
3726,
3726,
31,
57,
21,
13,
5,
9587,
5890,
7462,
6,
2271,
15,
17,
8144,
25,
4348,
68,
109,
16,
14,
972,
8,
10197,
1596,
9,
184,
92,
31,
747,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 some industry standard for aceptable webapp response time?
===
There's a cots(commercial off-the-shelf) application that I work on customizing, where a couple pages take an extremely long time to load for certain distributions of data. (I'm talking approximately 3 minutes for a page to load in this instance... and the time is growing exponentially).
Clearly this is unacceptable but are there studies out there where I can point what acceptable response time is?
I'd like some good studies possibly that discuss response time. | 0 | [
2,
25,
80,
109,
1230,
1236,
26,
21,
13433,
579,
2741,
7753,
1627,
85,
60,
800,
3726,
3726,
80,
22,
18,
21,
13,
9546,
18,
5,
22547,
168,
8,
124,
8,
1079,
9641,
6,
3010,
30,
31,
170,
27,
5816,
3335,
15,
113,
21,
1335,
4434,
24... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Monitoring memory usage for a C DLL called with Java via JNI?
===
How can I monitor the memory being used by a native C DLL that is being called from Java via JNI? Using standard Java monitoring tools and options I can see the Java memory space, but I cannot view any memory used by the C DLL. Java is using ~70MB, but the task in the Task Manager shows 200Mb+, and I'd like to see what's in that 130MB extra if possible. | 0 | [
2,
8984,
1912,
7514,
26,
21,
272,
13,
43,
211,
227,
29,
8247,
1197,
487,
889,
60,
800,
3726,
3726,
184,
92,
31,
7626,
14,
1912,
142,
147,
34,
21,
1275,
272,
13,
43,
211,
30,
25,
142,
227,
37,
8247,
1197,
487,
889,
60,
568,
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... |
asp.net session and storing objects that use com interop
===
I'm working on an asp.net web site. We have to use com interop to interact with legacy vb6 activex components. The components in many cases rely on receiving a context object (which is itself a vb6 activex component) as a parameter. The context object is fairly costly to construct.
Therefore one idea is that a context object is constructed once and stored in asp.net session. However, if this object is just a .net wrapper around an activex component, is it wise to persist it in session?
| 0 | [
2,
28,
306,
9,
2328,
3723,
17,
25615,
3916,
30,
275,
13,
960,
1480,
2594,
800,
3726,
3726,
31,
22,
79,
638,
27,
40,
28,
306,
9,
2328,
2741,
689,
9,
95,
57,
20,
275,
13,
960,
1480,
2594,
20,
10001,
29,
7780,
13,
20468,
379,
1... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How to get an error-code from a VB component into (serverside) JScript.
===
I have an plain-old asp web site that makes a call to a method in a dll written in VB 6. This method sets an error code in the VB Err Object if something goes wrong. Now I want to access that error code and description set in the Err object from a javascript (where I do the call to the dll method). First: is it possible? Second: if it is possible, how can I do that? Thanks in advance!
My first idea was:
<code>
Function MyFunc()
{
var obj = Server.CreateObject(“MyDll.MyClass”);
try
{
obj.MyMethod();
}
catch(error)
{
// Here I want to get the error code and description from the VB Err object
}
}
</code>
However, when I try this, the error I get is wrong. (I tried to make a test-app which receives the same error.) I get an error-code which isn't the same in JavaScript as in VB.
Anyone know how this aught to be done?
/L | 0 | [
2,
184,
20,
164,
40,
7019,
8,
9375,
37,
21,
13,
20468,
5912,
77,
13,
5,
10321,
106,
1416,
6,
487,
8741,
9,
800,
3726,
3726,
31,
57,
40,
3748,
8,
1218,
28,
306,
2741,
689,
30,
1364,
21,
645,
20,
21,
2109,
19,
21,
13,
43,
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... |
Xterm control sequence to 'T' output to a file...
===
I swear there used to be a way in X to start capturing all terminal traffic to a file on your host. It may have been a HummingBird extension, but I thought it was standard. Now, I can't find the trick. Am I hallucinating (happens when you get old), or is it possible? | 0 | [
2,
993,
3964,
569,
4030,
20,
13,
22,
38,
22,
5196,
20,
21,
3893,
9,
9,
9,
800,
3726,
3726,
31,
6688,
80,
147,
20,
44,
21,
161,
19,
993,
20,
799,
12859,
65,
3855,
2227,
20,
21,
3893,
27,
154,
2015,
9,
32,
123,
57,
74,
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... |
Is there a Java standard "both null or equal" static method?
===
To save some typing and clarify my code, is there a standard version of the following method?
public static boolean bothNullOrEqual(Object x, Object y) {
return ( x == null ? y == null : x.equals(y) );
} | 0 | [
2,
25,
80,
21,
8247,
1236,
13,
7,
8110,
16203,
54,
2747,
7,
12038,
2109,
60,
800,
3726,
3726,
20,
2079,
109,
25266,
17,
23116,
51,
1797,
15,
25,
80,
21,
1236,
615,
16,
14,
249,
2109,
60,
317,
12038,
9827,
413,
210,
156,
103,
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... |
Accessing RPG on iSeries from Java
===
Has anyone had good experiences of talking direct to RPG programs running on a V5R4 iSeries machine from Java? If so, what are the recommendations of the community, and what pitfalls should I try to avoid?
From the various pieces of literature and spike solutions I have attempted it looks as though we can use ProgramCallBeans (either through PCML or xPCML), talking to the DataQueues (for asynchronous comms), or even JNI.
I'm looking for something that's robust, performant, quick to develop, easy to maintain, and easy to test (aren't we all!?!). | 0 | [
2,
1381,
68,
22338,
27,
31,
8231,
37,
8247,
800,
3726,
3726,
63,
1276,
41,
254,
5513,
16,
1582,
1744,
20,
22338,
1726,
946,
27,
21,
566,
264,
139,
300,
31,
8231,
1940,
37,
8247,
60,
100,
86,
15,
98,
50,
14,
12121,
16,
14,
514,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Are GUID collisions possible?
===
I'm working on a database that uses a GUID for each user that uses the app it's tied to. Somehow, two users ended up with the same GUID. I know that microsoft uses an algorithm to generate a random GUID that has an extremely low chance of causing collisons, but is a collision still possible?
This is in SQL Server 2000 btw | 0 | [
2,
50,
9457,
43,
11319,
18,
938,
60,
800,
3726,
3726,
31,
22,
79,
638,
27,
21,
6018,
30,
2027,
21,
9457,
43,
26,
206,
4155,
30,
2027,
14,
4865,
32,
22,
18,
3802,
20,
9,
3625,
15,
81,
3878,
1272,
71,
29,
14,
205,
9457,
43,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
I have a button inside a ControlTemplate. How do I get a reference to it?
===
I just want to enable or disable the button inside a ControlTemplate for a WPF Editor that I'm using. | 0 | [
2,
31,
57,
21,
5167,
572,
21,
569,
9577,
6554,
9,
184,
107,
31,
164,
21,
2801,
20,
32,
60,
800,
3726,
3726,
31,
114,
259,
20,
9240,
54,
1460,
579,
14,
5167,
572,
21,
569,
9577,
6554,
26,
21,
619,
7721,
1835,
30,
31,
22,
79,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
Techniques to measure application performance
===
I maintain an application which, during the course of two years, has constantly required new hardware to be even usable, due to the amount of new users / new data inserted. However, justifying the investiment is sometimes very hard to do.
I started to wonder - how can I establish the maximum number of users a web application currently suports?
I thought of using JMeter scripts but they can get really nasty to implement when having to simulate file transfers and decison trees. What do you guys use?
| 0 | [
2,
4212,
20,
4058,
3010,
956,
800,
3726,
3726,
31,
4027,
40,
3010,
56,
15,
112,
14,
674,
16,
81,
122,
15,
63,
7545,
1390,
78,
7610,
20,
44,
166,
182,
579,
15,
397,
20,
14,
2006,
16,
78,
3878,
13,
118,
78,
1054,
14215,
9,
207... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Expose a WCF Service through a Named Pipes binding
===
Intro:
-
I successfully implemented a WCF Service hosted in a Windows Service a few days ago. The community here at StackOverflow helped me with <a href="http://stackoverflow.com/questions/167852/wsdl-url-for-a-wcf-service-basichttpbinding-hosted-inside-a-windows-service">the WSDL exposure here</a>. I thank you once again. However recently I found out that there is another potential client for this service this time located on the same machine as the service and this lead me to think I should add another endpoint with the namedPipesBinding.
Named pipes seem to be the best solution for intra-machine communication as far as I am concerned. **Please** correct me if this is wrong.
Problem:
-
I need to expose another endpoint for the same service/contract but this time using a netNamedPipeBinding. However I really don't understand how do I can then add a service reference from a client. Foolishly after adding
<endpoint address="net.pipe://localhost/OfficeService"
binding="netNamedPipeBinding"
contract="netBridge.Development.OfficeService.IWordService"
bindingConfiguration="localBinding" />
I have tried to add a service reference in a Windows Forms Application located on the same machine typing the net.pipe://.... url. It didn't work. I must mention I have removed the mex (MetaData Exchange) endpoint earlier because I considered it not necessary.
1. Is this mex endpoint necessary for named pipes endpoint binding discovery?
2. How should I add a service reference in the client app to the named pipe endpoint? | 0 | [
2,
13833,
21,
11801,
410,
365,
120,
21,
377,
14104,
8728,
800,
3726,
3726,
17386,
45,
13,
8,
31,
3673,
6807,
21,
11801,
410,
365,
2812,
19,
21,
1936,
365,
21,
310,
509,
1464,
9,
14,
514,
235,
35,
7566,
2549,
9990,
1456,
55,
29,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Which Facebook .NET Library is the best to use?
===
There is a list of projects [here][1], mainly the [Facebook Developer Toolkit][2] and [Facebook.NET][3]. However, I've seen a lot of negative feedback about the toolkit and it seems like Facebook.NET hasn't been upgraded to the latest facebook API.
Are either of these worth using? Any other good libraries out there?
Specifically I'm looking to use the library in a ASP.NET MVC application.
Thanks!
[1]: http://www.marketing-ninja.com/old-stuff/list-of-facebook-sdks-for-net/
[2]: http://www.codeplex.com/FacebookToolkit
[3]: http://www.nikhilk.net/FacebookNET.aspx | 0 | [
2,
56,
9090,
13,
9,
2328,
1248,
25,
14,
246,
20,
275,
60,
800,
3726,
3726,
80,
25,
21,
968,
16,
2314,
636,
6836,
500,
2558,
165,
500,
15,
2011,
14,
636,
6413,
5199,
10058,
5607,
13703,
500,
2558,
135,
500,
17,
636,
6413,
5199,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Effective way to notify user of input validation failures in an editable table
===
Im looking for ideas on how to effectively notify users that their input into an editable table is invalid. For example, if one column of a table represents an American zip code and the user enters in the zip code "85rr3" into a cell, how would you notify the user of the issue? | 0 | [
2,
3140,
161,
20,
52,
8612,
4155,
16,
6367,
27999,
2990,
18,
19,
40,
9392,
579,
859,
800,
3726,
3726,
797,
699,
26,
3478,
27,
184,
20,
5463,
52,
8612,
3878,
30,
66,
6367,
77,
40,
9392,
579,
859,
25,
16671,
9,
26,
823,
15,
100,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
window.resizeTo affects subsequent Firefox windows
===
I have a webapp which resizes its window to exactly fit its contents:
window.resizeTo(200,300)
People do like having the page fit its window in this way. However with Firefox the next browser window the user opens comes up at the same size, which is ridiculously small.
Is there a way to tell Firefox to resize the current window, but not change its notion of how large subsequent windows should be? | 0 | [
2,
1463,
9,
99,
10454,
262,
15476,
3147,
535,
18219,
1936,
800,
3726,
3726,
31,
57,
21,
2741,
7753,
56,
10719,
13569,
82,
1463,
20,
1890,
2742,
82,
8478,
45,
1463,
9,
99,
10454,
262,
5,
4621,
15,
6571,
6,
148,
107,
101,
452,
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... |
Recommended spec for a build server
===
We're using CruiseControl.NET to manage our builds and we're in the process of obtaining a new build server. I've been tasked with coming up with the spec for the new server.
This server will need to run multiple builds concurrently and as effeciently as possible.
What would you consider the ideal spec for this server?
Any links to existing articles / blogs dealing with this topic will also be welcome! | 0 | [
2,
5773,
12737,
26,
21,
1895,
8128,
800,
3726,
3726,
95,
22,
99,
568,
6581,
12898,
9,
2328,
20,
4705,
318,
1895,
18,
17,
95,
22,
99,
19,
14,
953,
16,
12114,
21,
78,
1895,
8128,
9,
31,
22,
195,
74,
14605,
29,
880,
71,
29,
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... |
Java ColorSpace Support
===
I need to take a BufferedImage and convert it to YCbCr format so that I can do a more efficient Brightness/contrast manipulation on it, but I can't figure out how to do this. I've tried ColorConvertOp but there doesn't seem to be an appropriate ColorSpace for YCbCr (though there is a type for it?).
I could do the conversion manually (the conversion is not difficult) but this would immediately kick my image out of the 'fast-path'. Does anyone know a solution? | 0 | [
2,
8247,
1665,
5582,
555,
800,
3726,
3726,
31,
376,
20,
247,
21,
17497,
69,
22039,
17,
8406,
32,
20,
13,
93,
11849,
6711,
2595,
86,
30,
31,
92,
107,
21,
91,
8243,
21138,
118,
1126,
1939,
384,
17561,
27,
32,
15,
47,
31,
92,
22,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Custom Filters/Validators in Zend Framework
===
I have a Zend Framework application structure as below:
/application
/library
/Zend
/Core
/Filter
/MyFilter.php
/Validator
/MyValidator.php
I would like to put custom filters and validators in their respective folders and have them loaded automatically when used. However, I cannot figure out how to best accomplish this.
I need the solution to work with Zend\_Filter_Input in this fashion:
$filters = array(
'month' => 'Digits',
'account' => 'StringTrim',
'other' => 'MyFilter'
);
$validators = array(
'account' => 'Alpha',
'other' => 'MyValidator'
);
$inputFilter = new Zend_Filter_Input($filters, $validators);
What I already know:
- Core\_Filter\_MyFilter implements Zend\_Filter\_Interface
- Obviously, the filters and validators are already in my include path. | 0 | [
2,
5816,
21062,
118,
18506,
43,
9922,
19,
10526,
43,
6596,
800,
3726,
3726,
31,
57,
21,
10526,
43,
6596,
3010,
1411,
28,
1021,
45,
13,
118,
2552,
20669,
13,
118,
1210,
2559,
622,
13,
118,
4257,
43,
13,
118,
10375,
13,
118,
11924,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
java.beans.Introspector getBeanInfo does not pickup any superinterface's properties
===
I just noticed that java.beans.Introspector getBeanInfo does not pickup any superinterface's properties. Example:
public interface Person {
String getName();
}
public interface Employee extends Person {
int getSalary();
}
Introspecting on Employee only yields salary even though name is inherited from Person.
Why is this? I would rather not have to use reflection to get all the getters.
| 0 | [
2,
8247,
9,
863,
5950,
9,
23979,
7350,
248,
164,
863,
210,
108,
4120,
630,
52,
15181,
186,
1026,
6280,
6413,
22,
18,
3704,
800,
3726,
3726,
31,
114,
2711,
30,
8247,
9,
863,
5950,
9,
23979,
7350,
248,
164,
863,
210,
108,
4120,
63... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 version milestones developed in parallel that may not be completed sequentially?
===
I am currently working on a project with five other developers and we are using subversion for our revision control system. We have established that we have 12 milestones leading up to the first release of our software. We have labeled them 0.1, 0.2, 0.3 and so on through 0.12. Every 4th milestone is an external release that is composed of the three internal milestones before it. So, milestone 0.1, 0.2, 0.3 are internal milestones which when completed make up milestone 0.4.
In addition each milestone will be developed in a separate branch in subversion and when completed it will be merged into the stable trunk and an internal release is made at which point any other ongoing branches will be updated with the latest code from trunk. We want to version each release (internal and external) such that the milestone label (e.g., 0.1, 0.2, 0.3) is the version number of the application so that we can easily see what features have been implemented and what bugs have been found. However, it is possible that some milestones may finish before others. The problem here is that if 0.3 finishes before 0.2 and 0.1 our version numbers are out of sync. There is an implicit idea that version 0.3 would contain all the features of the previous milestones, but this may not be the case for internal releases.
Any thoughts on how to version software when there are several parallel releases that may not be completed sequentially? | 0 | [
2,
184,
20,
615,
19104,
18,
885,
19,
3821,
30,
123,
52,
44,
1066,
1353,
5495,
10107,
102,
60,
800,
3726,
3726,
31,
589,
871,
638,
27,
21,
669,
29,
355,
89,
10168,
17,
95,
50,
568,
972,
10898,
26,
318,
11323,
569,
329,
9,
95,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Rhino Mocks: good tutorials
===
I'm looking for a good tutorial on mock objects in general and Rhino Mocks in particular. I'd like to recommend it to co-workers to help bring them up to speed.
One co-worker is an experienced developer with some experience writing unit tests, while the other is less experienced. | 0 | [
2,
18642,
10506,
18,
45,
254,
29724,
18,
800,
3726,
3726,
31,
22,
79,
699,
26,
21,
254,
29724,
27,
10506,
3916,
19,
297,
17,
18642,
10506,
18,
19,
1498,
9,
31,
22,
43,
101,
20,
12360,
32,
20,
326,
8,
16355,
20,
448,
1499,
105,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Windsor Container and internal properties
===
Is there any solution how to initialize properties of component marked as 'internal'? What assembly name should I use for InternalsVisibleTo attrribute or it won't help? | 0 | [
2,
10784,
12147,
17,
3117,
3704,
800,
3726,
3726,
25,
80,
186,
4295,
184,
20,
2104,
2952,
3704,
16,
5912,
2739,
28,
13,
22,
6280,
5025,
22,
60,
98,
1475,
204,
378,
31,
275,
26,
3117,
18,
3762,
3426,
262,
35,
6384,
17980,
6567,
5... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
HTTP Compression in IIS 6 - vs Third Party Solutions
===
Anyone had any experience with httpZip product (ISAPI - based compression for IIS). I'm wondering if this is worthwhile compared to the native compression in IIS6... Pros / Cons / pitfalls of either approach? | 0 | [
2,
7775,
14864,
19,
595,
18,
400,
13,
8,
4611,
422,
346,
6776,
800,
3726,
3726,
1276,
41,
186,
1496,
29,
7775,
2553,
306,
2374,
13,
5,
8164,
2159,
13,
8,
432,
14864,
26,
595,
18,
6,
9,
31,
22,
79,
5712,
100,
48,
25,
29604,
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... |
Draw shapes or images on a curved path
===
I am looking for a drawing library or code examples to draw images or vector shapes repeated along a path which could be curved.
I found a cocoa library which is what I am looking for http://apptree.net/drawkitmain.htm but for .NET. | 0 | [
2,
2003,
12129,
54,
3502,
27,
21,
9279,
2013,
800,
3726,
3726,
31,
589,
699,
26,
21,
3533,
1248,
54,
1797,
3770,
20,
2003,
3502,
54,
7497,
12129,
4251,
303,
21,
2013,
56,
110,
44,
9279,
9,
31,
216,
21,
24507,
1248,
56,
25,
98,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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++ testing framework: recommendation sought
===
I'm looking for a "quick and dirty" C++ testing framework I can use on my Windows/Visual Studio box. It's just me developing, so it doesn't have to be enterprise class software.
Staring at a list of testing frameworks, I am somewhat befuddled...
http://en.wikipedia.org/wiki/List_of_unit_testing_frameworks#C.2B.2B | 0 | [
2,
272,
20512,
4431,
6596,
45,
14066,
3477,
800,
3726,
3726,
31,
22,
79,
699,
26,
21,
13,
7,
25865,
17,
6121,
7,
272,
20512,
4431,
6596,
31,
92,
275,
27,
51,
1936,
118,
20893,
1120,
1649,
9,
32,
22,
18,
114,
55,
3561,
15,
86,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How to change the default Browser in Expression Blend
===
I want to set IE as my default browser for running Silver light applications from Expression Blend, but I don't want to change my windows default from Mozilla. | 0 | [
2,
184,
20,
753,
14,
12838,
16495,
19,
1803,
11138,
800,
3726,
3726,
31,
259,
20,
309,
13,
660,
28,
51,
12838,
16495,
26,
946,
1172,
471,
3767,
37,
1803,
11138,
15,
47,
31,
221,
22,
38,
259,
20,
753,
51,
1936,
12838,
37,
13,
1... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
Parent-Child object relationship events.
===
Is it an acceptable strategy for a child object in a typical parent-child OO relationship to raise an event that the parent catches then passes a value back to the child through the EventArgs?
I have a situation where the child needs data from the parent, but the parent does not have that data at the time the child is instantiated so I can not pass it though a constructor.
Thank you,
Keith
| 0 | [
2,
4766,
8,
11287,
3095,
1429,
963,
9,
800,
3726,
3726,
25,
32,
40,
12513,
4427,
26,
21,
850,
3095,
19,
21,
3874,
4766,
8,
11287,
13,
4328,
1429,
20,
3972,
40,
807,
30,
14,
4766,
12195,
94,
3789,
21,
1923,
97,
20,
14,
850,
120... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Learning LINQ: QSort
===
I took the plunge this afternoon and began studying LINQ, so far just mucking around with LINQ on collections. One of the first things I tried was to implement QSort.
Now -- ignoring the fact that I *could* just use an ORDERBY and that this is a very silly qsort implementation -- what I came up with was this:
public class lqsort
{
public static List<int> QSLinq(List<int> _items)
{
if (_items.Count <= 1)
return _items;
int _pivot = _items[0];
List<int> _less = (from _item in _items where _item < _pivot select _item).ToList();
List<int> _same = (from _item in _items where _item == _pivot select _item).ToList();
List<int> _greater = (from _item in _items where _item > _pivot select _item).ToList();
return (QSLinq(_less).Concat(_same.Concat(QSLinq(_greater)))).ToList();
}
}
The only thing that really bugs me is all of the casting involved. Are there any LINQ tricks I might use? Or am I just using LINQ for things it wasn't intended for?
| 0 | [
2,
2477,
6294,
1251,
45,
2593,
22843,
800,
3726,
3726,
31,
199,
14,
22212,
48,
3435,
17,
260,
4493,
6294,
1251,
15,
86,
463,
114,
25872,
68,
140,
29,
6294,
1251,
27,
5721,
9,
53,
16,
14,
64,
564,
31,
794,
23,
20,
8713,
2593,
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... |
Crash when calling into C++ library from Perl using SWIG (AIX 5.1)
===
I'm trying to call into a C++ library from Perl on an AIX 5.1 machine. I've created a very simple test project to try to exercise this.
My C++ shared library (`test.cpp`):
#include <stdio.h>
#include <iostream>
void myfunc()
{
printf("in myfunc()\n");
std::cout << "in myfunc() also" << std::endl;
}
My SWIG interface file (`test.i`):
%module test
%{
void myfunc();
%}
void myfunc();
I then build the shared object like so:
swig -c++ -perl test.i
g++ -c test_wrap.cxx -I/usr/opt/perl5/lib/5.6.0/aix/CORE -o test_wrap.o
g++ -c test.cpp -o test.o
ld -G -bI:/usr/opt/perl5/lib/5.6.0/aix/CORE/perl.exp -bnoentry -bexpall -lc_r test.o test_wrap.o -o test.so
At this point, I have a `test.so` shared object that should be loadable in perl (via the SWIG generated `test.pm`). I have a very simple perl script to try to load the shared object and call the one function that I am exporting (`test.pl`):
#!/usr/bin/perl
use test;
test::myfunc();
When I run `test.pl`, I get the following output:
> in myfunc()
> Illegal instruction (core dumped)
If I comment-out the `std::cout` usage in `myfunc`, it works without problem. It appears as though using anything in the C++ STL causes a core dump (I tried just declaring a `std::vector` and `std::stringstream`, both result in the core dump). I can create a standalone C++ executable that uses the STL without any issues, it's only when called in my shared object when loaded from perl that I get into trouble.
I've also tried using xlc rather than gcc, but I get the same result. I'm thinking there is some funky linker flag that I need to pass in to ensure that all of the linkage occurs correctly? Any ideas are welcome...
| 0 | [
2,
4597,
76,
2555,
77,
272,
20512,
1248,
37,
416,
255,
568,
13,
18,
12445,
13,
5,
58,
4028,
331,
9,
165,
6,
800,
3726,
3726,
31,
22,
79,
749,
20,
645,
77,
21,
272,
20512,
1248,
37,
416,
255,
27,
40,
21,
4028,
331,
9,
165,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
What is the general complexity of building a canonical language representation?
===
It is often handy to have a canonical representation of a language (in my case they are usually domain specific languages); however, I believe there are strict limits on the expressiveness of the languages involved that determine whether a canonical form can be determined and/or created for an arbitrary program in that language. Unfortunately, I've been unable to find the references that I (vaguely) recall reading about this in.
On one hand, it seems reasonable that creating a cannonical representation of a language is of comparable complexity to many hard graph problems (eg: graph isomorphism), but on the other hand, iirc, compilers like gcc, yhc, and ghc use intermediate representations to generate outputs in various formats (assembly, javascript, etc.), so this is at least in some forms, a solved problem.
When is it possible to determine / generate a canonical form for a given language? (How expressive can that language be, and how does language expressiveness impact the utility of the canonical forms?) Please provide references or proofs if at all possible. | 0 | [
2,
98,
25,
14,
297,
12745,
16,
353,
21,
5742,
4272,
816,
5442,
60,
800,
3726,
3726,
32,
25,
478,
20277,
20,
57,
21,
5742,
4272,
5442,
16,
21,
816,
13,
5,
108,
51,
610,
59,
50,
951,
4603,
1903,
2556,
6,
73,
207,
15,
31,
985,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Is it possible to limit standard streams available to linux at the process level?
===
I would like to be able to spawn a linux process that would only have access to stdin, stdout, and stderr (nothing more and nothing less). Can I do this at the process level itself? I am also implicitly stating (oxymoron) that I don't want the spawned process to be able to change the "thing" that the other end of the stream points to.
Metaphorically:
- the process has a input pipe that comes from somewhere, it cannot change where the pipe starts from, so it cannot control where input comes from.
- the process has output and error pipes that go somewhere, it cannot change where the other end of the output pipes point to, so it cannot control where output goes to.
- it cannot create any new pipes.
I am also currently looking at SElinux. Would this allow me to create a process that only had access to these three streams? Thank you. | 0 | [
2,
25,
32,
938,
20,
4496,
1236,
9464,
904,
20,
13024,
35,
14,
953,
662,
60,
800,
3726,
3726,
31,
83,
101,
20,
44,
777,
20,
13,
22860,
21,
13024,
953,
30,
83,
104,
57,
1381,
20,
354,
3653,
15,
354,
43,
1320,
15,
17,
354,
1157... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Can I inject a thread in a remote app domain from C#
===
I was wondering if its possible to inject a thread into a remote app domain running in a separate process.
My guess is that I could do this using the debugging interfaces (ICorDebug) but I was wondering if there is any other way?
| 0 | [
2,
92,
31,
20316,
21,
9322,
19,
21,
5388,
4865,
4603,
37,
272,
5910,
800,
3726,
3726,
31,
23,
5712,
100,
82,
938,
20,
20316,
21,
9322,
77,
21,
5388,
4865,
4603,
946,
19,
21,
1725,
953,
9,
51,
2321,
25,
30,
31,
110,
107,
48,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Delphi 7 compile error - “Duplicate resource(s)” between .res and .dfm
===
I got a very similar error to the one below:
http://stackoverflow.com/questions/97800/how-can-i-fix-this-delphi-7-compile-error-duplicate-resources
However, the error I got is this:
[Error] WARNING. Duplicate resource(s):
[Error] Type 10 (RCDATA), ID TFMMAINTQUOTE:
[Error] File P:\[PATH SNIPPED]\Manufacturing.RES resource kept; file FMaintQuote.DFM resource discarded.
Manufacturing.res is the default resource file (application is called Manufacturing.exe), and FMainQuote is one of the forms. .dfm files are plain text files, so I'm not sure what resources is being duplicated, how to find it and fix it?
| 0 | [
2,
23030,
453,
26561,
7019,
13,
8,
13,
1,
2323,
26811,
6577,
5,
18,
6,
1,
128,
13,
9,
99,
18,
17,
13,
9,
43,
5223,
800,
3726,
3726,
31,
330,
21,
253,
835,
7019,
20,
14,
53,
1021,
45,
7775,
6903,
25325,
2549,
9990,
9,
960,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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.