if(havePathInCommon(previousToCurrent, previousToNext)) {
return _.merge(current, previousToNext);
}

In the book, the explanation for the code above is:

"In order to determine whether there is a conflict, we calculate two diffs: the diff between previous and current and the diff between previous and next. If the intersection between the two diffs is empty, it means there is no conflict. We can safely patch the changes between previous to next into current."

Per my understanding the condition should be negated: if(**!**havePathInCommon(previousToCurrent, previousToNext)) { ...

It seems that the code throws exception if the intersection is empty.

the havePathInCommon function of chapter 5 uses lodash intersection which will always return false.

havePathInCommon uses informationPaths which returns an array of the paths, where each path is an array with keys as values of the array.

A return value example of informationPaths would be:

[
  ['library', 'catalog', 'authorsById', '1', 'name'] ,
  ['library', 'userManagement', 'userssById', '1', 'name'] 
]

but lodash's intersection will not deeply check this nested array, so if the above path was compared with

[
  ['library', 'catalog', 'authorsById', '1', 'name'] ,
]

It will return false because arrays are reference type.

Hi, besides the code in this library, is there some open source project or larger example for DOP that's not implemented in Clojure?