unified_texts
stringlengths
32
30.1k
OpenStatus_id
int64
0
4
input_ids
list
token_type_ids
list
attention_mask
list
Creating routes with an optional path prefix === How can I go about making my routes recognise an optional prefix parameter as follows: /*lang/controller/id In that the lang part is optional, and has a default value if it's not specified in the URL: /en/posts/1 => lang = en /fr/posts/1 => lang = fr /posts/1 => lang = en
0
[ 2, 2936, 5050, 29, 40, 12832, 2013, 14315, 800, 3726, 3726, 184, 92, 31, 162, 88, 544, 51, 5050, 16945, 40, 12832, 14315, 18906, 28, 2415, 45, 13, 118, 2483, 9949, 118, 12898, 1252, 118, 1340, 19, 30, 14, 4544, 141, 25, 12832, 15,...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1...
Unable to cast object of type 'System.Object[]' to 'MyObject[]', what gives? === Scenario: I'm currently writing a layer to abstract 3 similar webservices into one useable class. Each webservice exposes a set of objects that share commonality. I have created a set of intermediary objects which exploit the commonality. However in my layer I need to convert between the web service objects and my objects. I've used reflection to create the appropriate type at run time before I make the call to the web service like so: public static object[] CreateProperties(Type type, IProperty[] properties) { //Empty so return null if (properties==null || properties.Length == 0) return null; //Check the type is allowed CheckPropertyTypes("CreateProperties(Type,IProperty[])",type); //Convert the array of intermediary IProperty objects into // the passed service type e.g. Service1.Property object[] result = new object[properties.Length]; for (int i = 0; i < properties.Length; i++) { IProperty fromProp = properties[i]; object toProp = ReflectionUtility.CreateInstance(type, null); ServiceUtils.CopyProperties(fromProp, toProp); result[i] = toProp; } return result; } Here's my calling code, from one of my service implementations: Property[] props = (Property[])ObjectFactory.CreateProperties(typeof(Property), properties); _service.SetProperties(folderItem.Path, props); So each service exposes a different "Property" object which I hide behind my own implementation of my IProperty interface. The reflection code works in unit tests producing an array of objects whose elements are of the appropriate type. But the calling code fails: > System.InvalidCastException: Unable to > cast object of type 'System.Object[]' > to type > 'MyProject.Property[] Any ideas? I was under the impression that any cast from Object will work as long as the contained object is convertable?
0
[ 2, 2343, 20, 1325, 3095, 16, 1001, 13, 22, 10724, 9, 23793, 2558, 500, 22, 20, 13, 22, 915, 23793, 2558, 500, 22, 15, 98, 2352, 60, 800, 3726, 3726, 12705, 45, 31, 22, 79, 871, 1174, 21, 5385, 20, 8502, 203, 835, 2741, 11449, ...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 way to prevent extra elements in VBA dynamic arrays? === As the title states, is there a way to prevent extra elements from showing up in VBA dynamic arrays? For example, when using code similar to the following: While Cells(ndx, 1).Value <> vbNullString ReDim Preserve data(1 To (UBound(data) + 1)) ndx = ndx + 1 Wend You have an extra empty array element at the end of processing. While this can be eliminated with the following: ReDim Preserve data(1 To (UBound(data) - 1)) This doesn't seem like the best way of resolving this problem. As such, is there a way to prevent that extra element from being created in the first place? Preferably something that doesn't require additional logic inside of the loop.
0
[ 2, 25, 80, 21, 161, 20, 2501, 2230, 2065, 19, 566, 969, 7782, 7718, 18, 60, 800, 3726, 3726, 28, 14, 581, 202, 15, 25, 80, 21, 161, 20, 2501, 2230, 2065, 37, 3187, 71, 19, 566, 969, 7782, 7718, 18, 60, 26, 823, 15, 76, 568, ...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1...
How to create a for loop like command in C++ ? === I want to do something very simple in C++ but i can't find how. I want to create a function like a for loop where i will ideally enter a variable for the times the iteration should happen and some functions inside brackets my function will execute. I hope i was clear enough. Thanks... Example superFor (1) { //commands to be executed here add(1+2); }
0
[ 2, 184, 20, 1600, 21, 26, 5293, 101, 1202, 19, 272, 20512, 13, 60, 800, 3726, 3726, 31, 259, 20, 107, 301, 253, 1935, 19, 272, 20512, 47, 31, 92, 22, 38, 477, 184, 9, 31, 259, 20, 1600, 21, 1990, 101, 21, 26, 5293, 113, 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...
License to Distribute Matlab code === After writing the code in Matlab, is it possible to compile it into libraries and distribute them to customers who don't have matlab without installing the whole Matlab program? What is the license governing the distribution of Matlab code?
0
[ 2, 3962, 20, 14751, 4277, 9086, 1797, 800, 3726, 3726, 75, 1174, 14, 1797, 19, 4277, 9086, 15, 25, 32, 938, 20, 26561, 32, 77, 8649, 17, 14751, 105, 20, 5279, 72, 221, 22, 38, 57, 4277, 9086, 366, 25429, 14, 979, 4277, 9086, 625...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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...
Solr - Getting facet results without returning results === I need to return only the facet counts from solr. So I basically want to search over all documents and return the facet counts, but I don't want to return any search results. Is this possible? Thanks
0
[ 2, 7176, 139, 13, 8, 1017, 276, 38, 1736, 366, 2485, 1736, 800, 3726, 3726, 31, 376, 20, 788, 104, 14, 276, 38, 9927, 37, 7176, 139, 9, 86, 31, 11374, 259, 20, 2122, 84, 65, 4374, 17, 788, 14, 276, 38, 9927, 15, 47, 31, 221,...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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...
Is Click-Once available/compatible with .NETCF? === I develop and manage about 45 WindowsCE5 devices. Updating applications on the devices is a nightmare. Is it possible/feasible to do Click-Once on the CF?
0
[ 2, 25, 10840, 8, 13120, 904, 118, 20049, 29, 13, 9, 2328, 8940, 60, 800, 3726, 3726, 31, 2803, 17, 4705, 88, 2487, 1936, 1105, 264, 4690, 9, 71, 43, 1880, 3767, 27, 14, 4690, 25, 21, 10586, 9, 25, 32, 938, 118, 23707, 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, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
How to add a new SharePoint alert via Web Services === I found the Alert Service but it only seems to have methods for Getting and Deleting. How do I add a new alert?
0
[ 2, 184, 20, 3547, 21, 78, 1891, 3132, 7863, 1197, 2741, 687, 800, 3726, 3726, 31, 216, 14, 7863, 365, 47, 32, 104, 2206, 20, 57, 3195, 26, 1017, 17, 121, 1336, 68, 9, 184, 107, 31, 3547, 21, 78, 7863, 60, 3, 0, 0, 0, 0, 0,...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
What is a bus error? === What does the "bus error" message mean, and how does it differ from a segfault?
0
[ 2, 98, 25, 21, 1683, 7019, 60, 800, 3726, 3726, 98, 630, 14, 13, 7, 3822, 7019, 7, 2802, 884, 15, 17, 184, 630, 32, 11394, 37, 21, 1353, 16368, 9708, 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...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 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...
Struts2 Validation at the action vs domain object level === The struts2 validation framework allows you to define your validation for an action or at the domain object level. My question is, is there an advantage or disadvantage using one over the other? What do you recommend? My own findings: You may use the same domain objects in several actions and may have to re-define validation rules per action...maybe its better to place the validation rules in the object. But, I feel uncomfortable placing validation rules at the domain level since it seems to be something that belongs in the action.
0
[ 2, 18316, 18, 135, 27999, 35, 14, 1028, 4611, 4603, 3095, 662, 800, 3726, 3726, 14, 18316, 18, 135, 27999, 6596, 2965, 42, 20, 9267, 154, 27999, 26, 40, 1028, 54, 35, 14, 4603, 3095, 662, 9, 51, 1301, 25, 15, 25, 80, 40, 3314, ...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1...
How do I get output to show up in the Messages pane of the Error List for Visual Studio 2005? === I have a header file like this: #ifndef __GEN_NOTE_MARKERS_TO_DEVELOPERS_HPP__ #define __GEN_NOTE_MARKERS_TO_DEVELOPERS_HPP__ #ifdef _DEBUG // macros for turning a number into a string #define STRING2(x) #x #define STRING(x) STRING2(x) #ifdef TRIAGE_MESG_AS_WARNING #define TRIAGE_TODO_TAG(description) __pragma(message(__FILE__"("STRING(__LINE__)") : warning : TRIAGE TO-DO: " STRING(description) )) #define TRIAGE_FIXTHIS_TAG(description) __pragma(message(__FILE__"("STRING(__LINE__)") : warning : TRIAGE FIXTHIS: " STRING(description) )) #else #define TRIAGE_TODO_TAG(description) __pragma(message(__FILE__"("STRING(__LINE__)") : message : TRIAGE TO-DO: " STRING(description) )) #define TRIAGE_FIXTHIS_TAG(description) __pragma(message(__FILE__"("STRING(__LINE__)") : message : TRIAGE FIXTHIS: " STRING(description) )) #endif #else #define TRIAGE_TODO_TAG(description) #define TRIAGE_FIXTHIS_TAG(description) #endif #endif // __GEN_NOTE_MARKERS_TO_DEVELOPERS_HPP__ Which outputs notes to the output pane in Visual Studio 2005. When 'TRIAGE_MESG_AS_WARNING' is defined, Visual Studio will harvest these messages and list them as warnings in the Error List. It does this because the text format matches a warning. However, I don't want them to show up as warnings all the time, I would rather they show up in the Messages pane of the Error List. What do I need to do to get the output to show up in the Messages pane of the Error List? The format I have setup for messages in the above code looks like a message from other output, but does not get harvested in the same way. Thanks.
0
[ 2, 184, 107, 31, 164, 5196, 20, 298, 71, 19, 14, 7561, 13, 16660, 16, 14, 7019, 968, 26, 3458, 1120, 812, 60, 800, 3726, 3726, 31, 57, 21, 157, 106, 3893, 101, 48, 45, 6926, 821, 103, 13862, 13, 1, 1863, 1, 10280, 1, 4527, 4...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1...
How do you add external libraries for compilation in VC++? === I've worked with a couple of Visual C++ compilers (VC97, VC2005, VC2008) and I haven't really found a clearcut way of adding external libraries to my builds. I come from a Java background, and in Java libraries are everything! I understand from compiling open-source projects on my Linux box that all the source code for the library seems to need to be included, with the exception of those .so files. Also I've heard of the .lib static libraries and .dll dynamic libraries, but I'm still not entirely sure how to add them to a build and make them work. How does one go about this?
0
[ 2, 184, 107, 42, 3547, 4886, 8649, 26, 4868, 19, 13, 8990, 20512, 60, 800, 3726, 3726, 31, 22, 195, 577, 29, 21, 1335, 16, 3458, 272, 20512, 21486, 18, 13, 5, 8990, 3643, 15, 13, 8990, 2835, 15, 13, 8990, 2753, 6, 17, 31, 2933...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 way to keep files in App_Data from overwriting newer files when publishing? === I use an XML file in App\_Data in conjunction with a Repeater on the main page of an intranet application allow me to display messages to users when they logon about application status, maintenance, etc. To test the functionality, it would be nice to have the file in the App_Data folder under development, but if I do this it copies it over the file on the production server when I publish the application. Is there anyway I can prevent this from happening short of going to a Web Deployment project (and will that solve my problem)?
0
[ 2, 25, 80, 21, 161, 20, 643, 6488, 19, 4865, 1, 18768, 37, 84, 12646, 12372, 6488, 76, 3107, 60, 800, 3726, 3726, 31, 275, 40, 23504, 3893, 19, 4865, 1, 18768, 19, 9558, 29, 21, 6830, 106, 27, 14, 407, 2478, 16, 40, 14369, 232...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1...
Linux / C++: Get the IP Address of local computer === This Question is almost the same as the previously asked <a href="http://stackoverflow.com/questions/122208/get-the-ip-address-of-local-computer">Get the IP Address of local computer</a>-Question. However I need to find the IP address(es) of a **Linux Machine**. So: How do I - programmatically in **C++** - detect the IP addresses of the linux server my application is running on. The servers will have at least two IP addresses and I need a specific one (the one in a given network (the public one)). I'm sure there is a simple function to do that - but where?
0
[ 2, 13024, 13, 118, 272, 20512, 45, 164, 14, 15735, 3218, 16, 375, 1428, 800, 3726, 3726, 48, 1301, 25, 557, 14, 205, 28, 14, 1343, 411, 13, 1, 58, 746, 14057, 3726, 7, 21127, 6903, 25325, 2549, 9990, 9, 960, 118, 24652, 18, 118,...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1...
Is WHILE TRUE...BREAK...END WHILE a good design? === I've been looking at some code recently where the author used something similar to this (pseudo-code): WHILE TRUE OpenAFile IF Failed BREAK ENDIF DoSomething IF NOT OK BREAK ENDIF ...etc... BREAK END WHILE Arguments for using this design was speed (due to 'fall through' routines) and readability (no nasty indenting of multiple IFs). Arguments against has been that it's nothing but a nasty GOTO. My question: Is this a good design pattern? EDIT: NOTE! The example above isn't intended to 'do' anything, just demonstrate the code style.
0
[ 2, 25, 133, 1151, 9, 9, 9, 12008, 9, 9, 9, 2451, 133, 21, 254, 704, 60, 800, 3726, 3726, 31, 22, 195, 74, 699, 35, 109, 1797, 1989, 113, 14, 1314, 147, 301, 835, 20, 48, 13, 5, 1919, 62, 18601, 8, 9375, 6, 45, 133, 1151, ...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 reference for architecting Silverlight applications? === I'm curious if there are any texts that can be recommended that actually discuss application architecture best practices with respect to the use of Silverlight in web applications. ASP.Net would be preferable, but I'm open to consideration of other technologies also.
0
[ 2, 98, 25, 14, 246, 2801, 26, 3338, 68, 1172, 3130, 3767, 60, 800, 3726, 3726, 31, 22, 79, 7686, 100, 80, 50, 186, 6381, 30, 92, 44, 5773, 30, 1121, 5990, 3010, 2607, 246, 5242, 29, 2873, 20, 14, 275, 16, 1172, 3130, 19, 2741,...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1...
Resetting height of an HTML element via CSS === I use a custom-built asp.net control that renders to a DIV and has "height='0'" hard-coded into the element (I know.. stupid). But I need to reset it - get rid of the height assignment somehow. Is this doable with CSS? I can set the height to 100px for example, and it works. But that's not what I want - I want the height assignment removed pretty much.
0
[ 2, 302, 19831, 2947, 16, 40, 13, 15895, 4520, 1197, 272, 18, 18, 800, 3726, 3726, 31, 275, 21, 5816, 8, 8607, 28, 306, 9, 2328, 569, 30, 16535, 18, 20, 21, 13, 12916, 17, 63, 13, 7, 252, 7748, 3726, 22, 387, 22, 7, 552, 8, ...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1...
C# libraries? === Where can I learn how to use/create C# Libraries?
0
[ 2, 272, 5910, 8649, 60, 800, 3726, 3726, 113, 92, 31, 2484, 184, 20, 275, 118, 6037, 1373, 272, 5910, 8649, 60, 3, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, ...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
Java equivelent to app.config? === Is there a java equivelent to .net's App.Config? If not is there a standard way to keep you application settings, so that they can be changed after an app has been distributed?
0
[ 2, 8247, 13, 9629, 195, 13465, 20, 4865, 9, 14093, 2816, 60, 800, 3726, 3726, 25, 80, 21, 8247, 13, 9629, 195, 13465, 20, 13, 9, 2328, 22, 18, 4865, 9, 14093, 2816, 60, 100, 52, 25, 80, 21, 1236, 161, 20, 643, 42, 3010, 12410,...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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...
a script on this page is causing ie to run slowly === The problem is in the title - IE is misbehaving and is saying that there is a script running slowly - FF and Chrome don't have this problem. How can I find the problem . .there's a lot of JS on that page. Checking by hand is not a good ideea
0
[ 2, 21, 3884, 27, 48, 2478, 25, 3242, 13, 660, 20, 485, 1447, 800, 3726, 3726, 14, 1448, 25, 19, 14, 581, 13, 8, 13, 660, 25, 2462, 863, 13693, 17, 25, 1148, 30, 80, 25, 21, 3884, 946, 1447, 13, 8, 13, 2460, 17, 13, 12985, ...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 tools do you design software with? === Years ago, I used to use Rational Rose. It was big and bulky, and I only used a subset of the features, but it got the job done. Lately (last few years or so), I've just been sitting down with sheets of plain white paper and a pencil. I usually break out a UML cheat sheet and just iterate over the problem. What tools do people use today? (class diagrams and state diagrams would be essential, code generation not so much).
0
[ 2, 98, 4672, 107, 42, 704, 2306, 29, 60, 800, 3726, 3726, 122, 1464, 15, 31, 147, 20, 275, 7511, 1092, 9, 32, 23, 580, 17, 7238, 93, 15, 17, 31, 104, 147, 21, 16622, 16, 14, 967, 15, 47, 32, 330, 14, 1205, 677, 9, 10434, 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...
Is there a good way to have a Map<String, ?> get and put ignore case? === Is there a good way to have a Map<String, ?> get and put ignore case?
0
[ 2, 25, 80, 21, 254, 161, 20, 57, 21, 2942, 1, 11130, 15, 13, 60, 1, 164, 17, 442, 7174, 610, 60, 800, 3726, 3726, 25, 80, 21, 254, 161, 20, 57, 21, 2942, 1, 11130, 15, 13, 60, 1, 164, 17, 442, 7174, 610, 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...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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...
get ResultSet from Spring-JDBC === I'm using Spring's support for JDBC. I'd like to use [JdbcTemplate][1] (or SimpleJdbcTemplate) to execute a query and obtain the result as an instance of ResultSet. The only way that I can see of achieving this is using: String sql = "select * from...."; SqlRowSet results = jdbcTemplate.queryForRowSet(sql); ((ResultSetWrappingSqlRowSet) results).getResultSet(); An obvious shortcoming of this approach is that it requires me to make an assumption (by casting) about the implementation type of SqlRowSet, but is there a better way? **Background info...** The reason I want to obtain the results as a ResultSet, rather than a collection of beans, is because the results will be passed straight to a Jasper report for display. In other words, the Java bean would be used for nothing other than temporarily storing each row in the ResultSet, and I'd like to avoid creating such a bean for every Jasper report if possible. Cheers, Don [1]: http://static.springframework.org/spring/docs/2.5.x/api/org/springframework/jdbc/core/JdbcTemplate.html
0
[ 2, 164, 1736, 1198, 37, 1573, 8, 728, 43, 7229, 800, 3726, 3726, 31, 22, 79, 568, 1573, 22, 18, 555, 26, 487, 43, 7229, 9, 31, 22, 43, 101, 20, 275, 636, 728, 43, 7229, 9577, 6554, 500, 2558, 165, 500, 13, 5, 248, 1935, 728,...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 someone describe the landscape of the CMS world? === I'm going to be creating a site that's an aggregation of personal activities like Delicious, twitter, last.fm, etc. along with a blog. I'd like to try a CMS to manage/develop this site, but there's several very strong competitors: Joomla, Drupal, Xoops, Wordpress, etc. Language is not an issue, as a Java dev I'll be learning as I go regardless of implementation language, although I will admit I've been looking for a reason to use Python. So the question is this: Can anyone give me or link me to a balanced, concise summary of the strengths, weaknesses, and features of the most popular/best CMSs?
0
[ 2, 92, 737, 4996, 14, 4453, 16, 14, 2390, 18, 126, 60, 800, 3726, 3726, 31, 22, 79, 228, 20, 44, 2936, 21, 689, 30, 22, 18, 40, 27255, 16, 1319, 1648, 101, 12208, 15, 10623, 15, 236, 9, 5223, 15, 2722, 9, 303, 29, 21, 8146, ...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 create a PDF from XML in Java? === At the moment, I'm creating an XML file in Java and displaying it in a JSP page by transforming it with XSL/XSLT. Now I need to take that XML file and display the same information in a PDF. Is there a way I can do this by using some kind of XSL file? I've seen the [iText][1] Java-PDF library, but I can't find any way to use it with XML and a stylesheet. Any assistance would be much appreciated. Thanks in advance! [1]: http://www.lowagie.com/iText/
0
[ 2, 184, 107, 42, 1600, 21, 13, 11124, 37, 23504, 19, 8247, 60, 800, 3726, 3726, 35, 14, 688, 15, 31, 22, 79, 2936, 40, 23504, 3893, 19, 8247, 17, 17418, 32, 19, 21, 487, 3401, 2478, 34, 22335, 32, 29, 993, 18, 255, 118, 396, ...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1...
Has anyone used DotNetRemoting? === [DotNetRemoting][1] [1]: http://dotnetremoting.com/home.aspx They claim to have all the power of WCF but a lot simpler to implement and use. Does anyone here have any experience with using their product, and if so, have there been any problems with it?
0
[ 2, 63, 1276, 147, 14123, 2328, 99, 7662, 68, 60, 800, 3726, 3726, 636, 12527, 2328, 99, 7662, 68, 500, 2558, 165, 500, 636, 165, 500, 45, 7775, 6903, 12527, 2328, 99, 7662, 68, 9, 960, 118, 8167, 9, 472, 306, 396, 59, 2632, 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...
Drop Down List Issue === I’m having an issue where a drop down list in IE 6/7 is behaving as such: ![alt text][1] You can see that the drop down width is not wide enough to display the whole text without expanding the overall drop down list. However in Firefox, there is no issue as it expands the width accordingly. This is the behaviour we want in IE 6/7: ![alt text][2] We’ve looked at various ways to utilize the onfocus, onblur, onchange, keyboard and mouse events to attempt to solve the problem but still some issues. I was wondering if anyone has solved this issue in IE 6/7 without using any toolkits/frameworks (YUI, Ext-JS, jQuery, etc…). [1]: http://i488.photobucket.com/albums/rr249/djfloetic/ie7.jpg [2]: http://i488.photobucket.com/albums/rr249/djfloetic/firefox.jpg
0
[ 2, 2804, 125, 968, 1513, 800, 3726, 3726, 31, 1, 79, 452, 40, 1513, 113, 21, 2804, 125, 968, 19, 13, 660, 13, 12626, 465, 25, 44, 13693, 28, 145, 45, 13, 187, 2558, 192, 38, 1854, 500, 2558, 165, 500, 42, 92, 196, 30, 14, 28...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 detect sql server connection leaks in a ASP.net applications ? === I'm currently doing some GUI testing on a ASP.net 2.0 application. The RDBMS is SQL Server 2005. The host is Win Server 2003 / IIS 6.0. I do not have the source code of the application because it was programmed by an external company who's not releasing the code. I've noticed that the application performs well when I restart IIS but after some testing, after I have opened and closed my browser for a couple of hours, the application starts to get slower and slower. I was wondering if this behaviour was due to a bad closing connection practice from the programmers : I'm suspecting an open connection leak on the database here. I guess the .Net garbage collector will eventually close them but... that can take a while, no? I've got SQL Server Management Studio and I do notice from the activity monitor that there are quite a few connecions opened on the database from the activity monitor. So, from all that's being said above, here are some questions related to the main question : 1. Is there any way to know in SQL Server 2005 if connections are open because they're waiting to be used in a connection pool or if they're open because they are used by an application? 2. Does somone know of good online/paper resources where I could learn how to use performance counters or some other kind of tools to help track down these kind of issues? 3. If performance counters are the best solution, what are the variables that I should watch?
0
[ 2, 184, 20, 9092, 4444, 255, 8128, 2760, 11724, 18, 19, 21, 28, 306, 9, 2328, 3767, 13, 60, 800, 3726, 3726, 31, 22, 79, 871, 845, 109, 9457, 4431, 27, 21, 28, 306, 9, 2328, 172, 9, 387, 3010, 9, 14, 13, 897, 13178, 18, 25, ...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1...
Microsoft Access query seen as a Function or View by Visual Studio 2005 === I have a **Microsoft Access** database query that I'm trying to import into a **Visual Studio 2005** dataset. When the query is formed using an **NZ()** function like this: SELECT NZ(tblComponentSpecs.nPurchaseCostQuantity, 0) AS Quantity FROM tblComponentSpecs; it appears under the **<u>Functions</u>** list in the Data Connection. However, when the query is formed using an **IIF()** function like this: SELECT IIF(tblComponentSpecs.nPurchaseCostQuantity Is Null, 0, nPurchaseCostQuantity) AS Quantity FROM tblComponentSpecs; it appears under the **<u>Views</u>** list. Can anyone please explain why?
0
[ 2, 7099, 1381, 25597, 541, 28, 21, 1990, 54, 1418, 34, 3458, 1120, 812, 800, 3726, 3726, 31, 57, 21, 13, 1409, 22019, 12980, 1381, 1409, 6018, 25597, 30, 31, 22, 79, 749, 20, 9010, 77, 21, 13, 1409, 20893, 1120, 812, 1409, 1054, ...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1...
SQL Server xp_delete_file not deleting files === I'm trying to write some SQL that will delete files of type '.7z' that are older than 7 days. Here's what I've got that's not working: DECLARE @DateString CHAR(8) SET @DateString = CONVERT(CHAR(8), DATEADD(d, -7, GETDATE()), 1) EXECUTE master.dbo.xp_delete_file 0, N'e:\Database Backups',N'7z', @DateString, 1 I've also tried changing the '1' a the end to a '0'. This returns 'success', but the files aren't getting deleted. I'm using SQL Server 2005, Standard, w/SP2 Thank you
0
[ 2, 4444, 255, 8128, 23045, 1, 24249, 591, 1, 16877, 52, 121, 1336, 68, 6488, 800, 3726, 3726, 31, 22, 79, 749, 20, 2757, 109, 4444, 255, 30, 129, 27448, 6488, 16, 1001, 13, 22, 9, 465, 380, 22, 30, 50, 1234, 119, 453, 509, 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...
Can I create a PHP function that I can call without parantheses? === I have a function that is effectively a replacement for <tt>print</tt>, and I want to call it without parentheses, just like calling <tt>print</tt>. # Replace print $foo, $bar, "\n"; # with myprint $foo, $bar, "\n"; In Perl, you can create subroutines with parameter templates and it allows exactly this behavior if you define a subroutine as sub myprint(@) { ... } Anything similar in PHP?
0
[ 2, 92, 31, 1600, 21, 13, 26120, 1990, 30, 31, 92, 645, 366, 2258, 103, 11836, 18, 60, 800, 3726, 3726, 31, 57, 21, 1990, 30, 25, 5463, 21, 4610, 26, 13, 1, 38, 38, 1, 10299, 1, 118, 38, 38, 1, 15, 17, 31, 259, 20, 645, 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...
Should a method that implements an interface method be annotated with @Override === Intro ----- My real question is about the use of the annotation. Trying to find an answer myself, I ran into several other questions. This is why there are also related questions below. I hope this is not too confusing. Question -------- Should a method that implements an interface method be annotated with `@Override`? Eclipse for instance automatically inserts an `@Override` annotation after using the Quick Fix option 'Add unimplemented methods'. Is this correct behavior? The [javadoc of the `Override` annotation][1] says: > Indicates that a method declaration is intended to override a method declaration in a superclass. If a method is annotated with this annotation type but does not override a superclass method, compilers are required to generate an error message. I don't think that an interface is technically a superclass. Or is it? Compilers don't generate an error at least when the annotation is used in this case. Eclipse can give warnings if you omit this annotation for overriding ''real'' superclass methods. It doesn't if you omit it for interface methods. Or is this a glitch in Eclipse? The reason this worries me a little bit, is that I try to be consistent. But if the IDE doesn't give warnings when the annotation is not there and automatically generates them on the other hand, consistency is rather difficult. [1]: http://java.sun.com/javase/6/docs/api/java/lang/Override.html
0
[ 2, 378, 21, 2109, 30, 8713, 18, 40, 6573, 2109, 44, 40, 1270, 1669, 29, 13, 1, 2549, 11891, 800, 3726, 3726, 17386, 13, 8, 8, 8, 8, 8, 51, 683, 1301, 25, 88, 14, 275, 16, 14, 40, 1270, 857, 9, 749, 20, 477, 40, 1623, 992, ...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 Application for storing code === Just wondering if you can point me in the direction of a simple, fast program which stores code snippets. I have been using a local wiki up to now, but I find it a little annoying at times. Ideally I would like this application to be portable - i.e. it could run off of a USB stick on multiple machines with no installation. What do you guys use?
4
[ 2, 246, 3010, 26, 25615, 1797, 800, 3726, 3726, 114, 5712, 100, 42, 92, 454, 55, 19, 14, 1400, 16, 21, 1935, 15, 1512, 625, 56, 4134, 1797, 13, 29061, 18, 9, 31, 57, 74, 568, 21, 375, 13, 17375, 71, 20, 130, 15, 47, 31, 477,...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1...
NAnt for native code environment === does anyone know any good tutorial about using nant for native code build process instructions?
0
[ 2, 13, 11028, 26, 1275, 1797, 2307, 800, 3726, 3726, 630, 1276, 143, 186, 254, 29724, 88, 568, 13, 11028, 26, 1275, 1797, 1895, 953, 7650, 60, 3, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, ...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
Which log4j Version is bundled with latest OpenCms 7? === Which log4j Version is bundled with latest OpenCms 7?
0
[ 2, 56, 6738, 300, 728, 615, 25, 10194, 43, 29, 5736, 368, 9095, 18, 453, 60, 800, 3726, 3726, 56, 6738, 300, 728, 615, 25, 10194, 43, 29, 5736, 368, 9095, 18, 453, 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...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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...
How does _ftime work? === I have found an interesting issue in windows which allows me to cause the Windows clock (but not the hardware clocks) to run fast - as much as 8 seconds every minute. I am doing some background research to work out how Windows calculates and updates it's internal time (not how it syncs with an NTP servers). Any information anyone has or any documents you can point me to would be greatly appreciated!
0
[ 2, 184, 630, 13, 1, 410, 891, 170, 60, 800, 3726, 3726, 31, 57, 216, 40, 4883, 1513, 19, 1936, 56, 2965, 55, 20, 1679, 14, 1936, 4229, 13, 5, 811, 52, 14, 7610, 4229, 18, 6, 20, 485, 1512, 13, 8, 28, 212, 28, 469, 2582, 35...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1...
How do I disable query results when executing a stored procedure from a stored procedure? === Within a stored procedure, another stored procedure is being called within a cursor. For every call, the SQL Management Studio results window is showing a result. The cursor loops over 100 times and at that point the results window gives up with an error. Is there a way I can stop the stored procedure within the cursor from outputting any results? WHILE @@FETCH_STATUS = 0 BEGIN EXEC @RC = dbo.NoisyProc SELECT @RValue2 = 1 WHERE @@ROWCOUNT = 0 FETCH NEXT FROM RCursor INTO @RValue1, @RValue2 END Thanks!
0
[ 2, 184, 107, 31, 1460, 579, 25597, 1736, 76, 25836, 21, 8214, 7004, 37, 21, 8214, 7004, 60, 800, 3726, 3726, 363, 21, 8214, 7004, 15, 226, 8214, 7004, 25, 142, 227, 363, 21, 29588, 9, 26, 352, 645, 15, 14, 4444, 255, 1097, 1120,...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1...
Lua Library for Jabber === Does anyone know of a Jabber library for Lua? I've found the 'Lua Messaging Library' for AIM, although I can't find a download for it, it appears to be abandoned. Something like that for Lua would be helpful. Thanks RyanE
0
[ 2, 1612, 58, 1248, 26, 11284, 2102, 800, 3726, 3726, 630, 1276, 143, 16, 21, 11284, 2102, 1248, 26, 1612, 58, 60, 31, 22, 195, 216, 14, 13, 22, 2377, 58, 26437, 1248, 22, 26, 5226, 15, 419, 31, 92, 22, 38, 477, 21, 7121, 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...
Informix for beginner === What is Informix? I understand that it is DBMS, how well it is comparing to SQL server in terms of learning difficulties and syntax? How to start learning INformix? And may I know the "hello world" tutorial?
0
[ 2, 10361, 4028, 26, 26931, 800, 3726, 3726, 98, 25, 10361, 4028, 60, 31, 1369, 30, 32, 25, 13, 43, 13178, 18, 15, 184, 134, 32, 25, 15047, 20, 4444, 255, 8128, 19, 1663, 16, 2477, 8075, 17, 22649, 60, 184, 20, 799, 2477, 10361, ...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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...
Do the concepts in Accelerated C++ Practical Programming by Example still hold up today? === I was recommeded a book called: Accelerated C++ Practical Programming by Example by Andrew Koenig and Barbara E. Moo Addison-Wesley, 2000 ISBN 0-201-70353-X The basis of this book is that Object Oriented Programming is highly wasteful memory-wise, and that most source-code should not be written this way, rather that you should use all inline function calls and procedural programming. I mean I know most programming books have about the same shelf life as milk, but if your coding a client/server application (database, server and all) (not a device driver or a video game) is it really worth the hassle of having un-maintainable code just for a speed boost? Or is it worth it just to make the application run on a client's really old machine? Or to be able to run more servers on a single box?
0
[ 2, 107, 14, 8700, 19, 16878, 272, 20512, 5713, 3143, 34, 823, 174, 1027, 71, 786, 60, 800, 3726, 3726, 31, 23, 302, 960, 4688, 69, 21, 360, 227, 45, 16878, 272, 20512, 5713, 3143, 34, 823, 34, 2376, 1584, 219, 2816, 17, 5552, 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...
How do I generate a table of permissions granted to database tables for a database user? === I have a SQL Server 2000 database with around a couple of hundred tables. There are several SQL user accounts that can access this database but each one has different permissions granted on tables in the DB. How do I create a script to give me a report of the permissions granted to a particular user. i.e. to generate something like: Table SELECT DELETE UPDATE INSERT ALTER ----- ------ ------ ------ ------ ----- Invoices Yes No Yes Yes No Orders Yes Yes Yes Yes No Customers Yes No Yes Yes No and so on. It's Friday, my SQL-fu is low today and I have a million other things to do before getting finished here today and if someone had a handy script to do this already then I would be eternally grateful :) Appreciated. Kev
0
[ 2, 184, 107, 31, 7920, 21, 859, 16, 5572, 18, 2743, 20, 6018, 7484, 26, 21, 6018, 4155, 60, 800, 3726, 3726, 31, 57, 21, 4444, 255, 8128, 824, 6018, 29, 140, 21, 1335, 16, 1874, 7484, 9, 80, 50, 238, 4444, 255, 4155, 5310, 30,...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1...
How do you reduce Java logging boilerplate code? === Every class that wants to use java.util.logging generally needs to declare a logger like this: public class MyClass { private static Logger _log = Logger.getLogger(MyClass.class.getName()); } How do you avoid this MyClass.class.getName() boilerplate code?
0
[ 2, 184, 107, 42, 4136, 8247, 13, 13919, 11755, 13095, 1797, 60, 800, 3726, 3726, 352, 718, 30, 2846, 20, 275, 8247, 9, 14255, 9, 13919, 1469, 2274, 20, 10123, 21, 13, 29480, 101, 48, 45, 317, 718, 51, 1898, 13, 1, 932, 12038, 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...
How does CSS clearing really work? === I have a `<div>` that I want to be on a line by itself. According to <a href="http://www.w3schools.com/Css/pr_class_clear.asp">W3Schools</a>, this rule: div.foo { clear: both; } ...should mean this: > "No floating elements allowed on either the left or the right side." However, if I float two `<div>` elements left, and apply the rule above to the first one, the second one does not budge. On the other hand, if I apply `"clear: left"` to the second `<div>`, it moves down to the next line. This is my normal approach, but I don't understand why I have to do it like this. Is the W3Schools description above poorly stated, or am I missing something? **Is a clearing rule only able to move the element to which it is applied?**
0
[ 2, 184, 630, 272, 18, 18, 8130, 510, 170, 60, 800, 3726, 3726, 31, 57, 21, 13, 1, 12916, 1, 30, 31, 259, 20, 44, 27, 21, 293, 34, 1145, 9, 496, 20, 13, 1, 58, 746, 14057, 3726, 7, 21127, 6903, 6483, 9, 499, 240, 7535, 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...
Resting a Pic18 from ‘C’ === What is the best way to reset a Pic18 using C code With the HiTech Pic18 ‘c’ compiler
0
[ 2, 8317, 21, 9327, 1087, 37, 13, 1, 150, 1, 800, 3726, 3726, 98, 25, 14, 246, 161, 20, 23422, 21, 9327, 1087, 568, 272, 1797, 29, 14, 770, 7455, 9327, 1087, 13, 1, 150, 1, 21486, 3, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, ...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
Subversion: what does "Target path does not exist" when merging mean? === Using subversion 1.5 I have branch B which was branched off of branch A. After doing work in both branches I go to merge changes from A into B (using `svn merge http://path/to/A` in the working directory of B) and get `svn: Target path does not exist`. What does this mean?
0
[ 2, 972, 10898, 45, 98, 630, 13, 7, 3958, 3060, 2013, 630, 52, 3182, 7, 76, 18842, 884, 60, 800, 3726, 3726, 568, 972, 10898, 137, 9, 264, 31, 57, 1686, 334, 56, 23, 1686, 69, 168, 16, 1686, 21, 9, 75, 845, 170, 19, 156, 4395...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1...
Opening a file in kernel space in Python === Is it possible to open a file in kernel space in Python on Windows Vista? I'm trying to use the giveio.sys driver which requires a kernel space file to be opened before you can access protected memory. I'm looking at a C example from WinAVR/AVRdude that uses the syntax: #define DRIVERNAME "\\\\.\\giveio" HANDLE h = CreateFile(DRIVERNAME, GENERIC_READ, 0, NULL, OPEN_EXISTING, FILE_ATTRIBUTE_NORMAL, NULL); but this does not seem to work in Python - I just get a "The specified path is invalid" error.
0
[ 2, 1214, 21, 3893, 19, 17007, 726, 19, 20059, 800, 3726, 3726, 25, 32, 938, 20, 368, 21, 3893, 19, 17007, 726, 19, 20059, 27, 1936, 13520, 60, 31, 22, 79, 749, 20, 275, 14, 590, 1963, 9, 4980, 18, 2425, 56, 4781, 21, 17007, 72...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1...
When do I use the TestFixtureSetUp attribute instead of a default constructor? === The NUnit documentation doesn't tell me when to use a method with a testfixturesetup en when to do the setup in the constructor public class MyTest { private MyClass myClass; public MyTest() { myClass = new MyClass(); } [TestFixtureSetUp] public void Init() { myClass = new MyClass(); } } Are there any good/bad practices about the TestFixtureSetup versus default constructor or isn't there any difference?
0
[ 2, 76, 107, 31, 275, 14, 1289, 18594, 6418, 3554, 576, 35, 14755, 700, 16, 21, 12838, 6960, 248, 60, 800, 3726, 3726, 14, 10210, 242, 13945, 1437, 22, 38, 494, 55, 76, 20, 275, 21, 2109, 29, 21, 1289, 18594, 6418, 3554, 576, 195...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 Automatically start your service after install? === How do you automatically start a service after running an install from a Visual Studio Setup Project? I just figured this one out and thought I would share the answer for the general good. Answer to follow. I am open to other and better ways of doing this.
0
[ 2, 184, 20, 7499, 799, 154, 365, 75, 16146, 60, 800, 3726, 3726, 184, 107, 42, 7499, 799, 21, 365, 75, 946, 40, 16146, 37, 21, 3458, 1120, 18161, 669, 60, 31, 114, 5700, 48, 53, 70, 17, 289, 31, 83, 1891, 14, 1623, 26, 14, 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...
OS X command line text conversion === OS X 10.5.5 (though it does not matter much I guess) I have a set of text files with fancy characters like double backquotes, ellipses ("...") in one character etc. I need to convert these files to good old plain 7-bit ASCII, preferably without losing character meaning (that is, convert those ellipses to three periods, backquotes to usual "s etc.). Please advise some smart command-line (bash) tool/script to do that.
0
[ 2, 13, 759, 993, 1202, 293, 1854, 6263, 800, 3726, 3726, 13, 759, 993, 332, 9, 264, 9, 264, 13, 5, 9371, 32, 630, 52, 1161, 212, 31, 2321, 6, 31, 57, 21, 309, 16, 1854, 6488, 29, 12251, 1766, 101, 1494, 97, 8970, 3231, 15, 1...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1...
How to write a test method in NUnit for testing a savefile method? === I wrote a savefile method to save an object to xml. But I am not sure how to test the method in NUnit. Do I need create a sample file manually and compare the string between the files? Are there any better ways to test the method? Thanks for your answer.
0
[ 2, 184, 20, 2757, 21, 1289, 2109, 19, 10210, 242, 26, 4431, 21, 2079, 16877, 2109, 60, 800, 3726, 3726, 31, 738, 21, 2079, 16877, 2109, 20, 2079, 40, 3095, 20, 23504, 9, 47, 31, 589, 52, 562, 184, 20, 1289, 14, 2109, 19, 10210, ...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 "square" an image in .NET? === I need generate [thumbnails](http://stackoverflow.com/questions/27921/what-is-the-best-way-to-create-a-thumbnail-using-aspnet) for a bunch of jpegs (200,000+) but I want to make sure all of my thumbs have a equal height and width. However, I don't want to change the proportions of the image so I need to add empty space to the shorter dimension to "square it up". The empty space's background color is variable. Here's the code snippet I'm using to generate the thumbs. What's the best way to do the squaring? Dim imgDest As System.Drawing.Bitmap = New Bitmap(ScaleWidth, ScaleHeight) imgDest.SetResolution(TARGET_RESOLUTION, TARGET_RESOLUTION) Dim grDest As Graphics = Graphics.FromImage(imgDest) grDest.DrawImage(SourceImage, 0, 0, imgDest.Width, imgDest.Height)
0
[ 2, 98, 22, 18, 14, 246, 161, 20, 13, 7, 12300, 7, 40, 1961, 19, 13, 9, 2328, 60, 800, 3726, 3726, 31, 376, 7920, 636, 96, 723, 220, 325, 947, 18, 500, 5, 21127, 6903, 25325, 2549, 9990, 9, 960, 118, 24652, 18, 118, 24177, 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...
What online services mail coded postcards for address verification? === At about 24:20 in Stack Overflow [Podcast 26][1] Joel Spolsky said there are services that mail postcards with codes for address verification. > **Spolsky:** You know what we could have > badges for? We could have badges for > like: "Real Address". Like I have > proven that you live at a certain > address. > > **Atwood:** We could. > > **Spolsky:** And then certain things could > only be turned on if we can actually > go to your house. Not that we will. > But we could. > > **Atwood:** We could. > > **Spolsky:** And then you just use one of > these--there are these online services > that will mail a postcard to an > address with a, you know, with a code > on it, and if they type it in > correctly then you register that they > at least control the mail that goes to > that address. What companies offer these services? Have you used one? How was the experience? [1]: https://stackoverflow.fogbugz.com/default.asp?W25802
0
[ 2, 98, 2087, 687, 4216, 13, 22254, 678, 6648, 18, 26, 3218, 25056, 60, 800, 3726, 3726, 35, 88, 937, 45, 1323, 19, 7566, 20285, 636, 10670, 6146, 1262, 500, 2558, 165, 500, 8873, 13, 18, 7332, 2397, 87, 80, 50, 687, 30, 4216, 67...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1...
Keyboard interruptable blocking queue in Python === It seems import Queue Queue.Queue().get(timeout=10) is keyboard interruptible (ctrl-c) whereas import Queue Queue.Queue().get() is not. I could always create a loop; import Queue q = Queue() while True: try: q.get(timeout=1000) except Queue.Empty: pass but this seems like a strange thing to do. So, is there a way of getting an indefinitely waiting but keyboard interruptible Queue.get()?
0
[ 2, 8896, 15811, 579, 11828, 22521, 19, 20059, 800, 3726, 3726, 32, 2206, 9010, 22521, 22521, 9, 2005, 4185, 5, 6, 9, 3060, 5, 891, 1320, 3726, 1036, 6, 25, 8896, 15811, 3426, 13, 5, 4812, 6362, 8, 150, 6, 5142, 9010, 22521, 22521,...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 Java, how do I dynamically determine the type of an array ? === Object o = new Long[0] System.out.println( o.getClass().isArray() ) System.out.println( o.getClass().getName() ) Class ofArray = ??? Running the first 3 lines emits; true [Ljava.lang.Long; How do I get ??? to be type long? I could parse the string and do a Class.forname(), but thats grotty. What's the easy way?
0
[ 2, 19, 8247, 15, 184, 107, 31, 7782, 1326, 3746, 14, 1001, 16, 40, 7718, 13, 60, 800, 3726, 3726, 3095, 635, 800, 78, 175, 2558, 387, 500, 329, 9, 1320, 9, 10299, 16600, 5, 635, 9, 3060, 1898, 5, 6, 9, 403, 8576, 93, 5, 6, ...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1...
Is there a way to acces both a root App_Code folder and an App_Code folder in a sub directory in IIS 7.0? === I would love to be able to have a common set of Classes in my root App_Code folder, which is how we are set up right now. However, it doesn't make sense to put specific code there for some application residing in a sub directory. * Root Folder * App_Code * SubDirApp1 * App_Code * SubDirApp2 * App_Code We currently have each production application in it's own "Root" folder with it's own application pool. Then we just mirror the main root App_Code folder there.
0
[ 2, 25, 80, 21, 161, 20, 7602, 160, 156, 21, 5900, 4865, 1, 9375, 19294, 17, 40, 4865, 1, 9375, 19294, 19, 21, 972, 16755, 19, 595, 18, 453, 9, 387, 60, 800, 3726, 3726, 31, 83, 339, 20, 44, 777, 20, 57, 21, 757, 309, 16, 2...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1...
How force a maximum string length in a C# web service object property? === In this class for example, I want to force a limit of characters the first/last name can allow. public class Person { public string FirstName { get; set; } public string LastName { get; set; } } Is there a way to force the string limit restriction for the first or last name, so when the client serializes this before sending it to me, it would throw an error on their side if it violates the lenght restriction?
0
[ 2, 184, 558, 21, 2979, 3724, 1476, 19, 21, 272, 5910, 2741, 365, 3095, 1354, 60, 800, 3726, 3726, 19, 48, 718, 26, 823, 15, 31, 259, 20, 558, 21, 4496, 16, 1766, 14, 64, 118, 8558, 204, 92, 1655, 9, 317, 718, 840, 13, 1, 317...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 enable auto-completion for WebOb response/request objects in Pydev for Eclipse? === I've been using Pydev/Eclipse to develop Google App Engine (GAE) applications but I've been unable to get the response/request objects from WebOb to have auto-completion. I used a [widely recommended tutorial][1] to get everything configured; auto-completion is working for everything else I've run into. As an example: if I type in "self." I get auto-completion for response and request; if I select one of those, say "response", and add a "." (bringing the full line to "self.response." thus far) I don't get any options - since the WebOb library is included, I would expect to get things like "out.write()" as an option. I'm including the following libraries into my Pydev project: - C:\Program Files\Google\google_appengine - C:\Program Files\Google\google_appengine\lib\django - C:\Program Files\Google\google_appengine\lib\webob - C:\Program Files\Google\google_appengine\lib\yaml\lib Any help would be much appreciated, thanks. [1]: http://code.google.com/appengine/articles/eclipse.html
0
[ 2, 184, 107, 42, 9240, 3108, 8, 11103, 1336, 872, 26, 95, 12570, 1627, 118, 99, 10351, 3916, 19, 7103, 14438, 26, 11652, 60, 800, 3726, 3726, 31, 22, 195, 74, 568, 7103, 14438, 118, 3319, 6013, 870, 20, 2803, 8144, 4865, 1406, 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...
How does Vista decide which programs should be closed when low on memory? === Vista displays the dialog "Close programs to prevent information loss" when the system is low on virtual memory. In this dialog it names programs you should close. People have reported to me that it sometimes names the program I develop. How does Vista decide which programs should be closed? I'm wondering if this dialog is telling me that my program is at fault, or if it's just being named for some other reason (such as it was the last program to be started). Thanks.
0
[ 2, 184, 630, 13520, 4073, 56, 1726, 378, 44, 827, 76, 708, 27, 1912, 60, 800, 3726, 3726, 13520, 9412, 14, 28223, 13, 7, 14330, 1726, 20, 2501, 676, 1526, 7, 76, 14, 329, 25, 708, 27, 6599, 1912, 9, 19, 48, 28223, 32, 1817, 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...
How to test custom SOAP Headers in ASMX. === The test form generated by ASMX is pretty handy for testing operations. However, there is no apparent way to include SOAP headers.
0
[ 2, 184, 20, 1289, 5816, 6447, 157, 445, 19, 28, 79, 396, 9, 800, 3726, 3726, 14, 1289, 505, 6756, 34, 28, 79, 396, 25, 1772, 20277, 26, 4431, 1311, 9, 207, 15, 80, 25, 90, 5982, 161, 20, 468, 6447, 157, 445, 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...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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...
Best version control system for a non-networked environment? === I am mentoring the programming group of a high school robotics team. I would like to set up a source control repository to avoid the mess of manually copying directories for sharing/backups and merging these by hand. The build location will not usually have network access, so this has led me to distributed version control systems (DCVS), which I am not familiar with. The largest requirements are the following: 0. Works in Windows XP and Vista. (absolute must) 1. Changes can be committed locally. (Seems to be the case with all DCVS's) 2. Repositories from multiple machines can be merged without network access. (Possibly by storing the repository on a USB drive and swapping the drive to another machine, then merging from there) It should also be easy to learn and use, preferably through a graphical UI, as I am working with high school students who have never used a version control system. Any suggestions as to which DCVS fits this the best.
0
[ 2, 246, 615, 569, 329, 26, 21, 538, 8, 24106, 69, 2307, 60, 800, 3726, 3726, 31, 589, 7656, 68, 14, 3143, 214, 16, 21, 183, 116, 15219, 18, 173, 9, 31, 83, 101, 20, 309, 71, 21, 1267, 569, 24869, 20, 2658, 14, 3957, 16, 2367...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1...
Scrum/Agile: How do you plan in internal improvements? === I have now worked on two different teams that use the Agile/Scrum approach in the last two years and both teams were eager to improve the way they approach software development. In the first team, we could easily convince our product owner to get time for internal things like improving the build system, setting up better integration tests, having a better release strategy etc. Right now the PO is also willing to give us time, but he is more pushing back, which is reasonable as he also must get his things done. Anyway my question is now, how do other teams handle this? Do you create an improvement story and put it on the table during planning or do you keep a "bucket" of time around for such things? How difficult is it in your experience to convince the product owner to do get time for improving? After all these kind of improvements will benefit the team, but not directly or immediately the prodcut owner/business.
0
[ 2, 26562, 118, 14482, 413, 45, 184, 107, 42, 944, 19, 3117, 7951, 60, 800, 3726, 3726, 31, 57, 130, 577, 27, 81, 421, 952, 30, 275, 14, 27475, 118, 18, 25241, 2141, 19, 14, 236, 81, 122, 17, 156, 952, 46, 8705, 20, 3545, 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...
drop down list validation === I'm working on a web app project (in java; not that it matters) and we have a form with drop down lists and input fields,etc.. Obviously drop down lists are provided because we expect a specific value from a set of values. So my question is this..**does it make sense to ensure the submitted value is in the set of expected values? Or is it acceptable to just assume the correct value is coming across?** There aren't any "errors" that would arise from different values being submitted, but the data store would not be consistent with the business rules/requirements.
0
[ 2, 2804, 125, 968, 27999, 800, 3726, 3726, 31, 22, 79, 638, 27, 21, 2741, 4865, 669, 13, 5, 108, 8247, 73, 52, 30, 32, 4556, 6, 17, 95, 57, 21, 505, 29, 2804, 125, 7227, 17, 6367, 2861, 15, 1198, 150, 9, 9, 4409, 2804, 125, ...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1...
Usability hints for building an adult web site? === What are the usability considerations that should be taken into account by anyone who decided to build a good adult web site?
0
[ 2, 182, 4091, 6382, 18, 26, 353, 40, 3035, 2741, 689, 60, 800, 3726, 3726, 98, 50, 14, 182, 4091, 20478, 30, 378, 44, 658, 77, 2176, 34, 1276, 72, 868, 20, 1895, 21, 254, 3035, 2741, 689, 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...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 can I run NUnit(Selenium Grid) tests in parallel? === My current project uses NUnit for unit tests and to drive UATs written with Selenium. Developers normally run tests using ReSharper's test runner in VS.Net 2003 and our build box kicks them off via NAnt. We would like to run the UAT tests in parallel so that we can take advantage of Selenium Grid/RCs so that they will be able to run much faster. Does anyone have any thoughts on how this might be achieved? and/or best practices for testing Selenium tests against multiple browsers environments without writing duplicate tests automatically? Thank you.
0
[ 2, 184, 92, 31, 485, 10210, 242, 5, 18, 20110, 2187, 7354, 6, 4894, 19, 3821, 60, 800, 3726, 3726, 51, 866, 669, 2027, 10210, 242, 26, 1237, 4894, 17, 20, 1493, 287, 721, 18, 642, 29, 23027, 14311, 9, 10168, 4147, 485, 4894, 568...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 the .NET Framework, CLR and Visual Studio version numbers relate to each other === With the recent announcement of .NET 4.0 and Visual Studio 2010, it is becoming ever more difficult to keep track of what .NET Framework versions build on what version of the CLR and belong with which version(s) of Visual Studio. Is there a definative table that shows these relationships?
0
[ 2, 184, 107, 14, 13, 9, 2328, 6596, 15, 10842, 139, 17, 3458, 1120, 615, 2116, 16464, 20, 206, 89, 800, 3726, 3726, 29, 14, 1764, 7435, 16, 13, 9, 2328, 268, 9, 387, 17, 3458, 1120, 498, 15, 32, 25, 1535, 462, 91, 1956, 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...
Advantages of Antlr (versus say, lex/yacc/bison) === I've used lex and yacc (more usually bison) in the past for various projects, usually translators (such as a subset of EDIF streamed into an EDA app). Additionally, I've had to support code based on lex/yacc grammars dating back decades. So I know my way around the tools, though I'm no expert. I've seen positive comments about Antlr in various fora in the past, and I'm curious as to what I may be missing. So if you've used both, please tell me what's better or more advanced in Antlr. My current constraints are that I work in a C++ shop, and any product we ship will not include Java, so the resulting parsers would have to follow that rule.
0
[ 2, 14683, 16, 40, 38, 12988, 13, 5, 5498, 267, 395, 15, 13492, 118, 1046, 3384, 118, 2161, 528, 6, 800, 3726, 3726, 31, 22, 195, 147, 13492, 17, 2167, 3384, 13, 5, 1995, 951, 22696, 6, 19, 14, 640, 26, 617, 2314, 15, 951, 1088...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1...
Where is the official, extensive, complete documentation on web.config? === I'm trying to find about ALL the possible options that I can set in web.config. Surprisingly, I can't find this at all (i'm expecting it to be somewhere inside msdn.microsoft.com) I know I can technically add "anything" to web.config, what i'm looking for is the things that the .Net Framework "as shipped" uses. In particular, right now i'm interested in the <mailsettings> section. For example, in many examples i've found, i noticed that they set DeliveryMethod="Network". I'm really curious what other values this attribute can take. Is there any document on all the attributes and all their values, and all the effects those have? Thanks!
0
[ 2, 113, 25, 14, 989, 15, 3386, 15, 1279, 13945, 27, 2741, 9, 14093, 2816, 60, 800, 3726, 3726, 31, 22, 79, 749, 20, 477, 88, 65, 14, 938, 6368, 30, 31, 92, 309, 19, 2741, 9, 14093, 2816, 9, 11701, 15, 31, 92, 22, 38, 477, ...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1...
Script to associate an extension to a program === My customer is replacing MS Office with OpenOffice in some workstations. My program export a file to Excel using the .xml extension (using open format) and opens it using the current associated program (using ShellExecute) The problem is that OpenOffice does not register the .xml extension associated with it. Manually association works fine, but I want to make a .reg or something to easily change the setting. I'm looking in the registry in a PC with the change already made, but the "HKEY_CLASSES_ROOT\.xml" key does not have anything referencing OpenOffice. Where is the association stored? How can I make a script to do the work?
0
[ 2, 3884, 20, 4169, 40, 3896, 20, 21, 625, 800, 3726, 3726, 51, 7705, 25, 5496, 4235, 488, 29, 368, 17047, 19, 109, 170, 10839, 18, 9, 51, 625, 7487, 21, 3893, 20, 20700, 568, 14, 13, 9, 396, 8184, 3896, 13, 5, 12655, 368, 2595...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 permissions of a directory to be owned by Everyone with all access === I need to change the permissions of a directory to be owned by the Everyone user with all access rights on this directory. I'm a bit new to the Win32 API, so I'm somewhat lost in the SetSecurity* functions.
0
[ 2, 309, 5572, 18, 16, 21, 16755, 20, 44, 1467, 34, 1266, 29, 65, 1381, 800, 3726, 3726, 31, 376, 20, 753, 14, 5572, 18, 16, 21, 16755, 20, 44, 1467, 34, 14, 1266, 4155, 29, 65, 1381, 1096, 27, 48, 16755, 9, 31, 22, 79, 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...
OLE Client in SDI. Want to add a toolbar === I have an SDI that I'm loading Excel into using OLE. I want to add a toolbar to this that I an use to have a very prominent and evident "import" button (and a few others). The toolbars I add through MFC are all hidden or otherwise removed from the interface when Excel becomes active. Is there a way to keep a toolbar up and on the interface when the Excel Ole item becomes active? I've tried calling the FloatControlBar after the Excel OLE item is initialized, but it had no effect. I thought of twisting the menu (which does remain and behave normally) into a toolbar, but it would need to be docked on the left side (requirement) and have large, visible graphic depiction for the command ... and I haven't found a way to do that. CMenu class allows graphical menu items, but I haven't spotted a way to do much with the menu command itself (other than get its commandid in the message table).
0
[ 2, 12116, 6819, 19, 13, 18, 1115, 9, 259, 20, 3547, 21, 5607, 1850, 800, 3726, 3726, 31, 57, 40, 13, 18, 1115, 30, 31, 22, 79, 12797, 20700, 77, 568, 12116, 9, 31, 259, 20, 3547, 21, 5607, 1850, 20, 48, 30, 31, 40, 275, 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...
Allow null in a mysql column === Mysql 5.0.45 What is the syntax to alter a table to allow a column to be null, alternately what's wrong with this: ALTER mytable MODIFY mycolumn varchar(255) null; I interpreted the manual as just run the above and it would recreate the column, this time allowing null. The server is telling me I have syntactical errors. I just don't see them.
0
[ 2, 1655, 16203, 19, 21, 51, 18, 22402, 4698, 800, 3726, 3726, 51, 18, 22402, 331, 9, 387, 9, 2520, 98, 25, 14, 22649, 20, 7835, 21, 859, 20, 1655, 21, 4698, 20, 44, 16203, 15, 4912, 102, 98, 22, 18, 1389, 29, 48, 45, 7835, 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...
Using django-rest-interface === I have a django application that I'd like to add some rest interfaces to. I've seen http://code.google.com/p/django-rest-interface/ but it seems to be pretty simplistic. For instance it doesn't seem to have a way of enforcing security. How would I go about limiting what people can view and manipulate through the rest interface? Normally I'd put this kind of logic in my views. Is this the right place or should I be moving some more logic down into the model? Alternatively is there a better library out there or do I need to roll my own?
0
[ 2, 568, 3857, 14541, 8, 11466, 8, 6280, 6413, 800, 3726, 3726, 31, 57, 21, 3857, 14541, 3010, 30, 31, 22, 43, 101, 20, 3547, 109, 760, 6573, 18, 20, 9, 31, 22, 195, 541, 7775, 6903, 9375, 9, 16111, 4875, 9, 960, 118, 306, 118,...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1...
Many to Many delete cascade in NHibernate === I have a scenario in a system which I've tried to simplify as best as I can. We have a table of (lets call them) artefacts, artefacts can be accessed by any number of security roles and security roles can access any number of artefacts. As such, we have 3 tables in the database - one describing artefacts, one describing roles and a many-to-many association table linking artefact ID to Role ID. Domain wise, we have two classes - one for a role and one for an artefact. the artefact class has an IList property that returns a list of roles that can access it. (Roles however do not offer a property to get artefacts that can be accessed). As such, the nhibernate mapping for artefact contains the following; <bag name="AccessRoles" table="ArtefactAccess" order-by="RoleID" lazy="true" access="field.camelcase-underscore" optimistic-lock="false"> <key column="ArtefactID"/> <many-to-many class="Role" column="RoleID"/> </bag> This all works fine and if I delete an artefact, the association table is cleaned up appropriately and all references between the removed artefact and roles are removed (the role isn't deleted though, correctly - as we don't want orphans deleted). The problem is - how to delete a role and have it clear up the association table automatically. If I presently try to delete a role, I get a reference constraint as there are still entries in the association table for the role. The only way to successfully delete a role is to query for all artefacts that link to that role, remove the role from the artefact's role collection, update the artefacts and then delete the role - not very efficient or nice, especially when in the un-simplified system, roles can be associated with any number of other tables/objects. I need to be able to hint to NHibernate that I want this association table cleared whenever I delete a role - is this possible, and if so - how do I do it? Thanks for any help.
0
[ 2, 151, 20, 151, 27448, 13542, 19, 12109, 15191, 8820, 800, 3726, 3726, 31, 57, 21, 12705, 19, 21, 329, 56, 31, 22, 195, 794, 20, 28257, 28, 246, 28, 31, 92, 9, 95, 57, 21, 859, 16, 13, 5, 11045, 645, 105, 6, 27284, 15, 2728...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1...
ListBox elements rearranged with JavaScript causing event validation error on postback === I have created an item swapper control consisting in two listboxes and some buttons that allow me to swap items between the two lists. The swapping is done using javascript. I also move items up and down in the list. Basically when I move the items to the list box on the right I store the datakeys of the elements (GUIDs) in a hiddenfield. On postback I simply read the GUIDs from the field. Everything works great but on postback, I get the following exception: > Invalid postback or callback argument. Event validation is enabled using <pages enableEventValidation="true"/> in configuration or <%@ Page EnableEventValidation="true" %> in a page. For security purposes, this feature verifies that arguments to postback or callback events originate from the server control that originally rendered them. If the data is valid and expected, use the ClientScriptManager.RegisterForEventValidation method in order to register the postback or callback data for validation. I've prepared a test application. All you have to do is download the archive and run the project. On the web page select the 3 items, press Add all, then move the third element up one level and then hit "Button". The error will show up. Turning event validation off is by no means acceptable. Can anyone help me, I've spent two already days without finding a solution. [TEST APPLICATION][1] [1]: http://cid-c9672af9b84b07ef.skydrive.live.com/self.aspx/TestApp/TestProject.zip
0
[ 2, 968, 5309, 2065, 302, 23273, 29, 8247, 8741, 3242, 807, 27999, 7019, 27, 678, 1958, 800, 3726, 3726, 31, 57, 679, 40, 9101, 17150, 1432, 569, 4160, 19, 81, 968, 5309, 160, 17, 109, 12861, 30, 1655, 55, 20, 17150, 3755, 128, 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...
Lookng for a way to programmatically convert G729 audio to WAV PCM === I have G729 encoded audio files. I need to programmatically convert them to WAV PCM (16bit 8kHz mono) in the flow of a tool that is doing other thing too. I have an executable that will do that for me. But spawning that external process every time I convert is too heavy on resources. Especially if I need many of them being done in parallel. Looking for a .NET library or code that will let me call this inside my process.
0
[ 2, 361, 2723, 26, 21, 161, 20, 625, 6732, 1326, 8406, 489, 465, 2738, 4023, 20, 3142, 710, 5168, 79, 800, 3726, 3726, 31, 57, 489, 465, 2738, 13665, 4023, 6488, 9, 31, 376, 20, 625, 6732, 1326, 8406, 105, 20, 3142, 710, 5168, 79...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1...
Simple C++ UML w/ reverse engineering === I need a way to build C++ code from UML diagrams and vice versa. Should be simple too hopefully. I don't mind paying too much.
0
[ 2, 1935, 272, 20512, 13, 723, 255, 619, 118, 7006, 1552, 800, 3726, 3726, 31, 376, 21, 161, 20, 1895, 272, 20512, 1797, 37, 13, 723, 255, 14161, 18, 17, 1821, 18596, 9, 378, 44, 1935, 266, 13416, 9, 31, 221, 22, 38, 594, 6605, ...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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...
CVS tab completion for modules under Linux === How can I get tab completion to work for selecting CVS modules under Linux (preferably using bash) ? For example, "cvs co " + tab would list the modules I can checkout. I've heard it's easy to do using zsh, but still I didn't manage to get it working either. Also, how can I list all available modules (or repositories?) available in the CVSROOT?
0
[ 2, 13, 12732, 18, 6523, 5392, 26, 17113, 131, 13024, 800, 3726, 3726, 184, 92, 31, 164, 6523, 5392, 20, 170, 26, 20764, 13, 12732, 18, 17113, 131, 13024, 13, 5, 3515, 2407, 4801, 568, 13158, 6, 13, 60, 26, 823, 15, 13, 7, 12732,...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1...
Continuous Integration for Xcode projects? === After using Hudson for continuous integration with a prior project, I want to set up a continuous integration server for the iPhone projects I'm working on now. After doing some research it looks like there aren't any CI engines designed specifically for Xcode, but one guy has had success [using Cruise Control combined with the xcodebuild CLI tool][1]. Has anyone here tried this? Are there any CI engines that work well with Xcode projects? I'm probably going to give Cruise Control a try. I'll post an answer with my findings. [1]: http://www.pragmaticautomation.com/cgi-bin/pragauto.cgi/Build/XcodeOnCC.rdoc
0
[ 2, 6357, 8078, 26, 993, 9375, 2314, 60, 800, 3726, 3726, 75, 568, 6195, 26, 6357, 8078, 29, 21, 1313, 669, 15, 31, 259, 20, 309, 71, 21, 6357, 8078, 8128, 26, 14, 21024, 2314, 31, 22, 79, 638, 27, 130, 9, 75, 845, 109, 527, ...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1...
[Reporting Services] Calculating grand totals from group totals === I have some data grouped in a table by certain criteria, and for each group is an average (well, the real case is a bit more tricky) of the values from each of the detail rows that belong to that group. Let's see this simple example: Value ----- Group 1: ------- 30 20 Subtotal: 25 Group 2: ------- 20 10 Subtotal: 15 What I want now is to show a grand total on the footer. The grand total should be computed by adding each group's subtotal (for instance, in this example the grand total should be 25 + 15 = 40). However, I can't nest aggregate functions. How can I do? Thanks in advance.
0
[ 2, 636, 17437, 68, 687, 500, 22937, 920, 600, 18, 37, 214, 600, 18, 800, 3726, 3726, 31, 57, 109, 1054, 19511, 19, 21, 859, 34, 1200, 9157, 15, 17, 26, 206, 214, 25, 40, 862, 13, 5, 854, 15, 14, 683, 610, 25, 21, 1142, 91, ...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1...
How can I get the original capture timestamp from my home movie files:: AVI and MPG4? === I have over a TB of home movies with horrible file names. Finding what you want is impossible. I would like to rename all files to the time they were originally recorded (not the file time they were placed on my computer). Some applications (like Ulead Video Studio) can access this information, which I believe is embedded in the CODEC. I would LOVE to find how how either I can write a .Net app to extract this information to rename my files so I can easily organize them OR find an application that will do this for me. Thank you very much in advanced. additional information:: home movies were captured on miniDV and DVD camcorders.
0
[ 2, 184, 92, 31, 164, 14, 501, 3683, 436, 38, 10158, 37, 51, 213, 1308, 6488, 45, 45, 13, 5271, 17, 4628, 263, 300, 60, 800, 3726, 3726, 31, 57, 84, 21, 13, 11872, 16, 213, 4795, 29, 9244, 3893, 1817, 9, 3007, 98, 42, 259, 25...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1...
Why doesn't Google index some words on page? === I've created a program in Delphi that uses Google's AJAX Search API to evaluate search phrase occurrences on specific sites, [mine included][1]. What surprised me was it doesn't appear Google is indexing some words on my pages, or I am forming my search queries via the API incorrectly. For example the search [site:www.delphi.org -"delphi programming"][2] which uses the search string *site%3Awww.delphi.org+-"delphi+programming"* via the API Clearly shows that all the pages returned have the phrase "Delphi programming" in the header or otherwise in the body text. It is a different set then is returned by the search [site:www.delphi.org +"delphi programming"][3] which uses the search string *site%3Awww.delphi.org+%2B"delphi+programming"* via the API Maybe the issue is in Wordpress. Is it looking at the pages differently? What am I missing? [1]: http://www.Delphi.org/ [2]: http://www.google.com/search?&q=site%3Awww.delphi.org+-"delphi+programming" [3]: http://www.google.com/search?&q=site%3Awww.delphi.org+%2B"delphi+programming"
0
[ 2, 483, 1437, 22, 38, 8144, 4348, 109, 715, 27, 2478, 60, 800, 3726, 3726, 31, 22, 195, 679, 21, 625, 19, 23030, 30, 2027, 8144, 22, 18, 20624, 2122, 21, 2159, 20, 13, 15599, 2122, 6845, 12933, 18, 27, 1903, 3259, 15, 636, 7640,...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1...
How can I call C# extension methods in VB code === I have a class library with some extension methods written in C# and an old website written in VB. I want to call my extension methods from the VB code but they don't appear in intelisense and I get compile errors when I visit the site. I have got all the required *Import*s because other classes contained in the same namespaces are appearing fine in Intelisense. Any suggestions
0
[ 2, 184, 92, 31, 645, 272, 5910, 3896, 3195, 19, 13, 20468, 1797, 800, 3726, 3726, 31, 57, 21, 718, 1248, 29, 109, 3896, 3195, 642, 19, 272, 5910, 17, 40, 315, 2271, 642, 19, 13, 20468, 9, 31, 259, 20, 645, 51, 3896, 3195, 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...
Is there a way to make Team System Web Access linkable? === I'm a big fan of Team System Web Access as it is very polished and even includes some features not available in Team Explorer, but unfortunately they seem to have missed the boat on this whole internet thing and didn't realize linking to individual items (be they work items, documents, or files under version control) is a large part of the value of having a web interface. [This blog post][1] discusses using TSWA Power Tools to link directly to things (which is useful for building linkified notification emails), but that is not sufficient since I need for *any* user to be able to easily copy/paste a link to send to someone else. Has anybody hacked Team System Web Access into usefulness or are there any alternatives that provide easy linking? [1]: http://blogs.msdn.com/buckh/archive/2007/11/30/team-system-web-access-2008-power-tool-is-now-available.aspx
0
[ 2, 25, 80, 21, 161, 20, 233, 173, 329, 2741, 1381, 3508, 579, 60, 800, 3726, 3726, 31, 22, 79, 21, 580, 2514, 16, 173, 329, 2741, 1381, 28, 32, 25, 253, 14603, 17, 166, 1103, 109, 967, 52, 904, 19, 173, 8520, 15, 47, 6200, 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...
SSL Issues with IntraWeb - Delphi 2007 === I've been trying to SSL working on my IW program for the last little while and I keep running up against the 'Could not load SSL Library'. I've followed every piece of advice I could find on the subject, but still no joy. I've tried the suggested DLLs in both the local directory and in system32. Does anyone have a definitive answer about what OpenSSL DLLs I should be using? And what build of them? Or any other ideas at all? Indy: updated to the most recent snapshot yesterday IntraWeb: stock D2007 installed This is running on a Vista machine, if that makes any difference. TIA, Trevor
0
[ 2, 13, 18, 18, 255, 1549, 29, 14369, 14113, 13, 8, 23030, 624, 800, 3726, 3726, 31, 22, 195, 74, 749, 20, 13, 18, 18, 255, 638, 27, 51, 31, 499, 625, 26, 14, 236, 265, 133, 17, 31, 643, 946, 71, 149, 14, 13, 22, 13431, 52,...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1...
SQL - Find where in a query a certain row will be === I'm working on a forums system, and I'm trying to allow users to see the posts they've made. In order for this link to work, I'd need to jump to the **page** on the particular topic they posted in that contained their post, so the bookmarks could work, etc. Since this is a new feature on an old forum, I'd like to code it so that the forum system doesn't have to keep track of every post, but can simply populate this list automatically. I know how to populate the list, but I need to do this: Given a query, where will X row within the query (guaranteed to be unique by some combination of identifiers) appear? As in, how many rows would I have to offset to get to it? This would be in a sorted query. Ideally, I'd like to do this with SQL and not PHP, but if it can't be done in SQL I guess that's an answer too. ^_^ Thanks
0
[ 2, 4444, 255, 13, 8, 477, 113, 19, 21, 25597, 21, 1200, 3131, 129, 44, 800, 3726, 3726, 31, 22, 79, 638, 27, 21, 5691, 18, 329, 15, 17, 31, 22, 79, 749, 20, 1655, 3878, 20, 196, 14, 9868, 59, 22, 195, 117, 9, 19, 389, 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...
C++: Use 'class' or 'typename' for template parameters? === When defining a function template or class template in C++, one can do this: template <class T> ... or one can do this: template <typename T> ... Is there a good reason to prefer one over the other?
0
[ 2, 272, 20512, 45, 275, 13, 22, 1898, 22, 54, 13, 22, 4474, 7259, 22, 26, 22894, 12905, 60, 800, 3726, 3726, 76, 14684, 21, 1990, 22894, 54, 718, 22894, 19, 272, 20512, 15, 53, 92, 107, 48, 45, 22894, 13, 1, 1898, 13, 38, 1, ...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1...
How do you specify font sizes in CSS so that they match bitmap mockups and allow the user to resize the text in the browser? === We're running into issues with how we specify font sizes. If we specify the font sizes using pt, they don't always look the same across browsers/platforms. If we specify font sizes using px, IE6 users can't resize the text.
0
[ 2, 184, 107, 42, 19077, 9978, 13403, 19, 272, 18, 18, 86, 30, 59, 730, 1142, 15022, 10506, 15699, 17, 1655, 14, 4155, 20, 302, 10454, 14, 1854, 19, 14, 16495, 60, 800, 3726, 3726, 95, 22, 99, 946, 77, 1549, 29, 184, 95, 19077, ...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 would views & procs referencing another db cause log to grow? === I've got 2 databases on one server; let’s call them db A and B. Database A is about 11 GB, database B is very small (155mb). Database B has some views and procs which are constantly accessing and updating data in database A. The interesting thing is, the log for database B quickly grows to huge sizes, I think it grew to about 12 GB in under a week. Database A doesn't grow that big that fast. What could be causing my log to grow that much? Is there something going on when you select data from another database, that would cause my log to grow like that? I know when you do something similar against a database on a different server, the data is all moved to the calling database before it's joined and selected ... I can see this causing log growth, could the same thing be happening on the same server? SQL2000 SP4 STD edition<br/> Full Recovery model Thanks in advance, John BTW-I realize that changing my recovery model to Simple may help, but I'd like to know why this is happening first.
0
[ 2, 184, 83, 4146, 279, 13, 15617, 18, 13, 29254, 226, 13, 9007, 1679, 6738, 20, 3213, 60, 800, 3726, 3726, 31, 22, 195, 330, 172, 6018, 18, 27, 53, 8128, 73, 408, 1, 18, 645, 105, 13, 9007, 21, 17, 334, 9, 6018, 21, 25, 88, ...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1...
Textured spheres without strong distortion === I've seen well-textured balls, planets, and other spherical objects in couple of games, last time in UFO: aftermath. If you just splatter a texture into latitude/longditude as u and w -coordinates you'll get lots of ugly texture distortion to poles. I can think myself an one way to implement a spherical map with minimum distortion. By mapping in triangles instead of squares. But I don't know any algorithms. How to produce vertices and texture coordinates for such spheres? Also, I don't see a way to generate a complete spherical map from a simple flat square map. Is there some intuitive way on drawing such maps without real trouble? Though, is there other algorithms to render a sphere without or with minimal distortion? Both raytracing and rasterising algorithms are interesting.
0
[ 2, 12714, 43, 9228, 18, 366, 966, 20353, 800, 3726, 3726, 31, 22, 195, 541, 134, 8, 11969, 911, 69, 7152, 15, 12695, 15, 17, 89, 21599, 3916, 19, 1335, 16, 466, 15, 236, 85, 19, 22593, 45, 11372, 9, 100, 42, 114, 25162, 21, 12...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 IIS setting to get rid of extra '/' characters in a requested URL? === The general problem: We have urls coming to our IIS web servers formatted like: > **http://www.server.com/page.aspx** We are also seeing that urls like this are coming in: > **http://www.server.com//page.aspx** We would like to get rid of that extra path character because when the user agent is Internet Explorer, this is resolving as 2 different pages, and thus, downloading the content twice when it should be resolved from a cache. I am not sure if this is a problem to be solved with something like a url-rewriting module, or if there is a configuration setting.
0
[ 2, 25, 80, 40, 595, 18, 2697, 20, 164, 6681, 16, 2230, 13, 22, 118, 22, 1766, 19, 21, 6602, 287, 6362, 60, 800, 3726, 3726, 14, 297, 1448, 45, 95, 57, 13, 911, 7532, 880, 20, 318, 595, 18, 2741, 17595, 13, 29850, 101, 45, 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...
How does a DSP/FPGA phase accumulator work? === I'm looking at the code for a phase accumulator, and I must be a simpleton because I don't get it. The code is simple enough: <pre> Every Clock Tick do: accum = accum + NCO_param; return accum; </pre> accum is a 32-bit register. Obviously, at some point it will roll-over. My question really is: How does this relate to the phase?
0
[ 2, 184, 630, 21, 13, 43, 3401, 118, 12087, 1136, 2702, 7602, 723, 14868, 170, 60, 800, 3726, 3726, 31, 22, 79, 699, 35, 14, 1797, 26, 21, 2702, 7602, 723, 14868, 15, 17, 31, 491, 44, 21, 1935, 444, 185, 31, 221, 22, 38, 164, ...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1...
Tool to Peek into WCF SOAP message === I know there is a tool that enables me to see what actually gets sent/received in my WCF application, that is it let's me see the actual SOAP messages being passed down the wire. The problem is I don't remember what that tool was called, and my Google skills are not of much help either. Anyone?
0
[ 2, 5607, 20, 14918, 77, 11801, 410, 6447, 2802, 800, 3726, 3726, 31, 143, 80, 25, 21, 5607, 30, 14645, 55, 20, 196, 98, 1121, 3049, 795, 118, 27700, 19, 51, 11801, 410, 3010, 15, 30, 25, 32, 408, 22, 18, 55, 196, 14, 3463, 644...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1...
IE6 not playing nice with background-position === I have a single image with 9 different states and the appropriate background-position rules set up as classes to show the different states. I can't use the :hover pseudo-selector because the background image being changed is not the same element that is being hovered over. I have defined the classes this way: #chooser_nav {width:580px; height:38px; background:transparent url(/assets/images/chooser-tabs.jpg) 0 0 no-repeat; margin-left:34px;} #chooser_nav.feat {background-position:0 0;} #chooser_nav.inv {background-position:0 -114px;} #chooser_nav.bts {background-position:0 -228px;} #chooser_nav.featinv {background-position:0 -38px;} #chooser_nav.featbts {background-position:0 -76px;} #chooser_nav.invfeat {background-position:0 -152px;} #chooser_nav.invbts {background-position:0 -190px;} #chooser_nav.btsfeat {background-position:0 -266px;} #chooser_nav.btsinv {background-position:0 -304px;} Then, using jQuery, I have a series of hover rules based on a previous click event (the here-undeclared "cur" variable is properly declared elsewhere): $("#featured_races a").hover(function(){ cur == "feat" ? $("#chooser_nav").attr("class", cur) : $("#chooser_nav").attr("class", cur+"feat"); }, function(){ $("#chooser_nav").attr("class", cur); }); $("#invitational_races a").hover(function(){ cur == "inv" ? $("#chooser_nav").attr("class", cur) : $("#chooser_nav").attr("class", cur+"inv"); }, function(){ $("#chooser_nav").attr("class", cur); }); $("#behind_the_scenes a").hover(function(){ cur == "bts" ? $("#chooser_nav").attr("class", cur) : $("#chooser_nav").attr("class", cur+"bts"); }, function(){ $("#chooser_nav").attr("class", cur); }); So, in Moz and WebKit browsers, this works fine. The classes are applied and the background image changes accordingly. Works in IE7 as well. However, in IE6, the background image never changes. The classes get applied appropriately, I verified this with the DOM viewer in MS's web dev tool. So, the jQuery is working. The class is getting applied, but no change is visibly occurring. I'm kinda stumped here... Help me, Crackoverflow... you're my only hope...
0
[ 2, 13, 660, 379, 52, 791, 2210, 29, 2395, 8, 9339, 800, 3726, 3726, 31, 57, 21, 345, 1961, 29, 561, 421, 202, 17, 14, 4593, 2395, 8, 9339, 1761, 309, 71, 28, 2684, 20, 298, 14, 421, 202, 9, 31, 92, 22, 38, 275, 14, 13, 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...
How do I turn on Option Strict / Infer in a VB.NET aspx page without a code behind file? === Umm, I guess my questions in the title: How do I turn on Option Strict / Infer in a VB.NET aspx page without a code behind file? <%@ Page Language="VB" %> <script runat="server"> Protected Sub Page_Load(ByVal sender As Object, ByVal e As System.EventArgs) End Sub </script>
0
[ 2, 184, 107, 31, 805, 27, 4255, 8170, 13, 118, 19, 2407, 19, 21, 13, 20468, 9, 2328, 28, 306, 396, 2478, 366, 21, 1797, 439, 3893, 60, 800, 3726, 3726, 26462, 15, 31, 2321, 51, 2346, 19, 14, 581, 45, 184, 107, 31, 805, 27, 4...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1...
Can I safely download and install .Net framework 3.5 SP1 without requiring my customers to upgrade their .Net Framework distributable? === Can I safely download and install .Net framework 3.5 SP1 without requiring my customers to upgrade their .Net Framework distributable?
0
[ 2, 92, 31, 9817, 7121, 17, 16146, 13, 9, 2328, 6596, 203, 9, 264, 3782, 165, 366, 9052, 51, 5279, 20, 9483, 66, 13, 9, 2328, 6596, 1460, 13202, 5924, 60, 800, 3726, 3726, 92, 31, 9817, 7121, 17, 16146, 13, 9, 2328, 6596, 203, ...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1...
Is there any elegant way to execute specific code depending on the caller, using reflection or otherwise? === In my ideal world, what I'm looking for would exist as something along the lines of this: public string UserDefinedField { get { return _userDefinedField; } internal set { _userDefinedField = value; } set { _userDefinedField = value; ChangedFields.Add(Fields.UserDefinedField); } } Where one statement is executed regardless of the access modifier, and another statement is executed if it's called from an external assembly or class. I'm sure I could code something by using reflection and checking up the current call stack to see if the caller is in the same assembly, but I'm looking to see if there's a more elegant approach than that.
0
[ 2, 25, 80, 186, 11614, 161, 20, 15644, 1903, 1797, 4758, 27, 14, 21326, 15, 568, 9138, 54, 3190, 60, 800, 3726, 3726, 19, 51, 5628, 126, 15, 98, 31, 22, 79, 699, 26, 83, 3182, 28, 301, 303, 14, 1560, 16, 48, 45, 317, 3724, 4...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1...
OpenID authentication error. === When I try to login to this site using my yahoo openid, it takes me to the yahoo site, I click "continue" meaning that i *want* to send my authentication details to stackoverflow.com and stackoverflow.com gives me the following error underneath the login text field: Unable to log in with your OpenID provider: failed to authenticate, returning Failed. Please ensure your identifier is correct and try again.
0
[ 2, 368, 1340, 27963, 7019, 9, 800, 3726, 3726, 76, 31, 1131, 20, 6738, 108, 20, 48, 689, 568, 51, 23553, 368, 1340, 15, 32, 1384, 55, 20, 14, 23553, 689, 15, 31, 10840, 13, 7, 13391, 4185, 7, 1813, 30, 31, 1637, 14876, 2483, 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...
[IE CSS] Is it possible to have a bottom footer with a horizontal scrollbar and no vertical scroll bar? === I have a layout which uses min-width and works great. So I came to add a footer which I want to stick to the bottom. Firefox will display everything perfectly while with IE, when min-width takes in effect and the vertical scroll bar kicks in, the horizontal scroll bar also appears even thought my content isn't even close to needing it. I have tried every solution I could find about the bottom footer and they all seem to behave that way. Is there a solution to this problem or will I have to realize once again that IE is not-so-good? ;) Thank you.
0
[ 2, 636, 660, 272, 18, 18, 500, 25, 32, 938, 20, 57, 21, 2129, 1749, 106, 29, 21, 10095, 12159, 1850, 17, 90, 7035, 12159, 748, 60, 800, 3726, 3726, 31, 57, 21, 9106, 56, 2027, 4232, 8, 3976, 43, 96, 17, 693, 374, 9, 86, 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...
Scrum Burndown Patterns === I'm in a 10 person team working on a large legacy code base with a less than ideal product owner. Our backlog is in pretty bad shape and large epics have frequently been breaking our sprints. The team also struggles with its definition of done - some members write unit test religiously, others don't, sometimes depending on time available. So, I've been seeing some interesting burndown patterns, and I'm wondering which patterns others are seeing and what they mean. Pattern 1: # # # # # # # # # # # # # # # # # # # # # # # # # # # # - Positive explanation: "All good." - Negative explanation: "Too good to be true. What's **really** going on?" Pattern 2: # # # # # # # # # # # # # # # # # # # # # # - Positive explanation: "This was way easier than we thought, let's pull in more stories." - Negative explanation: ?? Pattern 3: # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # - Positive explanation: "Not sure about this work at first, then turns out easier than we thought." - Negative explanation: "Not enough progress, let's stop writing unit tests to get 'done' on time."
0
[ 2, 26562, 4306, 2968, 6282, 800, 3726, 3726, 31, 22, 79, 19, 21, 332, 840, 173, 638, 27, 21, 370, 7780, 1797, 1000, 29, 21, 787, 119, 5628, 2374, 2410, 9, 318, 97, 5567, 25, 19, 1772, 896, 2539, 17, 370, 7269, 18, 57, 3086, 74...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 Visual Studio toolbar commands to execute batch files === I have a few batch files I need to run frequently in developing a certain project. I'd like to create a Visual Studio toolbar called "MyProject" and have commands underneath to execute these batch files. What is the easiest way to accomplish this?
0
[ 2, 2936, 3458, 1120, 5607, 1850, 14294, 20, 15644, 13064, 6488, 800, 3726, 3726, 31, 57, 21, 310, 13064, 6488, 31, 376, 20, 485, 3086, 19, 3561, 21, 1200, 669, 9, 31, 22, 43, 101, 20, 1600, 21, 3458, 1120, 5607, 1850, 227, 13, 7...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1...