Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]


Groups > comp.lang.javascript > #39709

Re: Faster procedure then shift to remove first element of list or array?

Newsgroups comp.lang.javascript
Date 2021-03-19 12:39 -0700
References <ec6dacb2-0ac5-4ae3-bc3e-62bf086557ddn@googlegroups.com> <adb38a78-7566-46ba-844f-3a126419e0b3n@googlegroups.com> <11719837.O9o76ZdvQC@PointedEars.de> <70e509d6-88db-40e4-ac4d-2b02c769ac1cn@googlegroups.com>
Message-ID <59ea8408-9211-4887-ab7a-e939c7781611n@googlegroups.com> (permalink)
Subject Re: Faster procedure then shift to remove first element of list or array?
From Jonas Thörnvall <jonas.thornvall@gmail.com>

Show all headers | View raw


torsdag 18 mars 2021 kl. 14:30:07 UTC+1 skrev Michael Haufe (TNO):
> On Thursday, March 18, 2021 at 6:26:14 AM UTC-5, Thomas 'PointedEars' Lahn wrote: 
> 
> > Array.prototype.shift() usually is not available for non-Array instances; so 
> > in order to use .shift(), it may be necessary to convert the non-Array to 
> > Array, or treat it as such (by Function.prototype.call()/.apply()), which 
> > can be expensive.
> "The shift function is intentionally generic; it does not require that its this value be an Array object. Therefore it can be transferred to other kinds of objects for use as a method." 
> <https://tc39.es/ecma262/#sec-array.prototype.shift> 
> 
> How expensive is call/apply really? If it's less than O(n) then the entirety is still O(n) from that standpoint. Practically we could measure these two head to head to know the actual difference, 
> but who cares? We know we could do better with a data structure different from an array such as a Finger Tree which provides O(1) access to the head and tail and logarithmic concatenation and logarithmic random access.
What is a finger tree could you provide a link? I know about pointers and such but never heard the term finger tree?

Back to comp.lang.javascript | Previous | Next — Previous in thread | Next in thread | Find similar | Unroll thread


Thread

Faster procedure then shift to remove first element of list or array? Jonas Thörnvall <jonas.thornvall@gmail.com> - 2021-03-16 22:51 -0700
  Re: Faster procedure then shift to remove first element of list or array? "Michael Haufe (TNO)" <tno@thenewobjective.com> - 2021-03-17 06:09 -0700
    Re: Faster procedure then shift to remove first element of list or array? Jonas Thörnvall <jonas.thornvall@gmail.com> - 2021-03-17 06:45 -0700
    Re: Faster procedure then shift to remove first element of list or array? Thomas 'PointedEars' Lahn <PointedEars@web.de> - 2021-03-18 12:26 +0100
      Re: Faster procedure then shift to remove first element of list or array? "Michael Haufe (TNO)" <tno@thenewobjective.com> - 2021-03-18 06:30 -0700
        Re: Faster procedure then shift to remove first element of list or array? Thomas 'PointedEars' Lahn <PointedEars@web.de> - 2021-03-19 02:59 +0100
        Re: Faster procedure then shift to remove first element of list or array? Jonas Thörnvall <jonas.thornvall@gmail.com> - 2021-03-19 12:39 -0700
          Re: Faster procedure then shift to remove first element of list or array? "Michael Haufe (TNO)" <tno@thenewobjective.com> - 2021-03-19 13:55 -0700
          Re: Faster procedure then shift to remove first element of list or array? "sc...@sauyet.com" <scott@sauyet.com> - 2021-03-19 14:42 -0700

csiph-web