unified_texts stringlengths 32 30.1k | OpenStatus_id int64 0 4 | input_ids list | token_type_ids list | attention_mask list |
|---|---|---|---|---|
[C#] Settings.Default.<property> always returns default value instead of value in persistant storage (XML file)
===
I recently wrote a DLL in C# (.Net 2.0) which contains a class that requires an IP address. A co-worker of mine altered the class to retrieve the IP from a ".dll.config" (XML) file -- This apparently is automatically generated by the "Application Settings" file he created (Settings1.settings). The benefit of this was to allow the end-user to change the IP address in the XML/config file at will.
Unfortunately, when I check his code out of the tree and try to compile (or use) this new code, any application calling this DLL only gets the default value, rather than the value from the file.
I found [a reference to this problem on the MSDN forums][1] where a user said:
> the 'old' values (the ones you define at development time) are hard coded. If the franework isn't able to access or open the config file it will use the defaults instead. This will always happen if you use settings in a dll.
1. Does this mean that I cannot store an external value for a DLL in a config file? (My co-worker has somehow made this work...)
2. Since my framework appears to be unable to access or open the config file, how do I figure out why it's failing? Or even detect when this happens?
[1]: http://social.msdn.microsoft.com/Forums/en-US/clr/thread/f3a4b138-6e6c-42e3-86e8-1f86c90f8fb4/ | 0 | [
2,
636,
150,
5910,
500,
12410,
9,
13862,
9708,
9,
1,
10890,
106,
1084,
1,
550,
4815,
12838,
1923,
700,
16,
1923,
19,
22084,
1830,
4326,
13,
5,
396,
8184,
3893,
6,
800,
3726,
3726,
31,
1989,
738,
21,
13,
43,
211,
19,
272,
5910,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
.NET Dynamic Objects with Reflection
===
How do I determine if a `Nullable(of Enum)` is indeed an `Enum` by means of reflection?
I'm working with a method that dynamically populates an object of type `T` with an `IDataReader` retrieved from a database call. At its essence, it loops through the datareader's ordinals, and all the properties of `T` and populates the properties that match the name of the ordinals (also some attribute magic is thrown to change column names). In every other circumstance, it works great, but when I check the property's `BaseType` for `System.Enum` I find instead, `System.ValueType` Thusly, my Enum check fails and the method bombs.
Any ideas? | 0 | [
2,
13,
9,
2328,
7782,
3916,
29,
9138,
800,
3726,
3726,
184,
107,
31,
3746,
100,
21,
13,
1,
4215,
211,
579,
5,
1041,
1957,
723,
6,
1,
25,
4057,
40,
13,
1,
219,
723,
1,
34,
1108,
16,
9138,
60,
31,
22,
79,
638,
29,
21,
2109,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
CakePHP - item name as title
===
OK, so I'm trying to teach myself the CakePHP framework, and I'm trying to knock up a simple demo app for myself.
I have the controllers, views and models all set up and working, but I want to do something slightly more than the basic online help shows.
I have a guitars_controller.php file as follows...
<?php
class GuitarsController extends AppController {
var $name = 'Guitars';
function index() {
$this->set('Guitars', $this->Guitar->findAll());
$this->pageTitle = "All Guitars";
}
function view($id = null) {
$this->Guitar->id = $id;
$this->set('guitar', $this->Guitar->read());
// Want to set the title here.
}
}
?>
The 'Guitar' object contains an attribute called 'Name', and I'd like to be able to set that as the pageTitle for the individual page views.
Can anyone point out how I'd do that, please?
NB. I know that there is general disagreement about where in the application to set this kind of data, but to me, it is data related so should go here. | 0 | [
2,
8390,
26120,
13,
8,
9101,
204,
28,
581,
800,
3726,
3726,
5854,
15,
86,
31,
22,
79,
749,
20,
5348,
992,
14,
8390,
26120,
6596,
15,
17,
31,
22,
79,
749,
20,
5307,
71,
21,
1935,
8376,
4865,
26,
992,
9,
31,
57,
14,
9919,
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... |
Can you monkey patch methods on core types in python?
===
Ruby can add methods to the Number class and other core types to get effects like:
<pre>
1.should_equal(1)
</pre>
But it seems like python cannot do this. Is this true? And if so, why? Does it have something to do with the fact that *type* can't be modified? | 0 | [
2,
92,
42,
11861,
7331,
3195,
27,
2884,
2551,
19,
20059,
60,
800,
3726,
3726,
10811,
92,
3547,
3195,
20,
14,
234,
718,
17,
89,
2884,
2551,
20,
164,
2292,
101,
45,
13,
1,
3515,
1,
137,
9,
14941,
1,
62,
14512,
5,
165,
6,
13,
1... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How come I can't see member 'Default' on a class derived from ApplicationSettingsBase?
===
I'm using .NET 3.5 and I have a class, A, marked as internal sealed partial and it derives from System.Configuration.ApplicationSettingsBase. I then use an instance of this class in the following manner:
A A_Instance = new A();
A_Instance.Default.Save();
Why would the Visual C# compiler be complaining:
error CS0117: 'A' does not contain a definition for 'Default'
?
| 0 | [
2,
184,
340,
31,
92,
22,
38,
196,
322,
13,
22,
13862,
9708,
22,
27,
21,
718,
3981,
37,
3010,
19831,
18,
8436,
60,
800,
3726,
3726,
31,
22,
79,
568,
13,
9,
2328,
203,
9,
264,
17,
31,
57,
21,
718,
15,
21,
15,
2739,
28,
3117,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Ant's wrong directory on property
===
I'm a newbie on Ant so instead of posting this on the official buglist(because its probably not a bug), I decided to post here:
When I run my Ant build.xml file everything works well except for the build directory, that instead of translating the property ${classes.dir} into build/ver_2.0.0/classes it creates a file ${cv.build.dir}/classes
Here is part of the ant code:
<!--Properties-->
<property name="build.ver" value="2.0.0"/>
<property name="src.dir" value="src"/>
<property name="lib.dir" value="lib"/>
<property name="build.dir" value="build"/>
<property name="classes.dir" value="${cv.build.dir}/classes"/>
<property name="jar.dir" value="${cv.build.dir}/jar"/>
<property name="main-class" value="br.uesc.computacao.estagio.controlador.ControladorModoExecucao"/>
<property name="cv.dir" value="ver_${build.ver}"/>
<property name="cv.src.dir" value="${src.dir}/${cv.dir}"/>
<property name="cv.build.dir" value="${build.dir}/${cv.dir}"/>
...
<target name="compile">
<mkdir dir="${classes.dir}"/> | 0 | [
2,
40,
38,
22,
18,
1389,
16755,
27,
1354,
800,
3726,
3726,
31,
22,
79,
21,
78,
5893,
27,
40,
38,
86,
700,
16,
15669,
48,
27,
14,
989,
6256,
5739,
5,
4451,
82,
910,
52,
21,
6256,
6,
15,
31,
868,
20,
678,
235,
45,
76,
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... |
Hotkeys override
===
Difficult question. The answer is probably no, if all I found in the Intertubes is right, but it is worth a try. I need to override the CTRL+SHIFT+ESC and the CTRL+ESC combinations. It would be good to be able to override the WIN key combinations, but I have a low level hook that does such, I only wish I didn't need it. If I can manage to block the start menu and the task manager entirely by policy, the overrides will no longer be needed but I couldn't find the correct policy to do so. | 0 | [
2,
1047,
4237,
18,
84,
11891,
800,
3726,
3726,
1956,
1301,
9,
14,
1623,
25,
910,
90,
15,
100,
65,
31,
216,
19,
14,
1480,
19302,
18,
25,
193,
15,
47,
32,
25,
2715,
21,
1131,
9,
31,
376,
20,
84,
11891,
14,
13,
4812,
6362,
2430... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
the art of programming
===
I see programming as the meeting-place of creative arts and science.
**Most of us ...**
- are interested in programming for
the fulfillment achieved by
creativeness tempered by the rigor
of applied science;
- produce extremely high quality
products that we distribute for free
(FOSS, as an example);
- subject ourselves to peer-reviews
that few established academicians
and research scientists will suffer
(or ever experience);
- are always ready to assist, educate,
and support fellows programmers in
improving their, and our own, skills (as SO proofs beyond
any doubt);
- proof our ability to apply our
skills to virtually any area of
specialization, at almost the "drop
of a hat";
- and more, and more ...
I think we seamlessly associate with both the fine-arts as well as the applied sciences. Are we for this to be termed 'geeks', as if we are separate from 'normal' people as well as the scientific establishment, not quite fitting in with either?
How can we reap the benefit of these abilities? I think not as much in financial terms, but far more in terms of having the comfort and opportunity to express ourselves in the ways we need to?
| 0 | [
2,
14,
415,
16,
3143,
800,
3726,
3726,
31,
196,
3143,
28,
14,
1235,
8,
5119,
16,
4231,
1008,
17,
762,
9,
13,
1409,
4630,
16,
182,
13,
9,
9,
9,
1409,
13,
8,
50,
3158,
19,
3143,
26,
14,
29289,
3153,
34,
4231,
720,
13,
24307,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Efficient way to check precision and scale of a numeric value
===
I'm writing a routine that validates data before inserting it into a database, and one of the steps is to see if numeric values fit the precision and scale of a Numeric(x,y) SQL-Server type.
I have the precision and scale from SQL-Server already, but what's the most efficient way in C# to get the precision and scale of a CLR value, or at least to test if it fits a given constraint?
At the moment, I'm converting the CLR value to a string, then looking for the location of the decimal point with .IndexOf(). Is there a faster way? | 0 | [
2,
8243,
161,
20,
2631,
13133,
17,
3464,
16,
21,
15764,
596,
1923,
800,
3726,
3726,
31,
22,
79,
1174,
21,
8275,
30,
7394,
7759,
1054,
115,
14692,
68,
32,
77,
21,
6018,
15,
17,
53,
16,
14,
2382,
25,
20,
196,
100,
15764,
596,
40... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How Do You Fix A Parameter Names Mismatch - DOJO and PL/SQL
===
How do you fix a names mismatch problem, if the client-side names are keywords or reserved words in the server-side language you are using?
The DOJO JavaScript toolkit has a QueryReadStore class that you can subclass to submit REST patterned queries to the server. I'm using this in conjunction w/ the FilteringSelect Dijit.
I can subclass the QueryReadStore and specify the parameters and arguments getting passed to the server. But somewhere along the way, a "start" and "count" parameter are being passed from the client to the server. I suspect this is a default thing that the FilteringSelect Dijit does.
I'm using Fiddler to confirm what's actually being sent and brought back. The server response is telling me I have a parameter names mismatch, because of the "start" and "count" parameters. The problem is, I can't use "start" and "count" in PL/SQL.
Workaround or correct implementation advice would be appreciated...thx.
//I tried putting the code snippet in here, but since it's largely HTML, that didn't work so well.
| 0 | [
2,
184,
107,
42,
6098,
21,
18906,
1817,
2462,
12280,
13,
8,
107,
1636,
17,
12443,
118,
18,
22402,
800,
3726,
3726,
184,
107,
42,
6098,
21,
1817,
2462,
12280,
1448,
15,
100,
14,
6819,
8,
1416,
1817,
50,
1246,
12827,
54,
9430,
715,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Consuming web services with jbossws
===
Can someone point me a good step-by-step tutorial to consuming an already running web service in java?
PS: I tried creating the classes with `wsconsume`, but it cries with
`[ERROR] rpc/encoded wsdls are not supported in JAXWS 2.0.` (my web service is rpc/encoded)
If I can consume web services entirely by hand (using no wizards), and understand how is it working, then I'll be happy.
Thanks! | 0 | [
2,
13,
17601,
2741,
687,
29,
487,
10349,
18,
10268,
800,
3726,
3726,
92,
737,
454,
55,
21,
254,
1424,
8,
779,
8,
8375,
29724,
20,
13,
17601,
40,
614,
946,
2741,
365,
19,
8247,
60,
8613,
45,
31,
794,
2936,
14,
2684,
29,
13,
1,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Creating Recordset in VBA wit SQL statement
===
I am trying to create a recordset in Access VBA that will show me all records in a table related to the current record of a form. My current code looks like this:
Private Sub Form_Load()
Dim rst As Recordset
Set rst = CurrentDb.OpenRecordset("Select [ID], [Ln] From [Order Detail] Where ((([Order Detail].[ID]) = [Forms]![Order Data Entry Header]![ID]))")
rst.MoveLast
Forms![Order Data Entry Header].LineNum = rst![Ln]
End Sub
I am doing this so that when adding new records they can be numbered sequentially after the highest number. When I run the form it get "Run-time Error: '3061' Too few parameters. Expected 1." on the Set rst line.
Any help would be appreciated.
| 0 | [
2,
2936,
742,
1198,
19,
566,
969,
9642,
4444,
255,
3331,
800,
3726,
3726,
31,
589,
749,
20,
1600,
21,
742,
1198,
19,
1381,
566,
969,
30,
129,
298,
55,
65,
742,
19,
21,
859,
1597,
20,
14,
866,
571,
16,
21,
505,
9,
51,
866,
17... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
MVC with SharePoint
===
1. We are looking to use the MVC Framework in our SP Application.
2. This is what we are trying to accomplish...
A virtual directory within the SPSite which can host and run MVC.
for e.g., /_layouts/MVC/
Any hints on the required configuration changes (if at all this is possible) will be very helpful.
Kind regards,
Ashish Sharma | 4 | [
2,
307,
8990,
29,
1891,
3132,
800,
3726,
3726,
137,
9,
95,
50,
699,
20,
275,
14,
307,
8990,
6596,
19,
318,
3782,
3010,
9,
172,
9,
48,
25,
98,
95,
50,
749,
20,
14570,
9,
9,
9,
21,
6599,
16755,
363,
14,
3782,
9097,
56,
92,
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... |
Is is possible to "collapse" an array so that it's elements can be passed into a method which uses the params keyword?
===
Take this non-compiling code for instance:
public string GetPath(string basefolder, string[] extraFolders)
{
string version = Versioner.GetBuildAndDotNetVersions();
string callingModule = StackCrawler.GetCallingModuleName();
return AppendFolders(basefolder, version, callingModule, extraFolders);
}
private string AppendFolders(params string[] folders)
{
string outstring = folders[0];
for (int i = 1; i < folders.Length; i++)
{
string fixedPath = folders[i][0] == '\\' ? folders[i].Substring(1) : folders[i];
Path.Combine(outstring, fixedPath);
}
return outstring;
}
Is there a way to "collapse" the extraFolders array so that it's contents can be passed into AppendFolders as parameters? | 0 | [
2,
25,
25,
938,
20,
13,
7,
7771,
17057,
7,
40,
7718,
86,
30,
32,
22,
18,
2065,
92,
44,
1100,
77,
21,
2109,
56,
2027,
14,
2258,
79,
18,
1246,
9587,
60,
800,
3726,
3726,
247,
48,
538,
8,
11103,
49,
802,
1797,
26,
4851,
45,
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... |
Castle Windsor: What is the XML for registering a generic array component
===
Quick question, How do I do the following in xml?
IoC.Container.AddComponent<IInputRequestedDialog<string[]>, SealsInputDialog>("seals");
Thanks.
| 0 | [
2,
1339,
10784,
45,
98,
25,
14,
23504,
26,
2243,
68,
21,
12733,
7718,
5912,
800,
3726,
3726,
2231,
1301,
15,
184,
107,
31,
107,
14,
249,
19,
23504,
60,
31,
2499,
9,
1126,
5851,
106,
9,
14854,
11103,
218,
2291,
1,
49,
108,
4881,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
JNDI without a J2EE Container (with JNP?)
===
I need to run a JNDI provider without the overhead of a J2EE container. I've tried to follow the directions in this [article][1], which describes (on page 3) exactly what I want to do. Unfortunately, these directions fail. I had to add the jboss-common.jar to my classpath too. Once I did that, I get a stack trace:
$ java org.jnp.server.Main
0 [main] DEBUG
org.jboss.naming.Naming - Creating
NamingServer stub, theServer=null,rmiPort=0,clientSocketFactory=null,serverSocketFactory=org.jboss.net.sockets.DefaultSocketFactory@ad093076[bindAddress=null]
Exception in thread "main"
java.lang.NullPointerException
at org.jnp.server.Main.getNamingInstance(Main.java:301)
at org.jnp.server.Main.initJnpInvoker(Main.java:354)
at org.jnp.server.Main.start(Main.java:316)
at org.jnp.server.Main.main(Main.java:104)
I'm hoping to make this work, but I would also be open to other lightweight standalone JNDI providers. All of this is to make ActiveMQ work, and if somebody can suggest another lightweight JMS provider that works well outside of the vm the clients are in without a full blown app server that would work too.
[1]: http://www.javaworld.com/javaworld/jw-04-2002/jw-0419-jndi.html | 0 | [
2,
487,
9805,
366,
21,
487,
135,
2851,
12147,
13,
5,
1410,
487,
8157,
60,
6,
800,
3726,
3726,
31,
376,
20,
485,
21,
487,
9805,
11747,
366,
14,
8860,
16,
21,
487,
135,
2851,
12147,
9,
31,
22,
195,
794,
20,
1740,
14,
7876,
19,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Is there a limit to how much a website should track the actions of a visitor and/or user to that website?
===
Once a user starts a session (or logs in, for a registered user, to associate over multiple sessions), their specific page views are followed. The data can then be used in a number of ways from targeted advertisements to email updates to often-visited sections of the site.
Would this be wrong, as long as this was noted in the Privacy Policy and such? | 0 | [
2,
25,
80,
21,
4496,
20,
184,
212,
21,
2271,
378,
792,
14,
3078,
16,
21,
10875,
17,
118,
248,
4155,
20,
30,
2271,
60,
800,
3726,
3726,
382,
21,
4155,
3244,
21,
3723,
13,
5,
248,
18893,
19,
15,
26,
21,
3801,
4155,
15,
20,
416... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 shouldn't I use Obective C 2.0 accessors in init/dealloc?
===
In [@mmalc's][1] [response][2] to [this question][3] he states that "In general you should *not* use accessor methods in dealloc (or init)." Why does mmalc say this?
The only really reasons I can think of are performance and avoiding unknown side-effects of @dynamic setters.
Discussion?
[1]: http://stackoverflow.com/users/23233/mmalc
[2]: http://stackoverflow.com/questions/155964/what-are-best-practices-that-you-use-when-writing-objective-c-and-cocoa#156288
[3]: http://stackoverflow.com/questions/155964/what-are-best-practices-that-you-use-when-writing-objective-c-and-cocoa | 0 | [
2,
483,
5714,
22,
38,
31,
275,
14222,
150,
6142,
272,
172,
9,
387,
1381,
248,
18,
19,
19,
242,
118,
546,
192,
10799,
60,
800,
3726,
3726,
19,
636,
1,
11651,
6109,
22,
18,
500,
2558,
165,
500,
636,
99,
18,
8782,
870,
500,
2558,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 somewhere I can search for available webservices?
===
I'm wondering if there is a website that collects (and hopefully updates) information on available web services. | 0 | [
2,
25,
80,
3493,
31,
92,
2122,
26,
904,
2741,
11449,
18,
60,
800,
3726,
3726,
31,
22,
79,
5712,
100,
80,
25,
21,
2271,
30,
5543,
18,
13,
5,
290,
13416,
16779,
6,
676,
27,
904,
2741,
687,
9,
3,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
Erlang crashing on large sequences
===
I hate to ask noob questions but my google-fu is completely failing me.
I have just started learning Erlang and am trying out some Project Euler problems to get started. However, I seem to be able to do any operations on large sequences without crashing the erlang shell.
Ie.,even this:
list:seq(1,64000000).
crashes erlang, with the error:
eheap_alloc: Cannot allocate 467078560 bytes of memory (of type "heap").
Actually # of bytes varies of course.
Now half a gig is a lot of memory, but a system with 4 gigs of RAM and plenty of space for virtual memory should be able to handle it.
Is there a way to let erlang use more memory?
| 0 | [
2,
13,
106,
9949,
14604,
27,
370,
11173,
800,
3726,
3726,
31,
3223,
20,
1349,
90,
4995,
2346,
47,
51,
8144,
8,
4096,
25,
1524,
7250,
55,
9,
31,
57,
114,
373,
2477,
13,
106,
9949,
17,
589,
749,
70,
109,
669,
28027,
1716,
20,
16... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How do I make git-svn use a particular svn branch as the remote repository
===
A word of warning: I'm a n00b to `git` in general. My team uses feature branches in `svn`, and I'd like to use `git-svn` to track my work on a particular feature branch. I've been (roughly) following [Andy Delcambre's post](http://andy.delcambre.com/2008/3/4/git-svn-workflow) to set up my local `git` repo, but those instructions seem to have led `git` to pick the `svn` branch that had changed most recently as the remote repository; the problem is that's not the branch I care about. How do I control which branch `git-svn` uses? Or am I approaching this completely wrong? | 0 | [
2,
184,
107,
31,
233,
13,
10404,
8,
18,
16578,
275,
21,
1498,
13,
18,
16578,
1686,
28,
14,
5388,
24869,
800,
3726,
3726,
21,
833,
16,
3590,
45,
31,
22,
79,
21,
13,
103,
2032,
220,
20,
13,
1,
10404,
1,
19,
297,
9,
51,
173,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Proper way to connect ODBC data source with Delphi 2006+ ?
===
What's proper way to connect ODBC datasources and execute some SQL statements?
TQuery and other BDE components can do it, but if I understood correctly they are now deprecated? | 0 | [
2,
4119,
161,
20,
6379,
12340,
7229,
1054,
1267,
29,
23030,
592,
2430,
13,
60,
800,
3726,
3726,
98,
22,
18,
4119,
161,
20,
6379,
12340,
7229,
1054,
12097,
18,
17,
15644,
109,
4444,
255,
9015,
60,
13,
38,
8190,
93,
17,
89,
334,
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... |
Weird positioning behaviour using ASP.Net, CSS, VS 2008, in IE7
===
I am working on a webpage in ASP.Net/C# that uses absolute positioning for a textbox, for several in fact. It was working just fine, until I added some more text boxes. That is, the existing text boxes still positioned correctly, but the new ones did not, despite the fact that I created new styles in the CSS for them just like the others. An exampe is below:
.pieceBox
{
position: absolute;
top: 425px;
left: 133px;
background-color: White;
color: Black;
width: 132px;
font-weight: bold;
text-align: center;
}
Identical styles in the same CSS file (with different names of course) both above and below this one work fine. I have checked, double-checked, and triple-checked the name of the style in the CssClass attribute of the <asp:TextBox> and it is correct. However, no matter what I do, including giving it a new name, copying the old entries, and renaming them, etc., these three new text boxes position themselves at the top of the page, whereas the others show in their correct absolute positions. I looked at the aspx source page and made sure they are not in some other DIV, etc. I am at my wits end with it. I did come up with a workaround for now, but it is not how I want to leave it (involves programmatically creating some HTML inside an Asp:Literal.)
I checked the resulting source (via IE's viewsource) and the class is set correctly in the resulting HTML.
One more thing in case this matters; this website project was originally created in VS 2005 and converted to VS 2008 format. Not that it should matter, but thought I would mention it.
Has anyone else experienced this type of behavior? | 0 | [
2,
5455,
649,
68,
7727,
568,
28,
306,
9,
2328,
15,
272,
18,
18,
15,
4611,
570,
15,
19,
13,
660,
465,
800,
3726,
3726,
31,
589,
638,
27,
21,
2741,
6486,
19,
28,
306,
9,
2328,
118,
150,
5910,
30,
2027,
7070,
649,
68,
26,
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... |
MSDTC and Oracle issue
===
I’m running into problems using MSDTC and Oracle. It’s a .net application and I’m using the TransactionScope class to control the transactions.
The problem is that, sometimes, if the transaction is rolled back (scope.Dispose is called without having called scope.Complete), it stays in “Aborting” state for a long time, not releasing the locked records. Even though the transactions stays in “Aborting” state, when Dispose is called to abort the transaction, it returns immediately, so the thread doesn’t get stuck.
Does anyone know what could cause the transaction to behave like this and keep the locks after abort has been called?
Thanks
| 0 | [
2,
4235,
43,
6668,
17,
15759,
1513,
800,
3726,
3726,
31,
1,
79,
946,
77,
1716,
568,
4235,
43,
6668,
17,
15759,
9,
32,
1,
18,
21,
13,
9,
2328,
3010,
17,
31,
1,
79,
568,
14,
12799,
11555,
718,
20,
569,
14,
13147,
9,
14,
1448,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Need to register domain names programmatically
===
Any domain name registrars out there that support domain name registration using a web service or a similar functionality without them telling you to become a reseller?
I don't register that many domain names and I am not interested in paying reseller fees.
If I can become a reseller without paying upfront fees, that would be fine. | 0 | [
2,
376,
20,
2243,
4603,
1817,
625,
6732,
1326,
800,
3726,
3726,
186,
4603,
204,
25393,
18,
70,
80,
30,
555,
4603,
204,
8587,
568,
21,
2741,
365,
54,
21,
835,
18548,
366,
105,
2497,
42,
20,
533,
21,
10719,
8461,
60,
31,
221,
22,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
ZeroConf extension that can be used in Firefox/XULRunner?
===
Is there a [ZeroConf][1] client extension for Firefox/XULRunner to be used in a zeroConf environment based on either [mDNS][2] or [SLP][3]?
I know of an extension already that's being developed by the [ActiveState Open Komodo][4] folks but it requires PyXPCOM support to be baked into the XULRunner runtime in order to access the Apple [Bonjour][5] libs for Windows. Is there anything else available?
[1]: http://en.wikipedia.org/wiki/ZeroConf
[2]: http://files.multicastdns.org/draft-cheshire-dnsext-multicastdns.txt
[3]: http://en.wikipedia.org/wiki/Service_Location_Protocol
[4]: http://svn.openkomodo.com/openkomodo/browse/addons/sdconnector/
[5]: http://developer.apple.com/networking/bonjour/download/ | 0 | [
2,
4606,
14093,
3896,
30,
92,
44,
147,
19,
535,
18219,
118,
396,
1287,
12993,
60,
800,
3726,
3726,
25,
80,
21,
636,
15938,
14093,
500,
2558,
165,
500,
6819,
3896,
26,
535,
18219,
118,
396,
1287,
12993,
20,
44,
147,
19,
21,
4606,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Non-trivial data binding
===
Trivial data binding examples are just that, trivial. I want to do something a little more complicated and am wondering if there's an easy, built in way to handle it.
public partial class Form1 : Form
{
public Form1()
{
InitializeComponent();
List<DataStruct> list = new List<DataStruct>()
{
new DataStruct(){Name = "Name 1", Value = "Value 1", ComplexValue = new ComplexValue(){Part1 = "1:P1", Part2 = "1:P2"}},
new DataStruct(){Name = "Name 2", Value = "Value 2", ComplexValue = new ComplexValue(){Part1 = "2:P1", Part2 = "2:P2"}}
};
listBox1.DataSource = list;
listBox1.DisplayMember = "ComplexValue.Part1";
}
}
public class DataStruct
{
public string Name { get; set; }
public string Value { get; set; }
public ComplexValue ComplexValue { get; set; }
}
public class ComplexValue
{
public string Part1 { get; set; }
public string Part2 { get; set; }
}
Is there an easy way to get the value of the Part1 property to be set as the display member for a list of DataStruct items? Above I tried something that I thought made sense, but it just defaults back to the ToString() on DataStruct. I can work around it if necessary, I was just wondering if there was something built into the data binding that would handle more complex data binding like above. | 0 | [
2,
538,
8,
19712,
1054,
8728,
800,
3726,
3726,
13,
19712,
1054,
8728,
3770,
50,
114,
30,
15,
13,
19712,
9,
31,
259,
20,
107,
301,
21,
265,
91,
8343,
17,
589,
5712,
100,
80,
22,
18,
40,
2010,
15,
392,
19,
161,
20,
3053,
32,
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... |
SVN checkout filtered by file extension?
===
I have a home-grown automated build script in the form of a DOS batch file. In part of that script, I check out (with "svn checkout") a section of our SVN repository that includes a bunch of third-party stuff that's used in our projects. This batch file performed pretty well for a long time, but now people have checked in lots of fluff (docs, sample code, etc.) into the third-party area and the checkout part of this script has gotten lots slower. I'd like to mitigate this by checking out only the stuff we need -- mostly dll files in our case. So, my question is this: what's the best way to check out an SVN repository filtered by file extension?
I didn't see any obvious way to do this in the svn help. I have a .NET utility library that wraps svn.exe in some ways, and I was thinking of extending this to retrieve only content that matched my extensions of interest. But I'd prefer to use an easier or existing method if one exists.
| 0 | [
2,
13,
18,
16578,
2631,
1320,
25090,
34,
3893,
3896,
60,
800,
3726,
3726,
31,
57,
21,
213,
8,
16347,
14904,
1895,
3884,
19,
14,
505,
16,
21,
107,
18,
13064,
3893,
9,
19,
141,
16,
30,
3884,
15,
31,
2631,
70,
13,
5,
1410,
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... |
#warning directive in VB.net
===
I know the #warning directive does not exist in vb.net... is there anything like it?
I want to be able to throw messages (warnings) at compiler time. | 0 | [
2,
6926,
1885,
2981,
15626,
19,
13,
20468,
9,
2328,
800,
3726,
3726,
31,
143,
14,
6926,
1885,
2981,
15626,
630,
52,
3182,
19,
13,
20468,
9,
2328,
9,
9,
9,
25,
80,
602,
101,
32,
60,
31,
259,
20,
44,
777,
20,
3814,
7561,
13,
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,
0,
0,
0,
0,
0,
0,
0,
0... |
SVN checkout ignore folder
===
Can I ignore a folder on svn checkout? I need to ignore DOCs folder on checkout at my build server. | 0 | [
2,
13,
18,
16578,
2631,
1320,
7174,
19294,
800,
3726,
3726,
92,
31,
7174,
21,
19294,
27,
13,
18,
16578,
2631,
1320,
60,
31,
376,
20,
7174,
9765,
18,
19294,
27,
2631,
1320,
35,
51,
1895,
8128,
9,
3,
0,
0,
0,
0,
0,
0,
0,
0,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
Can you freeze a C/C++ process and continue it on a different host?
===
I was wondering if it is possible to generate a "core" file, copy if to another machine and then continue execution of the a core file on that machine?
I have seen the gcore utility that will make a core file from a running process. But I do not think gdb can continue execution based on a core file.
Is there any way to just dump the heap/stack and and restore those at a later point?
| 0 | [
2,
92,
42,
11551,
21,
272,
118,
150,
20512,
953,
17,
1816,
32,
27,
21,
421,
2015,
60,
800,
3726,
3726,
31,
23,
5712,
100,
32,
25,
938,
20,
7920,
21,
13,
7,
10375,
7,
3893,
15,
4344,
100,
20,
226,
1940,
17,
94,
1816,
5769,
16... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How can you get the terminal service client machine name from javascript?
===
Is it possible to get the machine name, or IP, or MAC address (basically client network information) from javascript running Internet Explorer?
I found the following code that seems to accomplish this:
function Button1_onclick() {
var locator = new ActiveXObject("WbemScripting.SWbemLocator");
var service = locator.ConnectServer(".");
var properties = service.ExecQuery("SELECT * FROM Win32_NetworkAdapterConfiguration");
var e = new Enumerator (properties);
document.write("<table border=1>");
dispHeading();
for (;!e.atEnd();e.moveNext ())
{
var p = e.item ();
document.write("<tr>");
document.write("<td>" + p.Caption + "</td>");
document.write("<td>" + p.IPFilterSecurityEnabled + "</td>");
document.write("<td>" + p.IPPortSecurityEnabled + "</td>");
document.write("<td>" + p.IPXAddress + "</td>");
document.write("<td>" + p.IPXEnabled + "</td>");
document.write("<td>" + p.IPXNetworkNumber + "</td>");
document.write("<td>" + p.MACAddress + "</td>");
document.write("<td>" + p.WINSPrimaryServer + "</td>");
document.write("<td>" + p.WINSSecondaryServer + "</td>");
document.write("</tr>");
}
document.write("</table>");
}
So it's using an ActiveX Object that seems to be installed with the OS to accomplish this. Is something similar like this possible to do from a terminal service session? To get the terminal service client network information? (Not the terminal server network information which is what the above code would do when run from a terminal service session).
I'm thinking maybe there is another Active X object available to accomplish this? | 0 | [
2,
184,
92,
42,
164,
14,
3855,
365,
6819,
1940,
204,
37,
8247,
8741,
60,
800,
3726,
3726,
25,
32,
938,
20,
164,
14,
1940,
204,
15,
54,
15735,
15,
54,
1572,
3218,
13,
5,
6093,
8438,
6819,
982,
676,
6,
37,
8247,
8741,
946,
2620,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 save a PDF file Using NHibernate and SQL Server 2005
===
I'm developing a webapp where the user is given the chance to upload his resume in pdf format. I'm using NHibernate as a data mapper and MS SQL SERVER 2005.
I want to be able to save the .pdf file to a given table... any ideas?
Thank you very much! | 0 | [
2,
184,
20,
2079,
21,
13,
11124,
3893,
568,
12109,
15191,
8820,
17,
4444,
255,
8128,
812,
800,
3726,
3726,
31,
22,
79,
3561,
21,
2741,
7753,
113,
14,
4155,
25,
504,
14,
1504,
20,
71,
8294,
33,
13113,
19,
13,
11124,
2595,
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... |
Set Windows process (or user) memory limit
===
Is there any way to set a system wide memory limit a process can use in Windows XP? I have a couple of unstable apps which do work ok for most of the time but can hit a bug which results in eating whole memory in a matter of seconds (or at least I suppose that's it). This results in a hard reset as Windows becomes totally unresponsive and I loose my work.
I would like to be able to do something like the /etc/limits on Linux - setting M90, for instance (to set 90% max memory for a single user to allocate). So the system gets the remaining 10% no matter what. | 0 | [
2,
309,
1936,
953,
13,
5,
248,
4155,
6,
1912,
4496,
800,
3726,
3726,
25,
80,
186,
161,
20,
309,
21,
329,
1051,
1912,
4496,
21,
953,
92,
275,
19,
1936,
23045,
60,
31,
57,
21,
1335,
16,
16571,
4865,
18,
56,
107,
170,
5854,
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... |
How do I stop Visual Studio from resizing my controls?
===
Visual Studio 2008 SP1 (although IIRC, the behavior was present in 2005 as well) keeps resizing a couple of grid controls (Janus.GridEx to be precise) I use.
I can resize them back to normal, save, and compile just fine. When it does compile, these two controls will expand to ridiculous values. | 0 | [
2,
184,
107,
31,
747,
3458,
1120,
37,
10719,
3335,
51,
8671,
60,
800,
3726,
3726,
3458,
1120,
570,
3782,
165,
13,
5,
8655,
595,
5453,
15,
14,
3257,
23,
734,
19,
812,
28,
134,
6,
8968,
10719,
3335,
21,
1335,
16,
7354,
8671,
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... |
.hide(), .show(), tables, and IE
===
I have some nested tables that I want to hide/show upon a click on one of the top-level rows.
The markup is, in a nutshell, this:
<pre>
<table>
<tr>
<td>stuff</td>
.... more tds here
</tr>
<tr>
<td colspan=some_number>
<table>
</table>
</td>
</tr>
</table>
</pre>
Now, I'm using some jQuery to target a link in the first table row. When that link is clicked, it pulls some data down, formats it as a bunch of table rows, and appends it to the table inside. Then it applies the .show() to the table. (this is all done via id/class targeting. I left them out of the sample for brevity).
This works beautifully in firefox. Click the link, data gets loaded, main table "expands" with the secondary table all nice and filled in.
Problem is -- Internet Explorer is giving me the finger. As best as I can tell, the data is getting appended to the inner table. The problem is that the .show() does not appear to be doing anything useful. To make matters more annoying, I've got a page that has this functionality that is working splendidly in both -- the only difference being two things:
In the one that is working, the inner table is wrapped in a div. I've even tried wrapping my table in this example in a div without success.
In the one that is not working, I have an extra jQuery plugin loaded -- but I've removed this plugin and tried the page without it and it still fails to show the inner table.
I've tried attaching the .show to the parent tr, parent td, and the table itself with no success. I must be missing something incredibly simple, because as near as I can tell this should work.
Has anyone come across something like this before? | 0 | [
2,
13,
9,
19522,
5,
6,
15,
13,
9,
9303,
5,
6,
15,
7484,
15,
17,
13,
660,
800,
3726,
3726,
31,
57,
109,
5618,
69,
7484,
30,
31,
259,
20,
3077,
118,
9303,
685,
21,
10840,
27,
53,
16,
14,
371,
8,
3906,
11295,
9,
14,
943,
57... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Performance of large EAV/open schema systems on SQL Server
===
Has anyone implemented a very large EAV or open schema style database in SQL Server? I'm wondering if there are performance issues with this and how you were able to overcome those obstacles. | 0 | [
2,
956,
16,
370,
13,
62,
5214,
118,
10157,
23874,
1242,
27,
4444,
255,
8128,
800,
3726,
3726,
63,
1276,
6807,
21,
253,
370,
13,
62,
5214,
54,
368,
23874,
1034,
6018,
19,
4444,
255,
8128,
60,
31,
22,
79,
5712,
100,
80,
50,
956,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0... |
Wait cursor over entire html page
===
Is it possible to set the cursor to 'wait' on the entire html page in a simple way? The idea is to show the user that something is going on while an ajax call is being completed. The code below shows a simplified version of what I tried and also demonstrate the problems I run into:
1. if an element (#id1) has a cursor style set it will ignore the one set on body (obviously)
2. some elements have a default cursor style (a) and will not show the wait cursor on hover
3. the body element has a certain height depending on the content and if the page is short, the cursor will not show below the footer
The test:
<html>
<head>
<style type="text/css">
#id1 {
background-color: #06f;
cursor: pointer;
}
#id2 {
background-color: #f60;
}
</style>
</head>
<body>
<div id="id1">cursor: pointer</div>
<div id="id2">no cursor</div>
<a href="#" onclick="document.body.style.cursor = 'wait'; return false">Do something</a>
</body>
</html>
| 0 | [
2,
1760,
29588,
84,
1078,
13,
15895,
2478,
800,
3726,
3726,
25,
32,
938,
20,
309,
14,
29588,
20,
13,
22,
8195,
22,
27,
14,
1078,
13,
15895,
2478,
19,
21,
1935,
161,
60,
14,
882,
25,
20,
298,
14,
4155,
30,
301,
25,
228,
27,
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... |
Software to Administrate Network Connections
===
I need a software to admin my networks connections, I go to diferents clients with my notebook and I have to manually change my settings. Best software to do this? Windows and Mac, I use a MacBook with Vmware Fusion.
| 0 | [
2,
2306,
20,
27932,
591,
982,
6760,
800,
3726,
3726,
31,
376,
21,
2306,
20,
21,
43,
2160,
51,
5540,
6760,
15,
31,
162,
20,
926,
2407,
2291,
18,
7421,
29,
51,
14630,
17,
31,
57,
20,
23671,
753,
51,
12410,
9,
246,
2306,
20,
107,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
XML Parsing - SAX vs. DOM. vs. ElementTree
===
Python has several ways to parse XML...
I understand the very basics of parsing with SAX. It functions as a stream parser, with an event-driven API.
I understand the DOM parser also. It reads the XML into memory and coverts it to objects that can be accessed with Python.
Generally speaking, it was easy to choose between the 2 depending on what you needed to do, memory constraints, performance, etc.
(hopefully I'm correct so far).
since Python 2.5, we also have ElementTree. How does this compare to DOM and SAX? Which is it more like? Why is it better than the previous parsers?
| 0 | [
2,
23504,
2017,
18,
68,
13,
8,
16070,
4611,
9,
11859,
9,
4611,
9,
4520,
8101,
800,
3726,
3726,
20059,
63,
238,
2847,
20,
2017,
870,
23504,
9,
9,
9,
31,
1369,
14,
253,
2125,
18,
16,
2017,
18,
68,
29,
16070,
9,
32,
3719,
28,
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... |
Best way to replace a whole directory tree in Subversion?
===
Within my Subversion project I have a few directories that contain other open source projects that my code needs. For example ffmpeg, freetype, matrixssl and a few others.
What is the best way to update SVN to hold the the latest version of one of these projects?
Essentially I will be doing the following (using ffmpeg as an example):
1) Rename current ffmpeg folder to ffmpeg.old
2) Download new version of ffmpeg from net
3) Make sure it and my code compile and work fine together
4) Update subversion to now hold the "new" version of ffmpeg
5) Delete ffmpeg.old directory tree
| 0 | [
2,
246,
161,
20,
3934,
21,
979,
16755,
1541,
19,
972,
10898,
60,
800,
3726,
3726,
363,
51,
972,
10898,
669,
31,
57,
21,
310,
559,
1596,
30,
3717,
89,
368,
1267,
2314,
30,
51,
1797,
2274,
9,
26,
823,
13,
2460,
79,
20427,
15,
55... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Generating a globally unique identifier in Java
===
**Summary:** I'm developing a persistent Java web application, and I need to make sure that all resources I persist have globally unique identifiers to prevent duplicates.
**The Fine Print:**
1. I'm not using an RDBMS, so I don't have any fancy sequence generators (such as the one provided by Oracle)
2. I'd like it to be fast, preferably all in memory - I'd rather not have to open up a file and increment some value
3. It needs to be thread safe (I'm anticipating that only one JVM at a time will need to generate IDs)
4. There needs to be consistency across instantiations of the JVM. If the server shuts down and starts up, the ID generator shouldn't re-generate the same IDs it generated in previous instantiations (or at least the chance has to be really, really slim - I anticipate many millions of presisted resources)
5. I have seen the examples in the <a href="http://java.sys-con.com/node/36169>EJB unique ID pattern</a> article. They won't work for me (I'd rather not rely solely on System.currentTimeMillis() because we'll be persisting multiple resources per millisecond).
6. I have looked at the answers proposed in <a href="http://stackoverflow.com/questions/41107/how-to-generate-a-random-alpha-numeric-string-in-java">this question</a>. My concern about them is, what is the chance that I will get a duplicate ID over time? I'm intrigued by the suggestion to use <a href="http://java.sun.com/j2se/1.5.0/docs/api/java/util/UUID.html">java.util.UUID</a>, but again, the chances of a duplicate need to be infinitesimally small.
7. I'm using JDK6
| 0 | [
2,
13500,
21,
18861,
2619,
25570,
19,
8247,
800,
3726,
3726,
13,
1409,
18,
723,
17396,
45,
1409,
31,
22,
79,
3561,
21,
15348,
8247,
2741,
3010,
15,
17,
31,
376,
20,
233,
562,
30,
65,
2566,
31,
22084,
57,
18861,
2619,
25570,
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... |
Best software for showing SQL Server Database Structure
===
I have a MSSQL2005 DB with about 140 tables. I want to create either an accessible diagram or a printable API type document with the table structure. Is there a program that offers this kind of db visualization?
I find the diagramming built into SQL Server to be very clunky and very inaccessible for my DB size. | 0 | [
2,
246,
2306,
26,
3187,
4444,
255,
8128,
6018,
1411,
800,
3726,
3726,
31,
57,
21,
4235,
18,
22402,
2835,
13,
9007,
29,
88,
10008,
7484,
9,
31,
259,
20,
1600,
694,
40,
7342,
14161,
54,
21,
4793,
579,
21,
2159,
1001,
4492,
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... |
SQL distinct for 2 fields in a database
===
Can you get the distinct combination of 2 different fields in a database table? if so, can you provide the SQL example. | 0 | [
2,
4444,
255,
4421,
26,
172,
2861,
19,
21,
6018,
800,
3726,
3726,
92,
42,
164,
14,
4421,
3733,
16,
172,
421,
2861,
19,
21,
6018,
859,
60,
100,
86,
15,
92,
42,
1181,
14,
4444,
255,
823,
9,
3,
0,
0,
0,
0,
0,
0,
0,
0,
0,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
How to programmatically update the Outlook contact name resolution order
===
When in Outlook 2003, open the Address Book, select Tools->Options. You get the [Address dialog][1] showing the option "When sending mail, check names using these address lists in the following order:"
For most people, this will contain only "Contacts". For corporate networks, it'll probably also contain "Global Address List". The problem is that in my company the GAL is many tens of thousands large, and it's common that conflicts occur in name resolution when attempting to send email and it goes to the wrong person in another country.
Instead, I would like to place a separate Exchange address list "X" at the top of that list, to first resolve against names in our own company before checking the GAL. Then, resolve against "Contacts", then GAL. This configuration would need to be deployed to many hundreds of PCs.
I've been able to do this on my own PC by hacking registry key:
`HKCU\Software\Microsoft\Windows NT\CurrentVersion\Windows Messaging Subsystem\Profiles\your_profile_name\9207f3e0a3b11019908b08002b2a56c2`, Value `11023d05`.
This contains a REG_BINARY data structure that lists the IDs of the items of this list. I can reorder them to my liking and Outlook accepts it.
The IDs of the GAL and "X" address list are static. However, the problem is that the "Contacts" ID is apparently not static, perhaps unique to the user and/or computer. Its value appears to be undiscoverable in the registry. This prevents me from simply copying this registry value to all PCs.
Has anyone been able to progammatically reorder the contact name resolution list?
[1]: http://uwex.uwc.edu/outlook/tips/images/addressing.jpg | 0 | [
2,
184,
20,
625,
6732,
1326,
11100,
14,
19837,
2203,
204,
4302,
389,
800,
3726,
3726,
76,
19,
19837,
973,
15,
368,
14,
3218,
360,
15,
5407,
4672,
8,
1,
25458,
4710,
9,
42,
164,
14,
636,
27950,
28223,
500,
2558,
165,
500,
3187,
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... |
Storing PCRE compiled regexes in C/C++
===
Is there an efficient way to store the compiled regexes (compiled via regcomp(), PCRE) in a binary file, so that later I can just read from the file and call regexec()?
Or is it just a matter of dumping the compiled regex_t structs to the file and reading them back when needed? | 0 | [
2,
25615,
5168,
99,
9316,
7953,
1706,
160,
19,
272,
118,
150,
20512,
800,
3726,
3726,
25,
80,
40,
8243,
161,
20,
1718,
14,
9316,
7953,
1706,
160,
13,
5,
11103,
49,
1294,
1197,
7953,
11103,
5,
6,
15,
5168,
99,
6,
19,
21,
14171,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 way to output an asp.net, C# GridView into a PDF.
===
I tried using the Microsoft ReportingControls but found them overly cumbersome, with too little documentation. I'd like a simple control that would convert a GridView control into a PDF document. I've started looking into PDFSHarp and am running into dead ends with documentation. Same thing with iTextSharp. I'm willing to dig into them further if they have worked for others in the past.
| 0 | [
2,
98,
25,
21,
254,
161,
20,
5196,
40,
28,
306,
9,
2328,
15,
272,
5910,
7354,
4725,
77,
21,
13,
11124,
9,
800,
3726,
3726,
31,
794,
568,
14,
7099,
6670,
12898,
18,
47,
216,
105,
18234,
10611,
2102,
3220,
15,
29,
266,
265,
1394... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
What's the best way to validate a user-entered URL in a Cocoa application?
===
I am trying to build a homebrew web brower to get more proficient at Cocoa. I need a good way to validate whether the user has entered a valid URL. I have tried some regular expressions but NSString has some interesting quirks and doesn't like some of the back-quoting that most regular expressions I've seen use. | 0 | [
2,
98,
22,
18,
14,
246,
161,
20,
7394,
1373,
21,
4155,
8,
23753,
287,
6362,
19,
21,
24507,
3010,
60,
800,
3726,
3726,
31,
589,
749,
20,
1895,
21,
213,
13712,
2741,
7246,
106,
20,
164,
91,
28140,
35,
24507,
9,
31,
376,
21,
254,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Pushing pixels on the iPhone
===
What's the fastest way to get a framebuffer and render to in software on the iPhone?
Basically getting into a mode 13h style thing going so I can make some effects? :) | 0 | [
2,
5076,
18146,
18,
27,
14,
21024,
800,
3726,
3726,
98,
22,
18,
14,
7518,
161,
20,
164,
21,
3523,
2345,
6866,
17,
16535,
20,
19,
2306,
27,
14,
21024,
60,
11374,
1017,
77,
21,
3740,
539,
252,
1034,
584,
228,
86,
31,
92,
233,
10... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
Efficiently querying one string against multiple regexes.
===
Lets say that I have 10,000 regexes and one string and I want to find out if the string matches any of them and get all the matches.
The trivial way to do it would be to just query the string one by one against all regexes. Is there a faster,more efficient way to do it? | 0 | [
2,
20519,
25597,
68,
53,
3724,
149,
1886,
7953,
1706,
160,
9,
800,
3726,
3726,
6884,
395,
30,
31,
57,
6693,
7953,
1706,
160,
17,
53,
3724,
17,
31,
259,
20,
477,
70,
100,
14,
3724,
1717,
186,
16,
105,
17,
164,
65,
14,
1717,
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... |
TListBox Drag and Drop problems with MultiSelect enabled
===
I have a TListBox with multiselect and ExtendedSelect both set to true. I need to be able to drag multiple items in the list box to re-arrange them. My problem is what happens when the user clicks on an item that is already selected without holding down the CTRL or SHIFT key.
Case 1: DragMode is set to dmManual
The selection is cleared before the mouse down. This will not allow multiple items to be dragged.
Case 2: DragMode is set to dmAutomatic
The MouseDown event never fires. The selection is not cleared so dragging is OK, but the user cannot clear the selection by clicking on one of the selected items. This really causes a problem if all the items are selected or the next item the user wants to select was part of the current selection.
Note that this problem only happens if you assign something to the DragObject in the OnStartDrag procedure. I think the problem would go away if OnStartDrag would only start after the user moves the mouse. I have Mouse.DragImmediate := false set but I still get the StartDrag fired as soon as I click on an item in the list box.
I am using Delphi 7 for this project but I see the same behavior in Delphi 2007. | 0 | [
2,
13,
38,
5739,
5309,
5501,
17,
2804,
1716,
29,
1889,
18,
16964,
9338,
800,
3726,
3726,
31,
57,
21,
13,
38,
5739,
5309,
29,
1889,
18,
16964,
17,
1984,
18,
16964,
156,
309,
20,
1151,
9,
31,
376,
20,
44,
777,
20,
5501,
1886,
37... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 simplify (reduce number of points) in KML?
===
I have a similar problem to [this post](http://stackoverflow.com/questions/174535/google-maps-overlays). I need to display up to 1000 polygons on an embedded Google map. The polygons are in a SQL database, and I can render each one as a single KML file on the fly using a custom HttpHandler (in ASP.NET), like this [http://alpha.foresttransparency.org/concession.1.kml](http://alpha.foresttransparency.org/concession.1.kml) .
Even on my (very fast) development machine, it takes a while to load up even a couple dozen shapes. So two questions, really:
1. What would be a good strategy for rendering these as markers instead of overlays once I'm beyond a certain zoom level?
2. Is there a publicly available algorithm for simplifying a polygon (reducing the number of points) so that I'm not showing more points than make sense at a certain zoom level?
| 0 | [
2,
184,
20,
28257,
13,
5,
99,
16041,
234,
16,
819,
6,
19,
401,
255,
60,
800,
3726,
3726,
31,
57,
21,
835,
1448,
20,
636,
1565,
678,
500,
5,
21127,
6903,
25325,
2549,
9990,
9,
960,
118,
24652,
18,
118,
13917,
4022,
10551,
16111,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Boiler plate code replacement - is there anything bad about this code?
===
I've recently created these two (unrelated) methods to replace lots of boiler-plate code in my winforms application. As far as I can tell, they work ok, but I need some reassurance/advice on whether there are some problems I might be missing.
(from memory)
static class SafeInvoker
{
//Utility to avoid boiler-plate InvokeRequired code
//Usage: SafeInvoker.Invoke(myCtrl, () => myCtrl.Enabled = false);
public static void Invoke(Control ctrl, Action cmd)
{
if (ctrl.InvokeRequired)
ctrl.Invoke(new MethodInvoker(cmd));
else
cmd();
}
//Replaces OnMyEventRaised boiler-plate code
//Usage: SafeInvoker.RaiseEvent(this, MyEventRaised)
public static void RaiseEvent(object sender, EventHandler evnt)
{
var handler = evnt;
if (handler != null)
handler(sender, EventArgs.Empty);
}
} | 0 | [
2,
11755,
3407,
1797,
4610,
13,
8,
25,
80,
602,
896,
88,
48,
1797,
60,
800,
3726,
3726,
31,
22,
195,
1989,
679,
158,
81,
13,
5,
1020,
6203,
6,
3195,
20,
3934,
7503,
16,
11755,
8,
13095,
1797,
19,
51,
628,
4190,
18,
3010,
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... |
Java Setting tab size in table cell renderer
===
I have a class which extends DefaultTableCellRenderer, which renders strings in a monospace font, with a particular color. By default, it appears that tabs are not rendered at all (0 spaces). How can I set the tab size and/or cause them to be rendered? | 0 | [
2,
8247,
2697,
6523,
1072,
19,
859,
1667,
16535,
106,
800,
3726,
3726,
31,
57,
21,
718,
56,
9073,
12838,
5924,
9725,
99,
16706,
106,
15,
56,
16535,
18,
7887,
19,
21,
4129,
5582,
9978,
15,
29,
21,
1498,
1665,
9,
34,
12838,
15,
32... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
QuickTime video codec configuration
===
So I'm porting an app from Windows to Mac, and part of the app deals with creating movie files. On Windows, there's a group of functions like ICOpen and ICConfigure, which signify to the video compression driver to open up a configuration box for the selected codec. Is there anything like that for QuickTime on Mac? | 0 | [
2,
2231,
891,
763,
1797,
150,
8091,
800,
3726,
3726,
86,
31,
22,
79,
1295,
68,
40,
4865,
37,
1936,
20,
1572,
15,
17,
141,
16,
14,
4865,
10342,
29,
2936,
1308,
6488,
9,
27,
1936,
15,
80,
22,
18,
21,
214,
16,
3719,
101,
13,
59... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Binary Database Aligned or Packed
===
Is there a way to see, via hex editor or otherwise, if data in a binary file is aligned or packed, specifically for an HPUX system? | 0 | [
2,
14171,
6018,
13,
12740,
54,
9402,
800,
3726,
3726,
25,
80,
21,
161,
20,
196,
15,
1197,
24,
396,
1835,
54,
3190,
15,
100,
1054,
19,
21,
14171,
3893,
25,
13,
12740,
54,
9402,
15,
3524,
26,
40,
5301,
7147,
329,
60,
3,
0,
0,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
.NET webservice using an instance of a parameter type?
===
I have a Windows forms project and a Web Service project in my solution, and I'm trying to call the web service and return a customer object as the result. The problem is that when I try to receive the return object, I get an error that it can't convert it. For example, here is the signature for my webservice:
Public Function GetDriverByID(ByVal DriverID As Integer) As Driver
And here is the code I'm using to call it:
Dim d As Driver = mywebserviceinstance.GetDriverByID(1)
But I receive this compile-time error (wsDrivers is the name of the web reference I've added to my form project): "Value of type ProjectNamespace.Common.wsDrivers.Driver cannot be converted to ProjectNamespace.Common.Driver"
This "Common" namespace contains the Driver class, and I'm not sure why the return class from the web service isn't just a generic "Driver", but is instead a "wsDrivers.Driver", and I can't convert it back. Anybody know how I can deal with this type mismatch?
| 0 | [
2,
13,
9,
2328,
2741,
11449,
568,
40,
4851,
16,
21,
18906,
1001,
60,
800,
3726,
3726,
31,
57,
21,
1936,
1997,
669,
17,
21,
2741,
365,
669,
19,
51,
4295,
15,
17,
31,
22,
79,
749,
20,
645,
14,
2741,
365,
17,
788,
21,
7705,
309... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 site definitions not showing up in template list -- why?
===
I have some custom SharePoint site definitions that are deployed via SharePoint wsp solution packages. They appear to work fine. I can deploy them fine via the stsadm command line, and my C# code running in some features can also deploy sites based on them. My webtemp.*.xml files appear to be correctly placed in the 12\1033\XML folder when my solutions are deployed. My problem is that they just don't show up in the central admin app when I try to "Create Site Collection." Why not? I don't even know where to look for this. | 0 | [
2,
1891,
3132,
689,
18544,
52,
3187,
71,
19,
22894,
968,
13,
8,
8,
483,
60,
800,
3726,
3726,
31,
57,
109,
5816,
1891,
3132,
689,
18544,
30,
50,
6698,
1197,
1891,
3132,
619,
3401,
4295,
16875,
9,
59,
1893,
20,
170,
1123,
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... |
Capicom 3des: 2 key or 3 key?
===
Much searching and reading has not told me whether the `capicom.encrypteddata` class module (it's VB6, but that shouldn't matter in answering this question) is using 2-key 3DES or 3-key 3DES. (`.Algorithm.Name = CAPICOM_ENCRYPTION_ALGORITHM_3DES`) Anyone know which one it is using? A source of this information would also be helpful. I suspect, since I don't think high enough key lengths are supported, that it is 2DES. But I haven't found acceptable confirmation. | 0 | [
2,
2605,
49,
960,
203,
3196,
45,
172,
1246,
54,
203,
1246,
60,
800,
3726,
3726,
212,
5792,
17,
1876,
63,
52,
470,
55,
1472,
14,
13,
1,
4666,
49,
960,
9,
219,
11435,
69,
18768,
1,
718,
12613,
13,
5,
242,
22,
18,
13,
20468,
37... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Rube Goldberg software design
===
Anybody seen a [Rube Goldberg][1] software design? Basically, complicated design for simple stuffs.
Please share your stories.
[1]: http://www.codinghorror.com/blog/archives/000255.html | 4 | [
2,
7598,
62,
20383,
2306,
704,
800,
3726,
3726,
11181,
541,
21,
636,
1820,
863,
20383,
500,
2558,
165,
500,
2306,
704,
60,
11374,
15,
8343,
704,
26,
1935,
3217,
18,
9,
2247,
1891,
154,
1650,
9,
636,
165,
500,
45,
7775,
6903,
6483,... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
Reverse engineering war stories
===
Sometimes you don't have the source code and need to reverse engineer a program or a black box. Any fun war stories?
Here's one of mine:
Some years ago I needed to rewrite a device driver for which I didn't have source code. The device driver ran on an old CPM microcomputer and drove a dedicated phototypesetting machine through a serial port. (Wow, I'm showing my age here...) Almost no documentation for the phototypesetting machine was available to me.
I finally hacked together a serial port monitor on a DOS PC that mimicked the responses of the phototypesetting machine. I cabled the DOS PC to the CPM machine and started logging the data coming out of the device driver as I feed data in through the CPM machine. This enabled me to figure out the handshaking and encoding used by the device driver and re-create an equivalent one for a DOS machine.
| 4 | [
2,
7006,
1552,
176,
1650,
800,
3726,
3726,
1030,
42,
221,
22,
38,
57,
14,
1267,
1797,
17,
376,
20,
7006,
2335,
21,
625,
54,
21,
319,
1649,
9,
186,
2414,
176,
1650,
60,
235,
22,
18,
53,
16,
1114,
45,
109,
122,
1464,
31,
851,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Constants in Perl Modules
===
If I define a constant in a perl module, how do I use that constant in my main program? (Or how do I call that constant in the main program?) | 0 | [
2,
3587,
18,
19,
416,
255,
17113,
800,
3726,
3726,
100,
31,
9267,
21,
3587,
19,
21,
416,
255,
12613,
15,
184,
107,
31,
275,
30,
3587,
19,
51,
407,
625,
60,
13,
5,
248,
184,
107,
31,
645,
30,
3587,
19,
14,
407,
625,
60,
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,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... |
Set ContentPlaceHolder data through code ASP.NET
===
Is it possible to set the data in a ContentPlaceHolder through code? This is what I am thinking of:
dim oCPH as new ContentPlaceHolder
oCPH.id = "column1" 'this id is the one that corresponds with the ID I set on the page
oCPH.content = "content here" '<-- not real code
Obviously that is not correct syntax, I hope that this clarifies what I am asking | 0 | [
2,
309,
2331,
5119,
12427,
1054,
120,
1797,
28,
306,
9,
2328,
800,
3726,
3726,
25,
32,
938,
20,
309,
14,
1054,
19,
21,
2331,
5119,
12427,
120,
1797,
60,
48,
25,
98,
31,
589,
1440,
16,
45,
5937,
13,
2499,
3971,
28,
78,
2331,
51... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Does PHP have a DEBUG symbol that can be used in code?
===
Languages like C and even C# (which technically doesn't have a preprocessor) allow you to write code like:
#DEFINE DEBUG
...
string returnedStr = this.SomeFoo();
#if DEBUG
Debug.WriteLine("returned string =" + returnedStr);
#endif
This is something I like to use in my code as a form of scaffolding, and I'm wondering if PHP has something like this. I'm sure I can emulate this with variables, but I imagine the fact that PHP is interpreted in most cases will not make it easy to strip/remove the debugging code (since its not needed) automatically when executing it. | 0 | [
2,
630,
13,
26120,
57,
21,
121,
16254,
4678,
30,
92,
44,
147,
19,
1797,
60,
800,
3726,
3726,
2556,
101,
272,
17,
166,
272,
5910,
13,
5,
2140,
12345,
1437,
22,
38,
57,
21,
782,
16835,
248,
6,
1655,
42,
20,
2757,
1797,
101,
45,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Web services and database concurrency
===
I'm building a .NET client application (C#, WinForms) that uses a web service for interaction with the database. The client will be run from remote locations using a WAN or VPN, hence the idea of using a web service rather than direct database access.
The issue I'm grappling with right now is how to handle database concurrency. That is, if two people from different locations update the same data, how do I deal with it? I'm considering using timestamps on each database record and having that as part of the update where clauses, but that means that the timestamps have to move back and forth through the web service interface, which seems kind of ugly.
What is the best way to approach this? | 0 | [
2,
2741,
687,
17,
6018,
25547,
800,
3726,
3726,
31,
22,
79,
353,
21,
13,
9,
2328,
6819,
3010,
13,
5,
150,
5910,
15,
628,
4190,
18,
6,
30,
2027,
21,
2741,
365,
26,
7754,
29,
14,
6018,
9,
14,
6819,
129,
44,
485,
37,
5388,
4095... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
What are all the Programming Paradigms?
===
I have heard of many and studied several, are there others that I've missed? I have studied:
- [Procedural][1]
- [Object Oriented][2]
- [Functional][3]
- [DataFlow][4]
- [Declarative][5]
- [Logic][6]
- [Total Functional Programming][7]
I'm looking for 'whole' paradigms for study, such as the above, that tend to fit a boundary around how you express a program - Aspect Oriented Programming doesn't fit into this description to me since it is an add-on to existing languages, rather than typically embodied by a language.
What other paradigms are there and what is compelling about them?
[1]: http://en.wikipedia.org/wiki/Procedural_programming
[2]: http://en.wikipedia.org/wiki/Object_oriented_programming
[3]: http://en.wikipedia.org/wiki/Functional_programming
[4]: http://en.wikipedia.org/wiki/Dataflow_programming
[5]: http://en.wikipedia.org/wiki/Declarative_programming
[6]: http://en.wikipedia.org/wiki/Logic_programming
[7]: http://en.wikipedia.org/wiki/Total_functional_programming | 1 | [
2,
98,
50,
65,
14,
3143,
20234,
18,
60,
800,
3726,
3726,
31,
57,
752,
16,
151,
17,
1449,
238,
15,
50,
80,
654,
30,
31,
22,
195,
3238,
60,
31,
57,
1449,
45,
13,
8,
636,
15617,
69,
10018,
500,
2558,
165,
500,
13,
8,
636,
237... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 alternative to RawInput in Mac OS X/Linux
===
I'm developing an application that runs on a machine that has several usb keyboards attached. Occasionally keyboards will added or removed. Each time a key is pressed, the application needs to find out which key was pressed, and which keyboard was used.
I have got a working version of the application which uses RawInput under windows. However windows can take a while to work out whats happened if you add or remove a hub or two full of keyboards, and I'm looking too see if the same can be achieved on a different OS more robustly.
Mac OS X/Cocoa would be the second choice if it is possible, but I am open to suggestions for any other platforms like linux if you can suggest a way to do it. | 0 | [
2,
25,
80,
40,
2676,
20,
4333,
108,
4881,
19,
1572,
13,
759,
993,
118,
1226,
7147,
800,
3726,
3726,
31,
22,
79,
3561,
40,
3010,
30,
1461,
27,
21,
1940,
30,
63,
238,
182,
220,
5362,
3638,
9,
4533,
5362,
129,
905,
54,
1974,
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... |
Standalone Python applications in linux
===
How can I distribute a standalone Python application in Linux?
I think I can take for granted the presence of a recent Python interpreter in any modern distribution. The problem is dealing with those libraries that do not belong to the standard library, i.e. wxPython, scipy, python cryptographic toolkit, reportlab, and so on.
Is there a working Linux counterpart to, say, py2exe (which, by the way, I have never tried)?
Is there a free, opensource one?
| 0 | [
2,
26986,
20059,
3767,
19,
13024,
800,
3726,
3726,
184,
92,
31,
14751,
21,
26986,
20059,
3010,
19,
13024,
60,
31,
277,
31,
92,
247,
26,
2743,
14,
1970,
16,
21,
1764,
20059,
19336,
19,
186,
773,
2523,
9,
14,
1448,
25,
5746,
29,
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... |
HOWTO: specify in app.config to call a function before Main() is called?
===
I really want to put in some sort of section handler into App.config that will execute some code before the application actually starts executing at Main. Is there any way to do such a thing? | 0 | [
2,
184,
262,
45,
19077,
19,
4865,
9,
14093,
2816,
20,
645,
21,
1990,
115,
407,
5,
6,
25,
227,
60,
800,
3726,
3726,
31,
510,
259,
20,
442,
19,
109,
2058,
16,
1050,
24641,
77,
4865,
9,
14093,
2816,
30,
129,
15644,
109,
1797,
115... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
What is your favorite source formatting tool?
===
We all know that deadlines and/or critical bugfixes and make us forget a bit about source formatting guidelines. Or sometimes you need to work with 3rd party source code which seems to have been coded by someone who doesn't know the meaning of whitespace and readability. What is your favorite tool to tabulate your code (or 3rd party code) to your specification? | 0 | [
2,
98,
25,
154,
3839,
1267,
2595,
1203,
5607,
60,
800,
3726,
3726,
95,
65,
143,
30,
15968,
18,
17,
118,
248,
2507,
6256,
18594,
160,
17,
233,
182,
3856,
21,
1142,
88,
1267,
2595,
1203,
12629,
9,
54,
1030,
42,
376,
20,
170,
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... |
C# how to add Excel Worksheet programatically Office XP / 2003
===
I am just starting to fiddle with Excel via C# to be able to automate the creation, and addition to an Excel file.
I can open the file and update the data and move through the existing worksheets. My problem is how can I add new sheets?
I tried:
<code>
Excel.Worksheet newWorksheet;
newWorksheet = (Excel.Worksheet)excelApp.ThisWorkbook.Worksheets.Add(
Type.Missing, Type.Missing, Type.Missing, Type.Missing);
</code>
But I get a COM Exception and my googling has not given me an answer.
I am hoping someone maybe able to put me out of my missery.
Thanks | 0 | [
2,
272,
5910,
184,
20,
3547,
20700,
170,
17627,
625,
721,
8438,
488,
23045,
13,
118,
973,
800,
3726,
3726,
31,
589,
114,
1422,
20,
12759,
29,
20700,
1197,
272,
5910,
20,
44,
777,
20,
3108,
5281,
14,
2502,
15,
17,
848,
20,
40,
20... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Why can't .NET parse a date string with a timezone?
===
.NET throws an exception trying to parse a datetime string in this format:
**Fri, 10 Oct 2008 00:05:51 CST**
Convert.ToDateTime("Fri, 10 Oct 2008 00:05:51 CST") results in an exception:
> The string was not recognized as a
> valid DateTime. There is a unknown
> word starting at index 26
Character 26 obviously being the start of "CST"
In a quick test, PHP and javascript can both parse this string into a date with no problem. Is .NET just full of fail or is there a reasonable explanation?
| 0 | [
2,
483,
92,
22,
38,
13,
9,
2328,
2017,
870,
21,
1231,
3724,
29,
21,
85,
11661,
60,
800,
3726,
3726,
13,
9,
2328,
13566,
40,
5391,
749,
20,
2017,
870,
21,
1231,
891,
3724,
19,
48,
2595,
45,
13,
1409,
11612,
15,
332,
9543,
570,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 Debugger Wrong? IndexOutOfRangeException thrown by the code: f++
===
Why is an exception being thrown in the "f++" part of the code below ("IndexOutOfRangeException was unhandled by user code"):
for (int f = 0; f < gnf; f++)
{
fieldNames[g] = grid.FieldName(f);
}
The bug is in the "fieldNames[g] = ..." part of the code, my algorithm should be:
for (int f = 0; f < gnf; f++)
{
fieldNames[f] = grid.FieldName(f);
}
(This does not crash.) But the debugger is not showing the exception on the "fieldNames[g]..." line when the wrong (top) code runs.
I'm not using threads at this point so I don't see it being one of those "debugging exceptions in a threaded program is suicide" situations.
Why is the debugger showing the exception in the wrong place? Optimizations or something? Has anyone else had the debugger be "wrong" like this before? | 0 | [
2,
25,
4611,
121,
2345,
11356,
1389,
60,
4348,
1320,
1041,
8366,
10066,
872,
6027,
34,
14,
1797,
45,
398,
20512,
800,
3726,
3726,
483,
25,
40,
5391,
142,
6027,
19,
14,
13,
7,
410,
20512,
7,
141,
16,
14,
1797,
1021,
13,
5,
7,
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... |
Print text in Oracle SQL Developer SQL Worksheet window
===
I am using Oracle SQL (in SQLDeveloper, using the SQL Worksheet). I would like to print a statement before my select, such as
PRINT 'Querying Table1';
SELECT * from Table1;
What do I use to Print / show text output? It's not Print, because that gives me the error: Bind Variable "'Table1'" is NOT DECLARED. DBMS_OUTPUT.PUT_LINE is an unknown command. (Obviously, I'm an inexperienced SQLDeveloper and Oracle user. There must be some synonym for Print, but I'm having trouble finding help on it without knowing what it is.)
| 0 | [
2,
4793,
1854,
19,
15759,
4444,
255,
10058,
4444,
255,
170,
17627,
1463,
800,
3726,
3726,
31,
589,
568,
15759,
4444,
255,
13,
5,
108,
4444,
255,
26051,
106,
15,
568,
14,
4444,
255,
170,
17627,
6,
9,
31,
83,
101,
20,
4793,
21,
33... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Using pbuffer with GLUT ?
===
I have been scouring the web for a code sample that shows how to use pbuffer with GLUT but I could not find anything...
I am puzzled with the context switching between pbuffer and the rendering window. I guess that I will have to use glutSetWindow to switch between the two rendering surface but I am not too sure about the details.
Can someone explain me how to use a pbuffer with GLUT?
| 0 | [
2,
568,
351,
2345,
6866,
29,
21697,
13,
60,
800,
3726,
3726,
31,
57,
74,
11530,
10450,
14,
2741,
26,
21,
1797,
5717,
30,
1285,
184,
20,
275,
351,
2345,
6866,
29,
21697,
47,
31,
110,
52,
477,
602,
9,
9,
9,
31,
589,
17033,
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... |
How can my iPhone Objective-C code get notified of Javascript errors in a UIWebView?
===
I need to have my iPhone Objective-C code catch Javascript errors in a UIWebView. That includes uncaught exceptions, syntax errors when loading files, undefined variable references, etc.
This is for a development environment, so it doesn't need to be SDK-kosher. In fact, it only really needs to work on the simulator.
I've already found used some of the hidden WebKit tricks to e.g. expose Obj-C objects to JS and to intercept alert popups, but this one is still eluding me. | 0 | [
2,
184,
92,
51,
21024,
7038,
8,
150,
1797,
164,
22904,
16,
8247,
8741,
11908,
19,
21,
13,
5661,
14113,
4725,
60,
800,
3726,
3726,
31,
376,
20,
57,
51,
21024,
7038,
8,
150,
1797,
2949,
8247,
8741,
11908,
19,
21,
13,
5661,
14113,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How to use prepared statements with Enterprise Library?
===
Is there a way to tell Enterprise Library to use prepared statements? If so, how? | 0 | [
2,
184,
20,
275,
3268,
9015,
29,
6002,
1248,
60,
800,
3726,
3726,
25,
80,
21,
161,
20,
494,
6002,
1248,
20,
275,
3268,
9015,
60,
100,
86,
15,
184,
60,
3,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
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... |
how do I share a javascript object between different pages in adobe air?
===
I'd like to have a custom object attached to the application so I can preserve state in it between different html pages in adobe air. Is this possible? | 0 | [
2,
184,
107,
31,
1891,
21,
8247,
8741,
3095,
128,
421,
4434,
19,
20299,
282,
60,
800,
3726,
3726,
31,
22,
43,
101,
20,
57,
21,
5816,
3095,
3638,
20,
14,
3010,
86,
31,
92,
6224,
146,
19,
32,
128,
421,
13,
15895,
4434,
19,
20299... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
Tips on how to inoffensively help an older co-worker to become a developer instead of a code-monkey?
===
Have an older co-worker who has been a programmer for about a year here, and just can't seem to break out of the code-by-the-seat-of-his-pants mentality. Is there a good way to help, or after a year of not taking advice is it best to give up? | 2 | [
2,
11034,
27,
184,
20,
19,
27489,
102,
448,
40,
1234,
326,
8,
22560,
20,
533,
21,
10058,
700,
16,
21,
1797,
8,
2111,
4237,
60,
800,
3726,
3726,
57,
40,
1234,
326,
8,
22560,
72,
63,
74,
21,
17968,
26,
88,
21,
159,
235,
15,
17... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Why does handling WM_NCCALCSIZE cause my window to jump?
===
I have a WPF app which snaps to screen edges (I just set the .Top or .Left of the window if you're within 20 pixels of the screen edge), but I recently added some code [provided by the WPF SDK Team](http://blogs.msdn.com/wpfsdk/archive/2008/09/08/custom-window-chrome-in-wpf.aspx) to "mess" with the window chrome, and although it's working great ([screenshot][1]), it's causing the "snapto" to move the window unexpectedly (e.g.: it jumps to the left when it should be snapping straight down to the bottom)
I've narrowed it down to their handling of the WM\_NCCALCSIZE ... which is really odd because they basically don't do anything, they just say they handle it, and return 0.
According to the documentation of WM\_NCCALCSIZE, this should just result in the whole window being treated as client (having no non-client edge), but somehow it also means that whenever my snap-to code moves the window down to the bottom of the screen, it also moves left about 134 pixels ... (moving to the other edges has similar side effects) and as long as I hold the mouse to drag it, it flickers back and forth from where it's supposed to be. If I comment the WM\_NCCALCSIZE handling out, the snap-to works the way it should (but the form doesn't look right).
I've tried everything I can thing of in the WM\_NCCALCSIZE handler, but I can't stop it from jumping left ... and of course, WM\_NCCALCSIZE only gets called when the window size changes, so I don't understand how it causes this in the first place!
P.S. If you want to actually see the code, it's already [on CodePlex](http://www.codeplex.com/PoshConsole/SourceControl/DirectoryView.aspx?SourcePath=%24%2fPoshConsole%2ftrunk&changeSetId=25220), in two files, look for [_HandleNCCalcSize](http://www.codeplex.com/PoshConsole/SourceControl/FileView.aspx?itemId=359235&changeSetId=25220) and [OnWindowLocationChanged](http://www.codeplex.com/PoshConsole/SourceControl/FileView.aspx?itemId=3029&changeSetId=25220)
[1]: http://huddledmasses.org/images/PoshConsole/NewLook_Aero.png | 0 | [
2,
483,
630,
7988,
19312,
1,
6897,
16304,
10454,
1679,
51,
1463,
20,
3936,
60,
800,
3726,
3726,
31,
57,
21,
619,
7721,
4865,
56,
6877,
18,
20,
2324,
7840,
13,
5,
49,
114,
309,
14,
13,
9,
3880,
54,
13,
9,
9742,
16,
14,
1463,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 force a MSTEST TestMethod to run in its own AppDomain to reset all singletons/statics inside?
===
I'm using MSTEST inside Visual Studio 2008. How can I have each unit test method in a certain test class act as if it were the first test to run so that all global state is reset before running each test? I do not want to explicitly clean up the world using TestInitialize, ClassInitialize, AssemblyInitialize, etc. For example:
[TestClass]
public class MyClassTests
{
[TestMethod]
public void Test1()
{
// The "Instance" property creates a new instance of "SomeSingleton"
// if it hasn't been created before.
var i1 = SomeSingleton.Instance;
...
}
[TestMethod]
public void Test2()
{
// When I select "Test1" and "Test2" to run, I'd like Test2
// to have a new AppDomain feel so that the static variable inside
// of "SomeSingleton" is reset (it was previously set in Test1) on
// the call to ".Instance"
var i2 = SomeSingleton.Instance;
// some code
}
Although a [similar question][1] appeared on this topic, it only clarified that tests do not run in parallel. I realize that tests run serially, but there doesn't seem to be a way to explicitly force a new AppDomain for each method.
Ideally, I'd like to specify this behavior for only a small subset of my unit tests so that I don't have to pay the penalty of a new AppDomain creation for tests that don't care about global state (the vast majority of my tests).
[1]: http://stackoverflow.com/questions/154180/how-does-nunit-and-mstest-handle-tests-that-change-staticshared-variables | 0 | [
2,
184,
20,
558,
21,
4235,
10543,
1289,
5909,
1807,
43,
20,
485,
19,
82,
258,
4865,
537,
6232,
20,
23422,
65,
345,
444,
18,
118,
18077,
18,
572,
60,
800,
3726,
3726,
31,
22,
79,
568,
4235,
10543,
572,
3458,
1120,
570,
9,
184,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
"The operation is not valid for the state of the transaction" error and transaction scope
===
I am getting a "The opertaion is not valid for the state of the transaction" error when I try to call a stored procedure that contains a SELECT Statement. Here is the structure of my calls
public void MyAddUpdateMethod()
{
using (TransactionScope Scope = new TransactionScope(TransactionScopeOption.RequiresNew))
{
using(SQLServer Sql = new SQLServer(this.m_connstring))
{
//do my first add update statement
//do my call to the select statement sp
bool DoesRecordExist = this.SelectStatementCall(id)
}
}
}
public bool DoesRecordExist(System.Guid id)
{
using(SQLServer Sql = new SQLServer(this.m_connstring)) //breaks on this line
{
//create parameters
//
}
}
Is the problem with me creating another connection to the same database within the transaction? | 0 | [
2,
13,
7,
124,
1453,
25,
52,
7394,
26,
14,
146,
16,
14,
12799,
7,
7019,
17,
12799,
9914,
800,
3726,
3726,
31,
589,
1017,
21,
13,
7,
124,
13,
9477,
536,
872,
25,
52,
7394,
26,
14,
146,
16,
14,
12799,
7,
7019,
76,
31,
1131,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Insert Into: Is one syntax more optimal or is it preference?
===
SQL Server (2005/2008)
Each of the below statements have the same result. Does anyone know if one outperforms the other?
insert into SOMETABLE
values ('FieldOneValue','FieldTwoValue',3,4.55,'10/10/2008 16:42:00.000')
insert into SOMETABLE
select 'FieldOneValue','FieldTwoValue',3,4.55,'10/10/2008 16:42:00.000'
insert into SOMETALBE
Select
Field1 = 'FieldOneValue',
Field2 = 'FieldTwoValue',
Field3 = 3,
Field4 = 4.55,
Field5 = '10/10/2008 16:42:00.000'
Assuming of course that the data types match the table appropriately... | 0 | [
2,
14692,
77,
45,
25,
53,
22649,
91,
17586,
54,
25,
32,
9808,
60,
800,
3726,
3726,
4444,
255,
8128,
13,
5,
2835,
118,
2753,
6,
206,
16,
14,
1021,
9015,
57,
14,
205,
829,
9,
630,
1276,
143,
100,
53,
70,
1432,
4190,
18,
14,
89... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Apache htaccess on Win2k is not being processed
===
I am trying to rewrite URLs using mod_rewrite. It is enabled in httpd.conf and url rewriting works if the lines are in the httpd.conf file. However, I would like the rules to be in the .htaccess file.
It doesn't appear that .htaccess is being processed at all by Apache on Win2k.
I have ReWriteLogging turned all the way up, but the log file isn't being created. The last line in httpd.conf is
AccessFileName .htaccess
.htaccess contents
RewriteEngine on
RewriteLog "c:/rewrite.log"
RewriteLogLevel 15
RewriteRule /alice.html$ /bob.html
Thanks
edit : Apache version 2.2 on Windows 2k | 0 | [
2,
17140,
13,
9020,
20604,
27,
628,
135,
197,
25,
52,
142,
16697,
800,
3726,
3726,
31,
589,
749,
20,
27891,
13,
911,
7532,
568,
7226,
1,
99,
23716,
9,
32,
25,
9338,
19,
7775,
43,
9,
14093,
17,
287,
6362,
302,
12646,
693,
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... |
What is the best project structure for a Python application?
===
Imagine that you want to develop a non-trivial end-user desktop (not web) application in Python. What is the best way to structure the project's folder hierarchy?
Desirable features are ease of maintenance, IDE-friendliness, suitability for source control branching/merging, and easy generation of install packages.
In particular:
1. Where do you put the source?
1. Where do you put application startup scripts?
1. Where do you put the IDE project cruft?
1. Where do you put the unit/acceptance tests?
1. Where do you put non-Python data such as config files?
1. Where do you put non-Python sources such as C++ for pyd/so binary extension modules?
| 0 | [
2,
98,
25,
14,
246,
669,
1411,
26,
21,
20059,
3010,
60,
800,
3726,
3726,
4382,
30,
42,
259,
20,
2803,
21,
538,
8,
19712,
241,
8,
16704,
17404,
13,
5,
1270,
2741,
6,
3010,
19,
20059,
9,
98,
25,
14,
246,
161,
20,
1411,
14,
669... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Good Java Process Control Library
===
Java process control is notoriously bad - primarily due to inadequate support by the Java VM/JDK classes (e.g. java.lang.Process).
I am wondering, are there any good open source libraries out there that are reliable.
The requirements would be:
1) OSS
2) Start/Stop processes
3) Manage STDIN and STDOUT
4) cross platform (at least Linux, Windows, Solaris, HP, and IBM in that order)
5) (optional) restartable
6) (desirable) mature | 0 | [
2,
254,
8247,
953,
569,
1248,
800,
3726,
3726,
8247,
953,
569,
25,
11904,
102,
896,
13,
8,
2257,
397,
20,
16296,
555,
34,
14,
8247,
13,
20147,
118,
728,
43,
197,
2684,
13,
5,
62,
9,
263,
9,
8247,
9,
9949,
9,
16835,
6,
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... |
Subversion & switching between tags
===
My automated deployment system updates a latest version of my site trough subversion. Instead of having my live site point to the trunk (which is always almost a work in progress version), I have my live site point to a tag.
E.g. I work on trunk and when my v1.0 is finished I create a tag called 1.0 and do a checkout of that tag which is then my live site. Now, I keep working on trunk and after a while there is a v2.0. I create a tag called 2.0 and I want my live site to resemble this 2.0 tag.
I could wipe the current live site and do a checkout of this 2.0 tag. Which sounds easy enough, however. My site is about 1GB is size because it has all kinds of PDF documents and video in it. I can safely say that most of the time I do updates it will be copy changes or bug fixes. This means that maybe only 1% of my site changes per update. And since my version control is only accessable to my webserver through on off site http connection it would mean that I need to download that whole site over and over again.
Is there an easy way to switch between tags and have subversion only update the differences between those tags?
| 0 | [
2,
972,
10898,
279,
13027,
128,
3383,
18,
800,
3726,
3726,
51,
14904,
10475,
329,
16779,
21,
5736,
615,
16,
51,
689,
22032,
972,
10898,
9,
700,
16,
452,
51,
515,
689,
454,
20,
14,
6436,
13,
5,
2140,
25,
550,
557,
21,
170,
19,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Putting newbies on Reports. Beneficial/Harmful?
===
In my work experience, most fresh out of school programmers are set right to creating reports for 6-12 months or so. While I see the benefit of doing something non-crucial, it seems to really discourage them.
So my question is, should organizations allow newbies to work with someone experienced right off the bat, obviously doing non-critical phases of a project, do get a real feel for what their career choice has in stock, or throw them on reports out of the gate? | 4 | [
2,
3873,
78,
5893,
18,
27,
2813,
9,
17623,
118,
2269,
79,
1566,
60,
800,
3726,
3726,
19,
51,
170,
1496,
15,
127,
3180,
70,
16,
116,
17968,
18,
50,
309,
193,
20,
2936,
2813,
26,
400,
8,
918,
818,
54,
86,
9,
133,
31,
196,
14,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
How do I turn off ABCpdf's paragraph indenting during a chain?
===
The project I'm working on uses a 3rd party component called ABCpdf to generate PDF documents. It has this feature where you can "chain" text from one content area to the next, which we're using to flow text across columns. You can also define an indent size to be used at the start of "paragraphs."
This is all great, except now I've just discovered that if I hand a paragraph of text to ABCpdf at the bottom of the column such that it needs to "chain" to the top of the next, ABCpdf thinks the top of the new column is the start of a new paragraph, and applies the indent there as well. I can't seem to find a way to turn this off, either in the documentation or by experiment.
Has anyone else solved this problem? (Or even run into it?) | 0 | [
2,
184,
107,
31,
805,
168,
5079,
11124,
22,
18,
20599,
19,
817,
1203,
112,
21,
2858,
60,
800,
3726,
3726,
14,
669,
31,
22,
79,
638,
27,
2027,
21,
203,
897,
346,
5912,
227,
5079,
11124,
20,
7920,
13,
11124,
4374,
9,
32,
63,
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... |
Programmatically get own phone number in iPhone OS
===
Is there any way to get own phone number by standard APIs from iPhone SDK? | 0 | [
2,
625,
6732,
1326,
164,
258,
1132,
234,
19,
21024,
13,
759,
800,
3726,
3726,
25,
80,
186,
161,
20,
164,
258,
1132,
234,
34,
1236,
21,
8954,
37,
21024,
13,
18,
43,
197,
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... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
Is it possible to set a default value when deserializing xml in C# (.NET 3.5)?
===
I've got a little problem that's slightly frustrating. Is it possible to set a default value when deserializing xml in C# (.NET 3.5)? Basically I'm trying to deserialize some xml that is not under my control and one element looks like this:
<assignee-id type="integer">38628</assignee-id>
it can also look like this:
<assignee-id type="integer" nil="true"></assignee-id>
Now, in my class I have the following property that should receive the data:
[XmlElementAttribute("assignee-id")]
public int AssigneeId { get; set; }
This works fine for the first xml element example, but the second fails. I've tried changing the property type to be int? but this doesn't help. I'll need to serialize it back to that same xml format at some point too, but I'm trying to use the built in serialization support without having to resort to rolling my own.
Does anyone have experience with this kind of problem?
Thanks in advance
Andy | 0 | [
2,
25,
32,
938,
20,
309,
21,
12838,
1923,
76,
1746,
106,
2815,
3335,
23504,
19,
272,
5910,
13,
5,
9,
2328,
203,
9,
264,
6,
60,
800,
3726,
3726,
31,
22,
195,
330,
21,
265,
1448,
30,
22,
18,
1847,
25568,
9,
25,
32,
938,
20,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
XPS with Windows Forms
===
What is the best way to **display** and **print** XPS files in a Windows Forms application? | 0 | [
2,
23045,
18,
29,
1936,
1997,
800,
3726,
3726,
98,
25,
14,
246,
161,
20,
13,
1409,
2906,
5438,
1409,
17,
13,
1409,
10299,
1409,
23045,
18,
6488,
19,
21,
1936,
1997,
3010,
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... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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... |
Is this slash character in an Oracle PL/SQL script an error?
===
I'm sorting out a series of SQL scripts for my company written in Oracle PL/SQL. I came across an essential script with a strangely placed slash near the bottom. It is checked into CVS this way. Is this a pure syntax error or does it have some function I'm not aware of. The slightly obfuscated script:
set serveroutput on size 2000;
--PL/SQL block to link ISSN in serial base on a company's ISSN text file
declare
cursor ItemCursor is
select issn is2 from web.obfuscated1 where issn is not null
union
select eissn is2 from web.obfuscated1 where eissn is not null;
cursor ItemCursor1(aIS varchar2) is
select obfuscated1_uid from web.obfuscated1 where group_num is null and issn in (
select distinct issn from web.obfuscated1 where issn = aIS or eissn = aIS
union
select distinct eissn from web.obfuscated1 where issn = aIS or eissn = aIS
)
union
select obfuscated1_uid from web.obfuscated1 where eissn in (
select distinct issn from web.obfuscated1 where issn = aIS or eissn = aIS
union
select distinct eissn from web.obfuscated1 where issn = aIS or eissn = aIS
);
cursor ItemCursor2(aIS9 varchar2) is
select obfuscated1_uid from web.obfuscated1 where issn in (
select distinct issn from web.obfuscated1 where issn = aIS9 or eissn = aIS9
union
select distinct eissn from web.obfuscated1 where issn = aIS9 or eissn = aIS9
) and group_num is null;
agroup number(8);
processCount number(8);
------------------------------------------------------
-- MAIN BLOCK -----------------------------------
-------------------------------------------------
begin
processCount := 0;
agroup := null;
for itemRec in ItemCursor loop
agroup := null;
begin
select group_num into agroup from web.obfuscated1 where issn in (
select distinct issn from web.obfuscated1 where issn = itemRec.is2 or eissn = itemRec.is2
union
select distinct eissn from web.obfuscated1 where issn = itemRec.is2 or eissn = itemRec.is2
) and group_num is not null and issn is not null and eissn is not null and rownum <= 1;
exception
when no_data_found then
agroup := null;
when others then
agroup := null;
end;
if agroup is not null then
for itemRec2 in ItemCursor2(itemRec.is2) loop
update web.obfuscated1 set group_num = agroup where obfuscated1_uid = itemRec2.obfuscated1_uid;
commit;
end loop;
else
processCount := processCount + 1;
for itemRec1 in ItemCursor1(itemRec.is2) loop
update web.obfuscated1 set group_num = processCount where obfuscated1_uid = itemRec1.obfuscated1_uid;
commit;
end loop;
commit;
end if;
end loop;
dbms_output.put_line('Total record read: ' || processCount);
exception
when others then
dbms_output.put_line('ORA' || sqlcode);
dbms_output.put_line(substr(sqlerrm, 1, 255));
dbms_output.put_line('ORA- Error during processing ' );
end;
/
exit;
| 0 | [
2,
25,
48,
14098,
925,
19,
40,
15759,
12443,
118,
18,
22402,
3884,
40,
7019,
60,
800,
3726,
3726,
31,
22,
79,
2058,
68,
70,
21,
231,
16,
4444,
255,
17505,
26,
51,
237,
642,
19,
15759,
12443,
118,
18,
22402,
9,
31,
281,
464,
40... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
Screen Grab with PHP and/or Javascript?
===
Just wondering if it's possible to screen grab a page you are viewing with a PHP script or javascript? For example, load up a page in an iframe and then save that view as a JPEG?
I'm sure it's possible somehow, but are there any known implementations/libraries that help out? | 0 | [
2,
2324,
4931,
29,
13,
26120,
17,
118,
248,
8247,
8741,
60,
800,
3726,
3726,
114,
5712,
100,
32,
22,
18,
938,
20,
2324,
4931,
21,
2478,
42,
50,
11244,
29,
21,
13,
26120,
3884,
54,
8247,
8741,
60,
26,
823,
15,
6305,
71,
21,
247... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... |
A good example of XIFF implementation?
===
XIFF is an implemenation of the XMPP protocol in actionscript.
So far, all the examples and documentation I have seen are sparse. Does anyone know a good explanation of the most recent version of XIFF and/or good examples of working Flex/AIR applications? | 0 | [
2,
21,
254,
823,
16,
993,
6021,
6123,
60,
800,
3726,
3726,
993,
6021,
25,
40,
5420,
413,
755,
857,
16,
14,
993,
79,
3421,
8494,
19,
1028,
8741,
9,
86,
463,
15,
65,
14,
3770,
17,
13945,
31,
57,
541,
50,
23162,
9,
630,
1276,
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... |
In MS SQL Server, is there a way to "atomically" increment a column being used as a counter?
===
Assuming a Read Committed Snapshot transaction isolation setting, is the following statement "atomic" in the sense that you won't ever "lose" a concurrent increment?
update mytable set counter = counter + 1
I would assume that in the general case, where this update statement is part of a larger transaction, that it wouldn't be. For example, I think this scenario is possible:
- update the counter within transaction #1
- do some other stuff
in transaction #1
- update the counter
with transaction #2
- commit
transaction #2
- commit transaction #1
In this situation, wouldn't the counter end up only being incremented by 1? Does it make a difference if that is the only statement in a transaction?
How does a site like stackoverflow handle this for its question view counter? Or is the possibility of "losing" some increments just considered acceptable?
| 0 | [
2,
19,
4235,
4444,
255,
8128,
15,
25,
80,
21,
161,
20,
13,
7,
26990,
1326,
7,
13,
28461,
21,
4698,
142,
147,
28,
21,
2105,
60,
800,
3726,
3726,
11704,
21,
1302,
4164,
29946,
12799,
13300,
2697,
15,
25,
14,
249,
3331,
13,
7,
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... |
Simplifying VIsualSVN Server's URLs
===
We're currently running an `svnserve` instance as NT service. While this works, it's needlessly cumbersome to administer, and I'd like to move on to the much simpler VisualSVN Server. (Bonus side benefits include Windows-integrated authentication and, thanks to HTTP/WebDAV, browsing of the latest revision.)
That said, the current server offers up URLs that look like this:
svn://oldserver/path/to/some/file.foo
Rather memorable.
The new one, as set up through VSVNS:
https://newserver:8443/svn/Repos/path/to/some/file.foo
Ouch. For one, the `/svn` bit is *entirely* unnecessary. Since VSVNS runs its own HTTP server (that's why it's on the special port `8443`, after all), *of course* everything is related to `svn`. Moreover, we only have one repository (and no real need for more), so the repository name in `/Repos` shouldn't be there either — we could turn this off with `svnserve`, so there should be a way to do it now, too.
* Is it possible to configure VisualSVN Server to drop the `/svn`? (Why is it there to begin with?)
* Given that there is only one repository, can I tell it not to make the repository name part of the URL? | 0 | [
2,
28257,
68,
3458,
18,
16578,
8128,
22,
18,
13,
911,
7532,
800,
3726,
3726,
95,
22,
99,
871,
946,
40,
13,
1,
18,
16578,
10321,
62,
1,
4851,
28,
13,
2877,
365,
9,
133,
48,
693,
15,
32,
22,
18,
376,
9687,
10611,
2102,
3220,
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... |
server-side css selectors
===
I am creating a tool that will check dynamically generated XHTML and validate it against expected contents.
I need to confirm the structure is correct and that specific attributes exist/match. There may be other attributes which I'm not interested in, so a direct string comparison is not suitable.
One way of validating this is with XPath, and I have implemented this already, but I would also like something less verbose - I want to be able to use CSS Selectors, like I can with jQuery, but on the server - within CFML code - as opposed to on the client.
<strong>Is there a CFML or Java library that allows me to use CSS Selectors against an XHTML string?</strong> | 0 | [
2,
8128,
8,
1416,
272,
18,
18,
23946,
18,
800,
3726,
3726,
31,
589,
2936,
21,
5607,
30,
129,
2631,
7782,
1326,
6756,
993,
15895,
17,
7394,
1373,
32,
149,
1727,
8478,
9,
31,
376,
20,
10265,
14,
1411,
25,
4456,
17,
30,
1903,
13422... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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 CVS and Subversion be set to ignore whitespace in merging?
===
CVS and Subversion both have a handy merge feature so that when you update a source file that you have modified, it merges in changes that others have made on the same file.
However, if your changes and the other ones are incompatible - generally if you have both changed the same parts of the code - it will create a conflict. Both stretches of source code will be included into the merged file and you need to manually sort out which changes to keep. All fine so far.
My problem is that some of us use different development environments (Netbeans versus vi if you must know) and Netbeans has an auto-indenting feature which re-indents the code. Therefore, when we merge changes, we sometimes get huge conflicts which are mostly caused by simple changes in indentation and are not genuine changes to code. Often these create hundreds of lines of apparent conflicts which have to be manually resolved, but usually they come down to just a few lines of real changes. A similar situation occurs when someone's editor changes unix to Windows newlines or vice versa.
So - can I set merge to ignore these "conflicts" when comparing the two versions? Diff has the --ignore-space-change or -b option and I would like to have essentially the same feature available in cvs or svn. We use each tool on different projects so I would be happy to have the answer for either or both.
Two final notes:
- clearly the merge process would have to make an arbitrary choice as to which version of the whitespace to use in the merged file. I'm fine with that - we can always reformat it again later.
- I could avoid some of this by being more disciplined and checking in more often - acknowledged and understood. But I am not perfect.
| 0 | [
2,
92,
13,
12732,
18,
17,
972,
10898,
44,
309,
20,
7174,
359,
5582,
19,
18842,
60,
800,
3726,
3726,
13,
12732,
18,
17,
972,
10898,
156,
57,
21,
20277,
12666,
1580,
86,
30,
76,
42,
11100,
21,
1267,
3893,
30,
42,
57,
5372,
15,
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... |
Getting file name of file directed by .htaccess?
===
I'm making a dynamic image for a forum that doesn't allow dynamic images.
I tried using .htacess to redirect all *.png files to image.png... which works perfectly, but from here I can't seem to be able to get the filename of the .png that was requested to generate the content.
is there a way to do this?
For example...
user puts in banana.png
htaccess forwards to image.php
I need a way of getting that banana into my php script.
Using $_SERVER['REQUEST_URI'] and $_SERVER["SCRIPT_NAME"] just returns that of the PHP file.
Is there a way of redirecting it to image.php?=bananana for example?
Any help would be highly appreciated.
Kind Regards
| 0 | [
2,
1017,
3893,
204,
16,
3893,
1012,
34,
13,
9,
9020,
20604,
60,
800,
3726,
3726,
31,
22,
79,
544,
21,
7782,
1961,
26,
21,
5691,
30,
1437,
22,
38,
1655,
7782,
3502,
9,
31,
794,
568,
13,
9,
17134,
5052,
18,
20,
302,
14706,
65,
... | [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
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.