functional data structure造句

• Efficient purely functional data structures may require the use of lazy evaluation and memoization.
• Purely functional data structures are often represented in a different way than their logarithmic time.
• Purely functional data structures are persistent.
• *I do agree with Mark viking in the importance of a purely functional data structure article.
• One of the key tools in building efficient purely functional data structures is "'memoization " '.
• One of the key tool in building efficient purely functional data structures is "'memoization " '.
• A "'finger tree "'is a purely functional data structure used in efficiently implementing other functional data structures.
• A "'finger tree "'is a purely functional data structure used in efficiently implementing other functional data structures.
• And like all functional data structures, it is inherently persistent; that is, older versions of the tree are always preserved.
• Functional programming may use persistent non-purely functional data structures, while those data structures may not be used in purely functional programs.
• In computer science, a "'purely functional data structure "'is one that can be implemented in a purely functional language.
• Purely functional data structures are persistent data structures that completely avoid the use of mutable state, but can often still achieve attractive amortized time complexity bounds.
• Purely functional data structures can be implemented in imperative and object-oriented languages, but their time and / or space performance may be inferior to that of data structures lacking purely functional properties.
• In his book " Purely Functional Data Structures ", computer scientist Chris Okasaki describes techniques used to design and implement purely functional data structures, a small subset of which are summarized below.
• In his book " Purely Functional Data Structures ", computer scientist Chris Okasaki describes techniques used to design and implement purely functional data structures, a small subset of which are summarized below.
• If you agree, I suggest that the 玴urely functional?page be either deleted, or renamed into 玃urely _ functional _ data _ structures?and we use the page I wrote for purely functional data structures.
• It may be better to split into purely functional language and purely functional data structure articles or sections, but I don't see any policy-based reason for outright deletion .-- talk ) 17 : 24, 28 July 2016 ( UTC)