text stringlengths 0 30.5k | title stringclasses 1
value | embeddings listlengths 768 768 |
|---|---|---|
Microsoft WPF? Adobe AIR/Flex? Adobe Flash? Curl programming language?
How does AJAX fit in?
Given a server written in C++ .NET.
The answer does depend really on what your application actually does and your platform requirements.
If its a regular web application like gmail and you want it to work on lots of browser... | [
0.43127548694610596,
0.08063061535358429,
0.13509207963943481,
0.21463970839977264,
-0.48752763867378235,
-0.18264180421829224,
0.08728231489658356,
-0.011225651949644089,
-0.08492401242256165,
-0.7060907483100891,
0.027827907353639603,
0.40134572982788086,
-0.1910664439201355,
-0.25064301... | |
then use browser plugins like Siverlight or Flex if and when they make sense (e.g. like [Google finance](http://finance.google.com/finance) uses Flash for interactive graphs).
If your application is highly graphical like a Visio type of thing or needs to embed Microsoft Office or something; you might wanna look at Sil... | [
0.40642160177230835,
-0.07925974577665329,
0.09436889737844467,
0.3028850555419922,
-0.3337523341178894,
-0.14457404613494873,
-0.059722285717725754,
0.1154726892709732,
-0.09005161374807358,
-0.9762213230133057,
-0.053033940494060516,
0.6051451563835144,
-0.20782281458377838,
-0.199220553... | |
the communication between the client and your C++ server would be to expose your C++ application as a set of RESTful resources - then at any point in time you can easily write other kinds of clients in any language technology or framework. | [
0.10022547841072083,
0.24688471853733063,
0.24990199506282806,
0.13064154982566833,
0.03529055416584015,
0.0013362276367843151,
-0.10461773723363876,
0.28123384714126587,
-0.22990180552005768,
-0.6619579792022705,
-0.11979741603136063,
0.6187876462936401,
-0.11654715985059738,
-0.104525528... | |
I need to know how to turn on Code Coverage when running TFS builds on a solution with a .testrunconfig file.
There is an option in the testrunconfig file that is for code coverage, but when running a TFS build there is no code coverage results.
I am running my tests using the \*Tests.dll mask and NOT using Test Lis... | [
0.9108339548110962,
0.14305822551250458,
0.11383624374866486,
0.11393725126981735,
-0.08077478408813477,
-0.2319626808166504,
0.5476115345954895,
-0.38970687985420227,
0.040935616940259933,
-0.8464906811714172,
0.13680580258369446,
0.61472088098526,
-0.2814815044403076,
0.11703486740589142... | |
the and of the first PropertyGroup in your TFSBuild.proj file for the build.
```
<RunConfigFile>$(SolutionRoot)\TestRunConfig.testrunconfig</RunConfigFile>
```
This points the build at your .testrunconfig so it can pick up the instructions to run code coverage. | [
0.21880756318569183,
0.03800857439637184,
0.3606710135936737,
-0.17684516310691833,
0.16119015216827393,
-0.28410008549690247,
0.24690034985542297,
-0.24026086926460266,
0.009216292761266232,
-0.9787788987159729,
-0.1603112667798996,
0.5970509648323059,
-0.1558525711297989,
0.1587819010019... | |
The title is pretty much self explanatory. Given two dates what is the best way of finding the number of week days using PHP? Week days being Monday to Friday.
For instance, how would I find out that there are 10 week days in between `31/08/2008` and `13/09/2008`?
```
$datefrom = strtotime($datefrom, 0);
... | [
0.13319596648216248,
-0.16397635638713837,
0.5985132455825806,
0.1446160227060318,
-0.24850063025951385,
0.22025886178016663,
0.07423102110624313,
0.06216871738433838,
-0.4973039925098419,
0.005323243327438831,
0.09085983783006668,
0.1971236765384674,
-0.05978039279580116,
0.39812248945236... | |
$weeks_difference = floor($days_difference / 7); // Complete weeks
$first_day = date("w", $datefrom);
$days_remainder = floor($days_difference % 7);
$odd_days = $first_day + $days_remainder; // Do we have a Saturday or Sunday in the remainder?
if ($odd_days > 7) { // Sunday
... | [
0.09971863776445389,
0.05455724895000458,
0.9069910049438477,
-0.12003537267446518,
0.4180887043476105,
0.18420785665512085,
0.3088076114654541,
-0.09226467460393906,
-1.007666826248169,
-0.03600704297423363,
-0.5242496132850647,
0.11254557967185974,
-0.16112419962882996,
0.531749010086059... | |
// Saturday
$days_remainder--;
}
$datediff = ($weeks_difference * 5) + $days_remainder;
```
From here: <http://www.addedbytes.com/php/php-datediff-function/> | [
0.2485627830028534,
-0.02658628113567829,
0.6694126725196838,
-0.21675753593444824,
0.08723133057355881,
0.12230383604764938,
0.06708725541830063,
0.25701576471328735,
-0.8226682543754578,
0.07137012481689453,
-0.3312857747077942,
0.16948796808719635,
-0.2125517874956131,
0.579795718193054... | |
I am going to hosting for files that user submits. I need to grab some data from the file and then move it to some directory.
There two points of interest for the lifetime of this file. The first is when the data is being abstracted and the second is when the file is archived so that it can be shared.
When data is be... | [
0.431197851896286,
0.032406967133283615,
0.21400204300880432,
0.11287528276443481,
0.2188926339149475,
-0.30070871114730835,
-0.1288459450006485,
0.16868530213832855,
-0.5202186703681946,
-0.6356074810028076,
-0.01893170364201069,
0.1632043868303299,
0.02409253641963005,
0.724875271320343,... | |
strategies. One is to keep all files uploaded from a certain data in one folder. (2006/sept/04, 2008/jan/05) The other is to keep a folder and keep filling it until some max number of files I want to keep in folder and then create another one (/folder001/, /folder002/, /folder003/, etc..). Another one is to create subf... | [
0.10972058027982712,
-0.040939684957265854,
-0.015260729007422924,
-0.017275171354413033,
-0.14784064888954163,
-0.07721348106861115,
0.09968632459640503,
-0.14287634193897247,
-0.3117316663265228,
-0.9034304022789001,
0.120295450091362,
0.707724928855896,
-0.12222165614366531,
0.046056132... | |
+ millisec();`
It is unlikely that two call to millisec will be the same, and filename is more userfriendly when accessing.
The date strategy can be convenient if you decide to remove old and unused files : you only have to get the 2006 folder, and remove all that has not been accessed in the last year, according to y... | [
0.3441341519355774,
-0.24244281649589539,
0.575791597366333,
-0.0444711335003376,
-0.12551160156726837,
-0.20127442479133606,
0.05724167823791504,
-0.1801527738571167,
-0.29025134444236755,
-0.3512897491455078,
-0.2660893201828003,
0.3963300883769989,
-0.15430676937103271,
0.30386134982109... | |
to keep the number of entries of your directories low, so access is faster. Note that this solution requires to sometimes move files (and then break some url if not mapped) when a particular directory grows.
Another possibility is to use a DB with UID corresponding to filename location, and accessing file through <htt... | [
0.1146983653306961,
-0.0905604213476181,
0.39399996399879456,
0.15942750871181488,
-0.23616789281368256,
-0.002161022275686264,
0.16801272332668304,
-0.12907329201698303,
-0.30328208208084106,
-0.9326287508010864,
-0.0960344523191452,
0.20156896114349365,
-0.05864887684583664,
0.4472262859... | |
same file. | [
0.24825377762317657,
0.0844951868057251,
0.15189096331596375,
0.2028753161430359,
0.3455806374549866,
-0.04778381437063217,
-0.1319429576396942,
-0.09342615306377411,
-0.537994921207428,
-0.4681791663169861,
0.40709567070007324,
0.024655207991600037,
-0.2176889330148697,
0.3002186417579651... | |
Why would one choose [YAML](http://yaml.org/) over XML or any other formats?
I agree with Sergio; YAML provides a format which is easily editable by humans, but also a good way to cleanly represent data structures.
YAML tends to be much more human-readable, IMO.
YAML is more of a data serialisation technique, rather ... | [
0.26342466473579407,
0.25344133377075195,
0.18132802844047546,
0.19299590587615967,
-0.42139890789985657,
-0.4199533462524414,
-0.057351674884557724,
0.0283596683293581,
-0.13947011530399323,
-0.29307836294174194,
-0.3987882435321808,
0.2323213368654251,
-0.4986271262168884,
-0.10254020243... | |
I am currently using Hibernate Tools 3.1; I customized naming convention and DAO templates. The database (SQL Server 2005) in early development phase and I'm in charge of rebuilding the mappings, entities, DAOs, configuration, whatever. Each time I have to reverse-engineer the tables and so I lose every customization I... | [
-0.050115589052438736,
0.23037880659103394,
0.569368302822113,
-0.264582097530365,
-0.19054697453975677,
-0.11493583023548126,
0.19543930888175964,
-0.19011741876602173,
-0.0314670093357563,
-0.7119744420051575,
0.07398165762424469,
0.37057772278785706,
-0.10477307438850403,
0.100638896226... | |
practice/tool for dealing with these annoying, unavoidable, critical tasks?
I'd strongly recommend against continual reverse engineering. Reverse engineering is a great one time thing, but changes need to be managed as changes to both the hbm and the database.
We use migrations to manage db changes, and we include the... | [
0.5632736086845398,
0.09699852019548416,
-0.14585474133491516,
-0.028643576428294182,
0.00514203030616045,
-0.2847888171672821,
0.4893758296966553,
0.02525242045521736,
-0.024739352986216545,
-0.6015328168869019,
0.15949879586696625,
0.6608051061630249,
-0.06767306476831436,
-0.13665889203... | |
I want to find 2nd, 3rd, ... nth maximum value of a column.
You could sort the column into descending format and then just obtain the value from the nth row.
EDIT::
Updated as per comment request. ***WARNING*** completely untested!
```
SELECT DOB FROM (SELECT DOB FROM USERS ORDER BY DOB DESC) WHERE ROWID = 6
```
S... | [
0.2799721360206604,
0.3739563226699829,
0.2848034203052521,
-0.06032996252179146,
0.17233042418956757,
-0.31066203117370605,
0.42290788888931274,
-0.17181123793125153,
0.09408554434776306,
-0.5817643404006958,
-0.09957149624824524,
0.6878839731216431,
-0.37588441371917725,
0.05092013999819... | |
I'm trying to get IKVM to build (see [this question](https://stackoverflow.com/questions/71599/how-to-get-ikvm-to-build-in-visual-studio-2008)) but now have encountered a problem not having to do with IKVM so I'm opening up a new question:
When running nant on the IKVM directory with the Visual Studio 2008 Command Pro... | [
0.0766386166214943,
0.3372260332107544,
-0.06169218569993973,
-0.39452219009399414,
-0.3619927167892456,
0.2737710773944855,
0.6141616106033325,
0.007798159494996071,
-0.12451323866844177,
-0.6756481528282166,
0.3291592001914978,
0.7672004103660583,
-0.3280012607574463,
-0.1156889572739601... | |
jni.c
> [cl] os.c
> [cl] C:\ikvm-0.36.0.11\native\os.c(25) : fatal error C1083: Cannot open include file: 'windows.h': No such
> file or directory
> [cl] Generating Code...
>
> BUILD FAILED
>
> | [
-0.27115944027900696,
0.331013947725296,
0.15028639137744904,
-0.19319765269756317,
0.1286071389913559,
0.2120455652475357,
0.8802165389060974,
-0.04384898766875267,
-0.18613441288471222,
-0.41170215606689453,
-0.13063167035579681,
0.4665021598339081,
-0.24077242612838745,
0.44223439693450... | |
C:\ikvm-0.36.0.11\native\native.build(17,10):
> External Program Failed: cl (return code was 2)
>
> ```
I have the Platform SDK installed. What am I missing? I'm sure it's something simple...
**Edit #1** I just checked - I do have the directory containing windows.h on the Path.
**Edit #2** Found the answer (... | [
0.1998911201953888,
0.1987319141626358,
-0.02602594718337059,
0.004261658526957035,
0.2100871205329895,
-0.15330085158348083,
0.4269452393054962,
-0.38631606101989746,
-0.1801227182149887,
-0.4170283377170563,
-0.07875985652208328,
0.7139800190925598,
-0.3171313405036926,
0.007130521349608... | |
to be set in the Include environment variable. | [
0.5429011583328247,
0.010588791221380234,
-0.4141205847263336,
-0.4300403594970703,
0.17240814864635468,
-0.17764344811439514,
0.3736133873462677,
-0.4700470566749573,
0.3052905797958374,
-0.26378142833709717,
-0.41026613116264343,
0.4751409590244293,
-0.6203694939613342,
0.060592837631702... | |
I've been doing some work with the JAX-RS reference implementation (Jersey).
I know of at least two other frameworks (Restlet & Apache CXF).
My question is: Has anyone done some comparison between those frameworks and if so, which framework would you recommend and why?
FWIW we're using Jersey as its packed full of fea... | [
-0.1315022110939026,
-0.48211801052093506,
-0.067301444709301,
-0.18336908519268036,
-0.16698522865772247,
-0.016429517418146133,
-0.046557676047086716,
-0.04826471954584122,
-0.3222052752971649,
-0.5606456995010376,
-0.13972747325897217,
0.3203217685222626,
0.05156631022691727,
-0.4665261... | |
and functional implementation. | [
-0.21356962621212006,
0.36924445629119873,
-0.050366003066301346,
-0.19281281530857086,
0.22703497111797333,
0.1536504626274109,
-0.0030259517952799797,
-0.2282363772392273,
0.057417962700128555,
-0.6208085417747498,
-0.4136020243167877,
0.685758650302887,
0.21592850983142853,
-0.277371227... | |
I have an Access 2007 form that is searchable by a combobox. When I add a new record, I need to update the combobox to include the newly added item.
I assume that something needs to be done in AfterInsert event of the form but I can't figure out what.
How can I rebind the combobox after inserting so that the new it... | [
0.09834609180688858,
0.0831693783402443,
0.42006561160087585,
0.4347326159477234,
0.08631584048271179,
-0.20427878201007843,
0.14615768194198608,
-0.12104842811822891,
-0.3560519516468048,
-0.5163812637329102,
0.30314186215400696,
0.6422763466835022,
0.12973256409168243,
0.2424182444810867... | |
is always up-to-date. A simple TheCombobox.Requery in the OnFocus event should be enough. | [
0.1934109628200531,
-0.0891781598329544,
0.6165698170661926,
0.2299559861421585,
0.5203126668930054,
-0.3397431969642639,
-0.025709453970193863,
0.23118308186531067,
-0.3625064194202423,
-0.40536996722221375,
-0.3763253092765808,
0.7314826846122742,
0.005961613729596138,
-0.321952432394027... | |
As the local subversion czar i explain to everyone to keep only source code and non-huge text files in the repository, not huge binary data files. Smaller binary files that are parts of tests, maybe.
Unfortunately i work with *humans*! Someone is likely to someday accidentally commit a 800MB binary hulk. This slows d... | [
0.7871925234794617,
0.30445829033851624,
0.2170300930738449,
0.062126077711582184,
-0.058974891901016235,
-0.2671402096748352,
0.466675728559494,
0.5682192444801331,
-0.32791996002197266,
-0.15056438744068146,
-0.14438053965568542,
0.43647143244743347,
-0.02063700743019581,
0.7754140496253... | |
or revision number.
Is there a way to really delete that monster file and end up with a decent sized repository? I've tried the svnadmin dump/load thing but it was a pain.
Some extra info about this can be found at the blog post: [Subversion Obliterate, the missing feature](http://blog.projectnibble.org/2008/03/01/su... | [
0.5013414025306702,
-0.025132477283477783,
-0.10760126262903214,
0.05819472670555115,
-0.1147979199886322,
-0.17519378662109375,
0.23132121562957764,
0.3792365789413452,
-0.48391857743263245,
-0.26648691296577454,
-0.04892866685986519,
0.42117321491241455,
0.028233468532562256,
0.483881682... | |
I am seeing strange behaviour with the flash.media.Sound class in Flex 3.
```
var sound:Sound = new Sound();
try{
sound.load(new URLRequest("directory/file.mp3"))
} catch(e:IOError){
...
}
```
However this isn't helping. I'm getting a stream error, and it actually sees to be in the Sound constructor.
> Error #2044... | [
0.21107061207294464,
0.009146624244749546,
0.2891778349876404,
-0.22833441197872162,
-0.14221985638141632,
-0.27120935916900635,
0.5463575124740601,
-0.40328115224838257,
-0.2063189297914505,
-0.6158512234687805,
-0.07190046459436417,
0.6874569654464722,
-0.2829303741455078,
0.205051615834... | |
I just realized this may not be your problem, you're just trying to catch the IO error? If so, you can do this:
```
var sound:Sound = new Sound();
sound.addEventListener(IOErrorEvent.IO_ERROR, ioErrorHandler);
sound.load(new URLRequest("directory/file.mp3"));
function ioErrorHandler(event:IOErrorEvent):void {
tra... | [
0.34239888191223145,
-0.059915363788604736,
0.23501694202423096,
-0.36825889348983765,
0.39488744735717773,
-0.11168189346790314,
0.44982078671455383,
-0.49412110447883606,
-0.17074836790561676,
-0.4316404461860657,
-0.1405687928199768,
1.159458875656128,
-0.24743933975696564,
0.0758889317... | |
getEmployeeNameByBatchId(int batchID)
getEmployeeNameBySSN(Object SSN)
getEmployeeNameByEmailId(String emailID)
getEmployeeNameBySalaryAccount(SalaryAccount salaryAccount)
or
getEmployeeName(int typeOfIdentifier, byte[] identifier) -> In this methods the typeOfIdentifier tells if identifier is batchID/SSN/... | [
-0.15885880589485168,
-0.03604527562856674,
0.4372716248035431,
0.0052954042330384254,
-0.20629118382930756,
0.04270457103848457,
0.2150219976902008,
-0.17265267670154572,
-0.09523297101259232,
-0.6713575720787048,
-0.07832293957471848,
0.5952867865562439,
-0.05296815186738968,
0.077662579... | |
A few years ago we started playing around with [XForms](http://www.w3.org/MarkUp/Forms/) from the W3C for a web app which required hundreds of custom forms.
As they aren't currently supported natively by the major browsers, what parsers/tools are you using on your projects today?
I'm not really interested in plugins ... | [
0.5613994598388672,
-0.07521697878837585,
0.3679879903793335,
0.08977849781513214,
-0.6942461133003235,
0.07850790023803711,
-0.0959375873208046,
-0.11321083456277847,
0.1588943749666214,
-0.9776809215545654,
0.30553722381591797,
0.21004682779312134,
-0.3792239725589752,
-0.035069331526756... | |
side with the help of AJAX. This puts quite high demands on the server, so I wouldn't bet on those engines when creating sites with heavy traffic. Alternatives are well documented on XForms Wikipedia page: <http://en.wikipedia.org/wiki/XForms>. | [
0.44061675667762756,
-0.17313995957374573,
0.36627352237701416,
0.12021633982658386,
-0.3755853474140167,
-0.00007706109317950904,
0.15659113228321075,
0.006190674379467964,
0.18402482569217682,
-0.6869935989379883,
0.030987557023763657,
0.34500670433044434,
-0.16338248550891876,
-0.264075... | |
We have a series of closed source applications and libraries, for which we think it would make sense opening up the source code.
What has been blocking us, so far, is the effort needed to clean up the code base and documenting the source before opening up.
We want to open up the source only if we have a reasonable ch... | [
0.6006948947906494,
0.410713791847229,
-0.14412568509578705,
0.24502752721309662,
0.10811661183834076,
-0.2806996703147888,
0.3061205744743347,
0.15113431215286255,
-0.228237122297287,
-0.42470160126686096,
-0.3733218312263489,
0.56163090467453,
0.19339947402477264,
0.13512727618217468,
... | |
Cleanliness of code
* Availability of source code comments
* Fully or partially documented APIs
* Choice of license (GPL vs. LGPL vs. BSD, etc...)
* Choice of public repository
* Investment in a public website
There are a several things which dominate the successfulness of code. All of these must be achieved for the sl... | [
0.6576606035232544,
0.22160719335079193,
-0.06447712332010269,
0.3073593080043793,
-0.1720978319644928,
-0.15964500606060028,
0.36500173807144165,
0.16340315341949463,
-0.20445901155471802,
-0.6478790640830994,
-0.3901772201061249,
0.5084434151649475,
-0.0906892940402031,
0.060130350291728... | |
likely to succeed if you can get other corporations to adopt it as well.
* Documentation - As you touched on earlier documentation is key. Amongst this documentation is commented code, architectural decisions, and API notes. Even if your documentation contains bugs, or bugs about your software it is ok. Remember, trans... | [
0.5365903377532959,
0.48285552859306335,
0.05032018572092056,
0.3158247470855713,
0.1396746039390564,
-0.723595380783081,
0.2606372833251953,
-0.21738150715827942,
-0.3384920358657837,
-0.5363681316375732,
-0.3819688856601715,
0.7167099714279175,
-0.11684396862983704,
-0.03381984680891037,... | |
is going to run on desktops then GPL is your choice.
* Transparency - You must write software in a transparent environment. Once you go open source there is no hidden secrets. You must explain everything you do, and what you are doing. This will piss off developers like no other
* Developer Community - A strong develop... | [
0.6302787065505981,
0.2896627187728882,
0.021631306037306786,
0.2047729790210724,
-0.2577612102031708,
-0.6096699237823486,
0.48654815554618835,
0.02878023497760296,
-0.0716128721833229,
-0.536618173122406,
-0.2366185486316681,
0.577039897441864,
0.07926679402589798,
-0.011709490790963173,... | |
dumped it." Keep your developers working on it, even if it means they are costing you money.
* Communications - You must make sure you community is able to communicate. They must be able to file bugs, discuss workarounds, and publish patches. Without feedback, it is pointless to opensource the project
* Availability - ... | [
0.937229573726654,
0.13060122728347778,
-0.07423337548971176,
0.44044938683509827,
0.011763347312808037,
-0.42286181449890137,
0.2701745927333832,
0.26532915234565735,
-0.32814255356788635,
-0.08372023701667786,
0.033811479806900024,
0.07966232299804688,
-0.12835796177387238,
0.14093613624... | |
do this. You have to make things simple, and clean | [
0.6620076894760132,
0.10604637116193771,
-0.5496135354042053,
0.15887156128883362,
0.06223493069410324,
0.1748189628124237,
0.30212944746017456,
-0.10182195156812668,
-0.08030278980731964,
-0.7657512426376343,
0.08316688984632492,
0.2765885889530182,
0.02164195477962494,
-0.189994767308235... | |
Why wouldn't I choose abstract? What are the limitations to declaring a class member virtual? Can only methods be declared virtual?
An abstract method or property (both can be virtual or abstract) can only be declared in an abstract class and cannot have a body, i.e. you can't implement it in your abstract class.
A vi... | [
0.18879388272762299,
-0.14215810596942902,
-0.10337649285793304,
0.3981817662715912,
-0.0713302344083786,
0.016640223562717438,
0.26811134815216064,
0.18500475585460663,
-0.21663057804107666,
-0.5513080358505249,
0.05023537203669548,
0.4154035747051239,
-0.2649800479412079,
0.6080579161643... | |
can chose to not override the virtual methods and properties.
Exemple :
```
using System;
using C=System.Console;
namespace Foo
{
public class Bar
{
public static void Main(string[] args)
{
myImplementationOfTest miot = new myImplementationOfTest();
miot.myVirtualMetho... | [
0.06273744255304337,
-0.013076655566692352,
0.7107717990875244,
-0.1813904196023941,
0.6135058999061584,
0.140529066324234,
0.5429422855377197,
-0.0871330052614212,
0.050773922353982925,
-0.3962765634059906,
-0.5485568642616272,
0.5056446194648743,
-0.44897302985191345,
0.3001382052898407,... | |
miot.myAbstractMethod();
}
}
public abstract class test
{
public abstract int myProperty
{
get;
set;
}
public abstract void myAbstractMethod(); | [
0.14286884665489197,
-0.06722979992628098,
-0.03702474758028984,
-0.05818858742713928,
0.4879823923110962,
0.23223720490932465,
0.6377065181732178,
0.060284536331892014,
0.4225199520587921,
-0.6119042038917542,
-0.5723099112510681,
0.5034381151199341,
-0.4104004502296448,
0.360785067081451... | |
public virtual void myVirtualMethod()
{
C.WriteLine("foo");
}
public virtual void myOtherVirtualMethod()
{
}
}
public class myImplementationOfTest : test
{
private int _foo;
public override int myProperty | [
0.3343656361103058,
-0.012888661585748196,
0.4287063181400299,
-0.1506791114807129,
0.5453913807868958,
0.04977211728692055,
0.47290584444999695,
-0.054462991654872894,
0.113380566239357,
-0.3545593023300171,
-0.24002383649349213,
0.6970320343971252,
-0.32813286781311035,
0.165042281150817... | |
{
get { return _foo; }
set { _foo = value; }
}
public override void myAbstractMethod()
{
C.WriteLine(myProperty);
}
public override void myOtherVirtualMethod() | [
0.19985805451869965,
-0.16607707738876343,
0.548185408115387,
-0.11764653027057648,
0.5804322361946106,
-0.019375251606106758,
0.6358240842819214,
-0.24186326563358307,
0.12100458890199661,
-0.336444616317749,
-0.40401408076286316,
0.8033067584037781,
-0.33795130252838135,
0.11960829794406... | |
{
C.WriteLine("bar");
}
}
}
``` | [
0.14382052421569824,
0.5461484789848328,
0.4355083703994751,
-0.5861539244651794,
0.38403069972991943,
-0.11624997854232788,
0.19233474135398865,
-0.13508489727973938,
0.19371521472930908,
-0.3416060507297516,
-0.4858405590057373,
0.6459093689918518,
-0.4155689775943756,
0.2251288145780563... | |
For a situation like capturing text incrementally, for example if you were receiving all of the output.write calls when a page was rendering, and those were being appended into a textwriter over a stringbuilder.
Is there a more efficient way to do this? Something that exists in dotnet already preferably? Especially if... | [
0.23590047657489777,
-0.2722778022289276,
0.34672877192497253,
0.2069595456123352,
-0.30049169063568115,
0.0725565031170845,
0.08366391807794571,
-0.1314513236284256,
-0.48775550723075867,
-0.8424715399742126,
0.13482540845870972,
0.35933324694633484,
-0.12666919827461243,
0.06157304719090... | |
As the title states, I'd be interested to find a safe feature-based (that is, without using navigator.appName or navigator.appVersion) way to detect Google Chrome.
By feature-based I mean, for example:
```
if(window.ActiveXObject) {
// internet explorer!
}
```
**Edit:** As it's been pointed out, the question do... | [
0.4833252429962158,
0.29242244362831116,
0.43311312794685364,
-0.2074674516916275,
-0.13224346935749054,
-0.36100077629089355,
0.2705886662006378,
-0.0372152216732502,
0.008269328624010086,
-0.7839469909667969,
-0.0491502620279789,
0.6639781594276428,
-0.1888655722141266,
-0.08618510514497... | |
return Boolean(window.chrome);
}
``` | [
0.14011047780513763,
0.27561506628990173,
0.13680978119373322,
-0.3633478283882141,
0.03625492379069328,
-0.2354738414287567,
0.35698041319847107,
0.24630595743656158,
0.19127900898456573,
-0.7210342288017273,
-0.31457942724227905,
0.8560699224472046,
-0.4195616841316223,
0.165167391300201... | |
Which built in (if any) tool can I use to determine the allocation unit size of a certain NTFS partition ?
Open an administrator command prompt, and do this command:
```
fsutil fsinfo ntfsinfo [your drive]
```
The Bytes Per Cluster is the equivalent of the allocation unit. | [
0.10060875117778778,
-0.08031748980283737,
0.47634878754615784,
-0.022737795487046242,
0.17075175046920776,
-0.3478812873363495,
-0.12503013014793396,
0.3248591423034668,
-0.14253699779510498,
-0.8870833516120911,
-0.19140787422657013,
0.704479992389679,
-0.19933180510997772,
0.15859085321... | |
Is there some way to block access from a referrer using a .htaccess file or similar? My bandwidth is being eaten up by people referred from <http://www.dizzler.com> which is a flash based site that allows you to browse a library of crawled publicly available mp3s.
**Edit:** Dizzler was still getting in (probably wasn'... | [
0.5931687951087952,
0.0006177747854962945,
0.37280476093292236,
0.14448213577270508,
-0.1257045567035675,
-0.05175046995282173,
0.32164618372917175,
0.32936936616897583,
-0.3584098815917969,
-0.6366586089134216,
0.072669617831707,
0.4466414749622345,
-0.4857390224933624,
0.3277844190597534... | |
stop spam-bots from harvesting emails on your publicly visible page - it's very tough to tell the difference between users and bots without forcing your viewers to log in to confirm their identity.
You could use robots.txt to disallow the spiders that actually follow those rules, but that's on their side, not your ser... | [
0.6400661468505859,
-0.1807437390089035,
0.26899558305740356,
0.11405132710933685,
-0.21100714802742004,
-0.34155458211898804,
0.582396388053894,
0.2286653071641922,
-0.5104739665985107,
-0.20781397819519043,
-0.13080620765686035,
0.4355107843875885,
-0.5464816689491272,
-0.172778740525245... | |
and add:
```
<Directory /directoryName/subDirectory>
Order Allow,Deny
Allow from all
Deny from 66.232.150.219
</Directory>
``` | [
0.21369507908821106,
0.4080134332180023,
0.48384618759155273,
-0.02916942536830902,
0.05939796566963196,
-0.10261527448892593,
0.4092530906200409,
-0.5858258605003357,
0.06410879641771317,
-0.37948089838027954,
-0.2832462787628174,
0.42961034178733826,
-0.3824903964996338,
0.28104856610298... | |
I re-image one of my machines regularly; and have a script that I run after the OS install completes to configure my machine; such that it works how I like.
I happen to have my data on another drive...and I'd like to add code to my script to change the location of the Documents directory from "C:\Users\bryansh\Documen... | [
0.06749483197927475,
0.2933989465236664,
0.551388680934906,
-0.016087116673588753,
0.21050092577934265,
0.03669071942567825,
0.28033676743507385,
0.06155010312795639,
-0.4351717531681061,
-0.9994581341743469,
-0.19728662073612213,
0.6419001817703247,
-0.08715619146823883,
-0.07189597189426... | |
Is there a pattern that is good to use when saving and loading different file formats?
For example, I have a complicated class hierarchy for the document, but I want to support a few different file formats.
I thought about the Strategy pattern, but I'm not convinced because of the need to access every part of the obj... | [
0.24977877736091614,
-0.30594560503959656,
0.06632805615663528,
0.2690809667110443,
0.1651087999343872,
-0.1631307303905487,
0.13470132648944855,
0.37449124455451965,
-0.5550000667572021,
-0.8237798810005188,
0.027944285422563553,
0.530103862285614,
-0.20185747742652893,
0.1004441529512405... | |
top of the hierarchy, and maybe redefine it in some derived classes, and the visitor still access the data of the nodes, but you decouple the file format, as different visitors implementations can write the data gathered in different ways.
Take a look also at the [memento pattern](http://en.wikipedia.org/wiki/Memento_... | [
0.24753405153751373,
-0.1823711395263672,
0.2366003394126892,
0.3350392282009125,
0.004555331543087959,
-0.11274456232786179,
0.3979022204875946,
-0.09034475684165955,
-0.5203373432159424,
-0.44017037749290466,
-0.09988284856081009,
0.13758552074432373,
-0.14767882227897644,
0.505564153194... | |
```
struct foo { unsigned x:1; } f;
printf("%d\n", (int)sizeof(f.x = 1));
```
What is the expected output and why? Taking the size of a bitfield lvalue directly isn't allowed. But by using the assignment operator, it seems we can still take the size of a bitfield type.
What is the "size of a bitfield in bytes"? Is i... | [
-0.09370893985033035,
-0.05164751783013344,
0.19602380692958832,
-0.13113513588905334,
-0.125017911195755,
-0.020691407844424248,
0.10299792140722275,
-0.32610881328582764,
-0.2306898534297943,
-0.35556426644325256,
-0.25050613284111023,
0.6310285329818726,
-0.38562607765197754,
-0.1024686... | |
on the same platform are giving me inconsistent results.
You are right, integer promotions aren't applied to the operand of `sizeof`:
> The integer promotions are applied only: as part of the usual arithmetic conversions, to certain argument expressions, to the operands of the unary +, -, and ~ operators, and to both ... | [
-0.1284741312265396,
0.05683212727308273,
-0.0331120565533638,
0.13436120748519897,
-0.13100631535053253,
-0.04866676777601242,
0.024393660947680473,
-0.27296182513237,
-0.20793753862380981,
-0.03292464092373848,
-0.30843475461006165,
0.6866466403007507,
-0.20263086259365082,
0.16843101382... | |
own types implementation-defined, and
> GCC follows the C90 DRs and so the assignment has type int:1 and is not
> promoted as an operand of sizeof.
This was discussed in [Defect Report #315](http://www.open-std.org/jtc1/sc22/wg14/www/docs/dr_315.htm).
To summarize: your code is legal but implementation-defined. | [
0.36254164576530457,
0.09093029052019119,
0.3123365640640259,
-0.0046388497576117516,
-0.21963676810264587,
-0.4314427077770233,
0.25180578231811523,
-0.40298816561698914,
-0.3474101424217224,
-0.25532495975494385,
0.11772517114877701,
0.43465670943260193,
-0.48190954327583313,
-0.16799388... | |
got a new blog at wordpress few days ago (<http://ghads.wordpress.com>) and I want to post some code snippets now or then. Is there anyway to make it look like code without paying for extra plugins?
See here: <http://en.support.wordpress.com/code/posting-source-code/>
Wrap your code in these tags: [sourcecode language... | [
0.5082841515541077,
0.10260166227817535,
0.488113135099411,
0.1583356410264969,
-0.38777080178260803,
-0.17894116044044495,
0.3440335690975189,
0.10873591899871826,
-0.344056636095047,
-0.7759666442871094,
-0.13331878185272217,
0.2413315623998642,
-0.4101889133453369,
-0.20670907199382782,... | |
vb
* xml
Hope that helps. | [
0.6205809712409973,
0.15959487855434418,
0.422091543674469,
0.22943592071533203,
-0.275322288274765,
-0.07175248116254807,
0.22091443836688995,
0.2386171668767929,
-0.1407630443572998,
-0.6449351906776428,
-0.07043134421110153,
0.24639204144477844,
0.18422411382198334,
0.08174405246973038,... | |
What are the private IP address ranges?
You will find the answers to this in [RFC 1918](http://www.faqs.org/rfcs/rfc1918.html). Though, I have listed them below for you.
```
10.0.0.0 - 10.255.255.255 (10/8 prefix)
172.16.0.0 - 172.31.255.255 (172.16/12 prefix)
192.168.0.0 - 192.168.255.255 (... | [
0.39932581782341003,
0.09858982264995575,
0.37153860926628113,
0.038686614483594894,
-0.21499718725681305,
0.03181438893079758,
0.4203164875507355,
-0.21040092408657074,
-0.38735559582710266,
-0.3874662220478058,
0.06547190248966217,
0.23371313512325287,
-0.5683338642120361,
0.240510955452... | |
about IPv4 addresses can be found in [RFC 3300](http://www.faqs.org/rfcs/rfc3300.html).
On the other hand IPv6 doesn't have an equivalent to RFC1918, but any sort of site-local work should be done in fc00::/7. This is further touched on in [RFC 4193](http://www.faqs.org/rfcs/rfc4193.html). | [
0.4800799787044525,
0.1420087367296219,
0.08286864310503006,
0.19243645668029785,
-0.14595259726047516,
-0.29241788387298584,
0.19434374570846558,
0.11459250003099442,
-0.46050092577934265,
-0.38807839155197144,
-0.2838405966758728,
0.1185179278254509,
-0.19187569618225098,
0.0641005709767... | |
If you declare variables of type byte or short and attempt to perform arithmetic operations on these, you receive the error "Type mismatch: cannot convert int to short" (or correspondingly "Type mismatch: cannot convert int to byte").
```
byte a = 23;
byte b = 34;
byte c = a + b;
```
In this example, the compile er... | [
-0.0507313497364521,
0.1106720119714737,
-0.10305290669202805,
-0.31040793657302856,
-0.06663847714662552,
0.14202846586704254,
0.307305246591568,
-0.395646333694458,
-0.0031351824291050434,
-0.16495048999786377,
-0.43191349506378174,
0.4548298716545105,
-0.36816856265068054,
-0.0966800972... | |
variables of type byte or short, you must enclose the expression in parentheses (inside of which operations will be carried out as type int), and then cast the result back to the desired type.
```
byte a = 23;
byte b = 34;
byte c = (byte) (a + b);
```
Here's a follow-on question to the real Java gurus: why? The types... | [
0.17696204781532288,
0.0844915434718132,
0.048903487622737885,
-0.14629459381103516,
-0.20882989466190338,
-0.03617117926478386,
0.14887964725494385,
-0.1899595558643341,
-0.13774080574512482,
-0.1616791933774948,
0.0051762936636805534,
0.5593077540397644,
-0.3672712445259094,
-0.087592147... | |
this behavior is based on the operations available in the JVM, specifically, that only full- and double-word operators are implemented. Hence, to operator on bytes and shorts, they must be converted to int. | [
-0.12156088650226593,
-0.2932073771953583,
-0.11307570338249207,
-0.07610587775707245,
0.028140824288129807,
0.1398955136537552,
0.11991652101278305,
0.06857386231422424,
-0.06253667920827866,
-0.4003928601741791,
-0.3282172381877899,
0.4739696979522705,
-0.09355786442756653,
-0.2697520852... | |
In a server-side application running on Tomcat, I am generating full HTML pages (with header) based on random user-requested sites pulled down from the Internet. The client-side application uses asynchronous callbacks for requesting processing of a particular web page. Since processing can take a while, I want to infor... | [
0.24874719977378845,
-0.12954258918762207,
0.3708938956260681,
-0.009398967027664185,
-0.26616814732551575,
0.08650284260511398,
0.01729097031056881,
-0.03954026475548744,
-0.12554331123828888,
-0.6037164330482483,
-0.2445099949836731,
0.28433310985565186,
-0.35540372133255005,
-0.07417165... | |
server generates a temporary file and sends back a link to it. This is clearly suboptimal.
The next best solution I can come up with inolves creating a caching-DB that stores the HTML content together with its md5-sums or sha1-ids and then sends back a link to a servlet, with the hash-ID as an argument. The servlet th... | [
-0.15906383097171783,
0.039341866970062256,
0.6223172545433044,
-0.06876228004693985,
-0.342926949262619,
0.03889719024300575,
-0.002558761974796653,
-0.19382108747959137,
-0.22239327430725098,
-0.8296530842781067,
0.10055100917816162,
0.15289443731307983,
-0.3643670380115509,
0.2625418603... | |
assume the database character set is UTF-8, which is the recommended setting in recent versions of Oracle. In this case, some characters take more than 1 byte to store in the database.
If you define the field as `VARCHAR2(11 BYTE)`, Oracle can use up to 11 bytes for storage, but you may not actually be able to store 1... | [
0.0016251298366114497,
0.3066110908985138,
-0.058112889528274536,
-0.059944331645965576,
0.05273570492863655,
0.06383506208658218,
0.09465815871953964,
-0.13326986134052277,
-0.07259046286344528,
-0.2885372042655945,
-0.11046043038368225,
0.4977487325668335,
-0.1477317214012146,
-0.3631696... | |
takes to store each one. A single character may require up to 4 bytes. | [
0.04378212243318558,
0.011726683005690575,
-0.2600573003292084,
0.07895568013191223,
-0.11381077021360397,
0.5327177047729492,
0.07067950069904327,
-0.5406688451766968,
0.10191681236028671,
-0.28957903385162354,
-0.1318214237689972,
0.0423404686152935,
0.10603085160255432,
-0.1634902656078... | |
If I understand correctly, `ClickOnce` only checks for prerequisites with the first install of an application through the setup.exe file that contains the prerequisite information. If the user opens the app in the future it will check for new versions, but it does not launch the setup.exe again, thus not checking for a... | [
0.8686960339546204,
0.021123627200722694,
0.582536518573761,
0.033684343099594116,
0.41601264476776123,
-0.5568835735321045,
0.1794443428516388,
-0.11441614478826523,
-0.17434288561344147,
-0.78692227602005,
-0.22988131642341614,
0.9766170382499695,
-0.4128180146217346,
-0.0858159288764,
... | |
the new prerequisites that you have added.
Applications deployed using ClickOnce only check for application updates (if enabled), not prerequisites as it's the bootstrapper's job to make sure all dependencies are installed before the application is installed.
I found this at [Microsoft's site](http://msdn.microsoft.c... | [
0.5479335188865662,
-0.03681490942835808,
0.7205026745796204,
0.037866994738578796,
0.46549153327941895,
-0.5560998320579529,
0.19261077046394348,
-0.11314641684293747,
-0.32380425930023193,
-0.7963694334030151,
-0.3041211664676666,
0.7072435021400452,
-0.46304070949554443,
-0.047952074557... | |
I need an encoder that can convert mp3 files to he-aac (aka aac+).
So far the best one I have found is [nero aac encoder](http://www.nero.com/eng/down-ndaudio.php) .
I have two problemes with it :
- Only one input format : wav . It is a little bit slow to transform mp3 files to wav and then to he-aac.
- a free licen... | [
0.03921281546354294,
0.2854146361351013,
0.22932641208171844,
-0.2109014093875885,
-0.4106171131134033,
-0.01952918991446495,
0.20613107085227966,
-0.36241814494132996,
-0.3544512987136841,
-0.5950163006782532,
0.1494596153497696,
0.6769529581069946,
-0.4701594114303589,
0.0768530219793319... | |
as I know. Even if FAAC supported HE-AAC it would be useless, since as an encoder its pretty awfully designed and its quality is not even competitive with LAME, let alone a good AAC encoder.
Kostya on the FFMPEG team is currently working on an AAC encoder but it has a long way to go--its not ready for primetime with L... | [
0.5190607905387878,
0.3093452751636505,
0.12114092707633972,
0.2069428265094757,
-0.14671912789344788,
-0.11749926954507828,
0.24002018570899963,
-0.2118559330701828,
-0.2310696542263031,
-0.3662978410720825,
-0.2800077795982361,
0.29971879720687866,
-0.43379440903663635,
-0.02045377343893... | |
encoder on any platform with a more permissive license than Nero's at this point in time. | [
0.16727712750434875,
-0.03517644479870796,
0.17285367846488953,
0.27775850892066956,
-0.10302292555570602,
-0.463689923286438,
0.1053655669093132,
0.06803760677576065,
0.16051730513572693,
-0.4594949185848236,
-0.09113600105047226,
0.3130528926849365,
-0.5051300525665283,
0.338751763105392... | |
I had a discussion with a developer earlier today re identifying TCP packets going out on a particular interface with the same payload. He told me that the probability of finding a TCP packet that has an equal payload (even if the same data is sent out several times) is very low due to the way TCP packets are construct... | [
0.280346155166626,
-0.00045633784611709416,
0.15238870680332184,
0.3031575083732605,
-0.07979622483253479,
-0.09492944180965424,
-0.11231298744678497,
-0.23070603609085083,
-0.47434771060943604,
-0.6394801735877991,
0.22564566135406494,
0.22729258239269257,
-0.24970634281635284,
0.09115808... | |
it easier identifying matching payloads?
EDIT: Sorry, my original idea was ridiculous.
You got me interested so I googled a little bit and found [this](http://monkey.org/~jose/software/flowgrep/). If you wanted to write your own tool you would probably have to inspect each payload, the easiest way would probably be s... | [
0.41685062646865845,
-0.10518196225166321,
-0.01502301450818777,
0.18030226230621338,
-0.426230251789093,
-0.20629648864269257,
0.024438872933387756,
0.0044293091632425785,
-0.254703551530838,
-0.42474886775016785,
0.4158457815647125,
0.4406564235687256,
-0.3645089566707611,
-0.31567388772... | |
I have three unordered lists that have been created as Scriptaculous Sortables so that the user can drag items within the lists and also between them:
```
var lists = ["pageitems","rowitems","columnitems"];
Sortable.create("pageitems", { dropOnEmpty: true, containment: lists, constraint: false });
Sortable.cre... | [
0.11067888885736465,
0.04484361782670021,
0.41332072019577026,
0.04546381160616875,
0.02797134406864643,
0.24252238869667053,
0.10712166875600815,
-0.3256419003009796,
-0.3022975027561188,
-0.799866259098053,
0.13529953360557556,
0.2367020547389984,
-0.6945331692695618,
0.06079405918717384... | |
an empty list.
Maybe the empty list has no height, and therefore no droppable area available. If that's the case, perhaps you just need to set a minimum height, or some padding on the block. | [
0.5191240906715393,
-0.05533595010638237,
0.101605124771595,
0.13637593388557434,
0.1635102927684784,
0.001401780522428453,
0.23306897282600403,
-0.025628961622714996,
-0.5295303463935852,
-0.26809820532798767,
-0.01988099329173565,
0.380993127822876,
-0.11466339975595474,
-0.2774722874164... | |
There doesn't seem to be a dictionary.AddRange() method. Does anyone know a better way to copy the items to another dictionary without using a foreach loop.
I'm using the System.Collections.Generic.Dictionary. This is for .NET 2.0.
There's nothing wrong with a for/foreach loop. That's all a hypothetical AddRange meth... | [
0.2645359933376312,
-0.06691409647464752,
0.25952500104904175,
0.0904679223895073,
0.04472823068499565,
0.13309554755687714,
0.20343312621116638,
0.008282626047730446,
-0.3600568473339081,
-0.7335529327392578,
0.04858699440956116,
0.439763605594635,
-0.19996283948421478,
0.2148814350366592... | |
for both current ones, but you'd still need a loop to load at least one of them. | [
0.6080051064491272,
-0.1952984482049942,
0.1246315985918045,
0.5954338908195496,
0.04575623199343681,
0.11777158826589584,
-0.15093496441841125,
-0.34424668550491333,
-0.3588946759700775,
0.013428314588963985,
0.36811548471450806,
0.3483591079711914,
-0.32553860545158386,
-0.07661951333284... | |
We have in the process of upgrading our application to full Unicode comptibility as we have recently got Delphi 2009 which provides this out of the box. I am looking for anyone who has experience of upgrading an application to accept Unicode characters. Specifically answers to any of the following questions.
* We need... | [
0.1803000122308731,
0.29940080642700195,
0.32729920744895935,
-0.17299583554267883,
-0.168399378657341,
0.34005236625671387,
0.2576698064804077,
0.09115763753652573,
-0.2952505648136139,
-0.5081875920295715,
0.04982951283454895,
0.43904969096183777,
-0.10912217199802399,
0.0692284032702446... | |
any way to default to this for certain Fields. It seems extraordinary this is still required.
* Is it possible to get any defaults set up in SQLServer that will make this simpler?
ps We also need to upgrade our Oracle code
Oracle doesn't require you to use `nvarchar` to store Unicode strings—the server can be configur... | [
0.25465214252471924,
0.014674112200737,
0.1226716861128807,
0.14820899069309235,
-0.08425524830818176,
-0.17281822860240936,
0.320484459400177,
-0.052379485219717026,
-0.2308642864227295,
-0.678941011428833,
-0.10991458594799042,
0.5357141494750977,
-0.29738935828208923,
-0.202675521373748... | |
to get rid of non-parameterized queries. They are nothing but a drag on your system from a maintenance, performance, and safety standpoint. | [
0.39294928312301636,
0.237253338098526,
-0.020612532272934914,
0.4485538899898529,
0.11974011361598969,
-0.08935360610485077,
0.20426718890666962,
0.15721632540225983,
-0.22350001335144043,
-0.5258907675743103,
0.017618777230381966,
0.46346426010131836,
-0.23670849204063416,
-0.10220646858... | |
I'd like to build a query string based on values taken from 5 groups of radio buttons.
Selecting any of the groups is optional so you could pick set A or B or both. How would I build the querystring based on this? I'm using VB.NET 1.1
The asp:Radiobuttonlist control does not like null values so I'm resorting to norma... | [
0.2912145256996155,
0.1675339639186859,
0.4902617335319519,
-0.040431540459394455,
-0.3565326929092407,
-0.17780032753944397,
0.14301826059818268,
-0.6961740851402283,
-0.27466124296188354,
-0.4486384391784668,
0.2247403860092163,
0.5671170949935913,
-0.4754003584384918,
-0.000083112063293... | |
name="cBoat" id="Cb2" value="2" /> detail2
```
VB.NET
```
Public Sub btnSubmit_click(ByVal sender As Object, ByVal e As System.EventArgs)
Dim queryString As String = "nextpage.aspx?"
Dim aBoat, bBoat, cBoat bas String
aBoat = "apb=" & Request("aBoat")
bBoat = "bBoat=" & Request("bBoat")
cBoat = "cBoat=" ... | [
0.0809754729270935,
-0.06545045971870422,
0.7782928347587585,
-0.21507661044597626,
-0.08908064663410187,
-0.137330561876297,
0.34320923686027527,
-0.3574773669242859,
-0.4022657871246338,
-0.569584310054779,
-0.5468800067901611,
0.35770440101623535,
-0.39225873351097107,
0.122385233640670... | |
form was submitted you would automatically get the querystring you are after (and don't forget to add <label> tags and associate them with your radio buttons):
```
<form action="..." method="get">
<input type="radio" name="apBoat" id="Apb1" value="1" /> <label for="Apb1">detail1</label>
<input type="radio" nam... | [
0.28520455956459045,
0.12395784258842468,
0.6773831248283386,
-0.10393358767032623,
-0.31584811210632324,
-0.008644902147352695,
-0.27279576659202576,
-1.1744593381881714,
-0.15777146816253662,
-0.43613287806510925,
-0.04839874058961868,
0.44827190041542053,
-0.2180544137954712,
-0.0115718... | |
I am looking for an easy way to check if an object in C# is serializable.
As we know you make an object serializable by either implementing the *ISerializable* interface or by placing the *[Serializable]* at the top of the class.
What I am looking for is a quick way to check this without having to reflect the class t... | [
-0.13272270560264587,
-0.11824853718280792,
0.14281338453292847,
-0.08591379225254059,
-0.10336185246706009,
-0.11252034455537796,
0.3201744556427002,
0.20642149448394775,
-0.2127009779214859,
-0.6365896463394165,
-0.08814963698387146,
0.6675450801849365,
-0.6166536211967468,
0.26185414195... | |
|| (Attribute.IsDefined(typeof (T), typeof (SerializableAttribute))));
}
```
Or even better just get the type of the object and then use the IsSerializable property on the type:
```
typeof(T).IsSerializable
```
Remember though this this seems to only just the class that we are dealing with if the class contains ot... | [
-0.18658477067947388,
-0.04399307817220688,
-0.010514629073441029,
0.0373300202190876,
-0.09065403789281845,
-0.08749458938837051,
0.18967722356319427,
0.0709138810634613,
-0.11679545789957047,
-0.786529004573822,
-0.1820429116487503,
0.38790997862815857,
-0.3805914521217346,
0.31689816713... | |
We have a NET app that gets installed to the Program Files folder.
The app itself writes some files and creates some directories to its app folder.
But when a normal windows user tries to use our application it crashes because that user does not have permission to write to app folder.
Is there any folder in both WinXP... | [
0.47270217537879944,
0.160446897149086,
0.6006870865821838,
0.3334715962409973,
0.07376547157764435,
-0.229396253824234,
0.052610401064157486,
-0.08666392415761948,
-0.13586166501045227,
-0.8630890250205994,
-0.02292591892182827,
0.5210356712341309,
-0.331329345703125,
0.13465921580791473,... | |
Data
Feel free to create a folder there in your installer and set the ACL so that everyone can write to that folder.
Keep in mind that COMMON\_APPDATA was implemented in Version 5 of the common controls library which means that it's available in Windows 2000 and later. In NT4, you can create that folder in your insta... | [
0.13829153776168823,
-0.21561147272586823,
0.7794950008392334,
0.13893258571624756,
-0.05859007313847542,
-0.2405090183019638,
0.4177436828613281,
-0.4145311117172241,
-0.15934312343597412,
-0.5821327567100525,
-0.036704953759908676,
0.6822189688682556,
-0.43558305501937866,
0.042121831327... | |
:= ExpandConstant('{app}\data');
GetWindowsVersionEx(Version);
if (Version.Major >= 5) then begin
Result := ExpandConstant('{commonappdata}\myprog');
end;
end;
``` | [
-0.2918252646923065,
-0.12613599002361298,
0.8957584500312805,
-0.5130743384361267,
0.3818538784980774,
0.11910270899534225,
0.40434491634368896,
-0.28662794828414917,
-0.1931450515985489,
-0.5533768534660339,
-0.7872400283813477,
0.6586484313011169,
-0.3035159707069397,
0.1502171605825424... | |
I am trying to use MinGW to compile a C program under Windows XP. The gcc.exe gives the following error:
**stdio.h : No such file or directory**
The code (hello.c) looks like this:
```
#include < stdio.h >
void main()
{
printf("\nHello World\n");
}
```
I use a batch file to call gcc. The batch file looks like... | [
0.2586333453655243,
0.2041434645652771,
0.5750893354415894,
-0.36063650250434875,
0.10741865634918213,
-0.08468447625637054,
0.4167321026325226,
-0.15288951992988586,
0.06016584113240242,
-0.6994295716285706,
-0.13844181597232819,
0.49969854950904846,
-0.5205045938491821,
0.210032358765602... | |
end. | [
-0.16555626690387726,
0.0250112172216177,
0.3882046937942505,
0.13125339150428772,
-0.3650429844856262,
-0.15264800190925598,
0.1251629889011383,
-0.045902784913778305,
0.32774409651756287,
-0.9626858234405518,
-0.34134721755981445,
0.21241573989391327,
0.07872407138347626,
0.2939342558383... | |
In .NET, after this code, what mechanism stops the `Thread` object from being garbage collected?
```
new Thread(Foo).Start();
GC.Collect();
```
Yes, it's safe to assume **something** has a reference to the thread, I was just wandering what exactly. For some reason Reflector doesn't show me `System.Threading`, so I c... | [
0.3628784716129303,
0.05802961066365242,
0.5584712624549866,
-0.056858789175748825,
-0.19589459896087646,
-0.5910720825195312,
0.23794440925121307,
0.2566470205783844,
-0.47377118468284607,
-0.62680983543396,
-0.03586685657501221,
0.41096922755241394,
-0.5694782733917236,
0.404890716075897... | |
I'd like to add a method `AddDefaultNamespace()` to the String class in Java so that I can type `"myString".AddDefaultNamespace()` instead of `DEFAULTNAMESPACE + "myString"`, to obtain something like `"MyDefaultNameSpace.myString"`. I don't want to add another derived class either (`PrefixedString` for example).
Maybe... | [
0.05663653090596199,
-0.0008801164804026484,
0.19085851311683655,
-0.1270923763513565,
-0.1561289131641388,
-0.26308614015579224,
0.3171265125274658,
-0.0604303814470768,
-0.056640610098838806,
-0.5832652449607849,
0.1252589374780655,
0.5436824560165405,
-0.33253535628318787,
0.11724805086... | |
Is there a way to hide the google toolbar in my browser programmable?
You haven't said which browser you are using so I'm going to assume Internet Explorer\* and answer No.
If JavaScript on a web page could manipulate the browser, it would be a serious security hole and could create a lot of confusion for users.
So n... | [
0.4676700532436371,
0.23433715105056763,
0.2195853590965271,
0.1877008080482483,
-0.029497891664505005,
-0.2918606996536255,
0.24599772691726685,
0.09655025601387024,
-0.20521600544452667,
-0.6018387079238892,
-0.03895728290081024,
0.613635241985321,
-0.40614035725593567,
0.179580956697464... | |
Is is possible to get login credentials such as name/id if user does login by OpenId?
There are two accepted methods for retrieving these kind of things by OpenID: SReg and Attribute Exchange (AX). Both of these are extensions to the standard OpenID specification; SReg is the older of the two and specifies a set of fie... | [
0.18949662148952484,
-0.18665899336338043,
0.27176326513290405,
0.23479488492012024,
-0.24514630436897278,
-0.36687520146369934,
-0.07219164818525314,
-0.13287106156349182,
-0.23807328939437866,
-0.48528769612312317,
-0.3176143765449524,
0.31909361481666565,
-0.30763792991638184,
-0.004473... | |
servers tend to implement the SReg names.
[OpenID Simple Registration Extension Specification 1.0](http://openid.net/specs/openid-simple-registration-extension-1_0.html)
[OpenID Attribute Exchange Specification 1.0 Final](http://openid.net/specs/openid-attribute-exchange-1_0.html) | [
0.0014314902946352959,
0.11101487278938293,
0.7100960612297058,
0.08233798295259476,
-0.5198332071304321,
-0.35505369305610657,
-0.0638604462146759,
-0.27109286189079285,
-0.262472540140152,
-0.2151608020067215,
-0.3716844618320465,
0.109159454703331,
-0.2955145835876465,
0.201273366808891... | |
Given the following JSON Date representation:
```
"\/Date(1221644506800-0700)\/"
```
How do you deserialize this into it's JavaScript Date-type form?
I've tried using MS AJAX JavaScrioptSerializer as shown below:
```
Sys.Serialization.JavaScriptSerializer.deserialize("\/Date(1221644506800-0700)\/")
```
However, ... | [
0.0643961951136589,
0.02868753671646118,
0.3409216105937958,
-0.22359143197536469,
-0.033430252224206924,
-0.14459924399852753,
0.15536154806613922,
-0.035217490047216415,
-0.0814475417137146,
-0.6320160031318665,
-0.43046605587005615,
0.49840524792671204,
-0.11998109519481659,
0.125204861... | |
I have a version number of the following form:
version.release.modification
where version, release and modification are either a set of digits or the '\*' wildcard character. Additionally, any of these numbers (and any preceding .) may be missing.
So the following are valid and parse as:
```
1.23.456 = version 1, r... | [
0.4270783066749573,
0.3053332567214966,
0.719842791557312,
-0.2087394744157791,
0.06943584233522415,
0.16716748476028442,
0.06114485487341881,
-0.1917857527732849,
0.05784830451011658,
-0.6061241626739502,
-0.2886209189891815,
0.6877076029777527,
-0.2377842217683792,
0.370126873254776,
0... | |
= any version, any release, any modification
```
But these are not valid:
```
*.12
*123.1
12*
12.*.34
```
Can anyone provide me a not-too-complex regex to validate and retrieve the release, version and modification numbers?
I'd express the format as:
> "1-3 dot-separated components, each numeric except that the l... | [
0.0865519568324089,
0.23494592308998108,
0.6363403797149658,
0.027241578325629234,
0.12586796283721924,
-0.0637969896197319,
0.048055995255708694,
-0.5700246691703796,
-0.07090864330530167,
-0.19786489009857178,
-0.18796885013580322,
0.563037097454071,
-0.3251204788684845,
-0.0276299305260... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.