index mock

kaaass · kaaass · Jan 13, 2021 · Jan 1, 2021 · Jan 1, 2021 · Jan 1, 2021
commit 9240fe73f07a676c7c6d79fe6693708710630bf3
diff --git a/src/main/java/net/kaaass/rumbase/index/Index.java b/src/main/java/net/kaaass/rumbase/index/Index.java
@@ -0,0 +1,92 @@
+package net.kaaass.rumbase.index;
+
+import net.kaaass.rumbase.index.exception.IndexNotFoundException;
+import net.kaaass.rumbase.index.mock.MockBtreeIndex;
+import net.kaaass.rumbase.record.exception.RecordNotFoundException;
+
+import java.nio.file.LinkOption;
+import java.security.KeyPair;
+import java.util.*;
+
+/**
+ * 索引
+ *
+ * @author DoctorWei1314
+ */
+
+public interface Index {
+    /**
+     * 通过文件名拿到索引,如果不存在，则抛出异常
+     *
+     * @param indexFileName
+     * @return
+     */
+    static Index getIndex(String indexFileName) throws IndexNotFoundException {
+        if (MockBtreeIndex.MOCK_BTREE_INDEX_MAP.get(indexFileName) == null){
+            MockBtreeIndex.MOCK_BTREE_INDEX_MAP.put(indexFileName,new MockBtreeIndex());
+        }
+        return MockBtreeIndex.MOCK_BTREE_INDEX_MAP.get(indexFileName);
+    }
+
+    /**
+     * 查看索引文件是否存在
+     *
+     * @param indexFileName
+     * @return
+     */
+    static boolean exists(String indexFileName) {
+        return true;
+    }
+
+    /**
+     * 创建一个空的索引
+     *
+     * @param indexFileName
+     * @return
+     */
+    static Index createEmptyIndex(String indexFileName) {
+        return new MockBtreeIndex();
+    }
+
+    /**
+     *替换uuid
+     *
+     * @param uuidMap
+     */
+    void replace(Map<Long, Long> uuidMap);
+
+    /**
+     * 插入
+     *
+     * @param dataHash
+     * @param uuid
+     */
+    void insert(long dataHash, long uuid);
+
+    /**
+     * 返回对应key的uuid，如果不存在，则list为空
+     * @param keyHash
+     * @return
+     */
+    List<Long> query(long keyHash);
+
+    /**
+     * 返回包括keyHash在内的迭代器 eg: keyHash = 4,   33^^^445577
+     * @param keyHash
+     * @return
+     */
+    Iterator<Pair> queryWith(long keyHash);
+
+    /**
+     * 返回不包括keyHash在内的迭代器 eg: keyHash = 4,   3344^^^5577
+     * @param keyHask
+     * @return
+     */
+    Iterator<Pair> queryWithout(long keyHask);
+
+    /**
+     * 返回第一个版本的迭代器
+     * @return
+     */
+    Iterator<Pair> getFirst();
+}
diff --git a/src/main/java/net/kaaass/rumbase/index/Pair.java b/src/main/java/net/kaaass/rumbase/index/Pair.java
@@ -0,0 +1,19 @@
+package net.kaaass.rumbase.index;
+
+public class Pair {
+    private long key;
+    private long uuid;
+
+    public Pair(long key, long uuid) {
+        this.key = key;
+        this.uuid = uuid;
+    }
+
+    public long getKey() {
+        return key;
+    }
+
+    public long getUuid() {
+        return uuid;
+    }
+}
diff --git a/src/main/java/net/kaaass/rumbase/index/exception/IndexNotFoundException.java b/src/main/java/net/kaaass/rumbase/index/exception/IndexNotFoundException.java
@@ -0,0 +1,31 @@
+package net.kaaass.rumbase.index.exception;
+
+import net.kaaass.rumbase.exception.RumbaseException;
+
+import java.util.HashMap;
+import java.util.Map;
+public class IndexNotFoundException extends RumbaseException {
+    /**
+     * 构造Rumbase异常
+     *
+     * @param mainId 主错误号
+     * @param subId  子错误号
+     * @param reason 错误原因
+     */
+    public IndexNotFoundException(int mainId, int subId, String reason) {
+        super(mainId, subId, reason);
+    }
+
+    public static final Map<Integer, String> REASONS = new HashMap<>(){{
+        put(1, "索引不存在");
+    }};
+
+    /**
+     * 索引不存在
+     *
+     * @param subId  子错误号
+     */
+    public IndexNotFoundException(int subId) {
+        super(9001, subId, REASONS.get(subId));
+    }
+}
diff --git a/src/main/java/net/kaaass/rumbase/index/mock/MockBtreeIndex.java b/src/main/java/net/kaaass/rumbase/index/mock/MockBtreeIndex.java
@@ -0,0 +1,58 @@
+package net.kaaass.rumbase.index.mock;
+
+import lombok.Getter;
+import lombok.RequiredArgsConstructor;
+import net.kaaass.rumbase.index.Index;
+import net.kaaass.rumbase.index.Pair;
+import net.kaaass.rumbase.record.mock.MockRecordStorage;
+
+import java.util.*;
+
+@RequiredArgsConstructor
+public class MockBtreeIndex implements Index {
+    /**
+     * 内存中创建的MockBtreeIndex
+     */
+    public static final Map<String, MockBtreeIndex> MOCK_BTREE_INDEX_MAP = new HashMap<>();
+
+    @Getter
+    private HashMap<Long, List<Long>> hashMap = new HashMap<>();
+
+    @Override
+    public void replace(Map<Long, Long> uuidMap) {
+        var values = hashMap.values();
+        for (List<Long> value : values){
+            for (Long old : value){
+                if (uuidMap.containsKey(old)) {
+                    value.remove(old);
+                    value.add(uuidMap.get(old));
+                }
+            }
+        }
+    }
+
+    @Override
+    public void insert(long dataHash, long uuid) {
+        hashMap.computeIfAbsent(dataHash,k -> new ArrayList<>()).add(uuid);
+    }
+
+    @Override
+    public List<Long> query(long keyHash) {
+        return hashMap.get(keyHash) == null ? new LinkedList<>() : hashMap.get(keyHash);
+    }
+
+    @Override
+    public Iterator<Pair> queryWith(long keyHash) {
+        return new MockIterator(this, keyHash,  true);
+    }
+
+    @Override
+    public Iterator<Pair> queryWithout(long keyHash) {
+        return new MockIterator(this, keyHash, false);
+    }
+
+    @Override
+    public Iterator<Pair> getFirst() {
+        return new MockIterator(this);
+    }
+}
diff --git a/src/main/java/net/kaaass/rumbase/index/mock/MockIterator.java b/src/main/java/net/kaaass/rumbase/index/mock/MockIterator.java
@@ -0,0 +1,66 @@
+package net.kaaass.rumbase.index.mock;
+
+import net.kaaass.rumbase.index.Pair;
+
+import java.util.Iterator;
+import java.util.LinkedList;
+
+public class MockIterator implements Iterator {
+    private MockBtreeIndex mockBtreeIndex;
+    private Iterator tempIterator;
+    private long tempKey;
+    private boolean state = true;
+
+    public MockIterator(MockBtreeIndex mockBtreeIndex) {
+        this.mockBtreeIndex = mockBtreeIndex;
+        var v = mockBtreeIndex.getHashMap().entrySet().iterator().next();
+        tempIterator = v.getValue().iterator();
+        tempKey = v.getKey();
+    }
+
+    public MockIterator(MockBtreeIndex mockBtreeIndex,long keyHash,boolean isWith) {
+        this.mockBtreeIndex = mockBtreeIndex;
+        if (isWith == true){
+            do {
+                var v = mockBtreeIndex.getHashMap().entrySet().iterator().next();
+                if (v == null) {
+                    state = false;
+                    break;
+                }
+                tempIterator = v.getValue().iterator();
+                tempKey = v.getKey();
+            } while (tempKey < keyHash);
+        }
+        else
+        {
+            do {
+                var v = mockBtreeIndex.getHashMap().entrySet().iterator().next();
+                if (v == null) {
+                    state = false;
+                    break;
+                }
+                tempIterator = v.getValue().iterator();
+                tempKey = v.getKey();
+            } while (tempKey <= keyHash);
+        }
+    }
+
+    @Override
+    public boolean hasNext() {
+        return mockBtreeIndex.getHashMap().entrySet().iterator().hasNext();
+    }
+
+
+    @Override
+    public Object next() {
+        if (state == false) return null;
+        Pair res = new Pair(tempKey, (Long) tempIterator.next());
+        if (!tempIterator.hasNext()) {
+            var v = mockBtreeIndex.getHashMap().entrySet().iterator().next();
+            if (v == null) return null;
+            tempIterator = v.getValue().iterator();
+            tempKey = v.getKey();
+        }
+        return res;
+    }
+}