text stringlengths 0 30.5k | title stringclasses 1
value | embeddings listlengths 768 768 |
|---|---|---|
a longer discussion. All of the options end up writing to a subfolder or another under `%USERPROFILE%` for the user in question.
Finally, your application should stay out of `HKEY_CURRENT_CONFIG`. This hive holds hardware configuration, services configurations and other items that 99.9999% of applications should not need to look at (for example, it holds the current plug-and-play device list). If you need anything from there, most of the information is available through supported APIs elsewhere. | [
0.38965505361557007,
0.1254611313343048,
0.2825677990913391,
0.2717827260494232,
0.18800699710845947,
-0.3230566084384918,
0.013277268037199974,
0.43632811307907104,
-0.3734193742275238,
-0.6355682015419006,
-0.07251408696174622,
0.3019512891769409,
-0.09267137944698334,
0.2860427796840668... | |
In trying to figure out [this problem](https://stackoverflow.com/questions/52981/cannot-delete-from-the-database) (which is still unsolved and I still have no clue what is going on), I am wondering if maybe an external reference to the table in question is causing the problem. For example, a trigger or view or some other such thing.
Is there an easy way to find all references to a given database table? Including all views, triggers, constraints, or anything at all, preferably from the command line, and also preferably without a 3rd party tool (we are using db2).
Wow, I wouldn't have thought it, but there seems to be.. Good ole | [
0.07462967187166214,
0.3011150360107422,
0.15648852288722992,
0.10597876459360123,
0.2056683748960495,
-0.42068254947662354,
0.3443525731563568,
0.09545397758483887,
-0.6247928142547607,
-0.32212263345718384,
0.054514702409505844,
0.5798335075378418,
-0.38577935099601746,
0.418609082698822... | |
DB2.
I find the publib db2 docs view very very handy by the way:
<http://publib.boulder.ibm.com/infocenter/db2luw/v8//index.jsp>
I just found the "SYSCAT.TABDEP" catalog view in it, which seems to contain more or less what you asked for. I suspect for anything not covered there you'll have to trawl through the rest of the syscat tables which are vast. (Unfortunately I can't seem to link you to the exact page on SYSCAT.TABDEP itself, the search facility should lead you to it fairly easily though).
Most databases these days have a set of tables which contain data about the layout of your actual schema tables, quite handy for | [
0.08605622500181198,
0.2377728968858719,
0.05199890211224556,
0.008368865586817265,
-0.30590009689331055,
-0.3309601843357086,
0.1692851334810257,
0.24177922308444977,
-0.27341827750205994,
-0.6647529602050781,
0.030218271538615227,
0.5611885190010071,
-0.2117580622434616,
-0.2168567180633... | |
this sort of thing. | [
0.4126484990119934,
0.15155567228794098,
0.09930603206157684,
0.060577116906642914,
0.07878585904836655,
-0.2468300610780716,
0.02911384217441082,
0.2782222330570221,
-0.14134058356285095,
-0.06211106851696968,
0.14688058197498322,
0.16779132187366486,
-0.1030920147895813,
0.07680317759513... | |
After working for a while developing games, I've been exposed to both variable frame rates (where you work out how much time has passed since the last tick and update actor movement accordingly) and fixed frame rates (where you work out how much time has passed and choose either to tick a fixed amount of time or sleep until the next window comes).
Which method works best for specific situations? Please consider:
* Catering to different system specifications;
* Ease of development/maintenance;
* Ease of porting;
* Final performance.
It seems that most 3D developers prefer variable FPS: the Quake, Doom and Unreal engines both scale | [
0.2307247668504715,
0.08371469378471375,
0.48123911023139954,
0.19470703601837158,
-0.3268014192581177,
0.019723789766430855,
0.16119934618473053,
-0.09606044739484787,
-0.13521727919578552,
-0.6610878109931946,
0.21668954193592072,
0.7989442348480225,
0.0811108723282814,
0.078532136976718... | |
up and down based on system performance.
* At the very least you have to compensate for too fast frame rates (unlike 80's games running in the 90's, way too fast)
* Your main loop should be parameterized by the timestep anyhow, and as long as it's not too long, a decent integrator like RK4 should handle the physics smoothly Some types of animation (keyframed sprites) could be a pain to parameterize. Network code will need to be smart as well, to avoid players with faster machines from shooting too many bullets for example, but this kind of throttling will need to | [
0.09532967954874039,
0.03394346311688423,
0.4523642659187317,
0.5437353849411011,
-0.041589733213186264,
-0.15203021466732025,
0.10090705752372742,
-0.16929888725280762,
-0.8474557995796204,
-0.4234640896320343,
0.17331956326961517,
0.5602704286575317,
-0.09039372950792313,
-0.221989423036... | |
be done for latency compensation anyhow (the animation parameterization would help hide network lag too)
* The timing code will need to be modified for each platform, but it's a small localized change (though some systems make extremely accurate timing difficult, Windows, Mac, Linux seem ok)
* Variable frame rates allow for maximum performance. Fixed frame rates allow for consistent performance but will never reach max on all systems (that's seems to be a show stopper for any serious game)
If you are writing a networked 3D game where performance matters I'd have to say, bite the bullet and implement variable frame rates. | [
0.24878911674022675,
-0.24343565106391907,
0.2829771637916565,
0.374287486076355,
-0.036663930863142014,
-0.17908726632595062,
0.381828248500824,
0.18954211473464966,
-0.3341355323791504,
-0.7437357306480408,
0.25564342737197876,
0.9970498085021973,
-0.051184315234422684,
-0.24973466992378... | |
If it's a 2D puzzle game you probably can get away with a fixed frame rate, maybe slightly parameterized for super slow computers and next years models. | [
0.20071177184581757,
-0.08948911726474762,
-0.02457435615360737,
0.6345400214195251,
0.21167901158332825,
-0.1515561193227768,
-0.020240750163793564,
0.2919570207595825,
-0.19348874688148499,
-0.32625383138656616,
0.25271037220954895,
0.45423680543899536,
0.01604650355875492,
-0.1318665444... | |
I have two elements:
```
<input a>
<input b onclick="...">
```
When b is clicked, I want to access a and manipulate some of its data. A does not have a globally unique name, so `document.getElementsByName` is out. Looking into the event object, I thought `event.target.parentNode` would have some function like `getElementsByName`, but this does not seem to be the case with <td>s. Is there any simple way to do this?
If `a` and `b` are next to each other and have the same parent, you can use the `prevSibling` property of `b` to find `a`. | [
0.03621257469058037,
-0.03754379600286484,
0.05324647203087807,
-0.1128411740064621,
0.032812733203172684,
-0.0680689737200737,
-0.017070401459932327,
-0.08135399967432022,
0.0781165212392807,
-0.4153764545917511,
0.08957203477621078,
0.25635451078414917,
-0.1141509860754013,
0.44675055146... | |
Say a user is browsing a website, and then performs some action which changes the database (let's say they add a comment). When the request to actually add the comment comes in, however, we find we need to force them to login before they can continue.
Assume the login page asks for a username and password, and redirects the user back to the URL they were going to when the login was required. That redirect works find for a URL with only GET parameters, but if the request originally contained some HTTP POST data, that is now lost.
Can anyone recommend a | [
0.34733453392982483,
0.06725089251995087,
0.3747648298740387,
0.11092222481966019,
0.032320600003004074,
-0.29818034172058105,
0.2634104788303375,
0.13728222250938416,
-0.17568209767341614,
-0.6233900189399719,
-0.33537575602531433,
0.4033849835395813,
-0.17157471179962158,
0.3255089223384... | |
way to handle this scenario when HTTP POST data is involved?
Obviously, if necessary, the login page could dynamically generate a form with all the POST parameters to pass them along (though that seems messy), but even then, I don't know of any way for the login page to redirect the user on to their intended page while keeping the POST data in the request.
---
**Edit** : One extra constraint I should have made clear - Imagine we don't know if a login will be required until the user submits their comment. For example, their cookie might have expired between when they | [
0.4850364029407501,
-0.023701243102550507,
0.402558833360672,
0.2189209908246994,
-0.037961289286613464,
-0.04864567518234253,
0.4866708815097809,
-0.0651271864771843,
-0.2730429768562317,
-0.715427815914154,
0.08556590974330902,
0.3749077022075653,
-0.13153256475925446,
0.2375446110963821... | |
loaded the form and actually submitted the comment.
2 choices:
1. Write out the messy form from the login page, and JavaScript form.submit() it to the page.
2. Have the login page itself POST to the requesting page (with the previous values), and have that page's controller perform the login verification. Roll this into whatever logic you already have for detecting the not logged in user (frameworks vary on how they do this). In pseudo-MVC:
```
CommentController {
void AddComment() { | [
0.3846995234489441,
-0.21546366810798645,
0.4792988896369934,
0.0729510635137558,
-0.1410287618637085,
-0.12907496094703674,
0.21702568233013153,
-0.3810790181159973,
-0.21448752284049988,
-0.3219088017940521,
-0.18482732772827148,
0.5340043306350708,
-0.6286507844924927,
-0.00204439996741... | |
if (!Request.User.IsAuthenticated && !AuthenticateUser()) {
return;
}
// add comment to database
}
bool AuthenticateUser() {
if (Request.Form["username"] == "") { | [
-0.17028985917568207,
-0.045402441173791885,
0.48732510209083557,
-0.2419729232788086,
0.07150844484567642,
-0.20132409036159515,
0.5186129212379456,
-0.3379863500595093,
0.19379456341266632,
-0.27541178464889526,
-0.3558410108089447,
0.36914533376693726,
-0.3198755979537964,
0.16602319478... | |
// show login page
foreach (Key key in Request.Form) {
// copy form values
ViewData.Form.Add("hidden", key, Request.Form[key]);
} | [
0.19899457693099976,
0.03419174998998642,
0.5073558688163757,
-0.17943909764289856,
0.06040707230567932,
-0.08899814635515213,
0.342851847410202,
-0.19441170990467072,
0.026302754878997803,
-0.672245979309082,
-0.44161778688430786,
0.2990952730178833,
-0.5050813555717468,
0.168406367301940... | |
ViewData.Form.Action = Request.Url;
ShowLoginView();
return false;
} else {
// validate login
return | [
0.18308241665363312,
-0.42278435826301575,
0.5303605198860168,
-0.08623188734054565,
0.1284952610731125,
-0.008368735201656818,
0.5105686783790588,
-0.20912989974021912,
-0.20636525750160217,
-0.27842384576797485,
-0.38316813111305237,
0.604391872882843,
-0.44826218485832214,
0.09344571828... | |
TryLogin(Request.Form["username"], Request.Form["password"]);
}
}
}
``` | [
-0.07929093390703201,
-0.01864304579794407,
0.3421795070171356,
-0.1418236792087555,
0.5272598266601562,
-0.3875064253807068,
0.28664201498031616,
-0.002369023161008954,
0.1051095724105835,
-0.6282073855400085,
-0.571636438369751,
0.6055199503898621,
-0.5933235883712769,
0.1852262020111084... | |
I'm trying to use the [Optiflag](http://optiflag.rubyforge.org/discussion.html) package in my Ruby code and whenever I try to do the necessary `require optiflag.rb`, my program fails with the standard `no such file to load -- optiflag` message. I added the directory with that library to my $PATH variable, but it's still not working. Any ideas?
is it a gem? Are you doing
```
require 'rubygems'
require 'optiflag'
```
or equivalent? | [
0.5410836935043335,
0.039765555411577225,
0.179021418094635,
-0.3383403420448303,
-0.1173846647143364,
-0.029531776905059814,
0.7075023055076599,
-0.3933314085006714,
-0.011532056145370007,
-0.3447059690952301,
0.049003295600414276,
0.8565986752510071,
-0.5600205659866333,
-0.0630798116326... | |
I have a one to many relationship between two tables. The many table contains a clob column. The clob column looks like this in hibernate:
```
@CollectionOfElements(fetch = EAGER)
@JoinTable(name = NOTE_JOIN_TABLE, joinColumns = @JoinColumn(name = "note"))
@Column(name = "substitution")
@IndexColumn(name = "listIndex", base = 0)
@Lob
private List<String> substitutions;
```
So basically I may have a Note with some subsitutions, say `"foo"` and `"fizzbuzz"`. So in my main table I could have a Note with id 4 and in my `NOTE_JOIN_TABLE` I would have two rows, `"foo"` and `"fizzbuzz"` that both have a relationship to the Note.
However, when one of these is inserted into the DB **the larger | [
0.10360860079526901,
0.009966314770281315,
0.6812424063682556,
-0.35398295521736145,
-0.18032905459403992,
0.08023323118686676,
-0.0027351994067430496,
-0.30417749285697937,
0.13289885222911835,
-0.7250388264656067,
0.21452659368515015,
0.5241808891296387,
-0.1829545497894287,
0.0394001267... | |
substitution values are cropped to be as long as the shortest.** So in this case I would have `"foo"` and `"fiz"` in the DB instead of `"foo"` and `"fizzbuzz"`.
Do you have any idea why this is happening? I have checked and confirmed they aren't being cropped anywhere in our code, it's defintely hibernate.
To follow up with jodonnell's comment, a Web service connection can be made in just about any server-side language. It is just that the API example they provided was in Java probably because PlanPlusOnline is written in Java. If you have a URL for the service, and an | [
0.6006090044975281,
-0.08075887709856033,
0.04951492324471474,
-0.19269414246082306,
-0.10751140862703323,
0.02286556176841259,
0.3639414608478546,
-0.009280926547944546,
-0.026836229488253593,
-0.4437963664531708,
0.01260480098426342,
0.3968096971511841,
-0.5158534646034241,
0.12680456042... | |
access key, then all you really need to do is figure out how to traverse the XML returned. If you can't do Java, then I suggest PHP because it could be already installed, and have the proper modules loaded. This link might be helpful:
<http://www.onlamp.com/pub/a/php/2007/07/26/php-web-services.html> | [
0.0716080293059349,
0.07555273920297623,
0.5279859304428101,
0.14221830666065216,
0.10616681724786758,
-0.15327900648117065,
0.07795697450637817,
-0.09886108338832855,
-0.3675331771373749,
-0.5462377071380615,
-0.02118501253426075,
0.5164788961410522,
0.00827644020318985,
0.024950312450528... | |
I have built a web page which contains a Crystal Report built using the Crystal libraries included in Visual Studio 2008.
It '[works on my machine](http://jcooney.net/archive/2007/02/01/42999.aspx)' but when deployed to the web server the icons (Export, Print etc) on the Crystal Report toolbar do not display or work. Just seeing the 'red X' where the button image should be and clicking does nothing.
I have checked that the toolbar images are actually in the location being looked at on the web server:
(C:/Inetpub/wwwroot/aspnet\_client/system\_web/2\_0\_50727/CrystalReportWebFormViewer4/images/toolbar/)
They are all there.
I have checked the permissions on the above mentioned folder on the web server.
Gave | [
0.08128224313259125,
0.4190914034843445,
0.3584171235561371,
-0.23529428243637085,
-0.2397661656141281,
0.2216368168592453,
0.24676455557346344,
-0.018323011696338654,
-0.3782983720302582,
-0.7310091853141785,
0.14014559984207153,
0.4507732391357422,
-0.16777442395687103,
0.023908939212560... | |
'full control' to every user just to test it.
I have also intalled/run the 'CRRedist2008\_x86.msi' on the web server.
Some people have mentioned ensuring that 'crystalreportviewers115' folder is added to my '\wwwroot\aspnet\_client\system\_web\2\_0\_50727' folder on the web server but I have been unable to find the 'crystalreportviewers115' to copy it.
Appreciate any help or ideas you may be able to offer.
Update - OK, so obviously I hadn't checked well enough that the images were in the correct location.
Doh! Someone else here at work figured this out. It was really simple and I should have been able to sort it, but hey, | [
0.16781821846961975,
-0.008507831953465939,
0.5119712948799133,
0.2832324802875519,
-0.049057770520448685,
-0.27399617433547974,
0.16624537110328674,
0.1839512139558792,
-0.4482711851596832,
-0.4217085540294647,
-0.0666789710521698,
0.6812309622764587,
-0.14860984683036804,
0.2587597668170... | |
that's how it goes sometimes.
Here the fix:
On the web server, copy the 'aspnet\_client' folder from 'C:\Inetpub\wwwroot' to 'C:\Inetpub\wwwroot\your-website-name'.
That's all we did and it's now working.
Hope this saves someone from all the fuss I just went through. | [
0.2950476408004761,
-0.027429014444351196,
0.49628233909606934,
0.08842113614082336,
0.2897781729698181,
0.013857733458280563,
0.37268492579460144,
0.5370199680328369,
-0.37324631214141846,
-0.5805267691612244,
0.17097167670726776,
0.5981163382530212,
-0.21925121545791626,
-0.1249254196882... | |
*(see [here](https://stackoverflow.com/questions/53316/hibernate-crops-clob-values-oddly) for the problem I'm trying to solve)*
How do you get hibernate to log clob values it's going to insert. It is logging other value types, such as Integer etc.
I have the following in my log4j config:
```
log4j.logger.net.sf.hibernate.SQL=DEBUG
log4j.logger.org.hibernate.SQL=DEBUG
log4j.logger.net.sf.hibernate.type=DEBUG
log4j.logger.org.hibernate.type=DEBUG
```
Which produces output such as:
```
(org.hibernate.SQL) insert into NoteSubstitutions (note, listIndex, substitution) values (?, ?, ?)
(org.hibernate.type.LongType) binding '170650' to parameter: 1
(org.hibernate.type.IntegerType) binding '0' to parameter: 2
(org.hibernate.SQL) insert into NoteSubstitutions (note, listIndex, substitution) values (?, ?, ?)
(org.hibernate.type.LongType) binding '170650' to parameter: 1
(org.hibernate.type.IntegerType) binding '1' to parameter: 2
```
However you'll note that it never displays `parameter: 3` which is our clob.
What I would really want is something | [
0.22256794571876526,
0.07230999320745468,
0.7542580366134644,
-0.06929153203964233,
0.096469946205616,
-0.01850791461765766,
-0.027459770441055298,
-0.1175980493426323,
-0.16833533346652985,
-0.3497615456581116,
-0.03203212842345238,
0.3222017288208008,
-0.28462323546409607,
-0.07010957598... | |
like:
```
(org.hibernate.SQL) insert into NoteSubstitutions (note, listIndex, substitution) values (?, ?, ?)
(org.hibernate.type.LongType) binding '170650' to parameter: 1
(org.hibernate.type.IntegerType) binding '0' to parameter: 2
(org.hibernate.type.ClobType) binding 'something' to parameter: 3
(org.hibernate.SQL) insert into NoteSubstitutions (note, listIndex, substitution) values (?, ?, ?)
(org.hibernate.type.LongType) binding '170650' to parameter: 1
(org.hibernate.type.IntegerType) binding '1' to parameter: 2
(org.hibernate.type.ClobType) binding 'something else' to parameter: 3
```
How do I get it to show this in the log?
Try using:
```
log4j.logger.net.sf.hibernate=DEBUG
log4j.logger.org.hibernate=DEBUG
```
That's the finest level you'll get. If it does not show the information you want, then it's not possible. | [
0.18262682855129242,
-0.06365565955638885,
0.5949064493179321,
-0.05760452523827553,
0.21417692303657532,
-0.1585598737001419,
0.178299218416214,
-0.39891988039016724,
-0.10295818001031876,
-0.7733562588691711,
-0.09972106665372849,
0.44819697737693787,
-0.14925946295261383,
-0.10089775919... | |
I know the answer is not going to be simple, and I already use a couple of (I think ugly) cludges. I am simply looking for some elegant answers.
Abstract class:
```
public interface IOtherObjects;
public abstract class MyObjects<T> where T : IOtherObjects
{
...
public List<T> ToList()
{
...
}
}
```
Children:
```
public class MyObjectsA : MyObjects<OtherObjectA> //(where OtherObjectA implements IOtherObjects)
{
}
public class MyObjectsB : MyObjects<OtherObjectB> //(where OtherObjectB implements IOtherObjects)
{
}
```
Is it possible, looping through a collection of MyObjects (or other similar grouping, generic or otherwise) to then utilise to *ToList* method of the *MyObjects* | [
-0.21112602949142456,
-0.02627403661608696,
0.24784034490585327,
0.024460535496473312,
0.1122431829571724,
0.09160174429416656,
0.14657089114189148,
-0.16990888118743896,
-0.11122972518205643,
-0.7861371040344238,
-0.15216289460659027,
0.3034859001636505,
-0.4133727550506592,
0.06925443559... | |
base class, as we do not specifically know the type of T at this point.
**EDIT**
As for specific examples, whenever this has come up, I've thought about it for a while, and done something different instead, so there is no current requirement. but as it has come up quite frequently, I thought I would float it.
**EDIT**
@Sara, it's not the specific type of the collection I care about, it could be a List, but still the ToList method of each instance is relatively unusable, without an anonymous type)
@aku, true, and this question may be relatively hypothetical, however being able to retrieve, | [
0.6127268075942993,
-0.32224059104919434,
-0.10582105070352554,
0.2912343740463257,
-0.41362082958221436,
0.1134258285164833,
0.3267207443714142,
0.08543257415294647,
-0.2740308940410614,
-0.4418550431728363,
-0.03672955930233002,
0.2648978531360626,
-0.09030065685510635,
-0.08246115595102... | |
and work with a list of T of objects, knowing only their base type would be very useful. Having the ToList returning a List Of BaseType has been one of my workarounds
**EDIT** @ all: So far, this has been the sort of discussion I was hoping for, though it largely confirms all I suspected. Thanks all so far, but anyone else, feel free to input.
**EDIT**@Rob, Yes it works for a defined type, but not when the type is only known as a List of IOtherObjects.
@Rob **Again** Thanks. That has usually been my cludgy workaround (no disrespect :) ). Either | [
0.5015616416931152,
-0.04290849715471268,
0.2212343066930771,
-0.017466193065047264,
-0.2080255150794983,
-0.020390236750245094,
0.3998119831085205,
0.12087754905223846,
-0.31440630555152893,
-0.5423874855041504,
0.06625581532716751,
0.9443657398223877,
0.026635058224201202,
-0.27075871825... | |
that or using the ConvertAll function to Downcast through a delegate. Thanks for taking the time to understand the problem.
**QUALIFYING EDIT** in case I have been a little confusing
To be more precise, (I may have let my latest implementation of this get it too complex):
lets say I have 2 object types, B and C inheriting from object A.
Many scenarios have presented themselves where, from a List of B or a List of C, or in other cases a List of either - but I don't know which if I am at a base class, I have needed a less specific | [
0.5227053165435791,
-0.08367553353309631,
-0.08884676545858383,
-0.007162847556173801,
-0.16473767161369324,
-0.25718775391578674,
0.32779666781425476,
-0.06667346507310867,
-0.2884052097797394,
-0.7634629607200623,
-0.08150018006563187,
0.478157103061676,
-0.03453340008854866,
0.178788155... | |
List of A.
The above example was a watered-down example of the *List Of Less Specific* problem's latest incarnation.
Usually it has presented itself, as I think through possible scenarios that limit the amount of code that needs writing and seems a little more elegant than other options. I really wanted a discussion of possibilities and other points of view, which I have more or less got. I am surprised no one has mentioned ConvertAll() so far, as that is another workaround I have used, but a little too verbose for the scenarios at hand
@Rob **Yet Again** and Sara
Thanks, however I | [
0.4383316934108734,
-0.059895846992731094,
0.07575245201587677,
-0.08399820327758789,
-0.33918508887290955,
0.15913449227809906,
0.46760135889053345,
-0.07786104083061218,
-0.43778201937675476,
-0.5424184799194336,
0.18570442497730255,
0.4780379831790924,
-0.33943241834640503,
0.0986290797... | |
do feel I understand generics in all their static contexted glory, and did understand the issues at play here.
The actual design of our system and usage of generics it (and I can say this without only a touch of bias, as I was only one of the players in the design), has been done well. It is when I have been working with the core API, I have found situations when I have been in the wrong scope for doing something simply, instead I had to deal with them with a little less elegant than I like (trying either to | [
0.49114832282066345,
0.10413002967834473,
-0.016036076471209526,
-0.06791287660598755,
-0.2811395823955536,
-0.2096821665763855,
0.27193889021873474,
0.001523293904028833,
0.03383982181549072,
-0.5084511041641235,
0.28911471366882324,
0.6065694093704224,
-0.06974679231643677,
-0.0316878147... | |
be clever or perhaps lazy - I'll accept either of those labels).
My distaste for what I termed a cludge is largely that we require to do a loop through our record set simply to convert the objects to their base value which may be a performance hit.
I guess I was wondering if anyone else had come across this in their coding before, and if anyone had been cleverer, or at least more elegant, than me in dealing with it.
If you have
```
class B : A
class C : A
```
And you have
```
List<B> listB;
List<C> listC;
```
that you wish to treat as a List of the | [
0.4919353127479553,
0.1993991881608963,
-0.09274998307228088,
0.22103330492973328,
-0.023411551490426064,
-0.10960454493761063,
0.2920853793621063,
0.02094375528395176,
-0.2856370210647583,
-0.49700304865837097,
-0.014848077669739723,
0.44750919938087463,
-0.13981100916862488,
-0.100397586... | |
parent type
Then you should use
```
List<A> listA = listB.Cast<A>().Concat(listC.Cast<A>()).ToList()
``` | [
0.029073305428028107,
-0.3359004557132721,
0.370009183883667,
-0.1656339019536972,
0.06095102056860924,
-0.27660244703292847,
-0.0849558562040329,
-0.04270440712571144,
-0.07115140557289124,
-0.521091639995575,
-0.41338661313056946,
0.4009146988391876,
-0.2917229235172272,
0.16032652556896... | |
What memory leak detectors have people had a good experience with?
Here is a summary of the answers so far:
[Valgrind](http://valgrind.org/) - Instrumentation framework for building dynamic analysis tools.
[Electric Fence](http://directory.fsf.org/project/ElectricFence/) - A tool that works with GDB
[Splint](http://splint.org/) - Annotation-Assisted Lightweight Static Checking
[Glow Code](http://www.glowcode.com/) - This is a complete real-time performance and memory profiler for Windows and .NET programmers who develop applications with C++, C#, or any .NET Framework
Also see this [stackoverflow post](https://stackoverflow.com/questions/45627/how-do-you-detectavoid-memory-leaks-in-your-unmanaged-code).
second the [valgrind](http://valgrind.org/)... and I'll add [electric fence](http://directory.fsf.org/project/ElectricFence/). | [
0.4248816967010498,
-0.22991983592510223,
0.24125537276268005,
0.15495969355106354,
-0.28825148940086365,
-0.34740832448005676,
0.10400564223527908,
-0.5073376893997192,
-0.009518292732536793,
-0.35539570450782776,
0.08837489783763885,
0.5608619451522827,
-0.22788144648075104,
-0.231130048... | |
I'm doing something bad in my ASP.NET app. It could be the any number of CTP libraries I'm using or I'm just not disposing something properly. But when I redeploy my ASP.NET to my Vista IIS7 install or my server's IIS6 install I crash an IIS worker process.
I've narrowed the problem down to my HTTP crawler, which is a multithreaded beast that crawls sites for useful information when asked to. After I start a crawler and redeploy the app over the top, rather than gracefully unloading the appDomain and reloading, an IIS worker process will crash (popping up a crash | [
0.12402960658073425,
0.25838473439216614,
0.2429025024175644,
-0.12914365530014038,
-0.118678018450737,
0.08063724637031555,
0.7150105237960815,
0.14479464292526245,
-0.3427684009075165,
-0.7939227223396301,
-0.11655593663454056,
0.38562044501304626,
-0.45997679233551025,
0.236199751496315... | |
message) and continue reloading the app domain.
When this crash happens, where can I find the crash dump for analysis?
Download Debugging tools for Windows:
<http://www.microsoft.com/whdc/DevTools/Debugging/default.mspx>
Debugging Tools for Windows has has a script (ADPLUS) that allows you to create dumps when a process CRASHES:
<http://support.microsoft.com/kb/286350>
The command should be something like (if you are using IIS6):
```
cscript adplus.vbs -crash -pn w3wp.exe
```
This command will attach the debugger to the worker process. When the crash occurs it will generate a dump (a \*.DMP file).
You can open it in WinDBG (also included in the Debugging Tools for Windows). File > Open Crash dump...
By default, WinDBG will show you (next | [
0.2111755758523941,
0.16897472739219666,
0.27710476517677307,
0.08915799111127853,
-0.1901291012763977,
-0.09795886278152466,
0.35767662525177,
0.026582935824990273,
-0.23347382247447968,
-0.5202258229255676,
-0.31671980023384094,
0.14853878319263458,
-0.40019121766090393,
0.15160036087036... | |
to the command line) the thread were the process crashed.
The first thing you need to do in WinDBG is to load the .NET Framework extensions:
```
.loadby sos mscorwks
```
then, you will display the managed callstack:
```
!clrstack
```
if the thread was not running managed code, then you'll need to check the native stack:
```
kpn 200
```
This should give you some ideas. To continue troubleshooting I recommend you read the following article:
<http://msdn.microsoft.com/en-us/library/ee817663.aspx> | [
-0.3423490524291992,
0.031070997938513756,
0.46146872639656067,
-0.042161975055933,
-0.06313865631818771,
-0.4092195928096771,
0.4918277859687805,
0.15776614844799042,
-0.46294519305229187,
-0.5509190559387207,
-0.16428054869174957,
0.6652037501335144,
-0.16226796805858612,
0.0946698188781... | |
I want to wrap a piece of code that uses the Windows Impersonation API into a neat little helper class, and as usual, I'm looking for a way to go test-first. However, while WindowsIdentity is a managed class, the LogonUser call that is required to actually perform the logging in as another user is an unmanaged function in advapi32.dll.
I think I can work around this by introducing an interface for my helper class to use and hiding the P/Invoke calls in an implementation, but testing that implementation will still be a problem. And you can imagine actually performing the | [
0.4785763621330261,
-0.05976023152470589,
0.10771165788173676,
0.09443365782499313,
0.22988906502723694,
-0.15008388459682465,
0.19562256336212158,
-0.02234981767833233,
-0.1723363995552063,
-0.4904364049434662,
0.001115964027121663,
0.47290733456611633,
-0.2749747931957245,
0.005871444940... | |
impersonation in the test can be a bit problematic, given that the user would actually need to exist on the system.
*Guideline: Don't test code that you haven't written.*
You shouldn't be concerned with WinAPI implementation not working (most probably it works as expected).
Your concern should be testing the 'Wiring' i.e. if your code makes the right WinAPI call. In which case, all you need is to mock out the interface and let the mock framework tell if you the call was made with the right params. If yes, you're done.
* Create IWinAPIFacade (with relevant WinAPI methods) and implementation | [
0.572663426399231,
0.2115282416343689,
0.005541746038943529,
0.26987424492836,
-0.05718614161014557,
-0.17509722709655762,
0.6338878273963928,
-0.23342029750347137,
0.03360849991440773,
-0.49836140871047974,
-0.20430655777454376,
0.4633778929710388,
-0.357907235622406,
-0.1258910894393921,... | |
CWinAPIFacade.
* Write a test which plugs in a mock of IWinAPIFacade and verify that the appropriate call is made
* Write a test to ensure that CWinAPIFacade is created and plugged in as a default (in normal functioning)
* Implement CWinAPIFacade which simply blind-delegates to Platform Invoke calls - no need to auto-test this layer. Just do a manual verification. Hopefully this won't change that often and nothing breaks. If you find that it *does* in the future, barricade it with some tests. | [
0.2985859811306,
-0.2671116888523102,
0.10747778415679932,
0.1558339148759842,
-0.11700722575187683,
-0.31047913432121277,
0.7506557106971741,
-0.018253253772854805,
0.026467805728316307,
-0.6025702357292175,
0.1498197615146637,
0.8168484568595886,
-0.3017077147960663,
-0.110677570104599,
... | |
Hey, I'm using [Levenshteins](http://en.wikipedia.org/wiki/Levenshtein_distance) algorithm to get distance between source and target string.
also I have method which returns value from 0 to 1:
```
/// <summary>
/// Gets the similarity between two strings.
/// All relation scores are in the [0, 1] range,
/// which means that if the score gets a maximum value (equal to 1)
/// then the two string are absolutely similar
/// </summary>
/// <param name="string1">The string1.</param>
/// <param name="string2">The string2.</param>
/// <returns></returns>
public static float CalculateSimilarity(String s1, String s2)
{
if ((s1 == null) || (s2 == null)) return 0.0f;
float dis = LevenshteinDistance.Compute(s1, s2);
float | [
0.17086902260780334,
0.09640461951494217,
0.5066773891448975,
0.0617632158100605,
-0.3213297426700592,
0.22910824418067932,
0.13477733731269836,
-0.9847051501274109,
-0.22313731908798218,
-0.37161773443222046,
0.16954505443572998,
0.3866044580936432,
0.02164357714354992,
0.3448118567466736... | |
maxLen = s1.Length;
if (maxLen < s2.Length)
maxLen = s2.Length;
if (maxLen == 0.0F)
return 1.0F;
else return 1.0F - dis / maxLen;
}
```
but this for me is not enough. Because I need more complex way to match two sentences.
For example I want automatically tag some music, I have original song names, and i have songs with trash, like *super, quality,* years like *2007, 2008,* etc..etc.. also some files have just <http://trash..thash..song_name_mp3.mp3>, other are normal. I want to | [
0.29007357358932495,
-0.23119544982910156,
0.5679537057876587,
-0.0011789259733632207,
-0.0729595348238945,
-0.14013029634952545,
0.30234354734420776,
-0.17759546637535095,
-0.38926583528518677,
-0.33881548047065735,
-0.04818998649716377,
0.7041040658950806,
-0.09855944663286209,
0.0928593... | |
create an algorithm which will work just more perfect than mine now.. Maybe anyone can help me?
here is my current algo:
```
/// <summary>
/// if we need to ignore this target.
/// </summary>
/// <param name="targetString">The target string.</param>
/// <returns></returns>
private bool doIgnore(String targetString)
{
if ((targetString != null) && (targetString != String.Empty))
{
for (int i = 0; i < ignoreWordsList.Length; ++i)
{
//* if we found ignore word or target string matching some some | [
0.18218980729579926,
-0.10365627706050873,
0.3911445438861847,
0.004232797771692276,
-0.20505377650260925,
0.09081395715475082,
0.2441929429769516,
-0.5716089606285095,
-0.31343919038772583,
-0.5102816820144653,
0.1294652223587036,
0.32182061672210693,
-0.46730944514274597,
-0.123282894492... | |
special cases like years (Regex).
if (targetString == ignoreWordsList[i] || (isMatchInSpecialCases(targetString))) return true;
}
}
return false;
}
/// <summary>
/// Removes the duplicates.
/// </summary>
/// <param name="list">The list.</param>
private void removeDuplicates(List<String> list)
{
if ((list != null) && (list.Count > 0))
{
for (int i = 0; i < list.Count - 1; ++i)
{ | [
0.24113580584526062,
0.09285564720630646,
0.35616546869277954,
-0.02247517555952072,
0.095302514731884,
0.3056669533252716,
0.3236533999443054,
-0.74186772108078,
-0.7635396718978882,
-0.3042387366294861,
-0.20342320203781128,
0.322824627161026,
-0.4488416314125061,
0.1979796588420868,
0... | |
if (list[i] == list[i + 1])
{
list.RemoveAt(i);
--i;
}
}
}
}
/// <summary>
/// Does the fuzzy match.
/// </summary>
/// <param name="targetTitle">The target title.</param>
/// <returns></returns>
private TitleMatchResult doFuzzyMatch(String targetTitle)
{
TitleMatchResult matchResult = null; | [
-0.1304040402173996,
-0.38379350304603577,
0.6260910034179688,
-0.13735365867614746,
0.06989923864603043,
-0.18542702496051788,
0.2189731001853943,
-0.5267785787582397,
0.2618175745010376,
-0.26002320647239685,
-0.5486518740653992,
0.3822425305843353,
-0.182334765791893,
0.1727772355079651... | |
if (targetTitle != null && targetTitle != String.Empty)
{
try
{
//* change target title (string) to lower case.
targetTitle = targetTitle.ToLower();
//* scores, we will select higher score at the end.
Dictionary<Title, float> scores = new Dictionary<Title, float>(); | [
0.018725154921412468,
-0.17554070055484772,
0.7222673892974854,
-0.06981192529201508,
0.2539396286010742,
0.04697912186384201,
0.154441699385643,
-0.437771201133728,
0.28541114926338196,
-0.525568962097168,
-0.30782806873321533,
0.707895040512085,
0.19640803337097168,
-0.018675612285733223... | |
//* do split special chars: '-', ' ', '.', ',', '?', '/', ':', ';', '%', '(', ')', '#', '\"', '\'', '!', '|', '^', '*', '[', ']', '{', '}', '=', '!', '+', '_'
List<String> targetKeywords = new List<string>(targetTitle.Split(ignoreCharsList, StringSplitOptions.RemoveEmptyEntries));
//* remove all trash from keywords, like super, quality, etc..
targetKeywords.RemoveAll(delegate(String x) { return doIgnore(x); });
//* sort keywords. | [
0.27517610788345337,
-0.1412666290998459,
0.07994759827852249,
-0.06033334136009216,
-0.12048997730016708,
0.23262420296669006,
0.21615144610404968,
-0.17099033296108246,
0.0025216832291334867,
-0.39887645840644836,
-0.578312873840332,
0.217317596077919,
-0.25956299901008606,
0.14580093324... | |
targetKeywords.Sort();
//* remove some duplicates.
removeDuplicates(targetKeywords);
//* go through all original titles.
foreach (Title sourceTitle in titles)
{
float tempScore = 0f;
//* split orig. title to keywords list. | [
0.3842543065547943,
0.15507787466049194,
0.4490036368370056,
-0.04967399314045906,
0.22778663039207458,
-0.09592888504266739,
0.20922063291072845,
-0.3838633596897125,
-0.1290367692708969,
-0.34642934799194336,
-0.15870440006256104,
0.23718450963497162,
-0.19994628429412842,
0.240652203559... | |
List<String> sourceKeywords = new List<string>(sourceTitle.Name.Split(ignoreCharsList, StringSplitOptions.RemoveEmptyEntries));
sourceKeywords.Sort();
removeDuplicates(sourceKeywords);
//* go through all source ttl keywords.
foreach (String keyw1 in sourceKeywords)
{
float max = float.MinValue; | [
0.17733675241470337,
-0.07164096087217331,
0.6351194381713867,
-0.2574440836906433,
0.22048702836036682,
0.18655063211917877,
0.33438894152641296,
-0.4701521098613739,
-0.07376474142074585,
-0.47709494829177856,
-0.3116127848625183,
0.5481892228126526,
-0.359576016664505,
0.154409542679786... | |
foreach (String keyw2 in targetKeywords)
{
float currentScore = StringMatching.StringMatching.CalculateSimilarity(keyw1.ToLower(), keyw2);
if (currentScore > max) | [
-0.06580064445734024,
-0.2156980186700821,
0.6043615937232971,
-0.2841552495956421,
0.43846043944358826,
0.16951778531074524,
0.138607457280159,
-0.7433629035949707,
0.1091972142457962,
-0.29728320240974426,
0.058816488832235336,
0.3548559248447418,
-0.1236635372042656,
-0.0098878536373376... | |
{
max = currentScore;
}
}
tempScore += max;
} | [
0.1996474713087082,
-0.5251848101615906,
0.5419224500656128,
0.0535043329000473,
0.15874214470386505,
0.03288206830620766,
0.3863840401172638,
-0.36078009009361267,
-0.14689010381698608,
-0.5544753074645996,
0.10161634534597397,
0.25557586550712585,
-0.3463152348995209,
-0.0131532810628414... | |
//* calculate average score.
float averageScore = (tempScore / Math.Max(targetKeywords.Count, sourceKeywords.Count));
//* if average score is bigger than minimal score and target title is not in this source title ignore list.
if (averageScore >= minimalScore && !sourceTitle.doIgnore(targetTitle))
{ | [
0.14657726883888245,
-0.08779683709144592,
0.6371052861213684,
0.20002388954162598,
0.07133907079696655,
-0.010989535599946976,
0.21269556879997253,
-0.12245077639818192,
-0.12534910440444946,
-0.7536137700080872,
0.06641437858343124,
0.33881905674934387,
-0.13727523386478424,
-0.159591391... | |
//* add score.
scores.Add(sourceTitle, averageScore);
}
}
//* choose biggest score.
float maxi = float.MinValue;
foreach (KeyValuePair<Title, float> kvp in scores)
{
if (kvp.Value > | [
0.020961454138159752,
-0.4756161570549011,
0.61249840259552,
0.5524224042892456,
0.2751743495464325,
0.1442357301712036,
0.36235085129737854,
-0.24549993872642517,
0.1044173464179039,
-0.5581194162368774,
-0.11399897933006287,
0.6483867764472961,
0.34556615352630615,
0.34539785981178284,
... | |
maxi)
{
maxi = kvp.Value;
matchResult = new TitleMatchResult(maxi, kvp.Key, MatchTechnique.FuzzyLogic);
}
}
}
catch { }
}
//* return result.
return matchResult;
}
```
This works normally but just in some cases, a lot of titles which should match, does | [
0.3461848497390747,
-0.3310369551181793,
0.7170920968055725,
0.42179688811302185,
0.19139935076236725,
-0.37302350997924805,
0.20021377503871918,
-0.4594411253929138,
0.32963576912879944,
-0.41157639026641846,
-0.20686069130897522,
0.8411259055137634,
-0.005701431538909674,
0.5650057792663... | |
not match... I think I need some kind of formula to play with weights and etc, but i can't think of one..
Ideas? Suggestions? Algos?
by the way I already know this topic (My colleague already posted it but we cannot come with a proper solution for this problem.):
[Approximate string matching algorithms](https://stackoverflow.com/questions/49263/approximate-string-matching-algorithms)
Your problem here may be distinguishing between noise words and useful data:
* Rolling\_Stones.Best\_of\_2003.Wild\_Horses.mp3
* Super.Quality.Wild\_Horses.mp3
* Tori\_Amos.Wild\_Horses.mp3
You may need to produce a dictionary of noise words to ignore. That seems clunky, but I'm not sure there's an algorithm that can distinguish between band/album names and noise. | [
0.4278860092163086,
0.3171139359474182,
-0.20097723603248596,
0.05376939848065376,
-0.4024999737739563,
-0.16477862000465393,
0.1469043493270874,
-0.0004978169454261661,
-0.28095123171806335,
-0.3255018889904022,
0.33128780126571655,
0.8884578347206116,
-0.2532918453216553,
0.3145669996738... | |
What are some of the ways? What frameworks can you use?
Here's a project which does this: <http://tsqlunit.sourceforge.net/>
Also, Visual Studio Team System for DBA has built-in support for unit testing of Databases. | [
0.4965122938156128,
-0.13346490263938904,
-0.09016048908233643,
0.2284940779209137,
-0.16893313825130463,
-0.22917328774929047,
0.06350918114185333,
-0.18553030490875244,
-0.30509063601493835,
-0.43921908736228943,
0.018854985013604164,
0.3810986578464508,
0.13114644587039948,
-0.170799046... | |
What is the best way to get a log of commits on a branch since the time it was branched from the current branch? My solution so far is:
```
git log $(git merge-base HEAD branch)..branch
```
The documentation for [git-diff](http://git-scm.com/docs/git-diff) indicates that `git diff A...B` is equivalent to `git diff $(git-merge-base A B) B`. On the other hand, the documentation for [git-rev-parse](http://www.kernel.org/pub/software/scm/git/docs/git-rev-parse.html) indicates that `r1...r2` is defined as `r1 r2 --not $(git merge-base --all r1 r2)`.
Why are these different? Note that `git diff HEAD...branch` gives me the diffs I want, but the corresponding git log command gives me more than what I want.
In | [
0.19873064756393433,
-0.04810255393385887,
0.4748564660549164,
-0.12593334913253784,
0.05959846451878548,
0.012757258489727974,
0.2682604193687439,
-0.376376211643219,
-0.3819204270839691,
-0.439344197511673,
-0.28774547576904297,
0.6728308200836182,
-0.3850758373737335,
0.1940918266773224... | |
pictures, suppose this:
```
x---y---z---branch
/
---a---b---c---d---e---HEAD
```
I would like to get a log containing commits x, y, z.
* `git diff HEAD...branch` gives these commits
* however, `git log HEAD...branch` gives x, y, z, c, d, e.
In the context of a revision list, `A...B` is how `git-rev-parse` defines it. git-log takes a revision list. `git-diff` does not take a list of revisions - it takes one or two revisions, and has defined the `A...B` syntax to mean how it's defined in the `git-diff` manpage. If `git-diff` did not explicitly | [
0.03527927026152611,
0.18939784169197083,
0.41129839420318604,
0.03224313631653786,
0.05897212028503418,
0.04124661535024643,
0.03996196761727333,
-0.2975253462791443,
-0.3678706884384155,
-0.5194798111915588,
-0.3375245928764343,
0.4580136835575104,
-0.35197943449020386,
0.097556367516517... | |
define `A...B`, then that syntax would be invalid. Note that the `git-rev-parse` manpage describes `A...B` in the "Specifying Ranges" section, and everything in that section is only valid in situations where a revision range is valid (i.e. when a revision list is desired).
To get a log containing just x, y, and z, try `git log HEAD..branch` (two dots, not three). This is identical to `git log branch --not HEAD`, and means all commits on branch that aren't on HEAD. | [
0.3462888300418854,
-0.06280598789453506,
0.11820513010025024,
-0.02781078964471817,
0.1743059903383255,
0.010438615456223488,
0.3439611792564392,
-0.16442826390266418,
-0.4750627279281616,
-0.44144561886787415,
-0.2626904249191284,
0.40767818689346313,
-0.3408759832382202,
0.1028417497873... | |
I've started using Vim to develop Perl scripts and am starting to find it very powerful.
One thing I like is to be able to open multiple files at once with:
```
vi main.pl maintenance.pl
```
and then hop between them with:
```
:n
:prev
```
and see which file are open with:
```
:args
```
And to add a file, I can say:
```
:n test.pl
```
which I expect would then be added to my list of files, but instead it wipes out my current file list and when I type `:args` I only have `test.pl` open.
So how can I add and remove files in my args list?
Why not use tabs (introduced in Vim | [
0.4533211588859558,
0.0971575379371643,
0.3559848666191101,
-0.11146803200244904,
-0.32314544916152954,
-0.02554433047771454,
0.2248554825782776,
-0.011678650975227356,
-0.4727899730205536,
-0.5979998111724854,
0.18760865926742554,
0.5470349192619324,
-0.43996143341064453,
0.34045082330703... | |
7)?
You can switch between tabs with `:tabn` and `:tabp`,
With `:tabe <filepath>` you can add a new tab; and with a regular `:q` or `:wq` you close a tab.
If you map `:tabn` and `:tabp` to your `F7`/`F8` keys you can easily switch between files.
If there are not that many files or you don't have Vim 7 you can also split your screen in multiple files: `:sp <filepath>`. Then you can switch between splitscreens with `Ctrl`+`W` and then an arrow key in the direction you want to move (or instead of arrow keys, `w` for next and `W` for previous splitscreen) | [
0.2560536861419678,
-0.6447190046310425,
0.908344566822052,
-0.10628713667392731,
0.13103337585926056,
0.12916015088558197,
0.17049512267112732,
-0.03893592953681946,
-0.5950610637664795,
-0.8430353403091431,
-0.07165960222482681,
0.9917197227478027,
-0.3815641403198242,
0.2258570194244384... | |
I am trying to join together several audio files into one mp4/m4a file containing chapter metadata.
I am currently using QTKit to do this but unfortunately when QTKit exports to m4a format the metadata is all stripped out (this has been confirmed as a bug by Apple) see [sample code](http://files.shinydevelopment.com/audiojoiner.zip). I think this rules QTKit out for this job, but would be happy to be proven wrong as it is a really neat API for it if it worked.
So, I am looking for a way to concatenate audio files (input format does not really matter as I can do conversion) into | [
0.8154696822166443,
0.35455936193466187,
0.3520561754703522,
0.07126691937446594,
-0.0429949127137661,
-0.44693225622177124,
0.2426593154668808,
-0.32140710949897766,
-0.24637959897518158,
-0.45815014839172363,
0.2404635101556778,
0.8351734280586243,
-0.21097587049007416,
0.430763870477676... | |
an m4a file with chapters metadata.
As an alternative to code, I am open to the idea of using an existing command line tool to accomplish this as long as it is redistributable as part of another application.
Any ideas?
[Audiobook Maker](http://audiobookmaker.sourceforge.net/) does something like this, and I believe it uses ffmpeg under the hood. It's open source, so maybe its worth a look? | [
0.5282851457595825,
0.1196681335568428,
0.0068774172104895115,
0.244694322347641,
0.016057606786489487,
-0.5624195337295532,
0.1165071576833725,
-0.16879330575466156,
-0.458844393491745,
-0.23360812664031982,
-0.20647409558296204,
0.5571472644805908,
-0.22284936904907227,
-0.05971857532858... | |
Which compiles to faster code: "ans = n \* 3" or "ans = n+(n\*2)"?
Assuming that n is either an int or a long, and it is is running on a modern Win32 Intel box.
Would this be different if there was some dereferencing involved, that is, which of these would be faster?
```
long a;
long *pn;
long ans;
...
*pn = some_number;
ans = *pn * 3;
```
Or
```
ans = *pn+(*pn*2);
```
Or, is it something one need not worry about as optimizing compilers are likely to account for this in any case?
IMO such micro-optimization is not necessary unless you work | [
-0.09200736880302429,
-0.06024209409952164,
-0.1790589541196823,
-0.13974815607070923,
0.035383664071559906,
0.12700709700584412,
0.2211248278617859,
-0.08479756861925125,
-0.3232119679450989,
-0.4701749384403229,
-0.16367702186107635,
0.50107342004776,
-0.3409613370895386,
-0.297879457473... | |
with some exotic compiler. I would put readability on the first place. | [
0.26088404655456543,
0.22132551670074463,
-0.08548392355442047,
0.31899377703666687,
-0.23726855218410492,
-0.07796726375818253,
-0.07467061281204224,
0.029759444296360016,
0.16954508423805237,
-0.43250128626823425,
-0.09219727665185928,
0.577966034412384,
-0.26989224553108215,
-0.15232871... | |
OK, so we all know the daily build is the heart beat of a project, but whats the single best way of automating it?
We have perl scripts wrapping our pipeline which includes ClearCase, VS2005 (C++), Intel FORTRAN, Inno setup. We use cron jobs on UNIX to schedule the build, and host a simple Apache web server to view and monitor the build. All in all its rather complex, I would like to know whats the best off the shelf solution that people use?
And yes I did say FORTRAN no escaping it sometimes, it works, no point doing a huge | [
0.6300594806671143,
0.2666991353034973,
0.01880398392677307,
0.041404906660318375,
0.0014588842168450356,
-0.056757088750600815,
0.2704811990261078,
0.1698862612247467,
0.0010184592101722956,
-0.32236266136169434,
0.04202176257967949,
0.8810738921165466,
0.06264857202768326,
-0.17815493047... | |
re-implementation project for some tried and tested FEA code that just works.
We're in the process of implementing CC.Net. So far it seems like it would fit your model pretty well.
Out of the box it offers automated building, results tracking and notification. I'm not sure how detailed the build-in-progress monitoring is though. | [
0.8597403764724731,
-0.16552035510540009,
0.2941315472126007,
0.22365544736385345,
0.10107430070638657,
-0.3330109417438507,
0.1724814772605896,
-0.04847098886966705,
-0.3101854622364044,
-0.5526512861251831,
0.41110163927078247,
0.5263582468032837,
-0.03746260330080986,
-0.041907005012035... | |
In the application I'm developping (in Java/swing), I have to show a full screen window on the *second* screen of the user.
I did this using a code similar to the one you'll find below...
Be, as soon as I click in a window opened by windows explorer, or as soon as I open windows explorer (i'm using windows XP), the full screen window is minimized...
Do you know any way or workaround to fix this problem, or is there something important I did not understand with full screen windows?
Thanks for the help,
```
import javax.swing.JFrame;
import javax.swing.JPanel;
import javax.swing.JWindow;
import java.awt.BorderLayout;
import java.awt.Dimension;
import java.awt.GraphicsDevice;
import java.awt.GraphicsEnvironment;
import java.awt.Window;
import javax.swing.JButton;
import javax.swing.JToggleButton;
import | [
0.36913228034973145,
0.18320204317569733,
0.34979844093322754,
-0.29885002970695496,
-0.5363819599151611,
0.19852888584136963,
0.3274271786212921,
-0.2374492734670639,
-0.009150570258498192,
-1.025834321975708,
-0.07692713290452957,
0.6339841485023499,
-0.5209513306617737,
-0.0342375226318... | |
java.awt.Rectangle;
import java.awt.GridBagLayout;
import javax.swing.JLabel;
public class FullScreenTest {
private JFrame jFrame = null; // @jve:decl-index=0:visual-constraint="94,35"
private JPanel jContentPane = null;
private JToggleButton jToggleButton = null;
private JPanel jFSPanel = null; // @jve:decl-index=0:visual-constraint="392,37"
private JLabel jLabel = null;
private Window window;
/**
* This method initializes jFrame
*
* @return javax.swing.JFrame
*/ | [
0.06222798675298691,
-0.2541563808917999,
0.5857198238372803,
-0.15335194766521454,
-0.19184525310993195,
0.35686734318733215,
0.40854164958000183,
-0.12749625742435455,
-0.06876353174448013,
-0.8096030354499817,
-0.1551627367734909,
0.4392337501049042,
-0.40117838978767395,
-0.15088774263... | |
private JFrame getJFrame() {
if (jFrame == null) {
jFrame = new JFrame();
jFrame.setSize(new Dimension(474, 105));
jFrame.setDefaultCloseOperation(JFrame.EXIT_ON_CLOSE);
jFrame.setContentPane(getJContentPane());
}
return jFrame;
}
/**
* | [
-0.12298044562339783,
-0.22806839644908905,
0.7568828463554382,
-0.10788100212812424,
0.19729791581630707,
0.10860328376293182,
0.30764642357826233,
-0.2772951126098633,
-0.02325049601495266,
-0.6006283760070801,
-0.4495900571346283,
0.36080753803253174,
-0.3762536942958832,
0.304158508777... | |
This method initializes jContentPane
*
* @return javax.swing.JPanel
*/
private JPanel getJContentPane() {
if (jContentPane == null) {
jContentPane = new JPanel();
jContentPane.setLayout(null);
jContentPane.add(getJToggleButton(), null);
} | [
0.05855894088745117,
-0.4202677607536316,
0.3629017770290375,
-0.30071505904197693,
0.038330063223838806,
0.11025575548410416,
0.32743191719055176,
-0.46820157766342163,
-0.08349744975566864,
-0.57552570104599,
-0.24254204332828522,
0.27445122599601746,
-0.4896013140678406,
-0.001996571430... | |
return jContentPane;
}
/**
* This method initializes jToggleButton
*
* @return javax.swing.JToggleButton
*/
private JToggleButton getJToggleButton() {
if (jToggleButton == null) {
jToggleButton = new JToggleButton();
jToggleButton.setBounds(new Rectangle(50, 23, 360, 28)); | [
0.33551058173179626,
-0.2641697824001312,
0.8231866359710693,
-0.5288816690444946,
0.13978461921215057,
0.31960442662239075,
0.28687429428100586,
-0.7244688272476196,
-0.17616795003414154,
-0.5094654560089111,
-0.10180342942476273,
0.27289944887161255,
-0.5553874969482422,
-0.0272540543228... | |
jToggleButton.setText("Show Full Screen Window on 2nd screen");
jToggleButton.addActionListener(new java.awt.event.ActionListener() {
public void actionPerformed(java.awt.event.ActionEvent e) {
showFullScreenWindow(jToggleButton.isSelected());
}
}); | [
0.01519626285880804,
-0.41679272055625916,
0.6828120350837708,
-0.5970188975334167,
0.03530554845929146,
0.19627095758914948,
0.522792398929596,
-0.28686562180519104,
-0.09442276507616043,
-0.4601384997367859,
-0.49483242630958557,
0.561095654964447,
-0.5500741600990295,
-0.156893536448478... | |
}
return jToggleButton;
}
protected void showFullScreenWindow(boolean b) {
if(window==null){
window = initFullScreenWindow();
}
window.setVisible(b);
}
private Window initFullScreenWindow() {
GraphicsEnvironment ge = GraphicsEnvironment.getLocalGraphicsEnvironment();
GraphicsDevice[] gds = ge.getScreenDevices(); | [
-0.034301288425922394,
-0.3875342011451721,
0.5131560564041138,
-0.39715760946273804,
-0.23053665459156036,
0.11531516909599304,
0.5138013958930969,
-0.07634669542312622,
-0.019574550911784172,
-1.0035240650177002,
-0.3135381042957306,
0.7553833723068237,
-0.313087522983551,
0.198170498013... | |
GraphicsDevice gd = gds[1];
JWindow window = new JWindow(gd.getDefaultConfiguration());
window.setContentPane(getJFSPanel());
gd.setFullScreenWindow(window);
return window;
}
/**
* This method initializes jFSPanel
*
* @return javax.swing.JPanel
*/
private JPanel getJFSPanel() {
if | [
-0.01143716461956501,
-0.35606634616851807,
0.611082911491394,
-0.24182626605033875,
-0.32456958293914795,
0.17946554720401764,
0.2827187776565552,
-0.1875019520521164,
-0.20402918756008148,
-0.914505124092102,
-0.31942394375801086,
0.5917531251907349,
-0.41007277369499207,
0.0543513149023... | |
(jFSPanel == null) {
jLabel = new JLabel();
jLabel.setBounds(new Rectangle(18, 19, 500, 66));
jLabel.setText("Hello ! Now, juste open windows explorer and see what happens...");
jFSPanel = new JPanel();
jFSPanel.setLayout(null);
jFSPanel.setSize(new Dimension(500, 107)); | [
-0.1572253555059433,
-0.31636470556259155,
0.6178110241889954,
-0.2635926306247711,
0.012966226786375046,
0.16985391080379486,
0.25334569811820984,
-0.07628917694091797,
-0.3634380102157593,
-0.8987643122673035,
-0.733615517616272,
0.22578327357769012,
-0.5427927374839783,
0.15937946736812... | |
jFSPanel.add(jLabel, null);
}
return jFSPanel;
}
/**
* @param args
*/
public static void main(String[] args) {
FullScreenTest me = new FullScreenTest();
me.getJFrame().setVisible(true);
}
}
```
Usually when an application is in "full screen" mode it will take over the entire desktop. For a user to | [
0.16181747615337372,
-0.2278536558151245,
0.6567717790603638,
-0.4562540054321289,
-0.03100930154323578,
0.11167804151773453,
0.4459885060787201,
-0.027650579810142517,
-0.3806757926940918,
-0.7543783187866211,
-0.3511703908443451,
0.38139498233795166,
-0.3259338140487671,
0.22382643818855... | |
get to another window they would have to alt-tab to it. At that point windows would minimize the full screen app so that the other application could come to the front.
This sounds like it may be a bug (undocumented feature...) in windows. It should probably not be doing this for a dual screen setup.
One option to fix this is rather than setting it to be "full screen" just make the window the same size as the screen with location (0,0). You can get screen information from the [GraphicsConfigurations on the GraphicsDevice](http://java.sun.com/j2se/1.4.2/docs/api/java/awt/GraphicsDevice.html#getConfigurations%28%29). | [
0.2190486192703247,
-0.21707430481910706,
0.5761700868606567,
0.01106880884617567,
-0.08080761134624481,
0.016602983698248863,
0.373333215713501,
0.03972041606903076,
-0.14398093521595,
-0.9321758151054382,
-0.2210683971643448,
0.6625330448150635,
-0.08721758425235748,
-0.06194745376706123... | |
I am attempting to use the .Net System.Security.SslStream class to process the server side of a SSL/TLS stream with client authentication.
To perform the handshake, I am using this code:
```
SslStream sslStream = new SslStream(innerStream, false, RemoteCertificateValidation, LocalCertificateSelectionCallback);
sslStream.AuthenticateAsServer(serverCertificate, true, SslProtocols.Default, false);
```
Unfortunately, this results in the SslStream transmitting a CertificateRequest containing the subjectnames of all certificates in my CryptoAPI Trusted Root Store.
I would like to be able to override this. It is not an option for me to require the user to install or remove certificates from the Trusted Root Store.
It looks like the SslStream uses SSPI/SecureChannel underneath, so if anyone knows how | [
0.10314472019672394,
0.15519070625305176,
0.4847155511379242,
-0.04213079810142517,
0.004123111721128225,
-0.3723416328430176,
0.6186561584472656,
-0.03703264147043228,
-0.06261082738637924,
-0.7476679682731628,
-0.14793993532657623,
0.40549904108047485,
-0.1597452610731125,
0.388559043407... | |
to do the equivalent with that API, that would be helpful, too.
Any ideas?
It does not look like this is currently possible using the .NET libraries.
I solved it by using the Mono class library implementation of System.Security.SslStream, which gives better access to overriding the servers behavior during the handshake. | [
0.2980005741119385,
-0.11342713236808777,
0.08921973407268524,
0.26941269636154175,
-0.06917988508939743,
-0.3567829430103302,
0.25370192527770996,
-0.012096325866878033,
-0.14922727644443512,
-0.5893644094467163,
0.1352914422750473,
0.44612064957618713,
-0.2458016574382782,
0.171986073255... | |
I'm using MinGW with GCC 3.4.5 (mingw-special vista r3).
My C application uses a lot of stack so I was wondering is there any way I can tell programatically how much stack is remaining so I can cleanly handle the situation if I find that I'm about to run out.
If not what other ways would you work around the problem of potentially running out of stack space?
I've no idea what size of stack I'll start with so would need to identify that programatically also.
Raymond Chen ([The Old New Thing](http://blogs.msdn.com/oldnewthing/default.aspx)) has a good answer to this sort of question:
> If you have | [
0.25817468762397766,
0.24787285923957825,
0.14090275764465332,
0.046594277024269104,
0.3989376723766327,
-0.15105263888835907,
0.08085623383522034,
-0.17602500319480896,
-0.44292813539505005,
-0.7973988652229309,
0.053357724100351334,
0.33801180124282837,
-0.13436804711818695,
0.2419808059... | |
to ask, you're probably doing something wrong.
Here's some Win32 details on stack allocation: [MSDN](http://msdn.microsoft.com/en-us/library/ms686774.aspx).
If you think you might be limited by stack space, you will almost certainly be limited by available virtual memory, in which case, you will need to find a different solution.
What exactly are you trying to do? | [
0.16305120289325714,
0.1482192873954773,
-0.07378673553466797,
0.20175670087337494,
0.19196154177188873,
-0.06603989005088806,
0.12798376381397247,
0.14607010781764984,
-0.62640380859375,
-0.5363445281982422,
0.1096465066075325,
0.4547969400882721,
-0.17781610786914825,
0.15422159433364868... | |
Can a Linq query retrieve BLOBs from a Sql Database?
And how do they come out?
LINQ-To-SQL classes create properties of type System.Data.Linq.Binary for all binary and varbinary fields in SQL-Server. The Binary type has a .ToArray() method that returns a byte[], and its constructor can take a byte[].
Older versions of SQLMetal generated properties of type byte[], but the problem with these was that they failed in any joins. I think that's the main reason they replaced it with the IEquatable Binary type. | [
0.011254149489104748,
0.11042261868715286,
0.491609662771225,
0.18147434294223785,
-0.055399127304553986,
0.011521488428115845,
-0.28122755885124207,
-0.17818298935890198,
-0.014456815086305141,
-0.1317947506904602,
-0.030230777338147163,
0.14252066612243652,
-0.4390566647052765,
-0.000542... | |
I am currently loading a lightbox style popup that loads it's HTML from an XHR call. This content is then displayed in a 'modal' popup using `element.innerHTML = content` This works like a charm.
In another section of this website I use a Flickr 'badge' (<http://www.elliotswan.com/2006/08/06/custom-flickr-badge-api-documentation/>) to load flickr images dynamically. This is done including a script tag that loads a flickr javascript, which in turn does some `document.write` statments.
Both of them work perfectly when included in the HTML. Only when loading the flickr badge code *inside* the lightbox, no content is rendered at all. It seems that using `innerHTML` to | [
0.5565559267997742,
0.057910747826099396,
0.6962457299232483,
-0.27536091208457947,
-0.39631029963493347,
-0.0908631905913353,
0.09855115413665771,
-0.1633753925561905,
-0.10352429747581482,
-0.808821439743042,
0.1576216220855713,
0.5715169310569763,
-0.20467209815979004,
0.208686992526054... | |
write `document.write` statements is taking it a step too far, but I cannot find any clue in the javascript implementations (FF2&3, IE6&7) of this behavior.
Can anyone clarify if this should or shouldn't work? Thanks.
In general, script tags aren't executed when using innerHTML. In your case, this is good, because the `document.write` call would wipe out everything that's already in the page. However, that leaves you without whatever HTML document.write was supposed to add.
jQuery's HTML manipulation methods will execute scripts in HTML for you, the trick is then capturing the calls to `document.write` and getting the HTML in the proper place. | [
0.5247728824615479,
0.048761215060949326,
0.38938865065574646,
-0.041430212557315826,
-0.10393660515546799,
-0.4451887607574463,
0.4336366355419159,
-0.030331840738654137,
-0.11533045768737793,
-0.562141478061676,
-0.10500308126211166,
0.7905346751213074,
-0.2544405162334442,
-0.0943536236... | |
If it's simple enough, then something like this will do:
```
var content = '';
document.write = function(s) {
content += s;
};
// execute the script
$('#foo').html(markupWithScriptInIt);
$('#foo .whereverTheDocumentWriteContentGoes').html(content);
```
It gets complicated though. If the script is on another domain, it will be loaded asynchronously, so you'll have to wait until it's done to get the content. Also, what if it just writes the HTML into the middle of the fragment without a wrapper element that you can easily select? [writeCapture.js](http://github.com/iamnoah/writeCapture) (full disclosure: I wrote it) handles all of these problems. I'd recommend just using it, but at the very least you can look | [
0.38404908776283264,
0.21468093991279602,
0.4412896931171417,
-0.10860176384449005,
0.07330677658319473,
-0.40118280053138733,
0.5509219765663147,
-0.14542700350284576,
-0.10157287865877151,
-0.5576925277709961,
-0.13458268344402313,
0.49446696043014526,
-0.21244706213474274,
0.04614103585... | |
at the code to see how it handles everything.
EDIT: Here is a [page](http://iamnoah.github.com/writeCapture/lbFlickrDemo.html) demonstrating what sounds like the effect you want. | [
0.7218136191368103,
0.01009566243737936,
0.25514593720436096,
-0.02085498720407486,
-0.0028163869865238667,
-0.21628114581108093,
0.1933756172657013,
-0.06515369564294815,
-0.35037773847579956,
-0.5971012115478516,
-0.07288914918899536,
0.45753297209739685,
-0.02837824821472168,
-0.2633594... | |
Is there a way to convert a HTML string into a Image .tiff file?
I am using C# .NET 3.5. The requirement is to give the user an option to fact a confirmation. The confirmation is created with XML and a XSLT. Typically it is e-mailed.
Is there a way I can take the HTML string generated by the transformation HTML string and convert that to a `.tiff` or any image that can be faxed?
3rd party software is allowed, however the cheaper the better.
We are using a 3rd party fax library, that will only accept `.tiff` images, but if I can | [
0.8515670895576477,
0.062405187636613846,
0.6176628470420837,
0.19794102013111115,
-0.025391900911927223,
-0.1999465823173523,
-0.10182686895132065,
0.01522339042276144,
-0.008227084763348103,
-0.48985084891319275,
0.0207980927079916,
0.5146899819374084,
-0.24829746782779694,
-0.1337779909... | |
get the HTML to be any image I can covert it into a `.tiff`.
Here are some free-as-in-beer possibilities:
You can use the PDFCreator printer driver that comes with ghostscript and print
directly to a TIFF file or many other formats.
If you have MSOffice installed, the Microsoft Office Document Image Writer will produce
a file you can convert to other formats.
But in general, your best bet is to print to a driver that will produce and
image file of some kind or a windows meta-file format (.wmf) file.
Is there some reason why you can't just print-to-fax? Does the third-party software not support a printer driver? | [
0.4124290943145752,
0.16637752950191498,
0.5865024328231812,
0.23767410218715668,
-0.2647586464881897,
-0.25776222348213196,
0.10714240372180939,
0.029239268973469734,
-0.19137078523635864,
-0.8063176870346069,
0.01322629302740097,
0.6594188213348389,
-0.28130435943603516,
-0.1149924248456... | |
That's unusual these days. | [
0.4474368393421173,
0.3603672683238983,
-0.070469431579113,
-0.21685267984867096,
0.3730814754962921,
-0.2834281921386719,
0.19018472731113434,
0.41782471537590027,
-0.3004225194454193,
-0.050249990075826645,
0.1618698239326477,
0.17599113285541534,
0.2799766957759857,
0.19070327281951904,... | |
I'm working with a large (270+ project) VS.Net solution. Yes, I know this is pushing the friendship with VS but it's inherited and blah blah. Anyway, to speed up the solution load and compile time I've removed all projects that I'm not currently working on... which in turn has removed those project references from the projects I want to retain. So now I'm going through a mind numbing process of adding binary references to the retained projects so that the referenced Types can be found.
Here's how I'm working at present;
* Attempt to compile, get thousands of
errors, 'type or namespace missing'
* | [
0.43175679445266724,
0.4549456536769867,
0.028041765093803406,
0.018890123814344406,
0.0213797464966774,
0.04715074226260185,
0.3854052424430847,
0.18893222510814667,
-0.17484797537326813,
-0.8663496375083923,
0.11523349583148956,
0.38786348700523376,
-0.17201794683933258,
0.57180142402648... | |
Copy the first line of the error
list to the clipboard
* Using a perl script hooked up to a
hotkey (AHK) I extract the type name from
the error message and store it in the windows clipboard
* I paste the type name into source
insight symbol browser and note the
assembly containing the Type
* I go back to VS and add that
assembly as a binary reference to
the relevant project
So now, after about 30 mins I'm thinking there's just got to be a quicker way...
No, there currently isn't a built-in quicker way.
I would suggest not modifying the existing solution and create a new solution with new | [
0.489940345287323,
0.1970098465681076,
0.49175164103507996,
-0.05795043334364891,
0.03811633586883545,
0.07418254017829895,
0.5627985000610352,
0.03624643757939339,
0.049318477511405945,
-1.1043915748596191,
0.0945805013179779,
0.518090546131134,
-0.05725349485874176,
-0.1381797045469284,
... | |
projects that duplicate (e.g. rename and edit) the projects you want to work on. If you find that the solution with the hundreds of projects is an issue for you then you'll likely just need to work on a subset. Start with a couple of new projects, add the binary (not project) reference and go from there. | [
0.7683422565460205,
0.06346134096384048,
-0.11904795467853546,
0.3845362365245819,
0.10502073913812637,
0.04097778722643852,
0.007317796349525452,
0.02528940699994564,
-0.49861639738082886,
-0.7085270881652832,
-0.09726201742887497,
0.4507119357585907,
-0.20102223753929138,
0.2379610985517... | |
```
$output = preg_replace("|(/D)(/s+)(/d+)(;)|", "//1,//3;", $output);
```
I'm trying to replace all alphabetical character followed by one or more whitespace characters (tabs and/or spaces) followed by one or more numerical characters followed by a semicolon with the alphabetical character followed by a comma followed by the numerical digits and then the semicolon.
I'll provide an example:
Start:
```
hello world 1007;
```
End:
```
hello world,1007;
```
The two `|` at the start and end probably are incorrect - and should both be forward-slashes.
All other forward slashes should be backward slashes (and need escaping).
And since PHP 4.04 `$n` is the preferred way of referring to a capture group.
```
$output | [
-0.2965473532676697,
0.11324621737003326,
0.1210678443312645,
-0.22579944133758545,
-0.09260430932044983,
0.2866672873497009,
0.191948801279068,
0.0779893770813942,
-0.1551358699798584,
-0.4942814111709595,
-0.2549343407154083,
0.34800291061401367,
-0.5179098844528198,
-0.01494276430457830... | |
= preg_replace("/(\\D)\\s+(\\d+;)/", "$1,$2", $output);
```
If you use single quotes you don't need to escape your backslashes:
```
$output = preg_replace('/(\D)\s+(\d+;)/', '$1,$2', $output);
``` | [
0.22014755010604858,
0.25399690866470337,
0.4506179392337799,
-0.3175085484981537,
-0.07640695571899414,
0.3051931858062744,
0.4759133458137512,
-0.20943209528923035,
-0.10165919363498688,
-0.145135298371315,
-0.3615054190158844,
0.6161689162254333,
-0.5672842264175415,
0.03995190560817718... | |
I have a class that map objects to objects, but unlike dictionary it maps them both ways. I am now trying to implement a custom `IEnumerator` interface that iterates through the values.
```
public class Mapper<K,T> : IEnumerable<T>, IEnumerator<T>
{
C5.TreeDictionary<K,T> KToTMap = new TreeDictionary<K,T>();
C5.HashDictionary<T,K> TToKMap = new HashDictionary<T,K>();
public void Add(K key, T value)
{
KToTMap.Add(key, value);
TToKMap.Add(value, key);
}
public int Count
{ | [
0.002434890251606703,
-0.008143089711666107,
0.4703187048435211,
-0.04497292637825012,
0.33508536219596863,
-0.03742719441652298,
0.3824809491634369,
-0.3150053322315216,
-0.1305430829524994,
-0.778795599937439,
-0.18234454095363617,
0.5449106097221375,
-0.28502559661865234,
0.001351093873... | |
get { return KToTMap.Count; }
}
public K this[T obj]
{
get
{
return TToKMap[obj];
}
}
public T this[K obj]
{
get
{ | [
-0.3513159453868866,
-0.2328227013349533,
0.10858924686908722,
-0.11919510364532471,
0.2519114017486572,
0.286790668964386,
0.5331249833106995,
-0.09710673987865448,
-0.331516832113266,
-0.40936270356178284,
-0.6585525870323181,
0.5546106696128845,
-0.4328218400478363,
-0.327934592962265,
... | |
return KToTMap[obj];
}
}
public IEnumerator<T> GetEnumerator()
{
return KToTMap.Values.GetEnumerator();
}
public T Current
{
get { throw new NotImplementedException(); }
}
public void Dispose()
{
throw new NotImplementedException();
}
object System.Collections.IEnumerator.Current | [
-0.05434000864624977,
-0.5082022547721863,
0.37549668550491333,
-0.15225675702095032,
0.43646240234375,
0.03634380176663399,
0.2374853789806366,
-0.35101622343063354,
-0.23815156519412994,
-0.40913838148117065,
-0.4935785233974457,
0.4869694411754608,
-0.34658563137054443,
0.20389141142368... | |
{
get { throw new NotImplementedException(); }
}
public bool MoveNext()
{
;
}
public void Reset()
{
throw new NotImplementedException();
}
}
```
First, don't make your collection object implement IEnumerator<>. This leads to bugs. (Consider the situation where two threads are iterating over the same collection).
Implementing an enumerator correctly turns out to be non-trivial, so C# 2.0 added | [
0.38250282406806946,
-0.3111073672771454,
0.18501001596450806,
-0.12008905410766602,
0.18415042757987976,
-0.13995438814163208,
0.3242647647857666,
-0.3161710500717163,
-0.318553626537323,
-0.6753112077713013,
-0.28857970237731934,
0.5336742401123047,
-0.5792405605316162,
0.187917694449424... | |
special language support for doing it, based on the 'yield return' statement.
Raymond Chen's recent series of blog posts ("The implementation of iterators in C# and its consequences") is a good place to get up to speed.
* Part 1: <https://web.archive.org/web/20081216071723/http://blogs.msdn.com/oldnewthing/archive/2008/08/12/8849519.aspx>
* Part 2: <https://web.archive.org/web/20080907004812/http://blogs.msdn.com/oldnewthing/archive/2008/08/13/8854601.aspx>
* Part 3: <https://web.archive.org/web/20080824210655/http://blogs.msdn.com/oldnewthing/archive/2008/08/14/8862242.aspx>
* Part 4: <https://web.archive.org/web/20090207130506/http://blogs.msdn.com/oldnewthing/archive/2008/08/15/8868267.aspx> | [
-0.31702741980552673,
0.10545016825199127,
-0.09963084757328033,
-0.09646600484848022,
-0.3630743622779846,
-0.05590462312102318,
0.34570977091789246,
-0.20165464282035828,
-0.06043333560228348,
0.07559839636087418,
-0.513661801815033,
0.42792636156082153,
-0.15559521317481995,
-0.33350360... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.