Modifying immutable data consists of building a new version of the data and working from the new version.
对不可变数据的更改包括构建数据新版本并从新版本开始工作。
Because Clojure trees are immutable data structures, any manipulation requires that we return a new, modified tree.
由于clojure树是不可变的数据结构，因此任何操作都需要返回一个经过修改的新树。
Immutable data cannot be changed and thus reading immutable data does not require locks, even when multiple threads are reading.
不可变数据是不能更改的，因此读取不可变数据无需用到锁，即使有多个线程读取时也是如此。
This means that it is much easier to write multi-threading applications in functional languages because immutable data structures inherently interact cleanly with threads.
这意味着以函数式语言编写多线程应用程序要容易得多，因为不可变数据结构与线程交互起来非常自然，因而代码可以很简洁。
When considering a tree of nodes where each node is an immutable data structure, we must consider how to modify a node or nodes inside the tree without modifying the entire tree.
在考虑每个节点都是一个不可变数据结构的节点树时，我们必须考虑如何修改树内的一个节点或多个节点，而不必更改整个树。
In functional programming, you think of immutable data structures and functions that convert them.
在函数式编程当中你想的是不变的数据结构以及那些转换它们的函数。
All literals correspond to immutable data types, and hence the object's identity is less important than its value.
所有字面值都属于不可变的数据类型，因此对象的标识比起它们的值来说显得次要一些。
Immutable data is a key aspect of many languages that focus on concurrency because it has such nice properties.
不可变数据是许多侧重于并发性的语言的关键方面，因为它有如此好的属性。
Immutable data is a key aspect of many languages that focus on concurrency because it has such nice properties.
不可变数据是许多侧重于并发性的语言的关键方面，因为它有如此好的属性。
应用推荐