text stringlengths 0 30.5k | title stringclasses 1
value | embeddings listlengths 768 768 |
|---|---|---|
I'm trying to create a UDF in `SQL Server 2005 Express` as below:
```
CREATE FUNCTION [CombineValues] ()
RETURNS VARCHAR(8000)
AS
BEGIN
DECLARE @CuisineList VARCHAR(8000);
RETURN
(
SELECT @CuisineList = COALESCE(@CuisineList + ', ', '') +
CAST(Cuisine AS varchar(20))
FROM Cuisines
)
END
``... | [
0.12831951677799225,
0.22524461150169373,
0.30629342794418335,
-0.5200647711753845,
0.008930197916924953,
0.0450926199555397,
0.34330981969833374,
-0.421159565448761,
0.02261660061776638,
-0.7167569398880005,
-0.025462552905082703,
0.22867664694786072,
-0.3005205988883972,
-0.0404776483774... | |
Wild Thing. Please do not vote it up or down.
```
CREATE FUNCTION [CombineValues] ()
RETURNS VARCHAR(8000)
AS
BEGIN
DECLARE @CuisineList VARCHAR(8000);
SELECT @CuisineList = COALESCE(@CuisineList + ', ', '') + CAST(Cuisine AS varchar(20)) FROM Cuisines;
RETURN
(
SELECT @CuisineList
)
END
``` | [
0.21222086250782013,
-0.47269466519355774,
0.17337575554847717,
0.020180594176054,
0.5852511525154114,
0.02099328488111496,
0.24825483560562134,
-0.5683675408363342,
-0.1238853707909584,
-0.09668192267417908,
-0.16884082555770874,
0.2821658253669739,
-0.19483032822608948,
-0.13367862999439... | |
I'm attempting to display a "LargeIcon" view in a listview control, however the images I specify are blurry. This is what I have so far:
[alt text http://img220.imageshack.us/img220/1005/blurryiconsql3.jpg](http://img220.imageshack.us/img220/1005/blurryiconsql3.jpg)
The .png files are 48x48 and that's what I have it s... | [
0.15421265363693237,
-0.1006024107336998,
0.7185990810394287,
-0.022198256105184555,
-0.2916935682296753,
0.09109961986541748,
0.03850062936544418,
-0.03242897987365723,
-0.4912222623825073,
-0.7689774036407471,
0.22917312383651733,
0.8638699650764465,
-0.0957435667514801,
0.06644088029861... | |
"Size" is set to 16x16 and not abled to be manipulated. Does anyone have any ideas? Many thanks!
When adding a .PNG Icon format size the editor tends to pick the first entry size in that file, so it picks up the 16x16 entry and it's stretching that out. That's why you see the 16x16 in the properties there. As suggested... | [
0.5083004236221313,
-0.10581114888191223,
0.5935994386672974,
-0.018754614517092705,
-0.26970720291137695,
0.012939279899001122,
-0.2255890667438507,
-0.03788821026682854,
-0.7143632173538208,
-0.5735208988189697,
0.03359996899962425,
0.5446479320526123,
-0.2726505696773529,
-0.15782462060... | |
Fireworks and extract the exact size you want. | [
0.4432362914085388,
0.3379335403442383,
0.05708364024758339,
0.23540788888931274,
0.049011457711458206,
-0.13370071351528168,
0.08824193477630615,
0.16017648577690125,
-0.1896447390317917,
-0.16972468793392181,
-0.2251519411802292,
0.9687780141830444,
0.29400408267974854,
-0.11263477802276... | |
There appear to be a lot of unnecessary frameworks loading into my iPhone app. I didn't link against them in Xcode, and I don't need them.
When I run "lsof -p" against them on the iPhone, I see these (and others) that I can't explain:
* CoreVideo
* AddressBookUI
* JavaScriptCore
* MobileSync
* EAP8021X
* BluetoothMan... | [
0.40589794516563416,
0.1770077347755432,
0.4304049611091614,
0.021605463698506355,
0.06480944901704788,
0.05220711976289749,
-0.005467311479151249,
0.10618840157985687,
-0.2873268723487854,
-0.803331732749939,
0.16360323131084442,
0.7550178170204163,
-0.042029622942209244,
-0.0212382581084... | |
it uses simple NSURL / NSURLConnection functions to post data to a couple of web services.
This is a jailbroken 2.1 iPhone with a few apps installed from Cydia. Is this normal?
This is normal, but that doesn't mean it's ideal. It probably only has a small impact on app startup time, but it'll have a slightly greater i... | [
0.12506811320781708,
0.08732102811336517,
0.1696002185344696,
0.17273543775081635,
0.42378804087638855,
-0.09088461846113205,
0.2928684949874878,
0.24426791071891785,
-0.29551467299461365,
-0.517536997795105,
-0.011381040327250957,
0.1979215294122696,
-0.6712489128112793,
-0.14068539440631... | |
they should be able to track things down from there. I'm sure they'd be interested in reports like this. | [
0.5529718399047852,
0.36725950241088867,
-0.022455861791968346,
0.09750692546367645,
0.11649186909198761,
-0.29225093126296997,
0.23101672530174255,
0.3141433000564575,
-0.2927616834640503,
-0.2798890471458435,
0.20026645064353943,
0.5158893465995789,
0.17847324907779694,
0.070372477173805... | |
How would it be possible to capture the audio programmatically? I am implementing an application that streams in real time the desktop on the network. The video part is finished. I need to implement the audio part. I need a way to get PCM data from the sound card to feed to my encoder (implemented using Windows Media F... | [
0.5134493708610535,
0.045176129788160324,
0.8579542636871338,
0.11765551567077637,
0.2393946796655655,
-0.37723830342292786,
-0.04968267306685448,
-0.16198092699050903,
-0.2244446575641632,
-0.8113641142845154,
0.17822809517383575,
0.9012293219566345,
0.2099670171737671,
0.1452644616365432... | |
there is a direct way to do this using the OS - it's a feature that may (or may not) be present on the sound card. Some sound cards have a loopback interface - Creative calls it "What U Hear". You simply select this as the input rather than the microphone, and record from it using the normal waveInOpen() that you alrea... | [
0.6571398377418518,
-0.20311188697814941,
0.44163164496421814,
0.48427876830101013,
0.2975711226463318,
-0.24355101585388184,
-0.17799179255962372,
0.07498287409543991,
0.19101886451244354,
-0.3573776185512543,
0.2940830588340759,
0.9233474731445312,
0.09090033173561096,
0.0657288506627082... | |
the speaker output to the line input :) | [
-0.23731042444705963,
-0.13529229164123535,
0.7432973980903625,
-0.19686506688594818,
-0.11561550945043564,
0.6129758358001709,
0.19125576317310333,
-0.14100372791290283,
-0.0144406883046031,
-0.24898786842823029,
-0.2102251648902893,
0.7087586522102356,
-0.05015872046351433,
0.37518915534... | |
What is the web interface tool that Debian or Ubuntu use for publicizing their custom repositories on the web?
Like [packages.debian.org](http://www.debian.org/distrib/packages)
Is such tool open sourced, so that it could be re-used for a custom repository?
The scripts that manage the archive are open source, they're... | [
0.628081202507019,
0.149177685379982,
-0.25908371806144714,
0.2759421169757843,
-0.25571003556251526,
-0.43577840924263,
-0.28765448927879333,
0.09781869500875473,
-0.36247870326042175,
-0.2630249261856079,
0.04047389701008797,
0.3199341893196106,
-0.2796812653541565,
-0.038487352430820465... | |
you can get hold of what debian use. | [
0.5235540270805359,
0.10968247801065445,
-0.373411625623703,
0.27651500701904297,
-0.23817871510982513,
-0.5383858680725098,
-0.287479430437088,
0.4409935176372528,
0.1263703554868698,
-0.2299315184354782,
0.02354453131556511,
0.43865227699279785,
-0.20252776145935059,
0.20555774867534637,... | |
Suppose that a group wants to encrypt some information, then share the encryption key among the group members in a way that requires the consensus of the group to decrypt the information. I'm interested in a variety of scenarios where the breadth of consensus ranges from unanimity to an absolute majority. A useful tech... | [
0.13484418392181396,
0.1620474010705948,
-0.2828213572502136,
0.13397303223609924,
0.04430724307894707,
-0.2498265951871872,
0.10780457407236099,
-0.21488866209983826,
-0.2599754333496094,
-0.2980964183807373,
-0.22925733029842377,
0.37186020612716675,
-0.1877368837594986,
-0.0940803140401... | |
scrutiny by expert cryptanalysts. Journal citations are good, but interpretation of academic sources are very useful too.
I have always been fascinated by this secret sharing technique. I've seen code implementing it on the internet, but have never seen actual applications. [Shamir's secret sharing](http://en.wikipedia... | [
0.5440554618835449,
0.30252811312675476,
-0.3203931450843811,
0.022829754278063774,
-0.2257986068725586,
-0.4381880760192871,
0.2835344076156616,
-0.1104627326130867,
-0.10753947496414185,
0.08953144401311874,
-0.1469811350107193,
0.4924502372741699,
-0.06965210288763046,
0.234094291925430... | |
For example:
```
root.Nodes.Add(new TNode() { Foo1 = bar1, Foo2 = bar2, Foo3 = bar3 });
```
or:
```
root.Nodes.Add(new TNode() { Foo1 = bar1,
Foo2 = bar2,
Foo3 = bar3 });
```
I've done it both ways.. IMO it depends on the complexity of the initialization.... | [
-0.06277824938297272,
0.1525806486606598,
0.37960320711135864,
-0.57962566614151,
0.32929664850234985,
0.12740248441696167,
0.42296111583709717,
-0.5260900259017944,
-0.27346888184547424,
-0.4716311991214752,
-0.2498927116394043,
0.6296132802963257,
-0.20270289480686188,
0.0196679253131151... | |
2 or 3 properties I will initialize on one line generally, but if i'm setting up an object with values for insertion into a database or something that has alot of properties i'll break it out like your second example.
```
Income income = new Income
{
Initials = something,
CheckNumber = something,
CheckDate... | [
0.28909483551979065,
0.05281902849674225,
0.18424803018569946,
-0.017243145033717155,
-0.09286752343177795,
-0.13717791438102722,
0.09316101670265198,
-0.4188813865184784,
-0.010999610647559166,
-0.73610919713974,
-0.26451143622398376,
0.4807189404964447,
-0.2344358265399933,
0.03928918018... | |
What is the best practice for naming UI controls (textboxes, drop-downs, etc.) on forms and reports for reference in the code-behind pages?
I develop a lot of reports and forms in my office. I have several web applications providing about 80+ "live" reports being generated from various and multiple data sources (Acces... | [
0.8200169205665588,
0.27938002347946167,
0.4753226637840271,
0.4166938364505768,
-0.010391018353402615,
0.01218943390995264,
0.023402975872159004,
-0.3950163424015045,
0.011989543214440346,
-0.6028682589530945,
-0.12776046991348267,
0.38725563883781433,
0.0006108919042162597,
-0.0249075368... | |
dataset, and finally assigning the dataset to the report. In some cases, additional fields displayed on the report need to be calculated from the dataset before the report can be generated. This requires referencing the output controls on the report to assign the calculated value.
While I don't really care to use pref... | [
0.1691383272409439,
0.05055835098028183,
0.583834707736969,
0.24210664629936218,
-0.015917887911200523,
-0.1826559603214264,
-0.19867490231990814,
-0.36874035000801086,
-0.1217053085565567,
-0.567413866519928,
-0.2489202916622162,
0.4524998068809509,
-0.21728210151195526,
0.069071158766746... | |
for naming/referencing UI controls on forms and reports?
The main product I work on at work uses the txt\_ pnl\_ etc prefixes. This does work, though it is a bit of a pain at times when switching something that just hides/shows controls from say, a tr to a panel because you have to rename it.
What I've started doing ... | [
0.34311166405677795,
0.29369133710861206,
0.18333661556243896,
0.040441300719976425,
-0.29417988657951355,
-0.22558534145355225,
0.14461615681648254,
-0.10054892301559448,
-0.30797892808914185,
-0.622459352016449,
0.10151179134845734,
0.2252742499113083,
-0.2713068127632141,
0.310843765735... | |
being the prefix meaning user interface control). | [
-0.32672247290611267,
-0.322007954120636,
0.7250813841819763,
0.26154905557632446,
-0.02459261193871498,
0.12260308861732483,
0.19132442772388458,
-0.06854663789272308,
-0.03820681944489479,
-0.0959906354546547,
-0.4329541027545929,
0.5578407049179077,
-0.20371559262275696,
0.1917320489883... | |
I work on a large C# application (approximately 450,000 lines of code), we constantly have problems with desktop heap and GDI handle leaks. WPF solves these issues, but I don't know what is the best way to upgrade (I expect this is going to take a long time). The application has only a few forms but these can contain m... | [
0.539797842502594,
0.40232130885124207,
0.17708182334899902,
-0.02296426147222519,
0.06314985454082489,
0.042648982256650925,
0.2843784689903259,
-0.16638103127479553,
-0.024172719568014145,
-0.6059538722038269,
-0.0809590071439743,
0.5610722899436951,
0.10863853245973587,
-0.2030278891324... | |
massive effort?
You can start by creating a WPF host.
Then you can use the <WindowsFormHost/> control to host your current application. Then, I suggest creating a library of your new controls in WPF. One at a time, you can create the controls (I suggest making them custom controls, not usercontrols). Within the style... | [
0.5203235745429993,
-0.2592127323150635,
0.30086201429367065,
0.21756340563297272,
-0.061946284025907516,
-0.09027673304080963,
0.19174179434776306,
-0.5358306169509888,
-0.45314472913742065,
-0.7327753901481628,
0.1639983206987381,
0.596950113773346,
-0.25621941685676575,
0.01224484201520... | |
and design a WPF host for the application. I am not sure the size of the application and or the complexity of the user controls, so I'm not sure how much effort that would be for you. Relatively speaking, it is significantly less effort and much faster to get you application up and running in WPF this way.
I wouldn't... | [
0.5861532688140869,
0.020674608647823334,
0.3776102662086487,
0.3049256503582001,
-0.13791073858737946,
-0.49063658714294434,
0.2560648024082184,
-0.1230294406414032,
-0.22758813202381134,
-1.0157904624938965,
0.2174612134695053,
0.6247920989990234,
-0.10122780501842499,
0.1405351161956787... | |
project, or provide more technical information if you would like more specific guidance. Thanks :) | [
0.5387435555458069,
-0.05341728776693344,
0.09788531064987183,
0.5638904571533203,
0.3869673013687134,
-0.14479900896549225,
0.08978741616010666,
0.3770698010921478,
0.04674621671438217,
-0.6352737545967102,
-0.14589844644069672,
0.32963526248931885,
0.48876097798347473,
-0.260964542627334... | |
Any good ones?
So far I have found IZWebFileManager, OXFileManager and AWS File Picker. The file manager should be able to delete, copy, rename, download & upload files.
I used [HTTPCommander](http://www.element-it.com/asp-net-explorer-browser/online-share/web-file-manager.aspx). Telerik also has a file manager control... | [
0.005276505369693041,
-0.30864882469177246,
0.3559528589248657,
0.13318832218647003,
0.02859249711036682,
-0.07074493169784546,
-0.04861312359571457,
-0.0002424075355520472,
-0.2737034261226654,
-0.6708874106407166,
0.017034918069839478,
0.6769925951957703,
-0.07338694483041763,
-0.0515338... | |
In Cocoa, if I want to loop through an NSMutableArray and remove multiple objects that fit a certain criteria, what's the best way to do this without restarting the loop each time I remove an object?
Thanks,
Edit: Just to clarify - I was looking for the best way, e.g. something more elegant than manually updating the... | [
0.14658001065254211,
0.09559497237205505,
0.07468896359205246,
-0.19603359699249268,
-0.1715087890625,
-0.12272722274065018,
0.12478030472993851,
-0.10923264920711517,
-0.4820016324520111,
-0.2776826322078705,
-0.11015302687883377,
0.49068450927734375,
-0.4282241761684418,
-0.1493879854679... | |
the items to delete. Then I delete them. Here's a sample using Objective-C 2.0 syntax:
```
NSMutableArray *discardedItems = [NSMutableArray array];
for (SomeObjectClass *item in originalArrayOfItems) {
if ([item shouldBeDiscarded])
[discardedItems addObject:item];
}
[originalArrayOfItems removeObjectsInA... | [
-0.1191537156701088,
-0.03490663319826126,
0.19145993888378143,
-0.07813291251659393,
-0.014252954162657261,
0.04535943269729614,
0.18845844268798828,
-0.4586288332939148,
-0.14615410566329956,
-0.3673200309276581,
-0.06204018369317055,
0.5556724071502686,
-0.3521464765071869,
-0.000015843... | |
and processing cost of allocating a new array, and discarding the old one?) but even if it's faster it may not be as big a deal as it would be for a naive implementation, because NSArrays do not behave like "normal" arrays. They talk the talk but they walk a different walk. [See a good analysis here:](http://ridiculous... | [
0.29331764578819275,
-0.2786715030670166,
0.07797743380069733,
0.11385602504014969,
-0.1986188292503357,
0.24621713161468506,
0.11060638725757599,
-0.20295323431491852,
-0.3530990779399872,
-0.7554698586463928,
0.24790365993976593,
0.6133623719215393,
-0.4245462417602539,
-0.39906755089759... | |
I personally find the above formulation clearest, which is why I use it. But if the inverse formulation is clearer to you, go for it. | [
0.22127372026443481,
0.280745267868042,
-0.17671646177768707,
-0.23245790600776672,
-0.6507834196090698,
0.18354271352291107,
0.25744250416755676,
0.008306212723255157,
0.20956969261169434,
-0.6099315285682678,
0.09192869812250137,
0.8060330152511597,
-0.23568153381347656,
-0.0665261521935... | |
The one-liner should:
* solve a real-world problem
* not be extensively cryptic (should be easy to understand and reproduce)
* be worth the time it takes to write it (should not be too clever)
I'm looking for practical tips and tricks (complementary examples for `perldoc perlrun`).
All one-liners from the answers col... | [
-0.4740445613861084,
-0.21859145164489746,
0.5219936966896057,
0.2877621054649353,
-0.15986354649066925,
0.09784043580293655,
-0.032671716064214706,
-0.17580603063106537,
0.2920539379119873,
-0.4607256352901459,
-0.20324015617370605,
0.45607051253318787,
-0.41968026757240295,
-0.4489125013... | |
%15s %9d\n", sub{reverse @_[0..2]}->(localtime $F[0]), @F[2,4]'`
* `export PATH=$(perl -F: -ane'print join q/:/, grep { !$c{$_}++ } @F'<<<$PATH)`
* `alias e2d="perl -le \"print scalar(localtime($ARGV[0]));\""`
* `perl -ple '$_=eval'`
* `perl -00 -ne 'print sort split /^/'`
* `perl -pe'1while+s/\t/" "x(8-pos()%8)/e'`
* ... | [
-0.2861861288547516,
-0.22801294922828674,
0.9701664447784424,
-0.15517748892307281,
0.18297910690307617,
0.36783653497695923,
0.25550687313079834,
-0.2678055763244629,
-0.2948867380619049,
-0.5139304399490356,
-0.5635157227516174,
0.5756284594535828,
-0.3902049958705902,
0.217708662152290... | |
I want to create some text in a canvas:
```
myText = self.canvas.create_text(5, 5, anchor=NW, text="TEST")
```
Now how do I find the width and height of `myText`?
```
bounds = self.canvas.bbox(myText) # returns a tuple like (x1, y1, x2, y2)
width = bounds[2] - bounds[0]
height = bounds[3] - bounds[1]
```
See the ... | [
0.09865482151508331,
0.24441197514533997,
0.6745201945304871,
-0.24208323657512665,
-0.3142322599887848,
0.18697822093963623,
0.489138126373291,
-0.2174612134695053,
-0.08794150501489639,
-0.7909939885139465,
-0.1464734971523285,
0.4063661992549896,
0.006742842495441437,
-0.041796244680881... | |
I need to upload some data to a server using HTTP `PUT` in python. From my brief reading of the urllib2 docs, it only does HTTP `POST`. Is there any way to do an HTTP `PUT` in python?
I've used a variety of python HTTP libs in the past, and I've settled on [requests](https://requests.readthedocs.io/) as my favourite. E... | [
0.4308586120605469,
-0.06299971044063568,
0.39419102668762207,
-0.1475910246372223,
-0.3015742599964142,
0.060712654143571854,
0.11909341812133789,
-0.14008848369121552,
-0.2852608263492584,
-0.6902446746826172,
-0.05206643417477608,
0.41368213295936584,
-0.13301527500152588,
0.01793040707... | |
the response with:
```
r.content
```
Requests has a lot synactic sugar and shortcuts that'll make your life easier. | [
0.4845132827758789,
0.3266311287879944,
0.6400026679039001,
0.42824721336364746,
-0.18540970981121063,
0.05086123198270798,
0.05604996532201767,
-0.05877231806516647,
0.13634724915027618,
-0.5481475591659546,
-0.3230854868888855,
0.5428476929664612,
0.021343549713492393,
0.0912944972515106... | |
I have a simple list I am using for a horizontal menu:
```
<ul>
<h1>Menu</h1>
<li>
<a href="/" class="selected">Home</a>
</li>
<li>
<a href="/Home">Forum</a>
</li>
</ul>
```
When I add a background color to the selected class, only the text gets the color, I want it to stretch the ent... | [
0.21635802090168,
-0.20831803977489471,
0.47656509280204773,
-0.24425461888313293,
-0.11127206683158875,
0.4567655324935913,
-0.029616236686706543,
-0.05275953561067581,
-0.3192131817340851,
-0.875794529914856,
-0.19773566722869873,
0.10129697620868683,
-0.2278996706008911,
0.0355743765830... | |
horizontally, apply the selected class to a block level element. Applying the class to the li element should work fine.
Alternatively, you could add this to the selected class' CSS:
```
display: block;
```
Which will make the a element display like a block element. | [
0.1937735676765442,
0.1230391412973404,
0.23912718892097473,
-0.034882403910160065,
-0.1747186779975891,
0.17992687225341797,
0.03625323623418808,
-0.19816385209560394,
-0.33815711736679077,
-0.7308387160301208,
-0.3350365459918976,
-0.09341269731521606,
-0.39860543608665466,
0.01011892501... | |
In terms of quick dynamically typed languages, I'm really starting to like Javascript, as I use it a lot for web projects, especially because it uses the same syntax as Actionscript (flash).
It would be an ideal language for shell scripting, making it easier to move code from the front and back end of a site, and less... | [
0.20896942913532257,
0.07491537183523178,
0.04574134200811386,
0.1213928759098053,
0.12297474592924118,
-0.14706943929195404,
0.09233630448579788,
0.4101092517375946,
-0.1695571392774582,
-0.821047306060791,
-0.08885359019041061,
0.7528824806213379,
-0.24879585206508636,
-0.190775841474533... | |
the OS.
Just run `cscript` or `wscript` against any .js file. | [
0.26785337924957275,
0.1810937225818634,
0.17726771533489227,
0.06802172213792801,
-0.12990708649158478,
-0.44866207242012024,
0.2970361113548279,
0.5915389060974121,
0.09930767863988876,
-0.8578814268112183,
-0.28610435128211975,
0.31697171926498413,
-0.3331073224544525,
-0.00582292815670... | |
I mean name off a programming project you did and how long it took, please. The boss has never complained but I sometimes feel like things take too long. But this could be because I am impatient as well. Let me know your experiences for comparison.
I've also noticed that things always seem to take longer, sometimes mu... | [
0.8818874955177307,
-0.14180009067058563,
-0.09915711730718613,
0.15436039865016937,
0.20128610730171204,
0.09828132390975952,
0.12734510004520416,
0.24358786642551422,
0.06466422975063324,
-0.43885964155197144,
0.44913989305496216,
0.5720374584197998,
0.2957463264465332,
0.171464443206787... | |
long as you are consistent, you can appropriately estimate actual times based on when you believed you'd get it done. It's not simply to determine how bad you are at estimating, but rather to take into account the regularity of inevitable distractions (both personal and boss/client-based).
This is based on Joel Spolsk... | [
0.3678407371044159,
-0.18392258882522583,
-0.16703516244888306,
0.12489767372608185,
0.14537042379379272,
0.3059016168117523,
0.4331003725528717,
-0.019888734444975853,
-0.41945210099220276,
-0.4256129860877991,
0.1884274184703827,
0.4861491918563843,
0.1362488567829132,
-0.080029495060443... | |
On my team, we usually do string concatentation like this:
```
var url = // some dynamically generated URL
var sb = new StringBuffer();
sb.append("<a href='").append(url).append("'>click here</a>");
```
Obviously the following is much more readable:
```
var url = // some dynamically generated URL
var sb = "<a href=... | [
0.2151235044002533,
0.03477694094181061,
0.3438732624053955,
-0.02936524897813797,
-0.4926096498966217,
-0.4403756856918335,
0.6098520755767822,
0.18731606006622314,
-0.21204303205013275,
-0.7806487083435059,
-0.1935213804244995,
0.25363120436668396,
-0.18142586946487427,
0.382064521312713... | |
string is.
If you have long strings to concatenate then definitely use an array.join technique. (Or some StringBuffer wrapper around this, for readability.) But if your strings are short don't bother. | [
0.34368133544921875,
-0.4163508117198944,
0.11636090278625488,
-0.06372608989477158,
-0.23018157482147217,
-0.39851054549217224,
0.2801927328109741,
0.02926742658019066,
-0.24564777314662933,
-0.591806173324585,
-0.13507962226867676,
0.4666318893432617,
-0.42470839619636536,
-0.13419277966... | |
I want to create a hidden field and create a link in one helper and then output both to my erb.
```
<%= my_cool_helper "something", form %>
```
Should out put the results of
```
link_to "something", a_path
form.hidden_field "something".tableize, :value => "something"
```
What would the definition of the helper lo... | [
0.036575112491846085,
-0.10629305243492126,
0.313629150390625,
0.02046515792608261,
0.10658238083124161,
-0.09019865840673447,
0.29828131198883057,
-0.05821846053004265,
0.22158540785312653,
-0.7429425120353699,
-0.009470188058912754,
0.6708310842514038,
-0.2814514935016632,
0.013413495384... | |
of the time, if things are simple).
EG:
```
link_to( "something", something_path ) + #NOTE THE PLUS FOR STRING CONCAT
form.hidden_field('something'.tableize, :value=>'something')
```
If you're doing things which are more complicated, you could just put that code in a partial, and have your helper call `render :p... | [
-0.004144350532442331,
-0.08916256576776505,
0.08326783031225204,
0.06650510430335999,
-0.24403399229049683,
-0.22118991613388062,
0.4113302528858185,
0.13349728286266327,
-0.2671040892601013,
-0.9268372058868408,
-0.43515732884407043,
0.23887065052986145,
-0.16303139925003052,
-0.15878590... | |
I am working a standalone c# desktop application that sends out documents and then imports them from Outlook when they are sent back. The application picks up the emails from a specified folder processes them and then saves the senders name plus other stuff to a database.
This works well for Outlook 2003 and 2007 whic... | [
0.5516541600227356,
0.23247098922729492,
0.35020712018013,
-0.2733640968799591,
-0.08188014477491379,
-0.0930095911026001,
0.2340470850467682,
0.0753651037812233,
-0.1557399183511734,
-0.5132423043251038,
0.09720027446746826,
0.39028170704841614,
-0.2299371361732483,
0.12141212075948715,
... | |
really want to avoid writing to customer registries. I also found MAPI33 a .Net wrapper around MAPI but it is unclear from the forums whether it is still being supported.
Would appreciate any pointers as to a .Net alternative to the Redemption dll or an approach to being able to consistently retrieve an email address ... | [
0.46075060963630676,
-0.15053392946720123,
0.2178475558757782,
0.06015077605843544,
-0.0652829110622406,
-0.03976402431726456,
0.5424317717552185,
0.006946892943233252,
-0.09646225720643997,
-0.4880242943763733,
0.04123222827911377,
0.11455237865447998,
-0.09736599773168564,
-0.13405968248... | |
Also found this on my travels <http://anoriginalidea.wordpress.com/2008/01/11/getting-the-smtp-email-address-of-an-exchange-sender-of-a-mailitem-from-outlook-in-vbnet-vsto/> it appears to be a touch involved. This might comprise my plan B if my existing implementation does not survive testing.
Thanks for your feedback... | [
0.28368625044822693,
-0.2058912217617035,
0.36493971943855286,
-0.06092502921819687,
-0.2716316282749176,
0.12619894742965698,
0.4696730971336365,
0.2154501974582672,
-0.25056135654449463,
-0.7184138894081116,
0.3538825809955597,
0.17308801412582397,
-0.20706836879253387,
0.017526756972074... | |
With it, you can get the SenderID of a mail message (IRDOMail), and from there, you can use the GetAddressEntryFromID() method of the IRDOSession object. | [
-0.294370174407959,
-0.2931358218193054,
0.7273733019828796,
0.10651687532663345,
-0.11415673792362213,
0.061934784054756165,
0.2675935924053192,
0.0036170966923236847,
0.02451075240969658,
-0.6864975094795227,
-0.2542687654495239,
0.7086594104766846,
-0.24852998554706573,
-0.0125683983787... | |
I want to put a `Canvas` with an image in my window, and then I want to *pack* widgets on top of it, so the Canvas acts as a background.
Is it possible to have two states for the `pack` manager: one for one set of widgets and another for another set?
The answer to your specific question is no. You can't have two stat... | [
0.853207528591156,
-0.14234259724617004,
0.13900470733642578,
0.17838670313358307,
0.36608582735061646,
-0.028069954365491867,
-0.008636358194053173,
-0.3258171081542969,
-0.3574727773666382,
-0.7598856687545776,
0.16616463661193848,
0.21749091148376465,
-0.38258498907089233,
-0.0164028368... | |
of the canvas, then pack things into the canvas as if it were a frame.
You can accomplish a similar thing by creating a label widget with an image, then pack your other widgets into the label.
One advantage to using a canvas is you can easily tile an image to fill the whole canvas with a repeating background image s... | [
0.6706382632255554,
-0.40772247314453125,
0.26840904355049133,
0.39869412779808044,
0.08377484232187271,
-0.18463261425495148,
-0.06105099990963936,
-0.3102888762950897,
-0.5269479751586914,
-0.8774574995040894,
0.21564286947250366,
0.2708818316459656,
-0.043901558965444565,
0.058023169636... | |
I'm building a C# application that will monitor a specified directory for changes and additions and storing the information in a database.
I would like to avoid checking each individual file for modifications, but I'm not sure if I can completely trust the file access time.
What would be the best method to use for ge... | [
0.5527102947235107,
-0.0203891322016716,
0.4376782774925232,
0.10519347339868546,
0.027414383366703987,
-0.11431234329938889,
-0.23584960401058197,
-0.07065600901842117,
-0.3851352334022522,
-0.5928046107292175,
0.28899744153022766,
0.3955841362476349,
-0.1820543110370636,
0.36691048741340... | |
request, then it would seem you might need to store off the directory info initially and then compare each time the user requests. I'd probably go with a FileSystemWatcher and just store off your results anyhow. | [
0.453297883272171,
-0.052502162754535675,
0.6224071979522705,
0.30240705609321594,
-0.04082321375608444,
0.04404006525874138,
-0.204996258020401,
-0.13159893453121185,
-0.19341786205768585,
-0.6168724298477173,
0.35586172342300415,
0.5510508418083191,
0.026711083948612213,
0.13946755230426... | |
In a C++ project I'm working on, I have a *flag* kind of value which can have four values. Those four flags can be combined. Flags describe the records in database and can be:
* new record
* deleted record
* modified record
* existing record
Now, for each record I wish to keep this attribute, so I could use an enum:
... | [
0.22528938949108124,
0.2871072590351105,
0.2997339069843292,
-0.10753277689218521,
-0.14252035319805145,
0.0816643014550209,
-0.010021754540503025,
-0.07524742186069489,
-0.4061335027217865,
-0.593647301197052,
0.0747237354516983,
0.1365252286195755,
-0.4034593105316162,
0.3002001643180847... | |
I have three possible appoaches:
```
#define X_NEW 0x01
#define X_DELETED 0x02
#define X_MODIFIED 0x04
#define X_EXISTING 0x08
```
or
```
typedef enum { xNew = 1, xDeleted, xModified = 4, xExisting = 8 } RecordType;
```
or
```
namespace RecordType {
static const uint8 xNew = 1;
static const uint8 ... | [
-0.18199829757213593,
0.2870217561721802,
0.34054723381996155,
-0.09660244733095169,
0.1669139415025711,
0.1789836287498474,
0.2805621922016144,
-0.44252488017082214,
-0.05151398107409477,
-0.5930078029632568,
-0.032321177423000336,
0.3415752053260803,
-0.26748842000961304,
0.3320062458515... | |
when I want to do a bitwise operation. With `const` I think I also lose type safety since a random `uint8` could get in by mistake.
Is there some other cleaner way?
If not, what would you use and why?
P.S. The rest of the code is rather clean modern C++ without `#define`s, and I have used namespaces and templates in... | [
0.1785067468881607,
0.11552809178829193,
-0.05576061084866524,
-0.008993900381028652,
-0.020023109391331673,
-0.25466105341911316,
0.235246479511261,
-0.14843852818012238,
0.028354180976748466,
-0.7750347256660461,
-0.097151018679142,
0.5824257135391235,
-0.24618110060691833,
-0.0144331147... | |
& low in flash usage.
Place the enum in a namespace to prevent the constants from polluting the global namespace.
```
namespace RecordType {
```
An enum declares and defines a compile time checked typed. Always use compile time type checking to make sure arguments and variables are given the correct type. There is ... | [
0.36298710107803345,
0.1210324838757515,
0.234709694981575,
-0.03010106459259987,
0.17183712124824524,
0.01150907576084137,
0.2753615975379944,
-0.10991889238357544,
-0.09487900137901306,
-0.5840253829956055,
-0.21406883001327515,
0.6107492446899414,
-0.443952739238739,
0.0137008186429739,... | |
useful for debugging; use it in initialisation lists and destructors to know if the variable's value should be used.
```
xInvalid = 16 };
```
Consider that you have two purposes for this type. To track the current state of a record and to create a mask to select records in certain states. Create an inline function t... | [
0.10758250206708908,
-0.07197517901659012,
0.10331016778945923,
0.14800511300563812,
0.15637630224227905,
-0.13221465051174164,
0.17973870038986206,
-0.10906098783016205,
-0.2374466508626938,
-0.4928443431854248,
0.13015884160995483,
0.494939923286438,
-0.44318273663520813,
0.1628924459218... | |
variables.
```
inline bool IsValidState( TRecordType v) {
switch(v) { case xNew: case xDeleted: case xModified: case xExisting: return true; }
return false;
}
inline bool IsValidMask( TRecordType v) {
return v >= xNew && v < xInvalid ;
}
```
Add a `using` directive if you want to use the type often.
... | [
0.3630615174770355,
-0.06912172585725784,
0.3563793897628784,
-0.06786711513996124,
0.021138494834303856,
-0.10060649365186691,
0.35666102170944214,
-0.311702698469162,
0.09670126438140869,
-0.5096359848976135,
0.030879953876137733,
1.0050203800201416,
-0.3739844262599945,
0.20232880115509... | |
mask) {
assert(RecordType::IsValidMask(mask));
// do stuff;
}
void wombleRecord(TRecord rec, TRecordType state) {
assert(RecordType::IsValidState(state));
if (RecordType ::xNew) {
// ...
} in runtime
TRecordType updateRecord(TRecord rec, TRecordType newstate) {
assert(RecordType::IsValidState(... | [
-0.0010485691018402576,
-0.2375575751066208,
0.634798526763916,
-0.16003729403018951,
0.19791258871555328,
-0.030125152319669724,
0.6108019948005676,
-0.36470460891723633,
0.14617200195789337,
-0.6458238363265991,
-0.4664533734321594,
0.9516732692718506,
-0.24241289496421814,
0.12620225548... | |
I have a table that contains tasks and I want to give these an explicit ordering based on the priority of the task. The only way I can think to do this is via an **unique** int column that indexes where the task is in term of the priority (i.e. 1 is top 1000 is low).
The problem is that say I wanted to update task and... | [
-0.12396392971277237,
-0.08729615062475204,
0.1673741340637207,
0.2598986029624939,
-0.261330783367157,
0.36601555347442627,
-0.031268857419490814,
-0.06205679848790169,
-0.5457389950752258,
-0.6493127346038818,
0.2794380784034729,
0.3736768960952759,
-0.22577914595603943,
0.12965361773967... | |
real number value as the priority. You can always slide in a value between two existing values with something like `newPri = task1Pri + (task2Pri - task1Pri)/2` where Task1 has the lower priority numeric value (which is probably the higher piority).
Corin points out that min and max priorities would have to be calcula... | [
-0.29780468344688416,
-0.3583570420742035,
0.045435793697834015,
0.2074408233165741,
-0.091214120388031,
0.3931024670600891,
-0.11526965349912643,
-0.16184981167316437,
-0.5583723783493042,
-0.6396346688270569,
-0.14738887548446655,
0.2873053252696991,
0.06677436083555222,
0.16636015474796... | |
I'm having a hard time understanding and therefore managing arrays and indexes manually in C. These are my two classic approaches but they doesn't seem to work as they keep looping when the condition is reached:
```
#include<stdio.h>
#define MAX 255
int main(){
int arr[MAX]={0};
int idx=0;
/* Approach ... | [
-0.06037084758281708,
-0.021759340539574623,
0.5539037585258484,
-0.4607691466808319,
-0.01740749552845955,
0.0764746367931366,
0.5109155178070068,
-0.5501033663749695,
0.051305051892995834,
-0.5221904516220093,
-0.06475798785686493,
0.822043776512146,
-0.5292561054229736,
0.04386747255921... | |
&arr[idx]);
idx++;
}
/* Approach #2 */
do{
printf("Enter elements, -1 to finish:\n");
scanf("%d", &arr[idx]);
idx++;
}while(arr[idx-1] != -1 && idx < MAX);
// Main func continues here.
}
```
Any advice would be much appreciated!
**Update:**
Now it work... | [
-0.07794530689716339,
-0.03654852136969566,
0.3333457112312317,
-0.11827098578214645,
-0.030805721879005432,
-0.23115898668766022,
0.7488561272621155,
-0.29434242844581604,
-0.014365991577506065,
-0.41717877984046936,
-0.3420979082584381,
1.0181353092193604,
-0.2582843005657196,
-0.2068566... | |
great community, it's helping me a lot.
```
arr[idx] <= MAX
```
should be
```
idx < MAX
```
unless you are checking the item instead of the index.
You are also always checking the "next" element for -1 (arr[idx] != -1) because you are incrementing idx prior to checking your added value.
so if you had
```
arr[id... | [
0.35972046852111816,
0.04233425855636597,
0.05286947265267372,
0.1409424990415573,
0.01419378723949194,
-0.6123852729797363,
0.6817900538444519,
0.12622450292110443,
-0.45902329683303833,
-0.5876204371452332,
0.1896885186433792,
0.5845649838447571,
0.20371195673942566,
0.041818346828222275... | |
I am hosting [SpiderMonkey](http://developer.mozilla.org/En/SpiderMonkey/JSAPI_Reference) in a current project and would like to have template functions generate some of the simple property get/set methods, eg:
```
template <typename TClassImpl, int32 TClassImpl::*mem>
JSBool JS_DLL_CALLBACK WriteProp(JSContext* cx, J... | [
0.21327216923236847,
-0.04392430558800697,
0.7816711068153381,
-0.06856343150138855,
-0.04964477941393852,
-0.1802511215209961,
0.3697982430458069,
-0.3862362504005432,
-0.1952340006828308,
-0.7672133445739746,
-0.2505652606487274,
0.19861441850662231,
-0.5537016987800598,
0.40080463886260... | |
<typename TClassImpl, JSObject* TClassImpl::*mem>
JSBool JS_DLL_CALLBACK WriteProp(JSContext* cx, JSObject* obj, jsval id, jsval* vp)
{
if (TClassImpl* pImpl = (TClassImpl*)::JS_GetInstancePrivate(cx, obj, &TClassImpl::s_JsClass, NULL))
return ::JS_ValueToObject(cx, *vp, &(pImpl->*mem));
return JS_FALSE... | [
-0.3265400826931,
-0.012062961235642433,
0.5326900482177734,
-0.08285995572805405,
-0.021336007863283157,
0.29085713624954224,
0.44851794838905334,
-0.37221798300743103,
-0.19722199440002441,
-0.43924468755722046,
-0.27753159403800964,
0.5009748935699463,
-0.5862030386924744,
0.23044544458... | |
d:\projects\testing\jswnd\src\wrap_js.h(64) : see declaration of 'JsWrap::ReadProp'
1>d:\projects\testing\jswnd\src\main.cpp(93) : error C2440: 'initializing' : cannot convert from 'overloaded-function' to 'JSPropertyOp'
1> None of the functions with this name in scope match the target type
```
Surprisingly, p... | [
-0.1551876813173294,
-0.07942596822977066,
0.2618946135044098,
-0.2942684292793274,
0.05782214552164078,
-0.029695717617869377,
0.3432038128376007,
-0.28599265217781067,
-0.16790121793746948,
-0.4169200360774994,
-0.486249178647995,
0.5604417324066162,
-0.33483222126960754,
0.0200986210256... | |
play, it is a defined function at that point and gets priority over template functions. It seems the template ordering is failing here.
Vec2 is just:
```
class Vec2
{
public:
int32 x, y;
Vec2(JSContext* cx, JSObject* obj, uintN argc, jsval* argv);
static ::JSClass s_JsClass;
static ::JSPropertySpec ... | [
0.03232036158442497,
-0.37615081667900085,
0.7129950523376465,
-0.0376284196972847,
-0.006448314990848303,
-0.1357714831829071,
-0.03029634803533554,
-0.06921632587909698,
-0.19418424367904663,
-0.5975920557975769,
-0.17713584005832672,
0.9156925678253174,
-0.5249937772750854,
-0.167170733... | |
jsval *vp);
...
struct JSPropertySpec {
const char *name;
int8 tinyid;
uint8 flags;
JSPropertyOp getter;
JSPropertyOp setter;
};
```
Pretty sure VC++ has "issues" here. Comeau and g++ 4.2 are both happy with the following program:
```
struct X
{
int i;
voi... | [
-0.05859791487455368,
-0.027707792818546295,
0.6741929054260254,
-0.3797948658466339,
0.1290452927350998,
0.22982460260391235,
0.5090658664703369,
-0.029235966503620148,
-0.1465587615966797,
-0.4444429576396942,
-0.2989313006401062,
0.7313147187232971,
-0.3132767081260681,
0.11365017294883... | |
t->*P = 0;
}
template<void* X::*P>
void foo(X* t)
{
t->*P = 0;
}
int main()
{
X x;
foo<&X::i>(&x);
foo<&X::p>(&x);
}
```
VC++ 2008SP1, however, is having none of it.
I haven't the time to read through my standard to find out exactly what's what... but I think VC++ is in the wrong here. | [
0.2025323510169983,
-0.05959109589457512,
0.31680962443351746,
-0.3337559103965759,
-0.03776990994811058,
-0.09339162707328796,
0.4011417627334595,
-0.13665898144245148,
-0.10689317435026169,
-0.37581223249435425,
-0.2715911269187927,
0.8742334842681885,
-0.2971727252006531,
0.237825632095... | |
I know how to create a `SEL` at compile time using `@selector(MyMethodName:)` but what I want to do is create a selector dynamically from an `NSString`. Is this even possible?
What I can do:
```
SEL selector = @selector(doWork:);
[myobj respondsToSelector:selector];
```
What I want to do: (pseudo code, this obvious... | [
0.1979225128889084,
0.10923002660274506,
0.1474565863609314,
-0.12813015282154083,
0.01236913911998272,
-0.05213138461112976,
0.4352700412273407,
-0.12189412117004395,
-0.0141933998093009,
-0.6123599410057068,
-0.18280935287475586,
0.3865613639354706,
-0.26554760336875916,
0.15842127799987... | |
to a selector. | [
0.2583755850791931,
-0.14990080893039703,
0.032408684492111206,
-0.08066201955080032,
-0.0849054828286171,
0.202845498919487,
-0.32687726616859436,
-0.2076655626296997,
-0.0240655317902565,
-0.18969368934631348,
-0.1398903727531433,
0.3241444230079651,
-0.1375245898962021,
0.14806932210922... | |
A two parter:
1) Say you're designing a new type of application and you're in the process of coming up with new algorithms to express the concepts and content -- does it make sense to attempt to **actively** not consider optimisation techniques at that stage, even if in the back of your mind you fear it might end up a... | [
0.43785297870635986,
0.0990709438920021,
0.08712798357009888,
0.30835893750190735,
-0.015211382880806923,
-0.16778233647346497,
0.08132737874984741,
-0.08448868244886398,
-0.0026973357889801264,
-0.29242393374443054,
-0.26222947239875793,
0.5163925886154175,
-0.285836398601532,
0.008959397... | |
mental exercises, paper notes, but I grew up essentially counting clock cycles in assembler and I continually find myself vetoing potential solutions for being too wasteful before fully considering the functional value.
**Edit:** This is about **designing** something which hasn't been done before (the unknown), when y... | [
0.6000270843505859,
0.07627842575311661,
-0.19292332231998444,
0.12909013032913208,
0.3025660216808319,
0.15935516357421875,
0.2533527612686157,
0.004118672572076321,
-0.21881839632987976,
-0.6281638741493225,
0.07647178322076797,
0.33228442072868347,
0.033073171973228455,
-0.1627743989229... | |
already know it, but to provide moral support while you suppress your inner critic :-)
The key is to retain sanity.
If you find yourself writing a Theta(N!) algorithm which is expected to scale, then you're crazy. You'll have to throw it away, so you might as well start now finding a better algorithm that you might ... | [
0.5900630354881287,
0.06335439532995224,
0.5420000553131104,
0.26002219319343567,
0.2859448790550232,
0.14144828915596008,
0.36890292167663574,
-0.23185527324676514,
-0.27637797594070435,
-0.14367970824241638,
0.11623401939868927,
0.634487509727478,
0.1354524940252304,
0.04975566640496254,... | |
ticket if you must, but step slowly away from the assembler.
Once thing to decide is whether the project is "write a research prototype and then evolve it into a real product", or "write a research prototype". With obviously an expectation that if the research succeeds, there will be another related project down the ... | [
0.42639127373695374,
-0.24561583995819092,
0.28627684712409973,
0.7194445729255676,
0.3375643193721771,
-0.2474781572818756,
0.021920835599303246,
0.004078246187418699,
-0.06333403289318085,
-1.0987967252731323,
0.3137606680393219,
0.2111247032880783,
-0.11660747230052948,
0.12694142758846... | |
for the problem, then you'll have a better idea what the performance issues are.
What you're doing, is striking a balance between wasting time now (on considerations that your research proves irrelevant) with wasting time later (because you didn't consider something now that turns out to be important). The more risky ... | [
0.2533433437347412,
0.06664557009935379,
-0.12847666442394257,
0.3180725574493408,
0.2825368046760559,
-0.08192938566207886,
0.33698588609695435,
-0.14821133017539978,
-0.31164583563804626,
-0.6164119243621826,
0.1620311141014099,
0.8049468994140625,
0.27208441495895386,
-0.164463177323341... | |
I have a `n...n` structure for two tables, **`makes`** and **`models`**. So far no problem.
In a third table (**`products`**) like:
```
id
make_id
model_id
...
```
My problem is creating a view for products of one specifi **`make`** inside my `ProductsController` containing just that's make models:
I thought this ... | [
0.2601792812347412,
0.31255292892456055,
0.7569859027862549,
-0.45962288975715637,
0.15500079095363617,
0.3361910581588745,
0.17928987741470337,
-0.46981528401374817,
-0.1226852759718895,
-0.7431482672691345,
0.14278924465179443,
0.7232483625411987,
-0.10187916457653046,
0.2953090667724609... | |
all models titles and create a new array and send to the view via `$this->set()`.
```
$makeArray = $this->Make->find();
foreach ($makeArray['Model'] as $model) {
$modelList[] = $model['title'];
}
$this->set('models', $models)
```
Is there any easier way to get that list without stressing the **`make`** Array. It... | [
0.18019132316112518,
-0.10078682750463486,
0.7109602689743042,
0.029151083901524544,
0.26290231943130493,
-0.004065957386046648,
-0.02944771945476532,
-0.40283286571502686,
-0.12151679396629333,
-0.6664665341377258,
-0.1805478036403656,
0.6658576130867004,
-0.0978221744298935,
0.3689427375... | |
or Controller, you can issue conditions to the `find` method.
See: <http://www.cricava.com/blogs/index.php?blog=6&title=modelizing_habtm_join_tables_in_cakephp_&more=1&c=1&tb=1&pb=1> | [
0.05328935757279396,
-0.3587344288825989,
0.35911720991134644,
0.5394339561462402,
0.24776946008205414,
-0.29706066846847534,
-0.11472675204277039,
-0.15969204902648926,
-0.5025857090950012,
-0.5438100695610046,
-0.17921650409698486,
0.2749832570552826,
-0.2794577479362488,
0.1386849731206... | |
What is the easiest way, preferably using recursion, to find the shortest root-to-leaf path in a BST (Binary Search Tree). Java prefered, pseudocode okay.
Thanks!
**General description:**
Use a [Breadth-first search (BFS)](http://en.wikipedia.org/wiki/Breadth-first_search) as opposed to a [Depth-first search (DFS)](h... | [
-0.3212849199771881,
-0.45781663060188293,
-0.2268502116203308,
0.05606286972761154,
0.09473059326410294,
0.08009400218725204,
0.2020084708929062,
0.013097739778459072,
-0.3071894943714142,
-0.9089092016220093,
-0.14591164886951447,
-0.054113540798425674,
-0.08040208369493484,
-0.167936190... | |
the first found childless node all the way back up to the root using the parent reference. If you have no parent reference stored in each node, you can keep track of the parent nodes as you recurse down. If you have your list in reverse order you could push it all on a stack and then pop it off.
**Pseudo-code:**
The ... | [
0.19908013939857483,
-0.17228952050209045,
0.3086739480495453,
-0.013518941588699818,
0.36575695872306824,
0.26371636986732483,
0.16870936751365662,
-0.17939218878746033,
-0.41078507900238037,
-0.49194562435150146,
-0.06723107397556305,
0.2053063064813614,
-0.37327462434768677,
0.670458793... | |
and check if it has no children. If it has no children you
are done you found the shortest path.
3. Otherwise push all the children (left, right) onto the queue.
**Finding all shortest paths:**
To find all shortest paths you can store the depth of the node along with node inside the queue. Then you would continue th... | [
-0.07877190411090851,
-0.3723295032978058,
0.29173994064331055,
0.14468196034431458,
-0.023810766637325287,
0.48496395349502563,
0.18517561256885529,
-0.06868784874677658,
-0.39530324935913086,
-0.9726676344871521,
-0.04863515868782997,
0.1545318067073822,
-0.046524640172719955,
0.14998784... | |
far, and only checking the depth of future nodes up until you find a new shortest, or until you reach the shortest so far. The BFS is a much better solution though. | [
-0.09616397321224213,
-0.5568060874938965,
0.6078472137451172,
-0.05589849501848221,
0.017957236617803574,
-0.18423517048358917,
0.421853631734848,
0.2181880921125412,
-0.27856966853141785,
-0.4758481979370117,
0.11045133322477341,
0.20618844032287598,
-0.17243419587612152,
-0.014507399871... | |
Is there a way to view the key/value pairs of a NSDictionary variable through the Xcode debugger? Here's the extent of information when it is fully expanded in the variable window:
```
Variable Value Summary
jsonDict 0x45c540 4 key/value pairs
NSObject {...}
isa 0xa06e0720
```
I was expecting it to s... | [
0.009535524994134903,
-0.11693500727415085,
0.3998732268810272,
-0.1800083965063095,
0.12489046156406403,
-0.07308827340602875,
0.16288600862026215,
-0.18882456421852112,
-0.12916524708271027,
-0.556564211845398,
-0.17384172976016998,
0.5779897570610046,
-0.40296345949172974,
-0.0744891837... | |
inspect what is in the dictionary
```
(gdb) po dict
{
bar = foo;
buz = fiz;
}
```
Of course these are `NSString` objects that print nicely. YMMV with other complex objects. | [
0.17115700244903564,
0.2450370341539383,
0.5601034164428711,
-0.05005047097802162,
0.11031094938516617,
-0.21357755362987518,
0.3782167136669159,
0.06590580940246582,
0.21235044300556183,
-0.7290509343147278,
-0.20816534757614136,
0.7842368483543396,
-0.26620903611183167,
-0.03208018466830... | |
Does anyone know of an MD5/SHA1/etc routine that is easily used with GLib (i.e. you can give it a GIOChannel, etc)?
Unless you have a *very* good reason, use glib's built-in MD5, SHA1, and SHA256 implementations with [`GChecksum`](http://developer.gnome.org/glib/unstable/glib-Data-Checksums.html#GChecksum). It doesn't ... | [
0.15966452658176422,
0.14687670767307281,
0.1528272032737732,
0.039746370166540146,
-0.038967009633779526,
-0.12595419585704803,
0.6386821866035461,
0.23664219677448273,
-0.06718233972787857,
-0.6820929646492004,
-0.02216878905892372,
0.49438992142677307,
-0.4140259623527527,
-0.2536294758... | |
How do I access parameters passed into an Oracle Form via a URL.
Eg given the url:
> <http://example.com/forms90/f90servlet?config=cust&form=>'a\_form'&p1=something&p2=else
This will launch the 'a\_form' form, using the 'cust' configuration, but I can't work how (or even if it's possible) to access p1 (with value of ... | [
0.13777178525924683,
0.09500442445278168,
0.4162949323654175,
0.09270171821117401,
0.1487913876771927,
-0.282718300819397,
0.2762165367603302,
-0.26268234848976135,
-0.013174399733543396,
-0.5660620927810669,
-0.22339478135108948,
0.35372045636177063,
-0.059354640543460846,
0.1769529730081... | |
Sometimes my c++ program crashes in debug mode, and what I got is a message box saying that an assertion failed in some of the internal memory management routines (accessing unallocated memory etc.). But I don't know where that was called from, because I didn't get any stack trace. How do I get a stack trace or at leas... | [
0.1483858972787857,
0.601947546005249,
-0.19604098796844482,
0.04755779355764389,
0.15014757215976715,
-0.3171900510787964,
0.602779746055603,
-0.0316375270485878,
-0.3592594563961029,
-0.3032894432544708,
-0.11233145743608475,
0.5505282878875732,
-0.28100988268852234,
-0.02777739055454731... | |
even if you are on a computer that does not have the source code.
To do this you need to use the PDB file that was built with your EXE. Put the PDB file inside the same directory as the EXE that crashed. Note: Even if you have the same source code, building twice and using the first EXE and the second PDB won't work. ... | [
0.25184258818626404,
-0.13292813301086426,
0.3760577142238617,
0.0636480450630188,
0.02263191156089306,
-0.21063953638076782,
0.43515142798423767,
-0.12971031665802002,
-0.446211576461792,
-0.7156303524971008,
-0.08772194385528564,
0.6497102379798889,
-0.32725557684898376,
0.15492723882198... | |
open. You will have to select the thread that crashed and check on the callstack for that thread. Each thread has a different call stack.
If you already have your VS debugger attached, it will automatically go to the source code that is causing the crash for you.
If the crash is happening inside a library you are us... | [
0.46967560052871704,
-0.06750164926052094,
0.3264562785625458,
0.30692771077156067,
-0.08306755125522614,
-0.3743259608745575,
0.4032846987247467,
0.12185917794704437,
-0.23231811821460724,
-0.8985608816146851,
-0.31071561574935913,
0.7060027122497559,
-0.4860936999320984,
0.50281029939651... | |
What is the best way to resolve a conflict when doing a `git svn rebase`, and the git branch you are on becomes "(no-branch)"?
You can use `git mergetool` to view and edit the conflicts in the usual fashion. Once you are sure the conflicts are resolved do `git rebase --continue` to continue the rebase, or if you don't ... | [
-0.1790626496076584,
-0.06025969982147217,
0.19051365554332733,
0.032993923872709274,
0.25090673565864563,
-0.21387779712677002,
0.2854384183883667,
0.07733219861984253,
-0.39589065313339233,
-0.49813246726989746,
-0.47935789823532104,
0.45046311616897583,
-0.26777416467666626,
-0.02399483... | |
How would retrieve all customer's birthdays for a given month in SQL? What about MySQL?
I was thinking of using the following with SQL server.
```
select c.name
from cust c
where datename(m,c.birthdate) = datename(m,@suppliedDate)
order by c.name
```
don't forget the 29th February...
```
SELECT c.name
FROM cust ... | [
-0.033990830183029175,
0.23356103897094727,
0.6961879730224609,
-0.0024720123037695885,
0.0832505002617836,
0.39414408802986145,
-0.02157195843756199,
0.027308333665132523,
-0.2070644497871399,
-0.15284675359725952,
-0.05845491960644722,
0.24206002056598663,
0.3567269742488861,
0.388048499... | |
0))
)
``` | [
-0.022158965468406677,
0.3981302082538605,
0.2775728702545166,
-0.3264146149158478,
-0.19959034025669098,
-0.3214675486087799,
0.45937398076057434,
-0.47259342670440674,
0.1926034837961197,
-0.2950676679611206,
-0.5423040986061096,
0.5344207286834717,
-0.5333998799324036,
0.408973783254623... | |
Ubuntu has 8 run levels (0-6 and S), I want to add the run level 7.
I have done the following:
1.- Created the folder **/etc/rc7.d/**, which contains some symbolic links to **/etc/init.d/**
2.- Created the file **/etc/event.d/rc7** This is its content:
```
# rc7 - runlevel 7 compatibility
#
# This task runs the old... | [
0.09619306027889252,
-0.09963110089302063,
0.8793896436691284,
-0.31854233145713806,
-0.021250201389193535,
-0.17151881754398346,
0.19629012048244476,
0.06092348322272301,
0.17820842564105988,
-0.7630670666694641,
-0.24764546751976013,
0.8601197004318237,
-0.5242971181869507,
0.31892532110... | |
RUNLEVEL=$2
export PREVLEVEL RUNLEVEL
fi
exec /etc/init.d/rc 7
end script
```
I thought that would be enough, but **telinit 7** still throws this error: *telinit: illegal runlevel: 7*
You cannot; the runlevels are hardcoded into the utilities. But why do you need to? Runlevel 4 is essentially unused.... | [
0.5725933313369751,
-0.1581253558397293,
0.5732716917991638,
0.17749400436878204,
0.14031261205673218,
-0.28197789192199707,
0.4400812089443207,
-0.1184222400188446,
-0.1466895043849945,
-0.2693573236465454,
-0.13681787252426147,
0.6525077223777771,
-0.52256178855896,
0.11641715466976166,
... | |
one of them. | [
0.016629358753561974,
-0.013592791743576527,
-0.06546159833669662,
0.2465410828590393,
-0.4093994200229645,
0.10382376611232758,
0.03725675120949745,
-0.22510221600532532,
-0.09913721680641174,
-0.3008595407009125,
-0.14884105324745178,
0.06984355300664902,
-0.44865551590919495,
0.25027525... | |
I am creating a site in which different pages can look very different depending upon certain conditions (ie logged in or not, form filled out or not, etc). This makes it necessary to output diferent blocks of html at different times.
Doing that, however, makes my php code look horrific... it really messes with the for... | [
0.827469527721405,
0.4395323395729065,
0.061207570135593414,
0.01875009946525097,
-0.31175747513771057,
-0.23350685834884644,
0.45828503370285034,
0.11876268684864044,
-0.2000030130147934,
-0.5037158131599426,
0.24053539335727692,
0.11417794972658157,
-0.2698326110839844,
0.282459259033203... | |
program logic from your display. First, try to make your own solution using two files for each Web page :
* one with only PHP code (no HTML) that fills variables
* another with HTML and very few PHP : this is your page design
Then include where / when you need it. E.G :
myPageLogic.php
```
<?php
// pure PHP code, ... | [
0.19589178264141083,
-0.07101242244243622,
0.3256929814815521,
0.14042222499847412,
0.11459541320800781,
0.2813427746295929,
0.29452547430992126,
-0.2044571489095688,
-0.1751224547624588,
-0.5752123594284058,
-0.16596293449401855,
0.5056896209716797,
-0.14329726994037628,
0.083684325218200... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.