text stringlengths 0 30.5k | title stringclasses 1
value | embeddings listlengths 768 768 |
|---|---|---|
button.userInteractionEnabled = NO;
}
- (void)buttonUpAct:(UIButton *)sender {
NSArray *targetArray = nil;
if ([leftButtonsArray indexOfObject:sender] == NSNotFound) {
targetArray = rightButtonsArray;
sender.backgroundColor = [UIColor blueColor];
}
else {
targetArray = leftButton... | [
-0.2233709990978241,
-0.5184994339942932,
0.4446360468864441,
-0.24060238897800446,
0.04138369485735893,
0.2983146011829376,
0.3278672695159912,
-0.21317026019096375,
-0.19696937501430511,
-0.7323420643806458,
-0.18984685838222504,
0.3931180536746979,
-0.41626858711242676,
0.13901346921920... | |
= YES;
}
#pragma mark - View lifecycle
- (void)loadView {
leftButtonsArray = [[NSMutableArray alloc] init];
rightButtonsArray = [[NSMutableArray alloc] init];
self.view = [[UIView alloc] initWithFrame:[[UIScreen mainScreen] applicationFrame]];
self.view.backgroundColor = [UIColor whiteColor];
flo... | [
0.10141445696353912,
-0.26910024881362915,
1.0275440216064453,
-0.3590492308139801,
-0.06742952018976212,
0.5330443382263184,
0.4554744362831116,
-0.630964457988739,
-0.06644931435585022,
-0.48160991072654724,
-0.18053078651428223,
0.544253945350647,
-0.0473921000957489,
0.0436270423233509... | |
desiredHeight), 10, 10);
[button setBackgroundColor:[UIColor redColor]];
[button addTarget:self action:@selector(buttonDownAct:) forControlEvents:UIControlEventTouchDown];
[button addTarget:self action:@selector(buttonUpAct:) forControlEvents:UIControlEventTouchUpInside | UIControlEventTouchUpOu... | [
-0.07825973629951477,
-0.3146408796310425,
1.023255705833435,
-0.37603676319122314,
-0.11070873588323593,
0.4536944031715393,
0.4137204587459564,
-0.9445702433586121,
0.07364401966333389,
-0.5113421082496643,
-0.1975310891866684,
0.5032545924186707,
-0.15959805250167847,
-0.146497294306755... | |
(i / 2), desiredWidth, desiredHeight), self.view.frame.size.width / 2, 0), 10, 10);
[button setBackgroundColor:[UIColor blueColor]];
[button addTarget:self action:@selector(buttonDownAct:) forControlEvents:UIControlEventTouchDown];
[button addTarget:self action:@selector(buttonUpAct:) forControl... | [
-0.06154605746269226,
-0.34182795882225037,
0.904507577419281,
-0.2217511236667633,
-0.10500486195087433,
0.25350648164749146,
0.26614025235176086,
-0.6767871379852295,
0.051577817648649216,
-0.6388080716133118,
-0.3393761217594147,
0.5677739381790161,
-0.06103427708148956,
-0.148713469505... | |
For months now I've been having an intermittent problem where, during my ant build, one of the jar files it produces is 0 bytes in size. This 0-byte jar file ends up getting packaged in my ear file, and the subsequent deployment fails. My project structure looks like this:
```
myProj
myProj-common
myProj-ejb
... | [
0.18508769571781158,
0.6513728499412537,
0.38983121514320374,
-0.4347681999206543,
0.08697681128978729,
0.48076045513153076,
0.520188570022583,
-0.06364347785711288,
-0.04361966252326965,
-0.8324494361877441,
0.2681906819343567,
0.6110262870788574,
-0.12222298234701157,
0.2584676146507263,... | |
main build directory is always the correct size. It's unclear to me why I have two copies of the jar file in the end result. All of the ant build scripts were automatically generated by NetBeans.
I'm still learning the ins and outs of ant build files, so it's not entirely clear to me why they're so complex. I've writt... | [
0.041108909994363785,
0.11009623855352402,
0.11822323501110077,
-0.2544979155063629,
-0.09332124888896942,
0.14676010608673096,
0.3840121030807495,
0.15150560438632965,
-0.12591640651226044,
-0.9170213937759399,
0.3588363826274872,
0.5898280143737793,
0.019740605726838112,
0.14150662720203... | |
and occurs whether I build the project inside of NetBeans or on the command line. The system where I'm having this problem runs Windows XP. With NB 7.0.1 I had a bad build perhaps one time in six. Now I have a -good- build maybe one time in ten.
Any pointers on where I should be looking to debug this would be most app... | [
0.1825527548789978,
0.4901164472103119,
0.32213494181632996,
-0.5044712424278259,
-0.08901645988225937,
-0.16667288541793823,
0.6363145709037781,
0.43802183866500854,
-0.38482820987701416,
-0.726791262626648,
0.08310512453317642,
0.4500173330307007,
0.005543241277337074,
0.4312514066696167... | |
My speculation is that this left time for the lower level drivers to complete whatever actions they were taking and flush their write buffers. It looks like right now the jar file is getting copied before the write buffer flushes and therefore a 0-byte file is getting copied. Ant never sees an error, which is why there... | [
0.23673300445079803,
0.3265591561794281,
0.21979929506778717,
0.035905927419662476,
-0.027656810358166695,
-0.005447336006909609,
0.6117389798164368,
0.12796349823474884,
-0.3051818609237671,
-0.761935830116272,
0.3224175274372101,
0.7643605470657349,
-0.08145883679389954,
0.00978351477533... | |
and Build, then run Build (as opposed to Clean and Build), which only takes a few seconds to repackage the ear file.
I think the reason the problem got more prevalent when I upgraded NetBeans is that some change in the IDE made the builds run faster, and thus I ran into the buffering problem more often. | [
0.8014029264450073,
0.2925933301448822,
-0.09787337481975555,
-0.14496350288391113,
-0.05640336126089096,
-0.02717239409685135,
0.46912044286727905,
-0.15827590227127075,
0.387873113155365,
-0.6073393225669861,
0.3316625654697418,
1.1495386362075806,
0.1987440288066864,
-0.1854517757892608... | |
I want to perform performance measurement of a change I want to make to an application by counting instructions. However, I'm not familiar enough with ARM's debug interface to know how to do this. Is there even an interface for this sort of thing? I'm perfectly capable of diving into the kernel if necessary, but my int... | [
0.6069573163986206,
0.23465508222579956,
0.42605191469192505,
-0.06129610165953636,
0.019907251000404358,
-0.05036654323339462,
-0.1905154287815094,
-0.29488202929496765,
-0.2862207889556885,
-0.5564166903495789,
0.14242781698703766,
0.7311044931411743,
-0.4027980864048004,
-0.026047287508... | |
<cfarguments name=ProfileHead />
<cfset variables.profilehead = arguments.profilehead>
</cffunction>
```
Then...
```
<cffunction name=GetProfileHead>
<cfreturn variables.profileHead />
</cffuction>
``` | [
-0.06933941692113876,
-0.06136314198374748,
0.4977920651435852,
-0.3365783989429474,
-0.4469362795352936,
0.033186569809913635,
-0.036440957337617874,
-0.2743360996246338,
-0.2978708744049072,
-0.34206387400627136,
-0.42393964529037476,
0.5493016839027405,
-0.19801506400108337,
-0.13303251... | |
I am considering replacing a number of static css files with style tags dynamically generated from JavaScript. My purpose is not to build a stylesheet for the whole document, but rather to use it for plugins that get added to the page, like tabs, slideshows, etc. The stylesheets I currently deal with have 10 to 20 line... | [
0.7600082755088806,
-0.22244545817375183,
0.42484766244888306,
0.001216540695168078,
-0.23960468173027039,
-0.02704608254134655,
-0.12267681211233139,
-0.04728325083851814,
-0.05811034515500069,
-0.8532359600067139,
0.01829362101852894,
0.3606463372707367,
-0.2223416417837143,
-0.227468311... | |
the drawbacks of this approach? Could you recommend any good references on this topic?
I did some research and found the following tools:
* [less](http://lesscss.org/) - but still requires to load a separate stylesheet
* [DiceJS](http://dicejs.com/) (apparently a new library)
Another benefit would be that each additi... | [
0.36349377036094666,
-0.05036664381623268,
0.2747208774089813,
0.05717756599187851,
-0.15447115898132324,
-0.023103980347514153,
0.07226680219173431,
-0.2090834230184555,
-0.6171248555183411,
-0.824646532535553,
0.012493361718952656,
0.6162370443344116,
0.06302173435688019,
-0.122756019234... | |
needs to iterate through to make up the final css block.
In terms of performance, it seems very unlikely to me that javascript is going to elegantly / efficiently replace the styles that would've been included in a combined css file.
The other thing is that in production environments, you also can do another option w... | [
0.27663755416870117,
-0.03872958570718765,
0.035471655428409576,
0.0966954305768013,
-0.22994031012058258,
-0.002498893765732646,
0.19390882551670074,
-0.2451286017894745,
0.02709091454744339,
-0.9945818185806274,
-0.254388689994812,
0.3953264653682709,
-0.32493966817855835,
-0.25452667474... | |
has a script for this i think.
End of the day: energy is neither created nor destroyed -- your optimizations in one place and hurt you elsewhere if you're not careful. | [
0.4606771469116211,
0.2765728235244751,
0.15912926197052002,
0.40436413884162903,
0.19595298171043396,
-0.3103888928890228,
0.27787062525749207,
0.035752441734075546,
0.13551372289657593,
-0.8252040147781372,
0.02172260545194149,
0.6390343904495239,
-0.09780142456293106,
0.1821028441190719... | |
I captured a video and took out a frame of that, converted it to Bitmap and now I can show it on picture box.
I have some float points which is the return values of GoodFeaturesToTrack() function from image class.
Now I want to draw/show those points/marks on different Xi,Yi over my picture;
How is it possible to d... | [
0.9034929275512695,
-0.15119825303554535,
0.581164538860321,
-0.09247992187738419,
-0.17167040705680847,
0.06873679906129837,
0.16885177791118622,
-0.497292697429657,
0.0907338336110115,
-0.6695348024368286,
0.26722264289855957,
0.6428623199462891,
-0.4006690979003906,
0.0922594964504242,
... | |
has the same "syntax" as `for` and allows you to account for side effecting functions such as `println`. | [
0.055911045521497726,
-0.10570556670427322,
-0.024394530802965164,
-0.3556518852710724,
-0.017374148592352867,
-0.20588736236095428,
0.25663989782333374,
0.12594427168369293,
0.0931842103600502,
-0.2659018635749817,
-0.19404149055480957,
0.5836735367774963,
-0.08407559990882874,
-0.1730843... | |
I've just finished moving a Wordpress site to a new server. The domain has not changed, nor has the directory that Wordpress is installed in; the only thing that has changed is the machine it happens to be on.
The only problem I seem to have had as a result is that my permalinks aren't working, and when I go into the ... | [
0.13075724244117737,
0.34364089369773865,
0.7772316932678223,
-0.05952766537666321,
0.24687466025352478,
-0.03800215572118759,
0.5012902021408081,
0.40891438722610474,
-0.19823704659938812,
-0.6858038902282715,
0.02751525677740574,
0.5670734643936157,
-0.2478267252445221,
0.599798917770385... | |
needed.
Use the `doseq` function instead. It will force the evaluation of your code, and thus is not lazy. It has the same "syntax" as `for` and allows you to account for side effecting functions such as `println`. | [
0.5314026474952698,
-0.09315706789493561,
0.19002678990364075,
-0.15493637323379517,
-0.0985802635550499,
-0.2778676152229309,
0.3568394184112549,
-0.24307812750339508,
0.4129538834095001,
-0.7168298959732056,
0.05978685989975929,
0.8716134428977966,
-0.22767917811870575,
-0.25113624334335... | |
I have a query that looks like this:
```
SELECT *
FROM A
INNER JOIN B ON A.AId = B.AId
WHERE A.ADate BETWEEN @Start and @End
or B.BDate BETWEEN @Start and @End
```
Both tables A and B are about the same size and have a lot of rows. Execution plan shows a index seek, but looks like it is scanning the entire inde... | [
-0.20550119876861572,
0.14212647080421448,
0.6204495429992676,
-0.14505134522914886,
-0.23965607583522797,
0.19204603135585785,
0.18234290182590485,
-0.45565807819366455,
-0.0026261487510055304,
-0.8018031716346741,
0.26229384541511536,
0.32945865392684937,
-0.3380207121372223,
0.174554154... | |
the `or`. The `and` is easily split into two operations.
I have read some people stating that it is possible to use `UNION` in place of `or`, but this would potentially introduce duplicate rows in the case that both conditions in the OR are true.
What solution is there so that I can reduce the size of join and preven... | [
0.2952219247817993,
0.02689054235816002,
0.430386483669281,
-0.08154904842376709,
0.31968632340431213,
0.14766351878643036,
0.04373171553015709,
-0.28542760014533997,
-0.28942179679870605,
-0.25863656401634216,
-0.13580600917339325,
0.3220101594924927,
-0.15092794597148895,
0.4900000691413... | |
matches the range) to remain the same.
Thanks for the answers, in the end I opted for `UNION ALL`, and I crafted a query based on the union of two selects that are mutually exclusive, so no duplicates would be introduced in the `UNION ALL`.
First, get all the rows where `ADate` is in the range, and exclude rows where ... | [
0.31933555006980896,
-0.09160664677619934,
0.28440406918525696,
-0.09459925442934036,
-0.05639710649847984,
0.3823963403701782,
0.018638936802744865,
-0.677284300327301,
0.06650960445404053,
-0.36471712589263916,
0.12438734620809555,
0.37770524621009827,
-0.44555139541625977,
0.14071170985... | |
not produce duplicates). Let me know if you see a flaw in this logic, I found it helpful to think of a venn diagram.
This made the query perform the best of the options presented(in my case), and wasn't overly complicated, so I went with it.
```
SELECT *
FROM A
INNER JOIN B ON A.AId = B.AId
WHERE A.ADate BETWEEN @Sta... | [
-0.16758881509304047,
0.15421204268932343,
0.3314041793346405,
-0.18266840279102325,
-0.28542786836624146,
0.2285117655992508,
0.31474342942237854,
-0.595111072063446,
-0.2251848429441452,
-0.8324486613273621,
-0.12892621755599976,
0.36811748147010803,
-0.6308708190917969,
0.09683992713689... | |
it works with date ranges, but could work with any other predicates I imagine. | [
0.23584920167922974,
-0.0003075451822951436,
0.08363950252532959,
0.014164621010422707,
-0.2301511913537979,
0.052082791924476624,
0.06780457496643066,
-0.047719068825244904,
-0.06077582761645317,
-0.2959592640399933,
-0.07392854243516922,
0.12827520072460175,
0.14540249109268188,
0.225092... | |
I've seen that Solr will allow you to index JSON:
<http://wiki.apache.org/solr/UpdateJSON>
However, none of the examples are nested. Can you index something like this and if not how is it normally handled?
```
{
name: 'ben',
state: 'california',
country: 'united states',
companies: [
{
name: 'google... | [
0.179316908121109,
0.14578665792942047,
0.4469740688800812,
0.08437580615282059,
0.09877078980207443,
-0.1521267294883728,
-0.17941613495349884,
0.34963804483413696,
-0.4401353895664215,
-0.31520694494247437,
-0.17843961715698242,
0.09271954745054245,
-0.4193649888038635,
0.191983282566070... | |
can be stored explicitly, with serialization handled in the application layer. Elasticsearch uses this approach transparently.
For indexing, you can flatten the data using naming conventions. Mongodb uses such a syntax.
```
companies.name: ['google', 'sherwin-williams']
companies.title: ['software engineer', 'web dev... | [
0.1235569640994072,
0.08036652952432632,
0.30002960562705994,
0.2852725088596344,
-0.014599037356674671,
-0.0033638859167695045,
-0.3387543857097626,
0.09246580302715302,
-0.15639103949069977,
-0.3403562903404236,
-0.44278115034103394,
0.30113083124160767,
-0.31339582800865173,
0.182633578... | |
I'm running into problems with my Sieve of Eratosthenes. I wanted to write a Sieve that didn't require an array of all numbers up to the largest prime you want, instead just keeping track of each prime multiple as the Sieve reaches it. That means you don't have to do all the work up front, but can just determine the ne... | [
0.22905373573303223,
0.041706833988428116,
0.09392578899860382,
-0.13487596809864044,
0.12496035546064377,
0.4362626373767853,
-0.014260695315897465,
-0.29898902773857117,
-0.49786853790283203,
-0.8214690685272217,
0.2635766863822937,
0.2096453607082367,
-0.45812419056892395,
0.28721481561... | |
empty:
Peek at the top prime in the queue
If current > top, we can move top to the next multiple
Remove the top prime from the prime queue
Increment top to its next multiple
Re-add it to the queue
If current == top, current is | [
-0.18186886608600616,
-0.2785741686820984,
0.6247404217720032,
-0.15644364058971405,
0.3059057593345642,
0.3069784641265869,
0.05903267860412598,
0.18079018592834473,
-0.2573460042476654,
-0.44977959990501404,
-0.04674282297492027,
0.37171536684036255,
-0.531196653842926,
0.445922017097473... | |
not a prime
Increment current number to next integer
If current < top, we've found a prime
Break
Push current number onto prime queue
Increment current number to next integer
Return the new prime
```
So here's the problem: I correctly calculate the first 31 primes (up to 127), but afte... | [
-0.003569079330191016,
-0.0641329288482666,
0.518730640411377,
-0.17050816118717194,
0.24871252477169037,
0.03358098864555359,
0.1734088808298111,
0.09879232197999954,
-0.4943754971027374,
-0.4905274510383606,
-0.03224184364080429,
0.5809307098388672,
-0.35660746693611145,
0.25800883769989... | |
rather than the algorithm itself. I can't think of a reason the algorithm should break after a certain number of primes. I've confirmed manually that after 127, if the heap is properly ordered, my algorithm should recognize 128 as not a prime, but that's not what the code shows me.
Any suggestions?
<http://ideone.com... | [
-0.41084328293800354,
0.13685458898544312,
0.2500174343585968,
-0.03686169907450676,
0.08671966195106506,
0.022020425647497177,
0.12426011264324188,
-0.14312994480133057,
-0.6493269205093384,
-0.3826151490211487,
-0.3045567572116852,
0.5981084704399109,
-0.2141873985528946,
0.1860620975494... | |
if I recall correctly, so the comparison using `==` compares identical instances for values smaller than 128. But from 128 on, you get a new boxed `Integer` for `current`, and that is a different object than the one referenced by `top.multiple`.
Compare using `equals` or declare `int current;` to solve it.
And improv... | [
-0.11797571927309036,
-0.021340657025575638,
0.5146628618240356,
-0.23443058133125305,
0.178253635764122,
0.12149983644485474,
-0.06066637113690376,
-0.2476770281791687,
-0.35746943950653076,
-0.43722018599510193,
0.27897804975509644,
0.5430849194526672,
-0.19954197108745575,
0.33604636788... | |
Starting with a blank project, when I load a SWF which has a dependence on ISomeInterface defined in a swc which is compiled into my blank project
```
var lc:LoaderContext = new LoaderContext( true, ApplicationDomain.currentDomain );
var loader:Loader = new Loader();
loader.load( new URLRequest(... | [
0.027573363855481148,
0.022219957783818245,
0.5898246169090271,
-0.1910092830657959,
0.05198139324784279,
-0.22726942598819733,
0.16342830657958984,
-0.04961848631501198,
-0.13201618194580078,
-0.6852455139160156,
-0.42789286375045776,
0.5833077430725098,
-0.3260670006275177,
0.34720826148... | |
"http://127.0.0.1/Some.swf"), lc );
```
I get the evil
```
[Fault] exception, information=VerifyError: Error #1014: Class ISomeInterface could
not be found
```
What am I missing that makes these different?
My issue appears to have been 2 fold
1) When loading the asset locally, it will by default be loaded into ... | [
0.06375332176685333,
-0.03525868058204651,
0.45834240317344666,
-0.014085679315030575,
0.00526092667132616,
-0.015180312097072601,
0.5702699422836304,
-0.20825140178203583,
-0.13344036042690277,
-0.35542455315589905,
-0.3176639676094055,
0.6737812161445618,
-0.3278910517692566,
0.354635387... | |
remote.
In the end it was a matter of simply loading the first SWF from a website, and adding the correct SecurityDomain.
In my searching, this was the best discorse I found on the topic of Security Domains and Applciation Domains <http://www.senocular.com/flash/tutorials/contentdomains/> | [
0.020152118057012558,
-0.3592740297317505,
0.5640614628791809,
0.36089253425598145,
-0.39432334899902344,
-0.12684255838394165,
0.17174172401428223,
0.058570604771375656,
-0.14369040727615356,
-0.17033755779266357,
-0.05548425763845444,
0.6280634999275208,
-0.1545507311820984,
0.3130180835... | |
I have what I *think* is a simple question but I can't get it to work for the life of me.
All I want to do is add some javascript to the page that adds a class to the main page container based on the URL.
Let's say I have a site at root.com and the following html structure (loosely speaking):
```
<html>
<head>
... | [
0.5142242312431335,
0.4054003357887268,
0.43049192428588867,
-0.2580375671386719,
-0.0850915014743805,
-0.05712006613612175,
0.266754686832428,
-0.1207069605588913,
0.016851162537932396,
-0.7814086079597473,
0.08619856089353561,
0.37898120284080505,
-0.005346577614545822,
-0.05175213888287... | |
example) root.com/technology, it adds a class to the main div. So the div would now look like:
```
<div id="main" class="wrapper tech">
```
I've loaded jquery, so I'd like to do it that way.
You can use `window.location` to get the current URL, and then switch based on that:
```
$(function() {
var loc = wind... | [
0.597453236579895,
-0.04784374684095383,
0.6452532410621643,
-0.15758055448532104,
0.3813513517379761,
-0.10925720632076263,
-0.08192253112792969,
0.02337704785168171,
-0.03065125085413456,
-0.6735274791717529,
-0.3410813510417938,
0.5272786021232605,
-0.20397783815860748,
0.30288818478584... | |
I am connecting to the Tridion core service using a System.ServiceModel.WsHttpBinding. The service will only be used by authenticated users, and probably only by code which I control. I have to choose values for the following
* [MaxBufferPoolSize](http://msdn.microsoft.com/en-us/library/system.servicemodel.wshttpbindi... | [
0.17978478968143463,
0.1414029747247696,
0.5842173099517822,
0.11156605184078217,
-0.059670690447092056,
0.3434382975101471,
0.5312598943710327,
-0.3936452567577362,
0.12567929923534393,
-0.6574835181236267,
-0.2451595962047577,
0.4855347275733948,
-0.12679965794086456,
0.36912789940834045... | |
used?
MaxBufferPoolSize is there to allow you to prevent excessive garbage collections. Is this simply a matter of monitoring GCs and tuning based on that?
MaxReceivedMessageSize, MaxArrayLength and MaxBytesPerRead are there to defend against Dos attacks, so in my scenario, perhaps I can improve throughput by incre... | [
0.43750107288360596,
-0.23575355112552643,
0.38000595569610596,
0.1780175268650055,
0.07417354732751846,
-0.2581018805503845,
0.20285621285438538,
-0.016562793403863907,
-0.43409964442253113,
-0.3847569227218628,
0.18501348793506622,
0.8165180683135986,
-0.28035029768943787,
0.076542705297... | |
so perhaps this value should be large.
So - should I leave these values at their defaults? Will that cause me problems? Should I increase them to large values? Will that help with throughput etc., or is it more likely to cause other problems?
The general rule is to have these values as small as possible, just enough ... | [
0.1922794133424759,
-0.16223229467868805,
0.49710941314697266,
0.2992531359195709,
0.34807607531547546,
-0.06342924386262894,
0.033157140016555786,
-0.14761175215244293,
-0.4965633749961853,
-0.4237823486328125,
0.046810828149318695,
0.6109398603439331,
-0.11699900031089783,
-0.06319100409... | |
`MaxReceivedMessageSize`. Keep in mind that you have control over the size of the list you will get using `BaseColumns` property of a filter.
If you prefer to use GetList, GetSystemWideList and GetSearchResults methods over their XML counterparts, you will probably have to increase `ReaderQuotas.MaxArrayLength` toget... | [
0.1989855319261551,
-0.32772019505500793,
0.6034442186355591,
0.14412462711334229,
-0.24758434295654297,
-0.3678659498691559,
0.0007721487199887633,
-0.4208308458328247,
-0.3416883647441864,
-0.7121769189834595,
-0.02398080751299858,
0.5898691415786743,
-0.29198065400123596,
0.009461249224... | |
How would I combine (stack vertically) the following 3 queries into **one query** that returns 100 rows, 50 rows from category 1, 25 from from category 2, 25 from category 3 all chosen randomly. I tried UNION but didn't seem to work.
```
select * from table where category_id = 1 order by rand() limit 50;
select * fro... | [
0.006436798255890608,
0.16444538533687592,
0.10903657972812653,
-0.11656133830547333,
-0.09631617367267609,
0.5245511531829834,
0.10210828483104706,
-0.8774304986000061,
-0.26747530698776245,
-0.4777223467826843,
-0.004659838974475861,
0.2359955608844757,
-0.5289458632469177,
0.15481698513... | |
where category_id = 1 order by rand() limit 50)
UNION ALL
(select * from table where category_id = 2 order by rand() limit 25)
UNION ALL
(select * from table where category_id = 3 order by rand() limit 25);
``` | [
-0.3380562961101532,
0.0865250676870346,
0.052044011652469635,
-0.27181166410446167,
-0.07112794369459152,
0.09684833884239197,
0.15972861647605896,
-0.622494637966156,
-0.36542344093322754,
-0.3024669289588928,
-0.36706799268722534,
0.4979943633079529,
-0.4946226179599762,
0.3911317884922... | |
Our organization is moving towards a new case management system. One of the functions that it has is the ability to publish XML files when certain conditions are met. I have that portion all set up and I get an XML document in a network folder.
Disclaimer: I have no knowledge ActiveMQ and/or Camel - complete newbie!!
... | [
0.3152395784854889,
0.07844280451536179,
0.4469163417816162,
-0.004127068445086479,
0.09760398417711258,
-0.31886717677116394,
0.09481795132160187,
-0.00263384310528636,
-0.33002254366874695,
-0.6202132105827332,
0.23862026631832123,
0.5937137603759766,
-0.23586945235729218,
0.175578549504... | |
code:
```
<route>
<description>Leslie Odyssey Route</description>
<from uri="file://servername.domain.gov/MetroFileDrop"/>
<to uri="activemq:queue:Odyssey.Queue"/>
</route>
```
Can someone tell me what more I need to do in order to get the XML file that is put in the MetroFileDrop folder moved to the Ody... | [
0.024652225896716118,
0.16359470784664154,
0.182547926902771,
0.12953068315982819,
0.2523804306983948,
-0.012609640136361122,
-0.004219585098326206,
0.01835017465054989,
-0.6308825612068176,
-0.733034610748291,
-0.06952391564846039,
0.3829880952835083,
0.06675366312265396,
0.09275762736797... | |
I am currently writing an iOS app with Xcode 4.3.2. In most parts of my code, debugging with LLDB works just fine. However at some point I am getting a strange message while stepping through my code. When I hover over an iVar, it says
> Error [IRForTarget]: Couldn't find Objective-C indirect ivar symbol OBJC\_IVAR\_$\... | [
-0.03177199140191078,
0.25740113854408264,
0.9317047595977783,
-0.2777855694293976,
-0.013584465719759464,
0.1024194210767746,
0.4455375075340271,
0.1399395763874054,
-0.1131787821650505,
-0.7342842817306519,
0.05225255712866783,
0.4845995306968689,
-0.47825655341148376,
0.1709143221378326... | |
that there is something wrong with my code which in turn causes the debuggers to fail. However, the code runs fine. I'd love to provide some samplecode but the class is rather long and I can't pinpoint the exact location of my screwup. So has anybody encountered a similar behavior?
**UPDATE:** Actually, it seems as if... | [
0.5004981160163879,
0.19810578227043152,
0.05999680235981941,
0.03782561421394348,
-0.026877693831920624,
-0.368804931640625,
0.5624567270278931,
0.4332064092159271,
-0.4260218143463135,
-0.07605597376823425,
0.052559345960617065,
0.16223888099193573,
-0.18982604146003723,
0.55546879768371... | |
wrong with the memory management. For example, if I say something like
```
[notificationCenter addObserver:self selector:@selector(foo) name:bar object:objA];
```
the selector is invoked even when I have
```
[notificationCenter postNotificationName:bar object:objB];
```
The cause of this error are incorrect build ... | [
0.18665103614330292,
0.5238620638847351,
0.18134990334510803,
-0.4874272346496582,
0.22134952247142792,
0.038357142359018326,
0.7102612257003784,
0.16409967839717865,
-0.13401785492897034,
-0.5534729361534119,
-0.09150774776935577,
0.9068089127540588,
-0.10016562789678574,
0.24603413045406... | |
I am trying to perform canny edge detector without calling the canny function in Matlab. I wrote a few functions for the gaussian filter(sigma = 1) and non-maximum suppression. The original image and the resultant image is shown.. Not sure what the error...
The original image is
,abs(Iy));
figure(6),imshow(It);
function [ G,sum ] = gauss_mask( w,sigma )
min = 1;
m = floor(w/2);
sum = 0;
for x = 1: w
for y = 1:w
g = x-m-1;
h = y-m-1;
k = -(g^2 +h^2)/(2*sigma^2);
G(x,y) = exp(k);
sum = sum + G(x,y);
... | [
-0.2899162173271179,
-0.4252561032772064,
0.628922164440155,
-0.09734608978033066,
-0.17825500667095184,
0.21198558807373047,
0.8323073387145996,
-0.8094194531440735,
-0.3594205975532532,
-0.1467980593442917,
-0.5963955521583557,
0.45775482058525085,
-0.35452643036842346,
0.040012687444686... | |
min = G(x,y);
end
end
end
B=1/min;
G= B * G;
G = round(G);
end
function [ I2 ] = image_convolution(I,w,G)
m= (w-1)/2;
N= size(I,1);
M=size(I,2);
for i=1:N
for j=1:M
if (i > N-m-1 || j > M-m-1 || i<m+1 || j <m+1)
I2(i,j) = 0;
continue;
end
sum1 = 0; | [
-0.4338207244873047,
-0.32541945576667786,
0.7219321131706238,
-0.3851585388183594,
-0.10251306742429733,
0.4385308027267456,
0.35031530261039734,
-0.40189871191978455,
-0.17949149012565613,
-0.3292808532714844,
-0.39964422583580017,
0.40707674622535706,
-0.22237294912338257,
0.20617015659... | |
for u=1:w
for v=1:w
sum1 = sum1+I(i+u-m-1,j+v-m-1)*G(u,v);
end
end
I2(i,j)=sum1;
end
end
end
function [ Ix ] = delx( image )
mask = [-1 0 1; -2 0 2; -1 0 1];
Ix =image_convolution(image,3,mask);
end
function [ Iy ] = dely( image )
mask = [-1 -2 | [
-0.10293010622262955,
-0.424092173576355,
0.8830564618110657,
-0.17331233620643616,
-0.5982108116149902,
0.571511447429657,
0.18393975496292114,
-0.5413777232170105,
-0.17581064999103546,
-0.5237974524497986,
-0.20072875916957855,
0.5358116626739502,
-0.41252994537353516,
0.158844962716102... | |
-1;0 0 0;1 2 1];
Iy =image_convolution(image,3,mask);
end
function [ Imag ] = grad_mag(Ix,Iy)
m=size(Ix,1);
n=size(Ix,2);
for i=1:m
for j=1:n
Imag(i,j) =sqrt(Ix(i,j)^2 + Iy(i,j)^2);
end
end
end
function [ It ] = suppression( If,Ix,Iy )
m=size(Ix,1);
n=size(Ix,2);
for i = 1:m
for j=1:n
... | [
-0.2848536968231201,
-0.34899479150772095,
0.8495345711708069,
-0.18913747370243073,
-0.31142768263816833,
0.2754659056663513,
0.5811159610748291,
-0.5072623491287231,
-0.3829100430011749,
-0.22382114827632904,
-0.7640657424926758,
0.49817004799842834,
-0.5797119736671448,
0.14600855112075... | |
else if (Ix(i,j)*Iy(i,j)> 0)
f1 =If(i-1,j-1);
f2 =If(i,j);
f3 =If(i+1,j+1);
It(i,j) = thinning(f1,f2,f3);
else if(Ix(i,j)*Iy(i,j)< 0) | [
-0.09098964929580688,
-0.38162389397621155,
0.4169002175331116,
-0.49424800276756287,
-0.027176033705472946,
0.3729662001132965,
0.20383058488368988,
-0.1966441124677658,
-0.10591811686754227,
-0.4351804256439209,
-0.5143592357635498,
0.516065239906311,
-0.1231495589017868,
0.0749230980873... | |
f1 =If(i+1,j-1);
f2 =If(i,j);
f3 =If(i-1,j+1);
It(i,j) = thinning(f1,f2,f3);
else if(abs(Ix(i,j))-abs(Iy(i,j))>5) | [
-0.10187961906194687,
-0.3770347535610199,
0.43697530031204224,
-0.5761157274246216,
-0.059275347739458084,
0.38925766944885254,
0.3491607904434204,
-0.3655393421649933,
-0.16524071991443634,
-0.35834017395973206,
-0.586000919342041,
0.42974385619163513,
-0.13461674749851227,
0.00532067753... | |
f1 =If(i-1,j);
f2 =If(i,j);
f3 =If(i+1,j); | [
-0.23978427052497864,
-0.35096439719200134,
-0.26602208614349365,
-0.5491220951080322,
-0.35227105021476746,
0.12236203253269196,
0.44803357124328613,
-0.254429429769516,
0.1148114800453186,
-0.05542844161391258,
-0.5832464098930359,
0.34846773743629456,
-0.3278477191925049,
-0.15390031039... | |
It(i,j) = thinning(f1,f2,f3);
else if(abs(Iy(i,j))-abs(Ix(i,j)) > 5)
f1 =If(i,j-1); | [
0.06799197196960449,
-0.2829552888870239,
0.40686753392219543,
-0.5222369432449341,
-0.007480198983103037,
0.35585883259773254,
0.3526012599468231,
-0.1842338889837265,
0.04273025318980217,
-0.32959169149398804,
-0.6480268239974976,
0.5702468156814575,
0.035660527646541595,
-0.014807521365... | |
f2 =If(i,j);
f3 =If(i,j+1);
It(i,j) = thinning(f1,f2,f3); | [
-0.314844012260437,
-0.48778554797172546,
0.3774991035461426,
-0.7124024629592896,
-0.1508660912513733,
0.2811627984046936,
0.18438468873500824,
-0.14498472213745117,
-0.0045790039002895355,
-0.414549320936203,
-0.5581309199333191,
0.36417603492736816,
-0.20384149253368378,
0.1596057862043... | |
end
end
end
end
end
end
end
end
function [ w ] = thinning( f1,f2,f3 )
if( f2>f1 && f2>f3)
w =1;
else | [
-0.06909598410129547,
-0.4711356461048126,
0.6886150240898132,
-0.6180939078330994,
0.09452225267887115,
-0.13780862092971802,
0.3126171827316284,
-0.19960802793502808,
0.30136385560035706,
-0.23698507249355316,
-0.3821333646774292,
0.3351806700229645,
-0.2629854679107666,
0.31439611315727... | |
w= 0;
end
end
function sz = mask_size(sigma)
sz = floor(6*sigma) + 1;
end
```
There is a lot of noise... how can i solve the error? i need some help....
Error is actually at thinning function.
```
if( f2>f1 && f2>f3)
w =f2;
else
w= 0;
``` | [
0.08402390778064728,
-0.09224512428045273,
0.7118227481842041,
-0.3943288326263428,
0.26745808124542236,
0.052120059728622437,
0.5061789751052856,
-0.5166134238243103,
-0.16257356107234955,
-0.7586890459060669,
-0.2203359454870224,
0.5102890133857727,
0.02463456057012081,
0.141636863350868... | |
Here is my scenario.
I have the following line of code in my program:
```
JCL_History.Enqueue(JCL_History(I))
```
This JCL\_History object is basically a Generic.List encapsulated in a wrapper and has the following method:
```
Public Sub Enqueue(ByRef value As String)
If Members.Contains(value) Then
Me... | [
0.005648376420140266,
-0.23588448762893677,
0.21827246248722076,
-0.044530462473630905,
0.27456504106521606,
-0.045495446771383286,
-0.005579533986747265,
-0.007465725764632225,
-0.32707807421684265,
-0.6535834670066833,
-0.17172762751579285,
0.2398599237203598,
-0.3009263575077057,
0.3504... | |
type has the following default property:
```
Default Public Property Item(ByVal Index As Integer) As String 'Implements Generic.IList(Of String).Item
Get
If Index < _MaxCount Then
Return Members(Index)
Else
Throw New IndexOutOfRangeException("Bug encountered while accessing ... | [
-0.226800337433815,
-0.0888388380408287,
0.39445245265960693,
-0.19953738152980804,
-0.0077528683468699455,
-0.09542496502399445,
0.30867329239845276,
-0.37439945340156555,
-0.032829321920871735,
-0.420567125082016,
-0.13561217486858368,
0.6919983625411987,
-0.4319108724594116,
0.380931138... | |
String)
If Index < _MaxCount Then
If Index = _Count Then _Count = _Count + 1
Members(Index) = value
Else
Throw New IndexOutOfRangeException("Bug encountered while accessing job command file history, please send an error report.")
End If
End Set
End Propert... | [
0.1599712073802948,
0.052953749895095825,
0.4299376904964447,
-0.26300913095474243,
0.18558979034423828,
-0.1454782783985138,
0.5687935948371887,
-0.5515668988227844,
-0.042692944407463074,
-0.39919906854629517,
-0.13832888007164001,
0.671462893486023,
-0.20127740502357483,
0.3937075436115... | |
have 2 items in this JCL\_History list. When I call that first line of code I posted (the one that invokes Enqueue) with I = 1 I expect the first item to be shuffled to the bottom and the second item to be shuffled to the top.
After the thread returns from Enqueue I notice that this is exactly what happens to my list... | [
0.08955731242895126,
-0.3979017734527588,
0.534332811832428,
-0.15604640543460846,
0.22300873696804047,
-0.053516313433647156,
0.3756626546382904,
-0.15624023973941803,
-0.4111821949481964,
-0.8370223641395569,
0.028101764619350433,
0.3854514956474304,
-0.4008764326572418,
0.52375835180282... | |
got shuffled to the end (index 1) gets overwritten by the item value shuffled to the top.
So basically the set method on the default property is getting called at what I think to be a completely ridiculous time. What gives? By the way I'm running VS2005 on XP.
No answer. Never fixed this, just worked around it. | [
0.23523572087287903,
-0.1053217351436615,
0.6951638460159302,
0.08162741363048553,
0.03825359791517258,
-0.26150959730148315,
0.33148065209388733,
0.06724642962217331,
-0.4483407139778137,
-0.4936491847038269,
0.1139800027012825,
0.44136843085289,
-0.2517055571079254,
0.3872530162334442,
... | |
I'm currently running a site on php 5.4, prior to this I was running my site on 5.3.8. Unfortunately, php 5.4 combines `E_ALL` and `E_STRICT`, which means that my previous setting for `error_reporting` does not work now. My previous value was `E_ALL & ~E_NOTICE & ~E_STRICT` Should I just enable values one at a time?
I... | [
0.3070811629295349,
0.27994227409362793,
0.4380737245082855,
-0.09680897742509842,
-0.14905495941638947,
-0.12335601449012756,
0.7742025256156921,
0.2120053619146347,
-0.20719598233699799,
-0.9009444117546082,
0.042679063975811005,
0.5935930013656616,
-0.1876269280910492,
0.294640272855758... | |
```
error_reporting = E_ALL & ~E_NOTICE & ~E_STRICT
```
If you don't have access to the php.ini, you can potentially put this in your .htaccess file:
```
php_value error_reporting 30711
```
This is the E\_ALL value (32767) and the removing the E\_STRICT (2048) and E\_NOTICE (8) values.
If you don't have access to... | [
0.05174349620938301,
0.39920294284820557,
0.2615275979042053,
-0.015098915435373783,
-0.031797561794519424,
-0.12521496415138245,
0.40243661403656006,
-0.17019228637218475,
-0.23239858448505402,
-0.43667668104171753,
-0.08242875337600708,
0.5940243601799011,
-0.3668470084667206,
-0.1842745... | |
potential problems though and you may find some of the code is not working correctly in PHP 5.4. | [
0.3006686270236969,
0.3355933725833893,
0.3561670184135437,
0.2896242141723633,
0.03977680951356888,
-0.20448513329029083,
0.5318790078163147,
0.23072871565818787,
-0.186284139752388,
-0.39518168568611145,
0.3007761836051941,
0.6420867443084717,
-0.17083869874477386,
-0.09804543852806091,
... | |
The following code needs to produce an XML file.
```
string path = @"c:\load\myFile.xml";
SqlConnection connection = new SqlConnection(ConfigurationManager.ConnectionStrings["EmpFloors"].ConnectionString);
SqlCommand cmd;
cmd = new SqlCommand("select coords.xyid as '@id', xmin, xmax, ymin, ymax... | [
-0.26207029819488525,
-0.10247254371643066,
0.6770740747451782,
0.25828489661216736,
0.2592422366142273,
-0.0462966188788414,
0.13160263001918793,
-0.4572073817253113,
-0.30867040157318115,
-0.7796472311019897,
-0.4714508354663849,
0.3565521538257599,
-0.19387663900852203,
0.22696439921855... | |
DataSet("coords");
da.Fill(ds, "coord");
Response.Write(ds.GetXml());
File.WriteAllText(path, ds.GetXml());
```
The XML should look exactly like:
```
<?xml version="1.0" encoding="iso-8859-1"?>
<coords>
<coord id="6090">
<title>Office 6090</title>
<xmin>10</xmin>
<xmax>60</xmax>
... | [
0.005283248145133257,
-0.17850154638290405,
0.737375795841217,
0.014803532510995865,
-0.19740642607212067,
-0.17098090052604675,
0.13294747471809387,
-0.6510108709335327,
-0.05989597365260124,
-0.8842611312866211,
-0.5411196947097778,
0.2747810482978821,
-0.025747722014784813,
-0.226264834... | |
However, when I try to write to a file, it gets changed to what seems like htmlencoding.
```
<coords xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"><
```
I don't see a way to just write the same text that's rendered during response.write. Any clues would be appreciated.
Change your approach. Sorry, I... | [
0.17026318609714508,
0.12330646067857742,
0.46920454502105713,
-0.23330602049827576,
-0.2330818474292755,
-0.08061862736940384,
0.47892314195632935,
-0.21053698658943176,
-0.13728009164333344,
-0.8377713561058044,
-0.34099534153938293,
0.5945844054222107,
-0.37565740942955017,
-0.166659340... | |
So, the question might seem strange, but let's say that I compile:
```
int main(void)
{
int x = 3;
int y = 4;
int z = x + y;
}
```
Is it possible to make the CPU run just that? How? For example, would this allow me to write to the monitor? (If I remember it correctly, there are places in memory in which... | [
0.550073504447937,
0.028677280992269516,
-0.041939858347177505,
0.06937762349843979,
0.31032347679138184,
-0.07332687079906464,
0.36193734407424927,
0.17866183817386627,
-0.3639061152935028,
-0.35116487741470337,
0.025876272469758987,
0.5967308878898621,
-0.2319343537092209,
0.091366454958... | |
do input or output, it would almost certainly rely on the operating system to perform the i/o.
If you want to replace the operating system with your own code, then you could well do it. Minimalistic operating systems and program loaders exist. But yes, you have a lot to learn. | [
0.49444156885147095,
0.2956452965736389,
-0.23509079217910767,
0.45493894815444946,
0.2960566282272339,
-0.10587435960769653,
0.12677854299545288,
0.20048536360263824,
0.060832615941762924,
-0.6269587278366089,
-0.008323026821017265,
0.8328673839569092,
-0.047620292752981186,
0.02386762015... | |
I'm trying to use `iexact` in my Django app.
I have items in my database like `test`, `TEST`, `tEsT`, and `TesT`.
I'm trying to find out if any form of `test` is my database. It seems like I need to use `iexact` but however I try to use it I'm getting an error.
Here's a snippet of my code.
```
def item_search(x):... | [
0.21838656067848206,
0.24789349734783173,
0.08823294937610626,
-0.1237960159778595,
-0.09779901802539825,
-0.13264770805835724,
0.2354760766029358,
-0.1383669674396515,
0.16667498648166656,
-0.7415302991867065,
0.04190929979085922,
0.3960782587528229,
-0.5714440941810608,
-0.00682300422340... | |
#this is just pseduocode for stackoverflow
```
I've tried a variety of ways but I still can't get it to work.
This is *very* confused.
`__iexact` is something you use in Django query filters. Django converts that to the relevant SQL when it sends the query to the database. It's not a Python keyword, you can't just s... | [
0.33124861121177673,
0.12910640239715576,
-0.042447280138731,
-0.11271549016237259,
-0.3403404951095581,
-0.1918957233428955,
0.20130354166030884,
-0.15816836059093475,
0.0770249292254448,
-0.6056753993034363,
0.1479431539773941,
0.504717230796814,
-0.620722234249115,
-0.14828205108642578,... | |
I manage a CakePHP 1.1 CMS website, and our hosts just upgraded PHP to 5.3, causing a number of errors, such as:
```
Notice: Undefined variable: banner_image in /home2/intiwara/cake/app/views/layouts/public_site.thtml on line 49
Notice: Undefined variable: news_menu in /home2/intiwara/cake/app/views/articles/volunteer... | [
0.5161256790161133,
0.4016692042350769,
0.5655667185783386,
-0.3218919038772583,
-0.11296988278627396,
-0.0421869158744812,
0.6755547523498535,
-0.3015133738517761,
-0.18715864419937134,
-0.7341436147689819,
-0.06508132815361023,
0.3773341178894043,
-0.13288317620754242,
-0.270889312028884... | |
I am offline for two weeks' work in rural Ethiopia, so I'm hoping there's a 'workaround' solution I can put in place in the meantime. (The hosts didn't tell us this was about to happen..)
I don't need the admin functionality, I don't mind hiding errors - I just need the site to render. Is there any way I can trick PHP... | [
0.7032111287117004,
0.0538291372358799,
0.1080671176314354,
-0.05644473060965538,
-0.21672974526882172,
-0.15762512385845184,
0.9875556826591492,
0.25685229897499084,
-0.27485987544059753,
-0.7372002005577087,
0.07098741084337234,
0.37446752190589905,
0.24645565450191498,
-0.19414843618869... | |
From 1.1 to 2.1... this won't go that smooth.
Without knowing the whole code and all the issues it's hard to tell anything, it's not even really possible to say if it would be better to try to work around with fugly fixes or to do a proper upgrade to 1.3.
If this is really something mission critical contact me in pri... | [
0.7329384684562683,
-0.09302825480699539,
0.11657092720270157,
0.1596851497888565,
-0.24944305419921875,
-0.4173114001750946,
0.32580649852752686,
0.0966205894947052,
0.20620907843112946,
-0.7104291319847107,
-0.06787338852882385,
0.6802288293838501,
-0.2699333429336548,
-0.062686435878276... | |
I'm currently working on multiple changes/bugs and I would like to be able to work on these individually using individual local branches. But when I am in the middle of working on something on for example `branch_a` and then I need to start work on a new hot project, and I create a `branch_b`, I still have the changes ... | [
0.21126596629619598,
-0.0780964344739914,
0.08384525030851364,
-0.073912113904953,
0.2799077033996582,
0.03219299390912056,
0.32281848788261414,
-0.051876846700906754,
-0.34158334136009216,
-0.6869983077049255,
-0.06649892032146454,
0.472232460975647,
-0.41352561116218567,
0.24953037500381... | |
switched to `dev` branch, and created and checked-out `branch_b`
4. Perform a `git status` and I see the changes I made on `branch_a`
How do I create a new branch that doesn't have the changes I made on `branch_a`?
Also, when I checkout another branch I get
```
$ git checkout branch_b
M app/controllers/stuff.rb
M... | [
0.12326174229383469,
-0.3448496460914612,
0.7896971702575684,
-0.057760972529649734,
0.20360398292541504,
0.05192659795284271,
0.35774245858192444,
-0.032372184097766876,
-0.6051306128501892,
-0.7272393703460693,
-0.2389945536851883,
0.5861185789108276,
-0.40029117465019226,
0.360418528318... | |
commit -am 'fixed but in branch_b'
# go back to branch a
git checkout branch_a
# get back your stash
git stash pop
```
When you choose to commit your changes:
```
git add .
git commit -am 'changes in branch_a'
# creating and checkout new branch
git checkout -b branch_b
# fix your bug
git add .
git commit -am 'just f... | [
0.171560138463974,
0.0003714423510245979,
0.2777022123336792,
-0.06440162658691406,
0.5589561462402344,
0.2553201913833618,
0.0684041753411293,
0.2893146276473999,
-0.8219044208526611,
-0.5602448582649231,
-0.1335180252790451,
0.7010909914970398,
-0.716884195804596,
0.1282496601343155,
0... | |
First off I would like to say that this is my first post and that although I have never posted on StackOverflow.com, the people here have helped me an enormous amount and I wish I could go back and +1 all of the posts that have helped me.
That being said I was given an assignment in an algorithms class where I have to... | [
0.27108263969421387,
0.1255723536014557,
0.439608097076416,
0.15694180130958557,
-0.41175737977027893,
0.3205625116825104,
-0.14866438508033752,
0.22389285266399384,
-0.2716340124607086,
-0.8347845077514648,
0.7574281692504883,
0.559143602848053,
0.027158554643392563,
0.27727004885673523,
... | |
thousand nine hundred and ninetyeight
nine hundred and ninetynine thousand nine hundred and ninetynine
one million
```
I've got my code working to 8,980 just running to 10,000 for testing but then I run into a Stack Overflow. I'm not sure if the JVM puts aside only enough memory to run to 8,980 or if it's something i... | [
0.22827103734016418,
0.34685173630714417,
0.4729629158973694,
-0.11461156606674194,
-0.03216921165585518,
0.509273886680603,
0.08807834982872009,
0.121202252805233,
-0.07214431464672089,
-0.5522327423095703,
0.5107094645500183,
0.7799642086029053,
0.34541550278663635,
0.12262250483036041,
... | |
THOUSAND = " thousand ";
private String[] zeroToNineteen = { "", "one", "two", "three", "four", "five", "six", "seven", "eight", "nine", "ten", "eleven", "twelve", "thirteen", "fourteen", "fifteen", "sixteen", "seventeen", "eighteen", "nineteen" };
private String[] twentyToOneHundred = { "", "", "twent... | [
-0.05250414460897446,
0.11469123512506485,
0.40839141607284546,
-0.29863327741622925,
0.25890013575553894,
0.4562763273715973,
0.10293656587600708,
-0.4327392578125,
-0.14896924793720245,
-0.3009030520915985,
0.13653722405433655,
0.8390836119651794,
-0.07525750249624252,
0.1842101514339447... | |
String newNumber = "";
```
I first set a String `number` to the parameter `n` by means of `Integer.toString(n)`.
Then with each conditional statement I figure out the first number in the sequence and from there use that number to set a String `newNumber` to the index value in the correct array.
```java
newNumber ... | [
-0.1533474624156952,
-0.05381401628255844,
0.5491146445274353,
-0.5016140341758728,
0.15363964438438416,
0.16696231067180634,
0.1673121303319931,
-0.5829704403877258,
-0.12866520881652832,
-0.5081697106361389,
-0.15204587578773499,
0.7560863494873047,
-0.15871332585811615,
-0.0250276643782... | |
I then println the number to the console and make the recursive call `toOneMillion(n+1);` until `n` is equal to 10,000 (for testing purposes).
I guess my question is, is it possible to achieve 1 to 1,000,000 without encountering a stackoverflow? Also if you see something in my code that shouldn't be there or code that... | [
0.11515458673238754,
0.039519112557172775,
0.6209319829940796,
0.04644593968987465,
0.025159228593111038,
0.1489746868610382,
0.2740636467933655,
-0.03706146404147148,
-0.21001696586608887,
-0.4037073254585266,
0.29762935638427734,
0.5095279812812805,
0.09318604320287704,
0.068742632865905... | |
for any help to come.
Code In Full
------------
I have a main class that creates an instance of the numbers class and calls the recursive meathod via - `numbers.toOneMillion(1)`... and that's the only other class in my project folder, so it's this is the class with the problem.
```java
public class Numbers {
pr... | [
0.0007372208056040108,
0.16668175160884857,
0.19598758220672607,
-0.010680463165044785,
0.08295366168022156,
0.35472533106803894,
0.2552819550037384,
-0.1738511323928833,
-0.12411995232105255,
-0.36675503849983215,
0.2031114548444748,
0.6388659477233887,
-0.010472978465259075,
0.0304928235... | |
"thirteen", "fourteen", "fifteen", "sixteen", "seventeen", "eighteen", "nineteen" };
private String[] twentyToOneHundred = { "", "", "twenty", "thirty", "fourty", "fifty", "sixty", "seventy", "eighty", "ninety" };
public void toOneMillion(int n) {
String number = Integer.toString(n);
String new... | [
0.11696287244558334,
-0.1730843037366867,
0.49430346488952637,
-0.3301536440849304,
0.5763237476348877,
0.5815259218215942,
0.20355580747127533,
-0.42636391520500183,
-0.38324612379074097,
-0.3263580799102783,
-0.027408462017774582,
0.8147109150886536,
0.05594230815768242,
0.27192655205726... | |
if (n >= 100) {
if (n >= 1000) {
if (n % 1000 == 0) {
newNumber = zeroToNineteen[Integer.parseInt(number.substring(0, 1))] + THOUSAND; | [
0.09256961941719055,
-0.17251010239124298,
0.3999931812286377,
-0.22112581133842468,
0.26799529790878296,
0.21847060322761536,
0.3235096037387848,
-0.49526721239089966,
-0.04640834778547287,
-0.29196062684059143,
-0.193340465426445,
0.4631901979446411,
0.18089716136455536,
0.31317555904388... | |
System.out.print(newNumber);
number = number.substring(1, 4);
} else {
newNumber = zeroToNineteen[Integer.parseInt(number.substring(0, 1))] + THOUSAND; | [
-0.1145586371421814,
-0.25565969944000244,
0.4459623694419861,
-0.09655644744634628,
0.17114703357219696,
0.4848676025867462,
0.1744222640991211,
-0.5424364805221558,
-0.38845640420913696,
-0.3669821619987488,
-0.06657920032739639,
0.42903080582618713,
-0.031051412224769592,
0.423946022987... | |
System.out.print(newNumber);
number = number.substring(1, 4);
// System.out.println("HELLO!" + number + " " + n);
} | [
-0.36750712990760803,
-0.2162037193775177,
0.4496396481990814,
-0.4149303436279297,
0.24269317090511322,
0.3222973346710205,
0.16507340967655182,
-0.2978720963001251,
-0.4797726571559906,
-0.5828619003295898,
-0.3771349787712097,
0.31254422664642334,
-0.32510748505592346,
0.342110931873321... | |
}
if (Integer.parseInt(number) != 0) {
if (n % 100 == 0) {
if(zeroToNineteen[Integer.parseInt(number.substring(0, 1))].equals("")) { | [
-0.058910731226205826,
0.01483649481087923,
0.3197079300880432,
-0.15358664095401764,
0.18312601745128632,
0.09222721308469772,
0.2041623443365097,
-0.4991142153739929,
-0.0062864706851542,
0.00428249966353178,
-0.158481627702713,
0.4258074462413788,
-0.23913098871707916,
-0.03800420463085... | |
newNumber = zeroToNineteen[Integer.parseInt(number.substring(0, 1))];
System.out.print(newNumber);
number = number.substring(1, 3);
} else { | [
-0.05769887939095497,
-0.2190317064523697,
0.4488920569419861,
-0.2887665033340454,
0.20303069055080414,
0.28241851925849915,
0.3550615906715393,
-0.7090792059898376,
-0.28818458318710327,
-0.3900085985660553,
-0.2766433358192444,
0.5192493796348572,
-0.20332521200180054,
0.271061271429061... | |
newNumber = zeroToNineteen[Integer.parseInt(number.substring(0, 1))] + HUNDRED;
System.out.print(newNumber);
number = number.substring(1, 3); | [
-0.050399456173181534,
-0.05793479457497597,
0.5290672779083252,
-0.2974407970905304,
-0.014341714791953564,
0.3997757136821747,
0.24439895153045654,
-0.755306601524353,
-0.2518859803676605,
-0.3698270916938782,
-0.14585235714912415,
0.35362014174461365,
-0.027389731258153915,
0.4861319363... | |
}
} else {
if(zeroToNineteen[Integer.parseInt(number.substring(0, 1))].equals("")) {
newNumber = zeroToNineteen[Integer.parseInt(number.substring(0, 1))] + "and "; | [
-0.10464807599782944,
-0.27108681201934814,
0.4958939254283905,
-0.3187265694141388,
0.24441474676132202,
-0.06946397572755814,
0.2713264524936676,
-0.4865522086620331,
0.05742780864238739,
-0.27650415897369385,
-0.28810468316078186,
0.8605942130088806,
-0.05721285939216614,
0.074297092854... | |
System.out.print(newNumber);
number = number.substring(1, 3);
} else { | [
-0.16700705885887146,
-0.27153050899505615,
0.3836747109889984,
-0.2835915684700012,
0.24119898676872253,
0.2825028896331787,
0.23873476684093475,
-0.4483315050601959,
-0.42149460315704346,
-0.48244357109069824,
-0.1896599680185318,
0.36670419573783875,
-0.2993018627166748,
0.3520163297653... | |
newNumber = zeroToNineteen[Integer.parseInt(number.substring(0, 1))] + HUNDRED + "and ";
System.out.print(newNumber);
number = number.substring(1, 3); | [
-0.01093814056366682,
-0.07681547105312347,
0.5739918947219849,
-0.27327996492385864,
0.039241157472133636,
0.35258668661117554,
0.25030291080474854,
-0.7482634782791138,
-0.21675080060958862,
-0.45024222135543823,
-0.1988552063703537,
0.3791506886482239,
-0.013641026802361012,
0.415672451... | |
}
// System.out.println("HELLO!" + number + " " + n);
}
}
}
if (Integer.parseInt(number) < 20) { | [
-0.5224467515945435,
-0.1395103633403778,
0.3391628563404083,
-0.339196115732193,
0.27592647075653076,
0.20567670464515686,
0.024440161883831024,
-0.3689548969268799,
-0.27096426486968994,
-0.4216933250427246,
-0.361997127532959,
0.4135649502277374,
-0.24779339134693146,
-0.057098362594842... | |
System.out.println(zeroToNineteen[Integer.parseInt(number)]);
toOneMillion(n + 1);
} else {
if (n % 10 == 0) {
number = number.substring(0, 1); | [
-0.19879119098186493,
-0.4139556586742401,
0.2870478928089142,
-0.2234390527009964,
0.32242053747177124,
0.30073434114456177,
0.3848419785499573,
-0.33652234077453613,
-0.33015456795692444,
-0.21617288887500763,
-0.20060224831104279,
0.4260737895965576,
-0.3689868152141571,
0.1421446204185... | |
newNumber = twentyToOneHundred[Integer.parseInt(number)];
System.out.println(newNumber);
toOneMillion(n + 1);
} else {
newNumber = twentyToOneHundred[Integer.parseInt(number | [
-0.0950574204325676,
-0.10233611613512039,
0.48719462752342224,
-0.5254387259483337,
0.3414543867111206,
0.4946307837963104,
0.2891347110271454,
-0.7163413166999817,
-0.4213334023952484,
-0.5589393973350525,
-0.1912180334329605,
0.6248679161071777,
-0.09808118641376495,
0.12614603340625763... | |
.substring(0, 1))];
newNumber += zeroToNineteen[Integer.parseInt(number
.substring(1))];
System.out.println(newNumber); | [
-0.11720295995473862,
-0.2637512683868408,
0.34564387798309326,
-0.3672303259372711,
0.19299180805683136,
0.21889819204807281,
0.3779764175415039,
-0.5874379277229309,
-0.2512986361980438,
-0.250654011964798,
-0.3001145124435425,
0.4243009388446808,
-0.25954708456993103,
0.2919048964977264... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.