diff options
| -rw-r--r-- | src/couchdb/couch_btree.erl | 5 | ||||
| -rw-r--r-- | src/couchdb/couch_key_tree.erl | 2 | ||||
| -rw-r--r-- | src/couchdb/couch_view_updater.erl | 2 |
3 files changed, 5 insertions, 4 deletions
diff --git a/src/couchdb/couch_btree.erl b/src/couchdb/couch_btree.erl index 0231d83c..c9079781 100644 --- a/src/couchdb/couch_btree.erl +++ b/src/couchdb/couch_btree.erl @@ -243,8 +243,9 @@ complete_root(Bt, KPs) -> % written. Plus with the "case size(term_to_binary(InList)) of" code it's % probably really inefficient. -chunkify(_Bt, []) -> - []; +% dialyzer says this pattern is never matched +% chunkify(_Bt, []) -> +% []; chunkify(Bt, InList) -> case size(term_to_binary(InList)) of Size when Size > ?CHUNK_THRESHOLD -> diff --git a/src/couchdb/couch_key_tree.erl b/src/couchdb/couch_key_tree.erl index 87313ff0..d08f5ede 100644 --- a/src/couchdb/couch_key_tree.erl +++ b/src/couchdb/couch_key_tree.erl @@ -191,7 +191,7 @@ get_key_leafs_simple(Pos, [{Key, _Value, SubTree}=Tree | RestTree], KeysToGet, K {LeafsFound ++ RestLeafsFound, KeysRemaining}; KeysToGet2 -> LeafsFound = get_all_leafs_simple(Pos, [Tree], KeyPathAcc), - LeafKeysFound = [LeafKeyFound || {LeafKeyFound, _, _} <- LeafsFound], + LeafKeysFound = [LeafKeyFound || {LeafKeyFound, _} <- LeafsFound], KeysToGet2 = KeysToGet2 -- LeafKeysFound, {RestLeafsFound, KeysRemaining} = get_key_leafs_simple(Pos, RestTree, KeysToGet2, KeyPathAcc), {LeafsFound ++ RestLeafsFound, KeysRemaining} diff --git a/src/couchdb/couch_view_updater.erl b/src/couchdb/couch_view_updater.erl index 30d24baa..3c4c9108 100644 --- a/src/couchdb/couch_view_updater.erl +++ b/src/couchdb/couch_view_updater.erl @@ -123,7 +123,7 @@ process_doc(Db, DocInfo, {Docs, #group{sig=Sig,name=GroupId,design_options=Desig _ -> exit(reset) end; - {not_found, deleted} -> + {not_found, missing} -> exit(reset) end; {false, <<?DESIGN_DOC_PREFIX, _/binary>>} -> % we skip design docs |