growable การใช้
- In Java, the growable bit-array data structure has a method that counts the number of bits that are set.
- Burstsort algorithms use a trie to store prefixes of strings, with growable arrays of pointers as end nodes containing sorted, unique, suffixes ( referred to as " buckets " ).
- Some languages allow " dynamic arrays " ( also called " resizable ", " growable ", or " extensible " ) : array variables whose index ranges may be expanded at any time after creation, without changing the values of its current elements.
- Balanced trees require O ( log " n " ) time for indexed access, but also permit inserting or deleting elements in O ( log " n " ) time, whereas growable arrays require linear ( ? ( " n " ) ) time to insert or delete elements at an arbitrary position.
- Although users are familiar with protection faults as program-killing errors, OSes which run on CPUs with memory management units also ( transparently ) use protection faults to implement growable stacks, copy-on-write, and handling of paging data and executables to and from disk / memory .-- Talk 00 : 34, 31 October 2010 ( UTC)