unified_texts
stringlengths
32
30.1k
OpenStatus_id
int64
0
4
input_ids
list
token_type_ids
list
attention_mask
list
Will the Javascript performance improvements from Trace Trees find their way into other interpreted languages? === It sounds like Mozilla is having good luck improving JavaScript performance with [TraceMonkey][1]. See also Andreas Gal's [paper on Trace Trees][2]. Are these improvements available to other interpreters/compilers and if so, does this mean we'll see a cascade of improvements in other interpreted languages? [1]: http://weblogs.mozillazine.org/roadmap/archives/2008/08/tracemonkey_javascript_lightsp.html [2]: http://www.ics.uci.edu/~franz/Site/pubs-pdf/ICS-TR-06-16.pdf
0
[ 2, 129, 14, 8247, 8741, 956, 7951, 37, 5565, 1913, 477, 66, 161, 77, 89, 10394, 2556, 60, 800, 3726, 3726, 32, 2795, 101, 13, 18057, 3247, 25, 452, 254, 5419, 9273, 8247, 8741, 956, 29, 636, 38, 7367, 2111, 4237, 500, 2558, 165, ...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1...
Has anyone taken the Adobe Certified Flex 2 Developer Exam? === I am looking to take the flex 2 developer exam very soon and was just wondering if anyone has taken it already? If so what did you think of the exam and how did you prepare? Thanks
0
[ 2, 63, 1276, 658, 14, 20299, 6935, 14409, 172, 10058, 11796, 60, 800, 3726, 3726, 31, 589, 699, 20, 247, 14, 14409, 172, 10058, 11796, 253, 651, 17, 23, 114, 5712, 100, 1276, 63, 658, 32, 614, 60, 100, 86, 98, 144, 42, 277, 16, ...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0...
How can I simulate ext3 filesystem corruption? === I would like to simulate filesystem corruption for the purpose of testing how our embedded systems react to it and ultimately have them fail as gracefully as possible. We use different kinds of flash storage for data which is modified often and unsuitable for storage in NAND/NOR. Since I have a pretty good idea of how often data is modified in different parts of the file tree and where sensitive data is stored I would like to inject errors in specific areas and not just randomly. In cases of emergency we use *fsck -y* as a sort of last resort in order to attempt to bring the system up and report that is in a very bad state. I would very much like to cause errors which would trigger fsck to attempt repairs in order to study the effect on the systems capability to come back up. *dd if=/dev/random* is not precise enough for my purpose since it can't easily be used to inject controlled errors. Are there any other tools or methods which fit my needs better or do I have to invent my own?
0
[ 2, 184, 92, 31, 24969, 1396, 38, 240, 3893, 10724, 7858, 60, 800, 3726, 3726, 31, 83, 101, 20, 24969, 3893, 10724, 7858, 26, 14, 2131, 16, 4431, 184, 318, 12138, 1242, 7749, 20, 32, 17, 3308, 57, 105, 7476, 28, 28138, 28, 938, 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...
Is there a way to return different types from a WCF REST method? === I am trying to write a web service to spec and it requires a different response body depending on whether the method completes successfully or not. I have creating two different DataContract classes, but how can I return them and have them serialized correctly?
0
[ 2, 25, 80, 21, 161, 20, 788, 421, 2551, 37, 21, 11801, 410, 760, 2109, 60, 800, 3726, 3726, 31, 589, 749, 20, 2757, 21, 2741, 365, 20, 12737, 17, 32, 4781, 21, 421, 1627, 358, 4758, 27, 1472, 14, 2109, 1279, 18, 3673, 54, 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...
Using locale.setlocale in embedded Python without breaking file parsing in C thread === We're using a third-party middleware product that allows us to write code in an embedded Python interpreter, and which exposes an API that we can call into. Some of these API calls allow us to load various kinds of file, and the loading code is implemented in C. File loading happens in a separate thread, and calls back into Python when the data is available. So far, all well and dandy. We've been i14ing (heh) our product, and one thing we'd like to do is format user-facing numerical output according to the user's locale settings. So, from Python, we do this: import locale locale.setLocale( locale.LC_ALL, '' ) Now, this works (in that the user-facing numbers are formatted correctly for their locale). However, if the user's locale differs from the default C locale, any files that are subsequently loaded will return incorrect data, presumably because all string-to-float conversion has been affected, right down to the metal. We can't work around this by implementing locale aware file loading, so our current workaround is to only set the locale when formatting output for the user, and then set it back again afterwards. That is, something like: import locale currentLocale = locale.getLocale( locale.LC_ALL ) locale.setLocale( locale.LC_ALL, '' ) displayNumbersToTheUser() locale.setlocale( locale.LC_ALL, currentLocale ) This seems a bit clunky, and I was wondering whether this is a common approach to formatting locale-aware output for the user? My other concern is that this is obviously not thread safe, so we'll presumably still get problems if any file parsing occurs in a separate thread when the locale is changed. Any information on best practice is appreciated - I don't have much experience with this sort of thing.
0
[ 2, 568, 375, 62, 9, 3554, 15580, 62, 19, 12138, 20059, 366, 3892, 3893, 2017, 18, 68, 19, 272, 9322, 800, 3726, 3726, 95, 22, 99, 568, 21, 422, 8, 9635, 772, 5011, 2374, 30, 2965, 182, 20, 2757, 1797, 19, 40, 12138, 20059, 19336...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1...
ASP.NET: Unable to validate data. === What is the cause of this exception in ASP.NET? Obviously it is a viewstate exception, but I can't reproduce the error on the page that is throwing the exception (a simple two TextBox form with a button and navigation links). FWIW, I'm not running a web farm. Exception ----------- > Error Message: Unable to validate > data. > > Error Source: System.Web > > Error Target Site: Byte[] > GetDecodedData(Byte[], Byte[], Int32, > Int32, Int32 ByRef) Post Data ---------- > *VIEWSTATE:* > > /wEPDwULLTE4NTUyODcyMTFkZF96FHxDUAHIY3NOAMRJYZ+CKsnB > > *EVENTVALIDATION:* > > /wEWBAK+8ZzHAgKOhZRcApDF79ECAoLch4YMeQ2ayv/Gi76znHooiRyBFrWtwyg= Exception Stack Trace ---------------------- at System.Web.UI.ViewStateException.ThrowError(Exception inner, String persistedState, String errorPageMessage, Boolean macValidationError) at System.Web.UI.ObjectStateFormatter.Deserialize(String inputString) at System.Web.UI.ObjectStateFormatter.System.Web.UI.IStateFormatter.Deserialize(String serializedState) at System.Web.UI.Util.DeserializeWithAssert(IStateFormatter formatter, String serializedState) at System.Web.UI.HiddenFieldPageStatePersister.Load() at System.Web.UI.Page.LoadPageStateFromPersistenceMedium() at System.Web.UI.Page.LoadAllState() at System.Web.UI.Page.ProcessRequestMain(Boolean includeStagesBeforeAsyncPoint, Boolean includeStagesAfterAsyncPoint) at System.Web.UI.Page.ProcessRequest(Boolean includeStagesBeforeAsyncPoint, Boolean includeStagesAfterAsyncPoint) at System.Web.UI.Page.ProcessRequest() at System.Web.UI.Page.ProcessRequestWithNoAssert(HttpContext context) at System.Web.UI.Page.ProcessRequest(HttpContext context) at ASP.default_aspx.ProcessRequest(HttpContext context) at System.Web.HttpApplication.CallHandlerExecutionStep.System.Web.HttpApplication.IExecutionStep.Execute() at System.Web.HttpApplication.ExecuteStep(IExecutionStep step, Boolean& completedSynchronously)
0
[ 2, 28, 306, 9, 2328, 45, 2343, 20, 7394, 1373, 1054, 9, 800, 3726, 3726, 98, 25, 14, 1679, 16, 48, 5391, 19, 28, 306, 9, 2328, 60, 4409, 32, 25, 21, 1418, 3859, 5391, 15, 47, 31, 92, 22, 38, 21509, 14, 7019, 27, 14, 2478, ...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1...
Tutorial for Windows Shell Extensions === I've been postponing this part of the project because I haven't found any particular helpful example/tutorial for these 2 aspects of Shell Extensions: 1. Return information for the Hint when you hover over a file. 2. Context pop-up menu with extension context, if it makes sense. Cheers.
4
[ 2, 29724, 26, 1936, 3593, 17529, 800, 3726, 3726, 31, 22, 195, 74, 678, 8782, 68, 48, 141, 16, 14, 669, 185, 31, 2933, 22, 38, 216, 186, 1498, 15600, 823, 118, 2473, 9819, 192, 26, 158, 172, 4842, 16, 3593, 17529, 45, 137, 9, ...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1...
How can I redirect to a page when the user session expires? === I am currently working on an web application that uses ASP.NET 2.0 framework. I need to redirect to a certain page, say SessionExpired.aspx, when the user session expires. There are lot of pages in the project, so adding code to every page of the site is not really a good solution. I have MasterPages though, which I think might help. Thanks!
0
[ 2, 184, 92, 31, 302, 14706, 20, 21, 2478, 76, 14, 4155, 3723, 25910, 18, 60, 800, 3726, 3726, 31, 589, 871, 638, 27, 40, 2741, 3010, 30, 2027, 28, 306, 9, 2328, 172, 9, 387, 6596, 9, 31, 376, 20, 302, 14706, 20, 21, 1200, 24...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1...
Where can I find a video of a pro using emacs? === I want to see a video of somebody using emacs really, really well. Not an instructional video, just something that shows off its raw power. I want to be dazzled. The inspiration for this question is the following [quote][1]: > "You have to be way smart to use > [emacs] well, and it makes you > incredibly powerful if you can master > it. Go look over Paul Nordstrom's > shoulder while he works sometime, if > you don't believe me. It's a real > eye-opener for someone who's used > Visual Blub .NET-like IDEs their whole > career." [1]: http://steve.yegge.googlepages.com/tour-de-babel
0
[ 2, 113, 92, 31, 477, 21, 763, 16, 21, 895, 568, 13, 62, 6893, 18, 60, 800, 3726, 3726, 31, 259, 20, 196, 21, 763, 16, 8861, 568, 13, 62, 6893, 18, 510, 15, 510, 134, 9, 52, 40, 25565, 763, 15, 114, 301, 30, 1285, 168, 82, ...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1...
Win32/MFC Get window rect from client rect === I know there is a function somewhere that will accept a client rect and it will convert it into a window rect for you. I just can't find / remember it! Does anyone know what it is? It will do something similar to: const CRect client(0, 0, 200, 200); const CRect window = ClientRectToWindowRect(client); SetWindowPos(...)
0
[ 2, 628, 3125, 118, 79, 7061, 164, 1463, 6042, 38, 37, 6819, 6042, 38, 800, 3726, 3726, 31, 143, 80, 25, 21, 1990, 3493, 30, 129, 3440, 21, 6819, 6042, 38, 17, 32, 129, 8406, 32, 77, 21, 1463, 6042, 38, 26, 42, 9, 31, 114, 92...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1...
What are the advantages and disadvantages of using XML schemas? === We are utilizing the XML data type in Microsoft SQL Server 2005 for a project. Some members of the team and I feel that we should also use XSDs while members of the other camp feel that we should keep the XMLs ad hoc and not treat them as "types". The XMLs are an effort to bring structure and centrality to a number of text configuration files that are a maintenance nightmare. We are using .NET 3.5/C# and our tables are designed with the appropriate data types. My argument is that we are already "types oriented" in our thinking why break that approach because it is XML. It is because of the lack of types with the text files that the original problem occured. Not using a "types" approach leaves us open to the same problem. May be my understanding of the benefits of XML schemas are incorrect. So what are the advantages and disadvantages of using XML schemas?
0
[ 2, 98, 50, 14, 14683, 17, 13387, 18, 16, 568, 23504, 23874, 18, 60, 800, 3726, 3726, 95, 50, 19894, 14, 23504, 1054, 1001, 19, 7099, 4444, 255, 8128, 812, 26, 21, 669, 9, 109, 443, 16, 14, 173, 17, 31, 583, 30, 95, 378, 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...
Data Protection and Web 2.0 Web sites === Many countries now have data protection legislation which afford individuals the rights to: 1. request that an organization hand over all information they hold on the individual and 2. to request that any information held on the individual is destroyed [Facebook got into trouble over the second part of this in the UK](http://www.channel4.com/news/articles/science_technology/facebook%20data%20protection%20row/1060467) as it is nigh on impossible to delete your information from Facebook. This is understandable. A persons' data in a social media site is intricately woven into the fabric of the site. Users generate posts, messages, chat, relationships with others, photos, applications etc. and in turn other people will add their own comments / thoughts on this content. However, I am far from convinced that simply stating in your terms and conditions that your data cannot be deleted complies with data protection legislation (at least in the UK - any programming lawyers want to comment?). We tend to handle the issue of deleting users content by overwriting key fields in the record for that user (e.g. username, name, email address) and by overwriting key fields in the content they have posted (e.g. comments, blog posts). This means that you may come accross a discussion post attributed to "deleted user" which reads "This post was deleted." Data protection issues even affect decisions such as hosting (we tend to host applications in the UK for many clients for Data Protection reasons, despite the higher cost). As a developer, how far is this my problem? I have a feeling that responsibility would ultimately fall on the legal owner of the application (my clients / employers) and it would be up to them to come after my company for not giving the issue proper consideration if they fell foul of this. My questions to you are: 1. How do you deal with the issue of deleting content from a social media application where data protection compliance is an issue? 2. Whose responsibility is this ultimately? 3. Should I just lighten up and be less concerned about these kinds of issues?
0
[ 2, 1054, 2057, 17, 2741, 172, 9, 387, 2741, 3259, 800, 3726, 3726, 151, 1166, 130, 57, 1054, 2057, 5064, 56, 7829, 1883, 14, 1096, 20, 45, 137, 9, 3772, 30, 40, 1165, 224, 84, 65, 676, 59, 1027, 27, 14, 1359, 17, 172, 9, 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...
Calculate package size === Does anyone know of existing software or algorithms to calculate a package size for shipping multiple items? I have a bunch of items in our inventory database with length, width and height dimesions defined. Given these dimensions I need to calculate how many of the purchased items will fit into predefined box sizes.
0
[ 2, 18469, 6030, 1072, 800, 3726, 3726, 630, 1276, 143, 16, 3149, 2306, 54, 15935, 20, 18469, 21, 6030, 1072, 26, 7405, 1886, 3755, 60, 31, 57, 21, 7653, 16, 3755, 19, 318, 13875, 6018, 29, 1476, 15, 9456, 17, 2947, 24966, 18, 5757...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 avoid pessimistic locking in a version control system? === Based on a few posts I've read concerning version control, it seems people think pessimistic locking in a version control system is a bad thing. Why? I understand that it prevents one developer from submitting a change while another has the file checked out, but so what? If your code files are so big that you constantly have more than one person working on them at the same time, I submit that you should reorganize your code. Break it up into smaller functional units. Integration of concurrent code changes is a tedious and error-prone process even with the tools a good version control system provides to make it easier. I think it should be avoided if at all possible. So, why is pessimistic locking discouraged?
0
[ 2, 483, 2658, 10457, 8672, 3771, 17538, 19, 21, 615, 569, 329, 60, 800, 3726, 3726, 432, 27, 21, 310, 9868, 31, 22, 195, 1302, 6477, 615, 569, 15, 32, 2206, 148, 277, 10457, 8672, 3771, 17538, 19, 21, 615, 569, 329, 25, 21, 896,...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 Microsoft Velocity with NHibernate? === Has anyone tried to use MS Velocity with NHibernate. I've seen that NHibernate can use NCache as a distributed cache, but I am more interested in using MS Velocity instead. Are you aware of Cache Provider for MS Velocity for NHibernate?
0
[ 2, 568, 7099, 10700, 29, 12109, 15191, 8820, 60, 800, 3726, 3726, 63, 1276, 794, 20, 275, 4235, 10700, 29, 12109, 15191, 8820, 9, 31, 22, 195, 541, 30, 12109, 15191, 8820, 92, 275, 9276, 9616, 28, 21, 4387, 16522, 15, 47, 31, 589,...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 translate 8bit characters into 7bit characters? (i.e. Ü to U) === I'm looking for pseudocode, or sample code, to convert higher bit ascii characters (like, Ü which is extended ascii 154) into U (which is ascii 85). My initial guess is that since there are only about 25 ascii characters that are similar to 7bit ascii characters, a translation array would have to be used. Let me know if you can think of anything else.
0
[ 2, 184, 107, 31, 20628, 469, 3326, 1766, 77, 453, 3326, 1766, 60, 13, 5, 49, 9, 62, 9, 287, 20, 287, 6, 800, 3726, 3726, 31, 22, 79, 699, 26, 8452, 9375, 15, 54, 5717, 1797, 15, 20, 8406, 1184, 1142, 28, 1892, 49, 1766, 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...
Authenticating against active directory using python + ldap === How do I authenticate against AD using Python + LDAP. I'm currently using the python-ldap library and all it is producing is tears. I can't even bind to perform a simple query: import sys import ldap Server = "ldap://my-ldap-server" DN, Secret, un = sys.argv[1:4] Base = "dc=mydomain,dc=co,dc=uk" Scope = ldap.SCOPE_SUBTREE Filter = "(&(objectClass=user)(sAMAccountName="+un+"))" Attrs = ["displayName"] l = ldap.initialize(Server) l.protocol_version = 3 print l.simple_bind_s(DN, Secret) r = l.search(Base, Scope, Filter, Attrs) Type,user = l.result(r,60) Name,Attrs = user[0] if hasattr(Attrs, 'has_key') and Attrs.has_key('displayName'): displayName = Attrs['displayName'][0] print displayName sys.exit() Running this with "myusername@mydomain.co.uk password username" gives me one of two errors: Invalid Credentials - When I mistype or intentionally use wrong credentials it fails to authenticate. ldap.INVALID_CREDENTIALS: {'info': '80090308: LdapErr: DSID-0C090334, comment: A cceptSecurityContext error, data 52e, vece', 'desc': 'Invalid credentials'} Or ldap.OPERATIONS_ERROR: {'info': '00000000: LdapErr: DSID-0C090627, comment: In order to perform this operation a successful bind must be completed on the connection., data 0, vece', 'desc': 'Operations error'} What am I missing out to bind properly? I am getting the same errors on fedora and windows.
0
[ 2, 14351, 1880, 149, 1348, 16755, 568, 20059, 2754, 644, 20472, 800, 3726, 3726, 184, 107, 31, 14351, 1373, 149, 21, 43, 568, 20059, 2754, 644, 20472, 9, 31, 22, 79, 871, 568, 14, 20059, 8, 255, 20472, 1248, 17, 65, 32, 25, 4081, ...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 Servers === My company is considering changing continuous integration servers (I won't say which one we have now, so I won't skew your responses in anyway :) ) I wondering if anybody has any recommendations? Best user experience, level of difficulty to maintain, etc... Our code is all in java, and we use ANT as a build tool.
4
[ 2, 6357, 8078, 17595, 800, 3726, 3726, 51, 237, 25, 5154, 4226, 6357, 8078, 17595, 13, 5, 49, 230, 22, 38, 395, 56, 53, 95, 57, 130, 15, 86, 31, 230, 22, 38, 13, 5835, 499, 154, 13231, 19, 2774, 13, 45, 6, 13, 6, 31, 5712, ...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1...
Client/JS Framework for "Unsaved Data" Protection? === Hey all- we have a typical web application that is essentially a data entry application with lots of screens some of which have some degree of complexity. We need to provide that standard capability on making sure if the user forgets to click the "Save" button before navigating away or closing their browser they get a warning and can cancel (but only when there is unsaved or dirty data). I know the basics of what I've got to do-- in fact I'm sure I've done it all before over the years (tie in to onbeforeunload, track the "dirty" state of the page, etc...) but before I embark on coding this YET AGAIN, does anyone have some suggestions for libraries already out there (free or otherwise) that will help out? Thanks!
0
[ 2, 6819, 118, 728, 18, 6596, 26, 13, 7, 1020, 19863, 43, 1054, 7, 2057, 60, 800, 3726, 3726, 8409, 65, 8, 95, 57, 21, 3874, 2741, 3010, 30, 25, 7398, 21, 1054, 2792, 3010, 29, 7503, 16, 14236, 109, 16, 56, 57, 109, 1168, 16, ...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1...
Testing for multiple screens with javascript === Is it possible to tell if the user of a website is using multiple monitors? I need to find the position of a popup but it's quite likely the user will have a multiple monitor setup. Whilst `window.screenX` etc. will give the position of the browser window it's useless for multiple monitors.
0
[ 2, 4431, 26, 1886, 14236, 29, 8247, 8741, 800, 3726, 3726, 25, 32, 938, 20, 494, 100, 14, 4155, 16, 21, 2271, 25, 568, 1886, 18521, 60, 31, 376, 20, 477, 14, 649, 16, 21, 1675, 576, 47, 32, 22, 18, 1450, 1720, 14, 4155, 129, ...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1...
What is the maximum possible length of a .NET string? === What is the longest string that can be created in .NET? The docs for the `String` class are silent on this question as far as I can see, so an authoritative answer might require some knowledge of internals. Would the maximum change on a 64-bit system? [This is asked more for curiosity than for practical use - I don't intend to create any code that uses gigantic strings!]
0
[ 2, 98, 25, 14, 2979, 938, 1476, 16, 21, 13, 9, 2328, 3724, 60, 800, 3726, 3726, 98, 25, 14, 5646, 3724, 30, 92, 44, 679, 19, 13, 9, 2328, 60, 14, 9765, 18, 26, 14, 13, 1, 11130, 1, 718, 50, 2690, 27, 48, 1301, 28, 463, 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...
What do your code reviews involve and what patterns are successful? === I want to better understand the patterns that work and the patterns that don't work for successful code reviews. 1. Should there be a difference be a Formal Code Review and an Informal Code Review? 2. What level of documentation of the Code Review do people do? 3. Can a Code Review be just as useful without the author of the code participating? Thanks for your input in advance.
0
[ 2, 98, 107, 154, 1797, 2783, 8847, 17, 98, 6282, 50, 1300, 60, 800, 3726, 3726, 31, 259, 20, 574, 1369, 14, 6282, 30, 170, 17, 14, 6282, 30, 221, 22, 38, 170, 26, 1300, 1797, 2783, 9, 137, 9, 378, 80, 44, 21, 2841, 44, 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...
Base constructor in C# - Which gets called first? === Which gets called first - the base constructor or "other stuff here"? public class MyExceptionClass : Exception { public MyExceptionClass(string message, string extrainfo) : base(message) { //other stuff here } }
0
[ 2, 1000, 6960, 248, 19, 272, 5910, 13, 8, 56, 3049, 227, 64, 60, 800, 3726, 3726, 56, 3049, 227, 64, 13, 8, 14, 1000, 6960, 248, 54, 13, 7, 9539, 3217, 235, 7, 60, 317, 718, 51, 10066, 872, 1898, 13, 45, 5391, 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...
Workaround for J2ME Hessian limitations ? === The official J2ME implementation of Hessian seems to have serious limitations : complex objects are not supported.<br> Does anyone have a solution for this problem ? Is there an alternate implementation of Hessian for J2ME ? <br> I do not want to get strings from Hessian and then do some JSON/XML parsing to get objects...
0
[ 2, 170, 10037, 26, 487, 135, 790, 24, 18, 10760, 14070, 13, 60, 800, 3726, 3726, 14, 989, 487, 135, 790, 6123, 16, 24, 18, 10760, 2206, 20, 57, 2055, 14070, 13, 45, 1502, 3916, 50, 52, 1827, 9, 1, 5145, 1, 630, 1276, 57, 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...
What options do you recommend for language translation on content driven Web sites? === Please read the whole question. I'm not looking for an approach to managing multi-lingual content, but I'm looking for a way to actually get that multi-lingual content. This usually falls within technical recommendations on most projects I work on, and I hope someone can offer some help. We are working with a client now who has the personnel to physically translate content, and each language has a separate domain, hosting, CMS, etc. For those clients that want to do business internationally though, and have no personnel, what are some approaches or services to use? Is it cheaper to farm this out to people, or to do it dynamically, and what are the technical drawbacks? Any advice you can offer is helpful. I know this isn't strictly a programming question, but I think it falls within the technical realm.
0
[ 2, 98, 6368, 107, 42, 12360, 26, 816, 4064, 27, 2331, 5355, 2741, 3259, 60, 800, 3726, 3726, 2247, 1302, 14, 979, 1301, 9, 31, 22, 79, 52, 699, 26, 40, 2141, 20, 5616, 1889, 8, 23427, 2331, 15, 47, 31, 22, 79, 699, 26, 21, 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 use Java reflection when the enum type is a Class? === I was using an enum in which the constant was a Class. I needed to invoke a method on the constant but could not introduce a compile time dependency and the enum was not always available at runtime (part of optional install). Therefore, I wanted to use reflection. This is easy, but I hadn't used reflection with enums before. The enum looked something like this: <code> public enum PropertyEnum { SYSTEM_PROPERTY_ONE("property.one.name", "property.one.value"), SYSTEM_PROPERTY_TWO("property.two.name", "property.two.value"); private String name; private String defaultValue; PropertyEnum(String name) { this.name = name; } PropertyEnum(String name, String value) { this.name = name; this.defaultValue = value; } public String getName() { return name; } public String getValue() { return System.getProperty(name); } public String getDefaultValue() { return defaultValue; } } </code> What is an example of invoking a method of the constant using reflection?
0
[ 2, 184, 20, 275, 8247, 9138, 76, 14, 1957, 723, 1001, 25, 21, 718, 60, 800, 3726, 3726, 31, 23, 568, 40, 1957, 723, 19, 56, 14, 3587, 23, 21, 718, 9, 31, 851, 20, 28371, 21, 2109, 27, 14, 3587, 47, 110, 52, 8500, 21, 26561, ...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 character set should I assume the encoded characters in a URL to be in ? === [RFC 1738][1] specifies the syntax for URL's, and mentions that > URLs are written only with the graphic > printable characters of the > US-ASCII coded character set. The > octets 80-FF hexadecimal are not > used in US-ASCII, and the octets 00-1F > and 7F hexadecimal represent > control characters; these must be > encoded. It does not, however, say what code set these octets then represent. [RFC 2396][2] seems to try and improve on the situation, but: > For original character sequences that > contain non-ASCII characters, however, the situation is more > difficult. Internet protocols that transmit octet sequences intended to > represent character sequences are expected to provide some way of > identifying the charset used, if there might be more than one > [RFC2277]. However, there is currently no provision within the > generic URI syntax to accomplish this identification. An individual URI > scheme may require a single charset, define a default charset, or > provide a way to indicate the charset used. > > It is expected that a systematic treatment of character encoding within URI will be > developed as a future modification of this specification. Is there any unambigous way in which a client can determine in which character set to interpret encoded octets, or in which a server can determine what a client used to encode with ? It looks to me like most servers default to UTF-8, but this seems to be a de facto choice more than a specified one. [1]: http://www.ietf.org/rfc/rfc1738.txt [2]: http://www.ietf.org/rfc/rfc2396.txt
0
[ 2, 98, 925, 309, 378, 31, 7158, 14, 13665, 1766, 19, 21, 287, 6362, 20, 44, 19, 13, 60, 800, 3726, 3726, 636, 139, 7061, 369, 3665, 500, 2558, 165, 500, 27669, 14, 22649, 26, 287, 6362, 22, 18, 15, 17, 10292, 30, 13, 1, 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...
Best way to store a large amount of text in a sql server table === What is the best way to store a large amount of text in a table in sql server? is varchar(max) reliable? thanks!
0
[ 2, 246, 161, 20, 1718, 21, 370, 2006, 16, 1854, 19, 21, 4444, 255, 8128, 859, 800, 3726, 3726, 98, 25, 14, 246, 161, 20, 1718, 21, 370, 2006, 16, 1854, 19, 21, 859, 19, 4444, 255, 8128, 60, 25, 4033, 5433, 5, 8304, 6, 11398, ...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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...
Buying a machine for continuous integration - key factors? === I'm planning to propose to my (very small) company that we buy a computer to run continous integration on. If they say yes, the task of actually buying the machine will probably fall on me, so my question is: What do I look for in a computer that will be used for continuous integration for a very small (3 people) php team? What "stuff" (memory, processor, etc.) are important, and what are not?
0
[ 2, 9459, 21, 1940, 26, 6357, 8078, 13, 8, 1246, 4776, 60, 800, 3726, 3726, 31, 22, 79, 2334, 20, 17873, 20, 51, 13, 5, 7864, 284, 6, 237, 30, 95, 3034, 21, 1428, 20, 485, 13, 13391, 1291, 8078, 27, 9, 100, 59, 395, 1643, 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...
Enterprise App and the Enterprise App Client === I came aboard a new project with a new company and we are trying to use JPA to do some DB work. So we have an Ear with an EJB, a webservice, and then there is a app client in the ear that really does all the work. The Webservice, calls the EJB, and the EJB calls the client to do the DB work. So within the appclient I want to load an EntityManager via annotations, but it does not seem to work (em is always null): @Entity public class Whatever...{ @PersistenceContext(unitName="pu") EntityManager em; } So I was thinking that I need to load the EntityManager at the EJB, but that didn't work either, because it seems that JPA didn't see the Entity classes since they are in the appclient and not the EJB. Can anyone give me some guidance?
0
[ 2, 6002, 4865, 17, 14, 6002, 4865, 6819, 800, 3726, 3726, 31, 281, 7211, 21, 78, 669, 29, 21, 78, 237, 17, 95, 50, 749, 20, 275, 487, 1060, 20, 107, 109, 13, 9007, 170, 9, 86, 95, 57, 40, 2330, 29, 40, 13, 10022, 220, 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...
How do I detect if my program runs in an Active Directory environment? === How do I detect if my program runs in an Active Directory environment? I'm using C# and .Net 2.0 Thanks VB
0
[ 2, 184, 107, 31, 9092, 100, 51, 625, 1461, 19, 40, 1348, 16755, 2307, 60, 800, 3726, 3726, 184, 107, 31, 9092, 100, 51, 625, 1461, 19, 40, 1348, 16755, 2307, 60, 31, 22, 79, 568, 272, 5910, 17, 13, 9, 2328, 172, 9, 387, 3669, ...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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...
best way of storing time === what is the best way to store time ? there is a lot of ways to go. [wikipedia][1] has a listing. Most of them are epoch based, but what if you were an archeologist and wanted to store a date in your program... [1]: http://en.wikipedia.org/wiki/System_time
4
[ 2, 246, 161, 16, 25615, 85, 800, 3726, 3726, 98, 25, 14, 246, 161, 20, 1718, 85, 13, 60, 80, 25, 21, 865, 16, 2847, 20, 162, 9, 636, 17375, 26132, 500, 2558, 165, 500, 63, 21, 9554, 9, 127, 16, 105, 50, 24612, 432, 15, 47, ...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1...
calling a wcf webservice from Silverlight === I am trying to call a wcf webservice (developed also by me) from a silverlight application but for some reason the silverlight app does not make the http soap call to the service, I know that because I am sniffing all http traffic with Fiddler (and it is not a localhost call). This my configuration in the server relevant to wcf: <system.serviceModel> <behaviors> <serviceBehaviors> <behavior name="ServiceBehavior"> <serviceMetadata httpGetEnabled="true"/> <serviceDebug includeExceptionDetailInFaults="false"/> </behavior> </serviceBehaviors> </behaviors> <serviceHostingEnvironment aspNetCompatibilityEnabled="true"/> <services> <service behaviorConfiguration="ServiceBehavior" name="Service"> <endpoint address="" binding="basicHttpBinding" contract="Service"/> <endpoint address="mex" binding="mexHttpBinding" contract="IMetadataExchange"/> </service> </services> </system.serviceModel> And the ServiceReferences.ClientConfig file in the silverlight app (i am using the beta 2): <system.serviceModel> <bindings> <basicHttpBinding> <binding name="BasicHttpBinding_Service" maxBufferSize="65536" maxReceivedMessageSize="65536"> <security mode="None" /> </binding> </basicHttpBinding> </bindings> <client> <endpoint address="http://itlabws2003/Service.svc" binding="basicHttpBinding" bindingConfiguration="BasicHttpBinding_Service" contract="Silverlight_organigram.DataService.Service" name="BasicHttpBinding_Service" /> </client> </system.serviceModel> This is the silverlight method that calls the service, I paste the whole method for completeness, the lambda is to make the call synchronous, I have debugged it and after the line client.GetPersonsAsync(), Fiddler does not show any message travelling to the server. public static List<Person> GetPersonsFromDatabase() { List<Person> persons = new List<Person>(); ServiceClient client = new ServiceClient(); ManualResetEvent eventGetPersons = new ManualResetEvent(false); client.GetPersonsCompleted += new EventHandler<GetPersonsCompletedEventArgs>(delegate(object sender, GetPersonsCompletedEventArgs e) { foreach (DTOperson dtoPerson in e.Result) { persons.Add(loadFromDto(dtoPerson)); } eventGetPersons.Set(); }); client.GetPersonsAsync(); eventGetPersons.WaitOne(); return persons; } Anyone could help? thanks
0
[ 2, 2555, 21, 11801, 410, 2741, 11449, 37, 1172, 3130, 800, 3726, 3726, 31, 589, 749, 20, 645, 21, 11801, 410, 2741, 11449, 13, 5, 20102, 67, 34, 55, 6, 37, 21, 1172, 3130, 3010, 47, 26, 109, 1215, 14, 1172, 3130, 4865, 630, 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...
What tools are available to measure the "health" of an enterprise web-based system? === I assist in maintaining an enterprise web-based system (programmed in J2EE, but this is a more general question) and I'd like to know: what good tools are out there to measure the "health" of an enterprise system? For instance, tools to check memory space on servers, check the status of batch runs, the number of records processed in a certain amount of time, etc? I don't wish to limit this to one tool per answer, though, multiple tools per answer are certainly acceptible.
0
[ 2, 98, 4672, 50, 904, 20, 4058, 14, 13, 7, 20818, 7, 16, 40, 6002, 2741, 8, 1281, 329, 60, 800, 3726, 3726, 31, 5404, 19, 8215, 40, 6002, 2741, 8, 1281, 329, 13, 5, 19746, 4688, 19, 487, 135, 2851, 15, 47, 48, 25, 21, 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 to address OpenID providers downtime? === OpenID is all good... UNTIL the provider goes down. At that point you're potentially locked out of EVERYTHING (since you jumped on the bandwagon and applied OpenID everywhere you could).
0
[ 2, 184, 20, 3218, 368, 1340, 13488, 125, 891, 60, 800, 3726, 3726, 368, 1340, 25, 65, 254, 9, 9, 9, 163, 14, 11747, 1852, 125, 9, 35, 30, 454, 42, 22, 99, 9465, 4011, 70, 16, 796, 13, 5, 7412, 42, 4298, 27, 14, 323, 14609, ...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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...
Subversion question: How can I use post-commit hooks to copy committed files to a web directory? === My Ubuntu server has Apache and Subversion installed. I use this server as a staging server, purely for testing purposes. I use Apache to host the web application, and Subversion to keep versioned copies of the source code. My current workflow: - Make changes to a file - Commit the file to the Subversion repository - Upload the file new over SFTP to the Apache public directory - View the changes in my web browser I would be much happier if my workflow was like this: - Make changes to a file - Commit the file to the Subversion repository - _In the background, Subversion puts a copy of the committed file into the Apache public directory_ - View the changes in my web browser I have very little server admin experience, and any help or pointers are appreciated. I heard that post-commit hooks are what I need, and that I can write bash scripts to do this, but I'm not sure where to start and didn't really find anything after quite a lot of Googling. Thank you!
0
[ 2, 972, 10898, 1301, 45, 184, 92, 31, 275, 678, 8, 960, 5130, 5559, 18, 20, 4344, 4164, 6488, 20, 21, 2741, 16755, 60, 800, 3726, 3726, 51, 287, 12968, 2473, 8128, 63, 17140, 17, 972, 10898, 4066, 9, 31, 275, 48, 8128, 28, 21, ...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1...
Is there a NAnt task that will display all property name / values? === Is there a NAnt task that will echo out all property names and values that are currently set during a build? Something equivalent to ant's [echoproperties][1] task maybe. [1]: http://ant.apache.org/manual/OptionalTasks/echoproperties.html
0
[ 2, 25, 80, 21, 13, 11028, 3005, 30, 129, 3042, 65, 1354, 204, 13, 118, 4070, 60, 800, 3726, 3726, 25, 80, 21, 13, 11028, 3005, 30, 129, 8117, 70, 65, 1354, 1817, 17, 4070, 30, 50, 871, 309, 112, 21, 1895, 60, 301, 4602, 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...
Session Variables and Web Services === I just wrote my first web service so lets make the assumption that my web service knowlege is non existant. I want to try to call a dbClass function from the web service. However I need some params that are in the session. Is there any way I can get these call these session variables from the webservice??
0
[ 2, 3723, 12157, 17, 2741, 687, 800, 3726, 3726, 31, 114, 738, 51, 64, 2741, 365, 86, 6884, 233, 14, 12027, 30, 51, 2741, 365, 143, 413, 834, 25, 538, 3182, 1830, 9, 31, 259, 20, 1131, 20, 645, 21, 13, 9007, 1898, 1990, 37, 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...
"View All Files" option missing in VS Database Project === The VS Database Project does not seem to have the "View All Files" option in the Solution Explorer. Does anyone know of a way to turn the option on in VS? Metro.
0
[ 2, 13, 7, 4725, 65, 6488, 7, 4255, 2863, 19, 4611, 6018, 669, 800, 3726, 3726, 14, 4611, 6018, 669, 630, 52, 2260, 20, 57, 14, 13, 7, 4725, 65, 6488, 7, 4255, 19, 14, 4295, 8520, 9, 630, 1276, 143, 16, 21, 161, 20, 805, 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, 0, 0, 0, 0, 0, 0, 0, 0, 0...
NSIS get path of current installer file that is running === Is there an NSIS var to get the path of the currently running installer?
0
[ 2, 13, 103, 4557, 164, 2013, 16, 866, 16146, 106, 3893, 30, 25, 946, 800, 3726, 3726, 25, 80, 40, 13, 103, 4557, 4033, 20, 164, 14, 2013, 16, 14, 871, 946, 16146, 106, 60, 3, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, ...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
ORA-01031: insufficient privileges when selecting view === When I try to execute a view that includes tables from different schemas an ORA-001031 Insufficient privileges is thrown. These tables have execute permission for the schema where the view was created. If I execute the view's SQL Statement it works. What am I missing?
0
[ 2, 54, 58, 8, 387, 1036, 3513, 45, 14748, 15977, 76, 20764, 1418, 800, 3726, 3726, 76, 31, 1131, 20, 15644, 21, 1418, 30, 1103, 7484, 37, 421, 23874, 18, 40, 54, 58, 8, 2032, 1036, 3513, 14748, 15977, 25, 6027, 9, 158, 7484, 57,...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1...
Where can I find the documentation of the Erlang shell === The <a href="http://www.erlang.org/doc/">Erlang documentation</a> contains the documentation of modules. Where can I find the documentation of the Erlang shell? (Which is not a module, I suppose.)
0
[ 2, 113, 92, 31, 477, 14, 13945, 16, 14, 13, 106, 9949, 3593, 800, 3726, 3726, 14, 13, 1, 58, 746, 14057, 3726, 7, 21127, 6903, 6483, 9, 106, 9949, 9, 5583, 118, 13799, 118, 7, 1, 106, 9949, 13945, 1, 118, 58, 1, 1588, 14, 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 often should you refactor? === I had a discussion a few weeks back with some co-workers on refactoring, and I seem to be in a minority that believes "Refactor early, refactor often" is a good approach that keeps code from getting messy and unmaintainable. A number of other people thought that it just belongs in the maintenance phases of a project. If you have an opinion, please defend it.
0
[ 2, 184, 478, 378, 42, 302, 17455, 60, 800, 3726, 3726, 31, 41, 21, 5460, 21, 310, 1342, 97, 29, 109, 326, 8, 16355, 27, 302, 17455, 68, 15, 17, 31, 2260, 20, 44, 19, 21, 6480, 30, 6939, 13, 7, 99, 17455, 274, 15, 302, 17455,...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1...
Firebug - Run multiline scripts on console or make new javascript file === Is there a way in FireBug to start a new script file to apply to page? Basically I want to do work like I'd normally do on the firebug console but be able to to paste in multi-line functionss, etc. It doesn't seem like the console is amenable to that.
0
[ 2, 535, 16254, 13, 8, 485, 1889, 1143, 17505, 27, 8650, 54, 233, 78, 8247, 8741, 3893, 800, 3726, 3726, 25, 80, 21, 161, 19, 535, 16254, 20, 799, 21, 78, 3884, 3893, 20, 5645, 20, 2478, 60, 11374, 31, 259, 20, 107, 170, 101, 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...
Multithreading support in various high-level languages === I'm wondering which languages support (or don't support) native multithreading, and perhaps get some details about the implementation. Hopefully we can produce a complete overview of this specific functionality.
0
[ 2, 1889, 96, 22883, 555, 19, 617, 183, 8, 3906, 2556, 800, 3726, 3726, 31, 22, 79, 5712, 56, 2556, 555, 13, 5, 248, 221, 22, 38, 555, 6, 1275, 1889, 96, 22883, 15, 17, 1774, 164, 109, 3289, 88, 14, 6123, 9, 13416, 95, 92, 22...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0...
Web Development IDE Suggestions === I'm looking for suggestions for web development IDEs. I'm currently looking at Aptana Studio and it looks rather impressive so far. Anyone have other suggestions? I'm looking for support for HTML, CSS and JavaScript. Thanks!
4
[ 2, 2741, 522, 13, 3448, 18389, 800, 3726, 3726, 31, 22, 79, 699, 26, 18389, 26, 2741, 522, 13, 8153, 9, 31, 22, 79, 871, 699, 35, 8442, 9068, 1120, 17, 32, 1879, 864, 7408, 86, 463, 9, 1276, 57, 89, 18389, 60, 31, 22, 79, 69...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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...
Glassfish: web application deployed with non-root context interperetes requests relative to domain1/docroot === The webapp uses Spring MVC. <bean class="org.springframework.web.servlet.handler.SimpleUrlHandlerMapping"> <property name="urlMap"> <map> <entry key="/*" value-ref="defaultHandler"/> </map> </property> <property name="order" value="2"/> </bean> <bean name="defaultHandler" class="org.springframework.web.servlet.mvc.UrlFilenameViewController"/> <bean id="viewResolver" class="org.springframework.web.servlet.view.InternalResourceViewResolver"> <property name="viewClass" value="org.springframework.web.servlet.view.JstlView"/> <property name="prefix" value="/"/> <property name="suffix" value=""/> </bean> So basically request like http://localhost:8080/index.jsp should resolve to application-context-folder\index.jsp and they resolve to domain1\docroot\application-context-folder. Is it by design or do I need to change something in the application or configuration ?
0
[ 2, 1350, 4934, 45, 2741, 3010, 6698, 29, 538, 8, 14032, 4141, 1480, 1432, 11258, 18, 12279, 4543, 20, 4603, 8197, 13799, 14032, 800, 3726, 3726, 14, 2741, 7753, 2027, 1573, 307, 8990, 9, 13, 1, 863, 210, 718, 3726, 7, 5583, 9, 158...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 practices in PHP and MySQL with international strings === It often happens that characters such as *é* gets transformed to *é*, even though the collation for the MySQL DB, table and field is set to utf8\_general\_ci. The encoding in the *Content-Type* for the page is also set to UTF8. I know about utf8_encode/decode, but I'm not quite sure about where and how to use it. I have read the "[The Absolute Minimum Every Software Developer Absolutely, Positively Must Know About Unicode and Character Sets (No Excuses!)][1]" article, but I need some MySQL / PHP specific pointers. **Question: How do I ensure that user entered data containing international characters doesn't get corrupted?** [1]: http://www.joelonsoftware.com/articles/Unicode.html
0
[ 2, 246, 5242, 19, 13, 26120, 17, 51, 18, 22402, 29, 294, 7887, 800, 3726, 3726, 32, 478, 5531, 30, 1766, 145, 28, 1637, 62, 2483, 3049, 8445, 20, 1637, 58, 1, 2483, 15, 166, 362, 14, 9470, 857, 26, 14, 51, 18, 22402, 13, 9007,...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1...
Why should I upgrade from SQL2000 to SQL2005? === I'm looking for the single biggest reason you are glad that you've already made the jump from SQL2000 to SQL2005.
0
[ 2, 483, 378, 31, 9483, 37, 4444, 255, 3050, 20, 4444, 255, 2835, 60, 800, 3726, 3726, 31, 22, 79, 699, 26, 14, 345, 3835, 1215, 42, 50, 3539, 30, 42, 22, 195, 614, 117, 14, 3936, 37, 4444, 255, 3050, 20, 4444, 255, 2835, 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, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
Best way to cache resized images using PHP and MySQL === What would be the best practice way to handle the caching of images using PHP. The filename is currently stored in a MySQL database which is renamed to a GUID on upload, along with the original filename and alt tag. When the image is put into the HTML pages it is done so using a url such as '/images/get/200x200/{guid}.jpg which is rewritten to a php script. This allows my designers to specify (roughly - the source image maybe smaller) the file size. The php script then creates a hash of the size (200x200 in the url) and the GUID filename and if the file has been generated before (file with the name of the hash exists in TMP directory) sends the file from the application TMP directory. If the hashed filename does not exist, then it is created, written to disk and served up in the same manner, Is this efficient as it could be? (It also supports watermarking the images and the watermarking settings are stored in the hash as well, but thats out of scope for this.)
0
[ 2, 246, 161, 20, 16522, 302, 6560, 3502, 568, 13, 26120, 17, 51, 18, 22402, 800, 3726, 3726, 98, 83, 44, 14, 246, 1345, 161, 20, 3053, 14, 1658, 7192, 16, 3502, 568, 13, 26120, 9, 14, 3893, 7259, 25, 871, 8214, 19, 21, 51, 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...
In BIRT, how do I access an arbitrary data set from JavaScript? === I am building my first report in [BIRT][1]. Very quickly I ran into a problem in which I wanted to display some text or data based on an expression that included data from two different tables (not tables that can/should be joined - (hypothetically example- take a student's ACT score from his record in the student table and compare it against the statistics table's entry for ACT statistics). I soon realized that a data element has to be bound to a dataset (only one of them.) I found a [similar question][2] in the BIRT mailing list which helped me get to a solution - I can bind an individual data element to a different dataset, but it can still access the elements of its container. I can send a parameters to the dataset that the element is bound to (e.g. "ACT" in the example I mentioned above). Eventually however, I came to a place where I needed to use data from three different tables. I am stuck here, and I'm assuming that there is a way to do this through the scripting abilities, but I have yet to see in the documentation a way to extract data from a data set - everything I have dealt with so far is associated with binding a report element to a dataset. To be clear, I have seen that I can add javascript functions to the initialize section of the top level report (and call them from an expression in a data element) but I don't see how in a script I can query any of my datasets -- as opposed to only interacting with the dataset bound to my data element). How can I access an arbitrary (though already defined) data set from JavaScript in BIRT? (Or how can I access more than two datasets from an element - one that it is bound to, and one that its container is bound to?) [1]: http://www.eclipse.org/birt/phoenix/ [2]: http://eclipsezone.net/eclipse/forums/m92006973.html
0
[ 2, 19, 8719, 38, 15, 184, 107, 31, 1381, 40, 17237, 1054, 309, 37, 8247, 8741, 60, 800, 3726, 3726, 31, 589, 353, 51, 64, 1330, 19, 636, 10071, 38, 500, 2558, 165, 500, 9, 253, 976, 31, 717, 77, 21, 1448, 19, 56, 31, 417, 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...
Is it possible to compile a .net program to machine code? === I would like to distribute my .net programs without of the .net framework. Is it possible to compile a .net program to machine code?
0
[ 2, 25, 32, 938, 20, 26561, 21, 13, 9, 2328, 625, 20, 1940, 1797, 60, 800, 3726, 3726, 31, 83, 101, 20, 14751, 51, 13, 9, 2328, 1726, 366, 16, 14, 13, 9, 2328, 6596, 9, 25, 32, 938, 20, 26561, 21, 13, 9, 2328, 625, 20, 1940...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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...
How do I manipulate GUID's when doing Windows programing in C or C++ === I'm always forgetting how to do this so this question is a reminder for future reference. Under Win32 if you want to manipulate GUID's you can use the UuidXXX() Network/RPC functions: UuidCompare(), UuidCreate(), UuidCreateNil(), UuidCreateSequential(), UuidEqual(), UuidFromString(), UuidHash(), UuidIsNil() and UuidToString()
0
[ 2, 184, 107, 31, 18468, 9457, 43, 22, 18, 76, 845, 1936, 625, 68, 19, 272, 54, 272, 20512, 800, 3726, 3726, 31, 22, 79, 550, 20183, 184, 20, 107, 48, 86, 48, 1301, 25, 21, 14973, 26, 1022, 2801, 9, 131, 628, 3125, 100, 42, 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...
Looking for File Traversal Functions in Python that are Like Java's === In Java you can do <code>File.listFiles()</code> and receive all of the files in a directory. You can then easily recurse through directory trees. Is there an analogous way to do this in Python?
0
[ 2, 699, 26, 3893, 19501, 192, 3719, 19, 20059, 30, 50, 101, 8247, 22, 18, 800, 3726, 3726, 19, 8247, 42, 92, 107, 13, 1, 9375, 1, 16877, 9, 5739, 16877, 18, 5, 6, 1, 118, 9375, 1, 17, 2588, 65, 16, 14, 6488, 19, 21, 16755, ...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 know WHEN to close an HTTP 1.1 Keep-Alive Connection? === I am writing a web server in Java and I want it to support HTTP 1.1 Keep-Alive connections. But how can I tell when the client is done sending requests for a given connection? (like a double end-of-line or something). Lets see how stackoverflow handles this very obscure question -- answers of which, on Google, are mired in technical specifications and obscure language. I want a plain-english answer for a non-C programmer :)
0
[ 2, 184, 107, 31, 143, 76, 20, 543, 40, 7775, 137, 9, 165, 643, 8, 192, 1284, 2760, 60, 800, 3726, 3726, 31, 589, 1174, 21, 2741, 8128, 19, 8247, 17, 31, 259, 32, 20, 555, 7775, 137, 9, 165, 643, 8, 192, 1284, 6760, 9, 47, ...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1...
How to simplify this code (generates a random int between min and max base on unsigned int)? === The code is return min + static_cast<int>(static_cast<double>(max - min + 1.0) * (number / (UINT_MAX + 1.0))); number is a random number obtained by rand_s. min and max are ints and represent minimum and maximum values (inclusive). If you provide a solution not using unsigned int as a number, please also explain how to make it be random. Please do not submit solutions using rand().
0
[ 2, 184, 20, 28257, 48, 1797, 13, 5, 17083, 7759, 21, 5477, 19, 38, 128, 4232, 17, 2049, 1000, 27, 28839, 19, 38, 6, 60, 800, 3726, 3726, 14, 1797, 25, 788, 4232, 2754, 12038, 1, 6146, 1, 6391, 1, 5, 18077, 1, 6146, 1, 14368, ...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1...
Are you a code neat freak? === How do you handle ugly code? Are you a code neat freak? - Do you feel that you have to clean up a file of source code before you can do anything useful? - Do you have the urge to refactor bad structure when you see it? I admit that I'm often tempted to clean up other people's code when I have to modify the code anyway. Bad code is a pet peeve of mine. How about you?
4
[ 2, 50, 42, 21, 1797, 15956, 8934, 60, 800, 3726, 3726, 184, 107, 42, 3053, 9212, 1797, 60, 50, 42, 21, 1797, 15956, 8934, 60, 13, 8, 107, 42, 583, 30, 42, 57, 20, 2745, 71, 21, 3893, 16, 1267, 1797, 115, 42, 92, 107, 602, 48...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1...
How do I test if another installation is already in progress? === Assuming I'm trying to automate the installation of something on windows and I want to try to test whether another installation is in progress before attempting install. I don't have control over the installer and have to do this in the automation framework. Is there a better way to do this, some win32 api?, than just testing if msiexec is running?
0
[ 2, 184, 107, 31, 1289, 100, 226, 7758, 25, 614, 19, 3455, 60, 800, 3726, 3726, 11704, 31, 22, 79, 749, 20, 3108, 5281, 14, 7758, 16, 301, 27, 1936, 17, 31, 259, 20, 1131, 20, 1289, 1472, 226, 7758, 25, 19, 3455, 115, 6314, 161...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 Raven? === What do you think about this [build tool][1]? I'm thinking of migrating from maven2 to raven (my poms are getting bigger and bigger), but I'd like to hear some opinions first. Thanks! [1]: http://raven.rubyforge.org/
0
[ 2, 63, 1276, 147, 7542, 60, 800, 3726, 3726, 98, 107, 42, 277, 88, 48, 636, 29361, 5607, 500, 2558, 165, 500, 60, 31, 22, 79, 1440, 16, 28749, 37, 1216, 3124, 135, 20, 7542, 13, 5, 915, 16214, 18, 50, 1017, 6197, 17, 6197, 6, ...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1...
How much does a process help in improving quality of shipping software ? === I would like your opinion (through experience) of implementing stricter processes in the aim of improving quality of shipping software. Assume a fairly large software with lots of processes(89) and databases and messaging, IPC, sockets, web servers and the full works (enterprisy made in Java). Some parts are fairly messy (1000 line functions and the sort) but theres a failry large collection of work done in handling itsy bitsy corner cases too. Would implementing failry strict process like code reviews for every bug fixes, static analysis runs for all code changes be enough to turn around the product ? What policies have you encountered that really made code reviews happen, rather than a cursory glance and a perfunctory pass to the code being reviewed ? What other steps / metrics (that you have seen being implemented successfully) would you suggest to increase quality?
0
[ 2, 184, 212, 630, 21, 953, 448, 19, 9273, 2190, 16, 7405, 2306, 13, 60, 800, 3726, 3726, 31, 83, 101, 154, 4052, 13, 5, 11639, 1496, 6, 16, 17333, 8170, 106, 5102, 19, 14, 5226, 16, 9273, 2190, 16, 7405, 2306, 9, 7158, 21, 664...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1...
The best way for a SSIS ftp task to not fail when there are no files to copy === I'm using SQL Server 2005, and creating ftp tasks within SSIS. Sometimes there will be files to ftp over, sometimes not. If there are not, I don't want the task nor the package to fail. I've changed the arrow going from the ftp task to the next to "completion", so the package runs through. I've changed the allowed number of errors to 4 (because there are 4 ftp tasks, and any of the 4 directories may or may not have files). But, when I run the package from a job in agent, it marks the job as failing. Since this will be running every 15 minutes, I don't want a bunch of red x's in my job history, which will cause us to not see a problem when it really does occur. How do I set the properties in the ftp task so that not finding files to ftp is not a failure? The operation I am using is "Send files". -k
0
[ 2, 14, 246, 161, 26, 21, 13, 18, 4557, 1187, 306, 3005, 20, 52, 7476, 76, 80, 50, 90, 6488, 20, 4344, 800, 3726, 3726, 31, 22, 79, 568, 4444, 255, 8128, 812, 15, 17, 2936, 1187, 306, 8674, 363, 13, 18, 4557, 9, 1030, 80, 129...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1...
Can you make a site with ASP.NET MVC Framework using .NET 2.0? === Is it possible to make a site with ASP.NET MVC Framework using .NET 2.0? I am limited to using .NET 2.0 (we use VS 2008, but we have to use the 2.0 Framework) and I really want to try out the MVC Framework.
0
[ 2, 92, 42, 233, 21, 689, 29, 28, 306, 9, 2328, 307, 8990, 6596, 568, 13, 9, 2328, 172, 9, 387, 60, 800, 3726, 3726, 25, 32, 938, 20, 233, 21, 689, 29, 28, 306, 9, 2328, 307, 8990, 6596, 568, 13, 9, 2328, 172, 9, 387, 60, ...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1...
Is there ever any reason not to take the advice of the Database Engine Tuning Advisor? === I'm on a team maintaining a .Net web app with a SQL Server 2005 back end. The system's been running a little slow in places lately, so after doing all the tuning kind of stuff we could think of (adding indexes, cleaning up really badly written stored procedures, etc.) I ran a typical workload through the Tuning Advisor - and it spit out a huge list of additional Indexes and Statistics to create. My initial reaction was to say "sure, you got it, SQL Server," but is there ever any reason NOT to just do what the Advisor says?
0
[ 2, 25, 80, 462, 186, 1215, 52, 20, 247, 14, 4978, 16, 14, 6018, 1406, 19253, 6721, 60, 800, 3726, 3726, 31, 22, 79, 27, 21, 173, 8215, 21, 13, 9, 2328, 2741, 4865, 29, 21, 4444, 255, 8128, 812, 97, 241, 9, 14, 329, 22, 18, ...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1...
Windows Installer - upgrade resuming after reboot === I have a Windows Installer MSI package that installs drivers which sometimes require a restart before they can be upgraded; the drivers are installed by a deferred custom action after WriteRegistryValues. When a reboot IS needed there's a rollback and the user is told to reboot and run the install again. In the InstallExecuteSequence the RemoveExistingProducts action is between InstallValidate and InstallInitialize, so when an upgrade signals that it needs a restart, the previous package has been removed. So when a reboot's needed, after the rollback and the error message saying "reboot and re-run this" our software is no longer installed. If the user reboots and repeats the install things work fine. I need to automate rebooting and resuming the install, so the user doesn't have to actually do anything (apart from agreeing to the restart of course.) A command written into the registry's RunOnce key can run the install again after the reboot, but I'm thinking it will be tricky to condition ForceReboot on what happens in the deferred custom action that does the driver install. Also maybe tricky to decide what to do in the resumed install. Advice on best practices or pointers to potential problems will be very welcome.
0
[ 2, 1936, 16146, 106, 13, 8, 9483, 10719, 723, 68, 75, 25312, 800, 3726, 3726, 31, 57, 21, 1936, 16146, 106, 4235, 49, 6030, 30, 16146, 18, 5783, 56, 1030, 4077, 21, 22767, 115, 59, 92, 44, 9958, 73, 14, 5783, 50, 4066, 34, 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...
IE Script debugging pop up === In order to debug an asp.net web app I have to have IE Script debugging enabled. Unfortunately, in the past week or so google's analytics javascript has developed a problem. So that when I browse to a site that has google analytics I receive the little pop up "A runtime error has occurred. Do you wish to debug?" Yes, even stackoverflow is affected. This is a tremendous pain in the butt. Is there any way to keep IE Script debugging enabled to keep the .net debugger happy, but get rid of the pop up?
0
[ 2, 13, 660, 3884, 121, 16254, 2762, 1675, 71, 800, 3726, 3726, 19, 389, 20, 121, 16254, 40, 28, 306, 9, 2328, 2741, 4865, 31, 57, 20, 57, 13, 660, 3884, 121, 16254, 2762, 9338, 9, 6200, 15, 19, 14, 640, 877, 54, 86, 8144, 22, ...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1...
Querying XML like SQL? === Is there any framework for querying XML SQL Syntax, I seriously tire of iterating through node lists. <hr> Or is this just wishful thinking (if not idiotic) and certainly not possible since XML isn't a relational database?
0
[ 2, 25597, 68, 23504, 101, 4444, 255, 60, 800, 3726, 3726, 25, 80, 186, 6596, 26, 25597, 68, 23504, 4444, 255, 22649, 15, 31, 4818, 11517, 16, 32, 106, 1880, 120, 15421, 7227, 9, 13, 1, 3112, 1, 54, 25, 48, 114, 2536, 1566, 1440,...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 program sorting by clicking listview columns in c# (WinForms)? === I have a ListView that has several columns. One of them contains "Names", the other contains "Amount". I would like to allow the user to click the Names column in the listview and have it sort alphabetically and also allow the user to click the "Amount" and have it sort numerically (higher/lower - lower/higher). What is the best way to implement this? I thought this functionality would be built into the listview but perhaps I'm missing something.
0
[ 2, 184, 20, 625, 2058, 68, 34, 25590, 968, 4725, 7498, 19, 272, 5910, 13, 5, 4181, 4190, 18, 6, 60, 800, 3726, 3726, 31, 57, 21, 968, 4725, 30, 63, 238, 7498, 9, 53, 16, 105, 1588, 13, 7, 7259, 18, 7, 15, 14, 89, 1588, 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...
Has anyone used Ruby/Rails with a Sales Logix database? === Has anyone used Ruby/Rails with a Sales Logix database?
0
[ 2, 63, 1276, 147, 10811, 118, 7301, 18, 29, 21, 2598, 6738, 4028, 6018, 60, 800, 3726, 3726, 63, 1276, 147, 10811, 118, 7301, 18, 29, 21, 2598, 6738, 4028, 6018, 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...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 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...
Normalize newlines in C# === I have a data stream that may contain \r, \n, \r\n, \n\r or any combination of them. Is there a simple way to normalize the data to make all of them simply become \r\n pairs to make display more consistent? So something that would yield this kind of translation table: \r --> \r\n \n --> \r\n \n\n --> \r\n\r\n \n\r --> \r\n \r\n --> \r\n \r\n\n --> \r\n\r\n
0
[ 2, 1826, 2952, 78, 7939, 19, 272, 5910, 800, 3726, 3726, 31, 57, 21, 1054, 3766, 30, 123, 3717, 13, 1, 139, 15, 13, 1, 103, 15, 13, 1, 139, 1, 103, 15, 13, 1, 103, 1, 139, 54, 186, 3733, 16, 105, 9, 25, 80, 21, 1935, 161...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1...
Partial class definition on C++? === Anyone knows if is possible to have partial class definition on C++ ? Something like: file1.h: <pre> class Test { public: int test1(); }; </pre> file2.h: <pre> class Test { public: int test2(); }; </pre> For me it seems quite useful for definining multi-platform classes that have common functions between them that are platform-independent.
0
[ 2, 7284, 718, 5465, 27, 272, 20512, 60, 800, 3726, 3726, 1276, 3620, 100, 25, 938, 20, 57, 7284, 718, 5465, 27, 272, 20512, 13, 60, 301, 101, 45, 3893, 165, 9, 252, 45, 13, 1, 3515, 1, 718, 1289, 13, 1, 317, 45, 19, 38, 1289...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 C# with a Sales Logix database? === Has anyone used C# with a Sales Logix database?
0
[ 2, 63, 1276, 147, 272, 5910, 29, 21, 2598, 6738, 4028, 6018, 60, 800, 3726, 3726, 63, 1276, 147, 272, 5910, 29, 21, 2598, 6738, 4028, 6018, 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, 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...
Is there a way to make Strongly Typed Resource files public (as opposed to internal)? === Here's what I'd like to do: I want to create a library project that contains my Resource files (ie, UI Labels and whatnot). I'd like to then use the resource library both in my UI and in my Tests. (Ie, basically have a common place for my resources that I reference from multiple projects.) Unfortunately, because the StronglyTypedResourceBuilder (the .Net class which generates the code for Resources) makes resource files internal by default, I can't reference my strongly typed resources in the library from another project (ie, my UI or tests), without jumping through hoops (ie, something similar to what is described [here][1], or writing a public wrapper class/function). Unfortunately, both those solutions remove my ability to keep the references strongly-typed. Has anyone found a straight-forward way to create strongly typed .Net resources that can be referenced from multiple projects? I'd prefer to avoid having to use a build event in order to accomplish this (ie, to do something like replace all instances of 'internal' with 'public', but that's basically my fall-back plan if I can't find an answer.. [1]: http://www.codeproject.com/KB/dotnet/Localization.aspx
0
[ 2, 25, 80, 21, 161, 20, 233, 5020, 1001, 43, 6577, 6488, 317, 13, 5, 472, 3499, 20, 3117, 6, 60, 800, 3726, 3726, 235, 22, 18, 98, 31, 22, 43, 101, 20, 107, 45, 31, 259, 20, 1600, 21, 1248, 669, 30, 1588, 51, 6577, 6488, 1...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1...
What's a good Wiki for technical documentation? === What's a good Wiki (or other browser based collaborative tool) for technical documentation? Both as a programmers reference and more general "How to perform this reoccurring tasks on a computer" documents. I'm looking for Wikis with features specifically geared towards documenting system, framework and application development. I'm **not** general purpose Wikis. Finally, yes, I know about Trac ;)
0
[ 2, 98, 22, 18, 21, 254, 13, 17375, 26, 2447, 13945, 60, 800, 3726, 3726, 98, 22, 18, 21, 254, 13, 17375, 13, 5, 248, 89, 16495, 432, 12937, 5607, 6, 26, 2447, 13945, 60, 156, 28, 21, 17968, 18, 2801, 17, 91, 297, 13, 7, 1544...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1...
Faster Directory Walk with VB6 Query: Cache and Ram issues? === Below is a rather simple function which counts how many files are on a machine. Called on "C:\", it takes about 5 seconds to run. Unless I haven't run it in a while or first run a ram-clearing program, in which case it takes 60 seconds or more. I wouldn't have thought it could be caching since I'm doing a new scan each time (i.e. starting a new intance of the program, since all it does is this scan), but perhaps it relates to memory allocation? Any ideas on how to make that fast run happen every time, or on why it can't be done? Private Function countFiles(Name As String) As Long On Error GoTo ErrorHandler DoEvents Const CurMthd = "countFiles" Dim retval As Long 13 Dim FindData As win.WIN32_FIND_DATA 14 Dim SearchPath As String 15 Dim FileName As String 17 Dim SearchHandle As Long If Right(Name, 1) <> "\" Then Name = Name & "\" 19 SearchPath = Name & "*.*" 20 SearchHandle = win.FindFirstFile(SearchPath, FindData) Do DoEvents ' g_Cancel = True If g_Cancel Then countFiles = retval Exit Function End If 22 If SearchHandle = win.INVALID_HANDLE_VALUE Or SearchHandle = ERROR_NO_MORE_FILES Then Exit Do 23 FileName = dsMain.RetainedStrFromPtrA(VarPtr(FindData.cFileName(0))) 24 If AscW(FileName) <> 46 Then If (FindData.dwFileAttributes And win.FILE_ATTRIBUTE_DIRECTORY) Then retval = retval + countFiles(Name & FileName) Else retval = retval + 1 End If 28 End If 29 Loop Until win.FindNextFile(SearchHandle, FindData) = 0 win.FindClose SearchHandle countFiles = retval Exit Function ErrorHandler: Debug.Print "Oops: " & Erl & ":" & Err.Description Resume Next End Function
0
[ 2, 4233, 16755, 1466, 29, 13, 20468, 379, 25597, 45, 16522, 17, 2843, 1549, 60, 800, 3726, 3726, 1021, 25, 21, 864, 1935, 1990, 56, 9927, 184, 151, 6488, 50, 27, 21, 1940, 9, 227, 27, 13, 7, 150, 45, 1, 7, 15, 32, 1384, 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...
If your software development team is not following any design methodology, what is that called? === If your software development team is not following any design methodology, what is that called?
0
[ 2, 100, 154, 2306, 522, 173, 25, 52, 249, 186, 704, 18653, 15, 98, 25, 30, 227, 60, 800, 3726, 3726, 100, 154, 2306, 522, 173, 25, 52, 249, 186, 704, 18653, 15, 98, 25, 30, 227, 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...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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...
How can I set the text of a WPF Hyperlink via data binding? === In WPF, I want to create a hyperlink that navigates to the details of an object, and I want the text of the hyperlink to be the name of the object. Right now, I have this: <TextBlock><Hyperlink Command="local:MyCommands.ViewDetails" CommandParameter="{Binding}">Object Name</Hyperlink></TextBlock> But I want "Object Name" to be bound to the actual name of the object. I would like to do something like this: <TextBlock><Hyperlink Command="local:MyCommands.ViewDetails" CommandParameter="{Binding}" Text="{Binding Path=Name}"/></TextBlock> However, the Hyperlink class does not have a text or content property that is suitable for data binding (that is, a dependency property). Any ideas?
0
[ 2, 184, 92, 31, 309, 14, 1854, 16, 21, 619, 7721, 5443, 6258, 1197, 1054, 8728, 60, 800, 3726, 3726, 19, 619, 7721, 15, 31, 259, 20, 1600, 21, 5443, 6258, 30, 20782, 18, 20, 14, 3289, 16, 40, 3095, 15, 17, 31, 259, 14, 1854, ...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1...
Javascript error: [elementname] has no properties === I'm doing some maintenance coding on a webapp and I am getting a javascript error of the form: "[elementname] has no properties" Part of the code is being generated on the fly with an AJAX call that changes innerHTML for part of the page, after this is finished I need to copy a piece of data from a hidden input field to a visible input field. So we have the destination field: `<input id="dest" name="dest" value="0">` <br>And the source field: `<input id="source" name="source" value="1">` <br>Now when the ajax runs it overwrites the innerHTML of the div that source is in, so the source field now reads: `<input id="source" name="source" value="2">` Ok after the javascript line that copies the ajax data to innerHTML the next line is: `document.getElementById('dest').value = document.getElementById('source').value;` I get the following error: `Error: document.getElementById("source") has no properties` (I also tried `document.formname.source` and `document.formname.dest` and same problem) What am I missing?
0
[ 2, 8247, 8741, 7019, 45, 636, 27567, 7259, 500, 63, 90, 3704, 800, 3726, 3726, 31, 22, 79, 845, 109, 5010, 13, 15458, 27, 21, 2741, 7753, 17, 31, 589, 1017, 21, 8247, 8741, 7019, 16, 14, 505, 45, 13, 7, 2558, 27567, 7259, 500, ...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 a XAML Resource from Code Witout a Key === Is there a way to add a resource to a ResourceDictionary from code without giving it a resource key? For instance, I have this resource in XAML: <TreeView.Resources> <HierarchicalDataTemplate DataType="{x:Type xbap:FieldPropertyInfo}" ItemsSource="{Binding Path=Value.Values}"> <TextBlock Text="{Binding Path=Name}" /> <HierarchicalDataTemplate> </TreeView.Resources> I need to create this resource dynamically from code and add it to the TreeView ResourceDictionary. However, in XAML having no Key means that it's used, by default, for all FieldPropertyInfo types. Is there a way to add it to the resource in code without having a key or is there a way I can use a key and still have it used on all FieldPropertyInfo types? Here's what I've done in C# so far: HierarchicalDataTemplate fieldPropertyTemplate = new HierarchicalDataTemplate("FieldProperyInfo"); fieldPropertyTemplate.ItemsSource = new Binding("Value.Values"); this.Resources.Add(null, fieldPropertyTemplate); Obviously, adding a resource to the ResourceDictionary the key null doesn't work.
0
[ 2, 2936, 21, 13, 6791, 8184, 6577, 37, 1797, 9642, 1320, 21, 1246, 800, 3726, 3726, 25, 80, 21, 161, 20, 3547, 21, 6577, 20, 21, 6577, 22595, 1857, 37, 1797, 366, 1438, 32, 21, 6577, 1246, 60, 26, 4851, 15, 31, 57, 48, 6577, 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...
Roll Up Task in Team Foundation Server === We are using TFS 2008 for project managmeent and I am looking for a method to roll up smaller tasks into larger tasks within tfs. Our work flow works like this: 1. I create a new large work item, say 'Implement web page X' and assign it to my developer (lets call him Brad) 2. Brad receives the task. Now he has never designed 'web page X' before and has no idea how long the whole thing will take to implement. However, he has done pages like it in the past...so Brad takes the large task and splits it into four or five smaller tasks that he can estimate. 3. Brad takes his five new tasks and creates an estimate for how long each task will take. Even a few of these tasks are longer than say 8 hours of work, so he continues to break the tasks down into small enough pieces where he believes he can accurately esitmate how long it will take him to implement the new web page. 4. Brad now has a great task list with realistic estimates of how long each task will take. I can use this data and figure out how long it will take to implement this new page. After going through all of this we have lost the overall 'master task'. I am looking for a workflow that would allow Brad and myself to reference the master task easily, and to communicate that all of these sub tasks belong to the larger master task. Any thoughts on how to implement such a work flow, or a better suggestions on how to tackle task roll up in tfs?
0
[ 2, 3001, 71, 3005, 19, 173, 1304, 8128, 800, 3726, 3726, 95, 50, 568, 13, 11720, 18, 570, 26, 669, 169, 3302, 790, 2291, 17, 31, 589, 699, 26, 21, 2109, 20, 3001, 71, 2012, 8674, 77, 1662, 8674, 363, 13, 11720, 18, 9, 318, 170...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1...
What's a good API for recording/capturing and playing back sound in Delphi and/or C#? === *&lt;flavor&gt; I want to create a spelling test program for my grade schoolers that would let them enter and record their spelling words then test them on them through out the week.&lt;/flavor&gt;* What's a good Delphi API with which I could select a recording device, capture and save sound files, then play them back? I'm also toying with doing the same project in C#, so C# Sound capture/playback API recommendations would also be appreciated.
0
[ 2, 98, 22, 18, 21, 254, 21, 2159, 26, 1576, 118, 4666, 2517, 68, 17, 791, 97, 646, 19, 23030, 17, 118, 248, 272, 5910, 60, 800, 3726, 3726, 1637, 1569, 255, 38, 73, 9165, 5771, 1569, 263, 38, 73, 31, 259, 20, 1600, 21, 11292, ...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 ActionScript3 User Interface Components? === After using AS2 for several years, I'm getting started with writing applications in AS3 (Flash9/Flash10). I've come to the point where I need some full sets of GUI components, and I need to decide which set I'm going to use. Back in the AS2 days, the built in components included with flash were pretty crappy - bloated filesize, slow, buggy, etc. However, I heard good things about the new ones (included with CS3). So I'm looking for advice from people who have used a few different sets. Component sets I've heard of: 1. **CS3 Components** - downside, I need to fiddle with the CS3 IDE, I'd prefer to work all from FlashDevelop only. 2. **Flex Components** - downside, I need the Flex Framework, meaning I have to start with a MXML file, plus the bloat of the framework 3. **bit101's [MinimalComps][1]** - These look like they might be a good starting point, though a bit limited 4. **[ASwing A3][2]** - These look interesting, but they seem a bit overengineered. Ideally, they would be lightweight, have a decent API, and not be overly complex. [1]: http://code.google.com/p/minimalcomps/ [2]: http://www.aswing.org/
0
[ 2, 246, 1028, 8741, 240, 4155, 6573, 5090, 60, 800, 3726, 3726, 75, 568, 28, 135, 26, 238, 122, 15, 31, 22, 79, 1017, 373, 29, 1174, 3767, 19, 28, 240, 13, 5, 26694, 12766, 26694, 1036, 6, 9, 31, 22, 195, 340, 20, 14, 454, 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 the SendChuncked Property missing from System.Net.HttpWebRequest in Silverlight 2? === I need to send large files from silverlight 2 beta 2, so I need to set the sendchuncked property to true, but the property doesn't seem to exist. I've seen other posts on the internet where people have been able to set this in Silverlight. I disassebled the .dll at C:\Program Files\Microsoft SDKs\Silverlight\v2.0\Reference Assemblies in reflector and have confirmed that the property doesn't exist. Am I missing something?
0
[ 2, 25, 14, 2660, 12583, 2601, 69, 1354, 2863, 37, 329, 9, 2328, 9, 21127, 458, 3692, 10351, 19, 1172, 3130, 172, 60, 800, 3726, 3726, 31, 376, 20, 2660, 370, 6488, 37, 1172, 3130, 172, 8434, 172, 15, 86, 31, 376, 20, 309, 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...
MS Paint command line switches === I have been looking for documentation related to interacting with MSPaint from the command line. I have only found references to /p, /pt and /wia, but no guidance as to how to use them and their limitations. I am trying to send some graphics files to the printer and when I drop the file on my printer driver I get a different print output than if I call paint from the command line. I am using the UDC print driver to convert graphics, and I am using paint to send my graphics file to the printer driver in order for my file to convert. Any ideas?
0
[ 2, 4235, 5107, 1202, 293, 18114, 800, 3726, 3726, 31, 57, 74, 699, 26, 13945, 1597, 20, 24747, 29, 4235, 20578, 37, 14, 1202, 293, 9, 31, 57, 104, 216, 7231, 20, 13, 118, 306, 15, 13, 118, 4417, 17, 13, 118, 3976, 58, 15, 47, ...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1...
Crystal Report 10.5 [included with Visual Studio 2008] Selection by Image column === I have an Image column (Allow Null = true) in SQL Server 2005. I am using Crystal Reports designer (ver 10.5) that comes with Visual Studio 2008. Crystal sees the column as blob field and puts an image object for the column. When I am trying to limit the record selection by using NOT ISNULL({Employee.Picture}) as Selection Formula, I get the following error: > Error in formula <Record_Selection>. > 'NOT (ISNULL({Employee.Picture}))' > This function cannot be used because it must be evaluated later. Is there a way to filter out rows with out pictures? Thanks, Kishore A
0
[ 2, 4282, 1330, 332, 9, 264, 636, 22640, 43, 29, 3458, 1120, 570, 500, 3155, 34, 1961, 4698, 800, 3726, 3726, 31, 57, 40, 1961, 4698, 13, 5, 17976, 16203, 800, 1151, 6, 19, 4444, 255, 8128, 812, 9, 31, 589, 568, 4282, 2813, 4742,...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1...
What is the best way to iterate over a Dictionary in C#? === I've seen a few different ways to iterate over a Dictionary in C#. Is there a standard way?
0
[ 2, 98, 25, 14, 246, 161, 20, 32, 106, 1373, 84, 21, 9186, 19, 272, 5910, 60, 800, 3726, 3726, 31, 22, 195, 541, 21, 310, 421, 2847, 20, 32, 106, 1373, 84, 21, 9186, 19, 272, 5910, 9, 25, 80, 21, 1236, 161, 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, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
Are "dirty reads" safe to use in Terracotta? === "Dirty reads", meaning reading an object's value even though it is write-locked by another thread, are [described][1] on Terracotta's website, yet I've heard that they shouldn't be used, even if you don't care about the possibility that you might get old data when you dirty-read the locked object. Does anyone have any experience of using dirty reads in Terracotta, and are they safe to use if you don't care about the possibility of reading an old value? [1]: http://www.terracotta.org/confluence/display/howto/Recipe?recipe=dirty-read
0
[ 2, 50, 13, 7, 28067, 11137, 7, 1834, 20, 275, 19, 9195, 5987, 58, 60, 800, 3726, 3726, 13, 7, 28067, 11137, 7, 15, 1813, 1876, 40, 3095, 22, 18, 1923, 166, 362, 32, 25, 2757, 8, 3966, 69, 34, 226, 9322, 15, 50, 636, 27701, 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...
ASP .Net Model View Presenter and Static Page Methods marked as WebMethod === In an asp.net application, I would like to combine the use of the Webclient Software Factory (WCSF), and its associated Model View Presenter pattern (MVP), with Page Method, that is static methods on the .aspx Views marked with the [WebMethod] attribute. However, static methods on the aspx page would seem to break the Model View Presenter pattern since an instance method is required on the page to have the context of the Presenter and Controller necessary for the View to talk to. How would one extended asp .net's MVP pattern in WCSF to support [WebMethods] on the page, aka the View?
0
[ 2, 28, 306, 13, 9, 2328, 1061, 1418, 9391, 17, 12038, 2478, 3195, 2739, 28, 2741, 5909, 1807, 43, 800, 3726, 3726, 19, 40, 28, 306, 9, 2328, 3010, 15, 31, 83, 101, 20, 12287, 14, 275, 16, 14, 2741, 150, 18513, 38, 2306, 3129, ...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 find the foreach index === Is it possible to find the foreach index? in a "for" loop as follows: for($i = 0; $i < 10; ++$i){ echo $i.' '; } $i will give you the index. Do I have to use the for loop or is there some way to get the index in the foreach loop?
0
[ 2, 184, 20, 477, 14, 26, 14322, 4348, 800, 3726, 3726, 25, 32, 938, 20, 477, 14, 26, 14322, 4348, 60, 19, 21, 13, 7, 1106, 7, 5293, 28, 2415, 45, 26, 5, 4403, 49, 800, 713, 73, 5579, 49, 13, 1, 332, 73, 13, 20512, 4403, 49...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1...
Why is deleting a branch in CVS not recommended? === Under what circumstances would this or would this not be safe? I have a branch that has a four changes (no file add or deletes). Would this be safe to delete?
0
[ 2, 483, 25, 121, 1336, 68, 21, 1686, 19, 13, 12732, 18, 52, 5773, 60, 800, 3726, 3726, 131, 98, 5072, 83, 48, 54, 83, 48, 52, 44, 1834, 60, 31, 57, 21, 1686, 30, 63, 21, 222, 1693, 13, 5, 251, 3893, 3547, 54, 27448, 18, 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, 0, 0, 0, 0, 0, 0, 0...
Developing a Datastructor === What is important to keep in mind when trying to develop a data structure for a database. I don't want to limit your answer to my needs as I am sure that others can benefit from your insights as well. But I am planning a content management system for a multi-client community driven site.
0
[ 2, 3561, 21, 1054, 10346, 248, 800, 3726, 3726, 98, 25, 681, 20, 643, 19, 594, 76, 749, 20, 2803, 21, 1054, 1411, 26, 21, 6018, 9, 31, 221, 22, 38, 259, 20, 4496, 154, 1623, 20, 51, 2274, 28, 31, 589, 562, 30, 654, 92, 4234,...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1...
Does TCP/IP prevent packet replays? === Does TCP/IP prevent multiple copies of the same packet from reaching the destination? Or is it up to the endpoint to layer idempotency logic above it? Please reference specific paragraphs from the TCP/IP specification if possible.
0
[ 2, 630, 13, 38, 7439, 118, 4307, 2501, 12795, 13942, 18, 60, 800, 3726, 3726, 630, 13, 38, 7439, 118, 4307, 2501, 1886, 3298, 16, 14, 205, 12795, 37, 2669, 14, 6970, 60, 54, 25, 32, 71, 20, 14, 241, 3132, 20, 5385, 31, 11546, ...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1...
Calculate timespan in Javascript === I have a .net 2.0 ascx control with a start time and end time textboxes. The data is as follows: txtStart.Text = 09/19/2008 07:00:00 txtEnd.Text = 09/19/2008 05:00:00 I would like to calculate the total time (hours and minutes) in Javascript then display it in a textbox on the page.
0
[ 2, 18469, 436, 3206, 19, 8247, 8741, 800, 3726, 3726, 31, 57, 21, 13, 9, 2328, 172, 9, 387, 28, 150, 396, 569, 29, 21, 799, 85, 17, 241, 85, 1854, 5309, 160, 9, 14, 1054, 25, 28, 2415, 45, 20225, 38, 13680, 9, 11969, 800, 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...
Why does Java not have block-scoped variable declarations? === The following method does not work because the inner block declares a variable of the same name as one in the outer block. Apparently variables belong to the method or class in which they are declared, not to the block in which they are declared, so I therefore can't write a short little temporary block for debugging that happens to push a variable in the outer scope off into shadow just for a moment: void methodName() { int i = 7; for (int j = 0; j < 10; j++) { int i = j * 2; } } Almost every block-scoped language I've ever used supported this, including trivial little languages that I wrote interpreters and compilers for in school. Perl can do this, as can Scheme, and even C. I'm actually pretty certain Pascal supports this. What's the rationale for this design decision for Java?
0
[ 2, 483, 630, 8247, 52, 57, 1921, 8, 11555, 43, 7612, 7098, 18, 60, 800, 3726, 3726, 14, 249, 2109, 630, 52, 170, 185, 14, 3754, 1921, 10123, 18, 21, 7612, 16, 14, 205, 204, 28, 53, 19, 14, 4896, 1921, 9, 3083, 12157, 6219, 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...
SQL trace in Great Plains shows Invalid column name 'desSPRkmhBBCreh'. === This error seems to just pop up now and again. It is not restricted to a single table and even happens on tables it just created. Anybody else see this weird behavior?
0
[ 2, 4444, 255, 5565, 19, 374, 8648, 1285, 16671, 4698, 204, 13, 22, 3196, 18, 4899, 2939, 252, 24188, 99, 252, 22, 9, 800, 3726, 3726, 48, 7019, 2206, 20, 114, 1675, 71, 130, 17, 188, 9, 32, 25, 52, 7079, 20, 21, 345, 859, 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, 0, 0...
How can I determine installed SQL Server versions? === I'm trying to determine what instances of sql server/sql express I have installed (either manually or programmatically) but all of the examples are telling me to run a SQL query to determine this which assumes I'm already connected to a particular instance.
0
[ 2, 184, 92, 31, 3746, 4066, 4444, 255, 8128, 3281, 60, 800, 3726, 3726, 31, 22, 79, 749, 20, 3746, 98, 13946, 16, 4444, 255, 8128, 118, 18, 22402, 2999, 31, 57, 4066, 13, 5, 18840, 23671, 54, 625, 6732, 1326, 6, 47, 65, 16, 14...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1...
How can I determine if a given process id is running in Java or JRuby on Linux? === I need to see if a given process id is running, and it must work in either Java or JRuby (preferably a Ruby solution). It can be system dependent for Linux (specifically Debian and/or Ubuntu). I already have the PID I am looking for, just need to see if it is currently running.
0
[ 2, 184, 92, 31, 3746, 100, 21, 504, 953, 4924, 25, 946, 19, 8247, 54, 2000, 291, 779, 27, 13024, 60, 800, 3726, 3726, 31, 376, 20, 196, 100, 21, 504, 953, 4924, 25, 946, 15, 17, 32, 491, 170, 19, 694, 8247, 54, 2000, 291, 77...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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# Dynamically created LinkButton Command Event Handler === So I have a weird situation here... I have an System.Web.UI.WebControls.WebParts.EditorPart class. It renders a "Search" button, when you click this button, it's clickHandler method does a DB search, and dynamically creates a LinkButton for each row it returns, sets the CommandName and CommandArgument properties and adds a CommandEventHandler method, then adds the LinkButton control to the page. The problem is, when you click a LinkButton, its CommandEventHandler method is never called, it looks like the page just posts back to where it was before the ORIGINAL "Search" button was pressed. I have seen postings saying that you need to add the event handlers in OnLoad() or some other early method, but my LinkButtons haven't even been created until the user tells us what to search for and hits the "Search" button... Any ideas on how to deal with this? Thanks!
0
[ 2, 272, 5910, 7782, 1326, 679, 3508, 811, 444, 1202, 807, 24641, 800, 3726, 3726, 86, 31, 57, 21, 5455, 1858, 235, 9, 9, 9, 31, 57, 40, 329, 9, 14113, 9, 5661, 9, 14113, 12898, 18, 9, 14113, 3091, 18, 9, 13401, 3091, 718, 9, ...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1...
How do I detect a keyboard modifier in a bookmarklet? === Is there a way to detect if the user is holding down the shift key (or other modifier keys) when executing a javascript bookmarklet? In my tests of Safari 3.1 and Firefox 3, `window.event` is always undefined.
0
[ 2, 184, 107, 31, 9092, 21, 8896, 7226, 16292, 19, 21, 360, 4527, 1336, 60, 800, 3726, 3726, 25, 80, 21, 161, 20, 9092, 100, 14, 4155, 25, 1337, 125, 14, 4471, 1246, 13, 5, 248, 89, 7226, 16292, 5534, 6, 76, 25836, 21, 8247, 87...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1...
How to handle per-Model database connections with ActiveRecord === I'd like the canonical way to do this. My Google searches have come up short. I have one ActiveRecord model that should map to a different database than the rest of the application. I would like to store the new configurations in the database.yml file as well. I understand that establish_connection should be called, but it's not clear where. Here's what I got so far, and it doesn't work: class Foo < ActiveRecord::Base establish_connection ('foo_#{ENV['RAILS_ENV']}').intern end
0
[ 2, 184, 20, 3053, 416, 8, 13998, 6018, 6760, 29, 1348, 14953, 800, 3726, 3726, 31, 22, 43, 101, 14, 5742, 4272, 161, 20, 107, 48, 9, 51, 8144, 19994, 57, 340, 71, 502, 9, 31, 57, 53, 1348, 14953, 1061, 30, 378, 2942, 20, 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...
AppDomain And the Current Directory === I have a class that utilizes a directory swap method for the Environment.CurrentDirectory. The code looks something like this: var str = Environment.CurrentDirectory; Environment.CurrentDirectory = Path.GetDirectoryName(pathToAssembly); var assembly = Assembly.Load(Path.GetFileNameWithoutExtension(pathToAssembly)); Environment.CurrentDirectory = str; As with my earlier post we are using this directory switching method to allow for loading of the specified assembly as well as any references assemblies, as well as unmanaged assemblies. The problem I am having is that this function is being run in two separate AppDomains. In AppDomain A (An AppDomain I create) the code works fine. In AppDomain B (the default AppDomain) it throws FileNotFoundException. For both of the calls I am trying to load the same assembly. Any clue why this would be the case?
0
[ 2, 4865, 537, 6232, 17, 14, 866, 16755, 800, 3726, 3726, 31, 57, 21, 718, 30, 13151, 18, 21, 16755, 17150, 2109, 26, 14, 2307, 9, 17657, 10197, 93, 9, 14, 1797, 1879, 301, 101, 48, 45, 4033, 13, 9729, 800, 2307, 9, 17657, 10197,...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
[ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1...