Path: csiph.com!weretis.net!feeder4.news.weretis.net!feeder5.news.weretis.net!news.solani.org!.POSTED!not-for-mail From: Thomas 'PointedEars' Lahn Newsgroups: comp.lang.javascript Subject: Re: Update only if not already in array Date: Tue, 07 Mar 2017 15:34:28 +0100 Organization: PointedEars Software (PES) Lines: 46 Message-ID: <5018147.DvuYhMxLoT@PointedEars.de> References: <567cadf8-91e1-4e1d-9183-09b60658ec39@googlegroups.com> <72c9bb07-427c-4256-bc82-0b0a3acd6cc5@googlegroups.com> <8e90e371-950e-4774-89f4-1c54566745fa@googlegroups.com> <20ca53b3-e664-4d34-86ec-1bc0e5fb4b1e@googlegroups.com> <87o9xhjb00.fsf@bsb.me.uk> <8fae31a5-24ba-46ac-a746-299a4eb57671@googlegroups.com> <87efyckbg4.fsf@bsb.me.uk> <6758a153-c068-4bbb-b890-52bc05066870@googlegroups.com> <8760jok1m3.fsf@bsb.me.uk> <3aa0dc8d-a808-4583-809c-c74fffda0e08@googlegroups.com> <87mvczhiq5.fsf@bsb.me.uk> <8737ep3o6e.fsf@bsb.me.uk> <10793909.O9o76ZdvQC@PointedEars.de> <87wpc11gb1.fsf@bsb.me.uk> Reply-To: Thomas 'PointedEars' Lahn Mime-Version: 1.0 Content-Type: text/plain; charset="UTF-8" Content-Transfer-Encoding: 8Bit X-Trace: solani.org 1488897269 1831 eJwFwYEBwCAIA7CXUGg73inT/08wQXJxVAQLF9eSoNn+hzIw2SfkyDB9Wdwnqtf0192AHxbTEIk= (7 Mar 2017 14:34:29 GMT) X-Complaints-To: abuse@news.solani.org NNTP-Posting-Date: Tue, 7 Mar 2017 14:34:29 +0000 (UTC) User-Agent: KNode/4.14.2 Face: iVBORw0KGgoAAAANSUhEUgAAADAAAAAwBAMAAAClLOS0AAAAGFBMVEXTxa4RFk5dUWANED8PFEfy7+MGBiW+n3ZNF/QuAAACaElEQVQ4jVXUwVOcMBQG8Dc7Rc4PUntdWV2uxjDpGaGeozOp1woar4jd5t/v9wLstMwsA/ntlxdCAgUc1hjTc9/JCZfGoo3wG3HdmdAWrIJRHe7GM/TmpY5VFefuVcAkkPbLIaN8rmPmjloyZxgyR3GuJ4K0AGtJ2htz8o7yqikm759fldQXaMpbDzjKAG+8v+AugVTOPO5DOjLvGtUYQwh0CPjnVMyGd+8/GfUB5nLKJDD2aLDh5HYyMDJGDwQIo2ZmZcKbowNmAdB/AzyFhrmF2MHRb0QJJfaAnwGB6orZhoykLzJtGwF/xpYxI1dswomiUj3gTuAIqCn/4C7cULwGNBtwMTk3Y4LfKB5YUaOKBKYtpplm7u0vip8tU1NWWyI/7XdcSuIDoMt6rVHMWT0DbjHPGqDqZVSa6zleLcUTcIKLoMv3ueJluALtAo9B302zPPlrtiVScRdCjXvVh3e3JpYa/jjkuC9N+LrBMlz/eAN4eQijX2EdLo6c5tGGHwLyHFtXk89dDGHwCVhG9T0S/j55AhRZgkMCmUQXJ49TnS1wnQDvw0eAh9ICeMmEFbCnPMFzjAvsWoEWEFdYEx+S0MoUZ1gT1wId8+AF3Bl2OoEu906AUHx5VLw/gXYg/x84loOah/2UYNrgiwSwGO7RfUzVBbx/kgpckumGOi6QirtD6gkLTitbnxNol47S2jVc2vsN5kPqaAHT8uUdAJM4v/DanjYOwmUjWznGfwB7sGtAtor5BgofDuzaRj4kSQAqDakTsKORa3Q3xKi3gE1fhl71KRMqrdZ2AWNNg/YOhQyrVBnb+i+nEg4bsDA+egAAAABJRU5ErkJggg== Cancel-Lock: sha1:Mg6pEcgO+32BCt3G+gZZqwiAIZ4= X-Face: %i>XG-yXR'\"2P/C_aO%~;2o~?g0pPKmbOw^=NT`tprDEf++D.m7"}HW6.#=U:?2GGctkL,f89@H46O$ASoW&?s}.k+&. Thomas 'PointedEars' Lahn writes: >> Ben Bacarisse wrote: >>> "Michael Haufe (TNO)" writes: >>>> Big-O is the upper-bound specifically. Whatever the input, >>>> the resulting time will not exceed this bound by definition, >>>> otherwise it wouldn't be the upper bound. >>> It's not an upper bound in that sense -- it's the asymptotic upper >>> bound, up to a constant factor. It states (in this case) that there >>> is some constant C and some integer M such that >>> steps_taken_by(small(k)) > C*k^3 for all k > M. > > steps_taken_by(small(k)) < C*k^3 for all k > M. > > (Some people use <= and >= for one or other but that makes no difference.) Yes, it does. >> No, it does not. > > Indeed, a typo. Surely just pointing out the swapped comparison would > have been more helpful? No, blankly, firmly, and concisely denying your *unsubstantiated claim* made you think more, caused less noise, and saved me more time, in total. While it required you to invest the time that you thought you could save and still get away with it, shifting the burden of proof. “The amount of energy necessary to refute bullshit is an order of magnitude bigger than to produce it.” (Alberto Brandolini, programmer, 2014) > Anyway, thanks for noticing You’re welcome. > and if there is anything else, maybe you could say what? Maybe. Or maybe you should learn how to ask questions the smart way, and how to post on topic. -- PointedEars FAQ: | | Twitter: @PointedEars2 | Please do not cc me./Bitte keine Kopien per E-Mail.