jageocoder 2.1.7.dev3__tar.gz → 2.1.7.post1__tar.gz

{jageocoder-2.1.7.dev3 → jageocoder-2.1.7.post1}/PKG-INFO

@@ -1,6 +1,6 @@
 Metadata-Version: 2.1
 Name: jageocoder
-Version: 2.1.7.dev3
+Version: 2.1.7.post1
 Summary: A Japanese-address geocoder for Python.
 Home-page: https://github.com/t-sagara/jageocoder/
 License: The MIT License

{jageocoder-2.1.7.dev3 → jageocoder-2.1.7.post1}/jageocoder/__init__.py

@@ -19,7 +19,7 @@ running the following steps.
     >>> jageocoder.searchNode('<Japanese-address>')
 """
 
-__version__ = '2.1.7.dev3'  # The package version
+__version__ = '2.1.7.post1'  # The package version
 __dictionary_version__ = '20230927'  # Compatible dictionary version
 __author__ = 'Takeshi Sagara <sagara@info-proto.com>'
 

{jageocoder-2.1.7.dev3 → jageocoder-2.1.7.post1}/jageocoder/module.py

@@ -63,16 +63,25 @@ def init(db_dir: Optional[os.PathLike] = None,
 
     _url = None
     _db_dir = None
+
+    # Check parameters
     if db_dir is not None:
         _db_dir = db_dir
     elif url is not None and mode == 'r':
         _url = url
-    elif os.environ.get('JAGEOCODER_DB2_DIR'):
-        _db_dir = get_db_dir(mode=mode)
 
+    # Check environmental variables
     if _db_dir is None and _url is None:
-        _url = os.environ.get('JAGEOCODER_SERVER_URL')
+        if os.environ.get('JAGEOCODER_DB2_DIR'):
+            _db_dir = get_db_dir(mode=mode)
+        elif os.environ.get('JAGEOCODER_SERVER_URL') and mode == 'r':
+            _url = os.environ.get('JAGEOCODER_SERVER_URL')
 
+    # Search local database
+    if _db_dir is None and _url is None:
+        _db_dir = get_db_dir(mode=mode)
+
+    # Initialize tree object
     if _db_dir:
         _tree = AddressTree(db_dir=_db_dir, mode=mode, debug=debug)
     elif _url:
@@ -293,7 +302,7 @@ def installed_dictionary_version(
         If omitted, it will be determined by `get_db_dir()`.
 
     url: str, optional
-        URL of the Jageocoder server endpoint.        
+        URL of the Jageocoder server endpoint.
 
     Returns
     -------
@@ -337,7 +346,7 @@ def installed_dictionary_readme(
         If omitted, it will be determined by `get_db_dir()`.
 
     url: str, optional
-        URL of the Jageocoder server endpoint.        
+        URL of the Jageocoder server endpoint.
 
     Returns
     -------
@@ -473,7 +482,7 @@ def reverse(
     -----
     - The result list contains up to 3 nodes.
     - Each element is a dict type with the following structure:
-        {"candidate":AddressNode, "dist":float} 
+        {"candidate":AddressNode, "dist":float}
     """
     if not is_initialized():
         raise JageocoderError("Not initialized. Call 'init()' first.")

{jageocoder-2.1.7.dev3 → jageocoder-2.1.7.post1}/jageocoder/node.py

@@ -1512,6 +1512,17 @@ class AddressNode(object):
 
         return ''
 
+    def get_machiaza_id(self) -> str:
+        """
+        Returns the MachiAza ID defined by JDA address-base-registry
+        containing this node.
+
+        Note
+        ----
+        - This method is an alias for 'get_aza_id'.
+        """
+        return self.get_aza_id()
+
     def get_aza_code(self) -> str:
         """
         Returns the 'AZA-code' concatinated with the city-code

{jageocoder-2.1.7.dev3 → jageocoder-2.1.7.post1}/jageocoder/remote.py

@@ -1,9 +1,9 @@
-from functools import lru_cache
+from __future__ import annotations
 import json
 from logging import getLogger
 import os
 import requests
-from typing import Any, List, NoReturn, Optional, Union
+from typing import Any, List, NoReturn, Optional
 import uuid
 
 from jageocoder.address import AddressLevel
@@ -14,56 +14,17 @@ from jageocoder.tree import AddressTree, LRU
 
 
 logger = getLogger(__name__)
-_session = None
-
-
-def _json_request(
-        url: str,
-        method: str,
-        params: object,
-) -> Any:
-    global _session
-    payload = {
-        "jsonrpc": "2.0",
-        "method": method,
-        "params": params,
-        "id": str(uuid.uuid4()),
-    }
-    if _session is None:
-        logger.debug("Start a new HTTP session with the remote tree.")
-        _session = requests.Session()
-
-    logger.debug(
-        "Send JSON-RPC request ---\n" +
-        json.dumps(payload, indent=2, ensure_ascii=False)
-    )
-    response = _session.post(
-        url=url,
-        data=json.dumps(payload),
-        headers={"Content-Type": "application/json"}
-    ).json()
-
-    if "error" in response:
-        raise RemoteTreeException(response["error"])
-
-    logger.debug(
-        "Receive JSON-RPC response ---\n" +
-        json.dumps(response["result"], indent=2, ensure_ascii=False)
-    )
-
-    return response["result"]
 
 
 class RemoteDataset(object):
 
-    def __init__(self, url: str) -> None:
-        self.url = url
+    def __init__(self, tree: RemoteTree) -> None:
+        self.tree = tree
         self.records = {}
         self._map = {}
 
     def load_record(self, id: int) -> None:
-        rpc_result = _json_request(
-            url=self.url,
+        rpc_result = self.tree.json_request(
             method="dataset.get",
             params={"id": id},
         )
@@ -79,9 +40,9 @@ class RemoteDataset(object):
 
 class RemoteNodeTable(object):
 
-    def __init__(self, url: str) -> None:
-        self.url = url
-        self.datasets = RemoteDataset(url=url)
+    def __init__(self, tree: RemoteTree) -> None:
+        self.tree = tree
+        self.datasets = RemoteDataset(tree=tree)
         self.cache = LRU()
         self.server_signature = None
         self.mode = 'r'   # Always read only
@@ -96,8 +57,7 @@ class RemoteNodeTable(object):
             that requires dictionary consistency to ensure
             the server has not been restarted during processing.
         """
-        server_signature = _json_request(
-            url=self.url,
+        server_signature = self.tree.json_request(
             method="jageocoder.server_signature",
             params=[],
         )
@@ -126,8 +86,7 @@ class RemoteNodeTable(object):
         if pos in self.cache:
             return self.cache[pos]
 
-        rpc_result = _json_request(
-            url=self.url,
+        rpc_result = self.tree.json_request(
             method="node.get_record",
             params={"pos": pos, "server": self.server_signature},
         )
@@ -166,8 +125,7 @@ class RemoteNodeTable(object):
         - TRIE index must be created on the column before searching.
         - The TRIE index file will be automatically opened if it exists.
         """
-        rpc_result = _json_request(
-            url=self.url,
+        rpc_result = self.tree.json_request(
             method="node.search_records_on",
             params={
                 "attr": attr,
@@ -204,8 +162,16 @@ class RemoteNodeTable(object):
         List[Record]
             List of records.
         """
-        nodes = self.search_records_on(attr, value)
-        ids = [node.id for node in nodes]
+        rpc_result = self.tree.json_request(
+            method="node.search_records_on",
+            params={
+                "attr": attr,
+                "value": value,
+                "funcname": "get",
+                "server": self.server_signature
+            },
+        )
+        ids = [record["id"] for record in rpc_result]
         return ids
 
 
@@ -241,9 +207,10 @@ class RemoteTree(AddressTree):
         debug: bool, optional (default=False)
             Debugging flag. If set to True, write debugging messages.
         """
+        self._session = None
         self.url = url
         self.debug = debug
-        self.address_nodes = RemoteNodeTable(url)
+        self.address_nodes = RemoteNodeTable(tree=self)
         self.config = {
             'debug': self.debug,
             'aza_skip': os.environ.get('JAGEOCODER_OPT_AZA_SKIP'),
@@ -294,10 +261,45 @@ class RemoteTree(AddressTree):
             self.validate_config(key=k, value=v)
             self.config[k] = v
 
+    def json_request(
+            self,
+            method: str,
+            params: object,
+    ) -> Any:
+        payload = {
+            "jsonrpc": "2.0",
+            "method": method,
+            "params": params,
+            "id": str(uuid.uuid4()),
+        }
+        if self._session is None:
+            logger.debug("Start a new HTTP session with the remote tree.")
+            self._session = requests.Session()
+
+        logger.debug(
+            "Send JSON-RPC request ---\n" +
+            json.dumps(payload, indent=2, ensure_ascii=False)
+        )
+        response = self._session.post(
+            url=self.url,
+            data=json.dumps(payload),
+            headers={"Content-Type": "application/json"}
+        ).json()
+
+        if "error" in response:
+            raise RemoteTreeException(response["error"])
+
+        logger.debug(
+            "Receive JSON-RPC response ---\n" +
+            json.dumps(response["result"], indent=2, ensure_ascii=False)
+        )
+
+        return response["result"]
+
     def _close(self) -> None:
-        if _session:
-            del _session
-            _session = None
+        if self._session:
+            del self._session
+            self._session = None
 
     def get_trie_nodes(self) -> NoReturn:
         raise RemoteTreeException(
@@ -305,8 +307,7 @@ class RemoteTree(AddressTree):
         )
 
     def installed_dictionary_version(self) -> str:
-        return _json_request(
-            url=self.url,
+        return self.json_request(
             method="jageocoder.installed_dictionary_version",
             params={},
         )
@@ -342,8 +343,7 @@ class RemoteTree(AddressTree):
         [[[11460207:東京都(139.69178,35.68963)1(lasdec:130001/jisx0401:13)]>[12063502:多摩市(139.446366,35.636959)3(jisx0402:13224)]>[12065383:落合(139.427097,35.624877)5(None)]>[12065384:一丁目(139.427097,35.624877)6(None)]>[12065390:15番地(139.428969,35.625779)7(None)], '多摩市落合1-15-']]
         """  # noqa: E501
         self.address_nodes.update_server_signature()
-        rpc_result = _json_request(
-            url=self.url,
+        rpc_result = self.json_request(
             method="jageocoder.searchNode",
             params={"query": query, "config": self.config},
         )
@@ -384,11 +384,10 @@ class RemoteTree(AddressTree):
         -----
         - The result list contains up to 3 nodes.
         - Each element is a dict type with the following structure:
-            {"candidate":AddressNode, "dist":float} 
+            {"candidate":AddressNode, "dist":float}
         """
         self.address_nodes.update_server_signature()
-        rpc_result = _json_request(
-            url=self.url,
+        rpc_result = self.json_request(
             method="jageocoder.reverse",
             params={
                 "x": x,

{jageocoder-2.1.7.dev3 → jageocoder-2.1.7.post1}/jageocoder/rtree.py

@@ -1,5 +1,4 @@
 from abc import ABC
-import copy
 from logging import getLogger
 import os
 from typing import Iterable, List, Optional, Tuple
@@ -321,6 +320,7 @@ class Index(object):
         node_table: AddressNodeTable = self._tree.address_nodes
 
         max_id = node_table.count_records()
+        registered_coordinates = set()
 
         logger.info("Building RTree for reverse geocoding...")
         id = AddressNode.ROOT_NODE_ID
@@ -331,18 +331,69 @@ class Index(object):
                 prev_id = id
 
                 node = node_table.get_record(pos=id)
-                if node.level <= AddressLevel.WARD or node.level > AddressLevel.BLOCK:
+                if node.level <= AddressLevel.WARD:
+                    registered_coordinates.clear()
                     id += 1
                     continue
 
-                if not node.has_valid_coordinate_values():
-                    node = node.add_dummy_coordinates()
+                if node.sibling_id == node.id + 1:
+                    # The node has no child nodes
+
+                    if not node.has_valid_coordinate_values():
+                        id += 1
+                        continue
+
+                    key = (node.x, node.y)
+                    if key in registered_coordinates:
+                        id += 1
+                        continue
 
-                if node.has_valid_coordinate_values():
                     file_idx.insert(
                         id=id,
                         coordinates=(node.x, node.y, node.x, node.y),
                     )
+                    registered_coordinates.add(key)
+                    id += 1
+                    continue
+
+                # The node has 1 or more child nodes
+                if node.level == AddressLevel.BLOCK:
+                    # Get BDR of child nodes
+                    bdr = None
+                    for child_id in range(node.id + 1, node.sibling_id):
+                        child_node = node_table.get_record(child_id)
+                        if not child_node.has_valid_coordinate_values():
+                            continue
+
+                        if bdr is None:
+                            bdr = (child_node.x, child_node.y,
+                                   child_node.x, child_node.y)
+                        else:
+                            bdr = (
+                                min(child_node.x, bdr[0]),
+                                min(child_node.y, bdr[1]),
+                                max(child_node.x, bdr[2]),
+                                max(child_node.y, bdr[3]),
+                            )
+
+                    if bdr:
+                        file_idx.insert(
+                            id=id,
+                            coordinates=bdr,
+                        )
+                    else:
+                        # All child nodes have invalid coordinate values
+                        key = (node.x, node.y)
+                        if node.has_valid_coordinate_values() and \
+                                key not in registered_coordinates:
+                            file_idx.insert(
+                                id=id,
+                                coordinates=(node.x, node.y, node.x, node.y),
+                            )
+                            registered_coordinates.add(key)
+
+                    id = node.sibling_id
+                    continue
 
                 id += 1
 
@@ -377,7 +428,6 @@ class Index(object):
         """
         node_table = self._tree.address_nodes
         node = node_table.get_record(pos=node_table.count_records() // 2)
-
         while True:
             while node.level < AddressLevel.BLOCK:
                 node = node_table.get_record(pos=node.id + 1)
@@ -390,16 +440,26 @@ class Index(object):
 
             node = node_table.get_record(pos=node.sibling_id)
 
-        results = tuple(self.idx.nearest((node.x, node.y, node.x, node.y), 20))
-        return len(results) > 0 and node.id in results
+        results = tuple(self.idx.nearest((node.x, node.y, node.x, node.y), 1, objects=True))
+        if len(results) == 0:
+            return False
+
+        item = results[0]
+        target_node = node_table.get_record(item.id)
+        target_bbox = item.bbox
+        res = target_node.x >= target_bbox[0] \
+            and target_node.y >= target_bbox[1] \
+            and target_node.x <= target_bbox[2] \
+            and target_node.y <= target_bbox[3]
+
+        return res
 
     def _sort_by_dist(
         self,
         lon: float,
         lat: float,
-        id_list: Iterable[int],
-        node_map: Optional[dict] = None,
-    ) -> Tuple[List[NodeDist], dict]:
+        nodes: Iterable[AddressNode],
+    ) -> List[NodeDist]:
         """
         Sort nodes by real(projected) distance from the target point.
 
@@ -409,31 +469,24 @@ class Index(object):
             The longitude of the target point.
         lat: float
             The latitude of the target point.
-        id_list: Iterable[int]
-            The list of node-id.
+        nodes: Iterable[AddressNode]
+            The list of candidate node.
 
         Returns
         -------
-        Tuple[List[NodeDist], dict]
-            The sorted list of (distance, address node) and a node map.
+        List[NodeDist]
+            The sorted list of (distance, address node).
         """
-        node_map = node_map or {}
         results = []
-        for node_id in set(id_list):
-            node = self._tree.get_node_by_id(node_id=node_id)
+        for node in nodes:
             if not node.has_valid_coordinate_values():
-                node = node.add_dummy_coordinates()
+                continue
 
-            key = (node.x, node.y)
-            if key in node_map:
-                node_map[key].append(node)
-            else:
-                node_map[key] = [node]
-                dist = self.distance(node.x, node.y, lon, lat)
-                results.append(NodeDist(dist, node))
+            dist = self.distance(node.x, node.y, lon, lat)
+            results.append(NodeDist(dist, node))
 
         results.sort(key=lambda x: x.dist)
-        return (results, node_map)
+        return results
 
     def nearest(
         self,
@@ -463,117 +516,25 @@ class Index(object):
         [{"candidate":AddressNode or dict, "dist":float}]
             Returns the results of retrieval up to 3 nodes.
         """
-
-        def _remove_parent_nodes(
-            candidates: Iterable[NodeDist]
-        ) -> List[NodeDist]:
-            ancestors = set()
-            max_level = 0
-            if len(candidates) == 0:
-                return []
-
-            nodes = []
-            for v in candidates:
-                dist, node = v.dist, v.node
-                if node.id in ancestors:
-                    continue
-
-                if not node.has_valid_coordinate_values():
-                    node = node.add_dummy_coordinates()
-
-                nodes.append(NodeDist(dist, node))
-                max_level = max(max_level, node.level)
-
-                # List ancestor nodes of registering node.
-                cur = node.parent
-                while cur is not None:
-                    # nodes = [node for node in nodes if node.id != cur.id]
-                    ancestors.add(cur.id)
-                    cur = cur.parent
-
-            # Exclude ancestor nodes
-            nodes = [node for node in nodes if node.node.id not in ancestors]
-            return nodes
-
-        def _get_k_nearest_child_nodes(
-            aza_node_dists: List[NodeDist],
-            *,
-            candidates: Optional[List[NodeDist]] = None,
-            node_map: Optional[dict] = None,
-            k: Optional[int] = 20,
-            min_k: Optional[int] = 0,
-            max_dist: Optional[float] = 500.0,
-        ) -> Tuple[List[NodeDist], dict]:
-            candidates = candidates or []
-            node_map = node_map or {}
-            for v in aza_node_dists:
-                dist, node = v.dist, v.node
-                child_id = node.id + 1
-                for child_id in range(node.id + 1, node.sibling_id):
-                    child_node = self._tree.get_node_by_id(
-                        node_id=child_id)
-                    if child_node.level > level:
-                        continue
-
-                    if not child_node.has_valid_coordinate_values():
-                        if child_node.level == level:
-                            continue
-
-                        child_node = child_node.add_dummy_coordinates()
-                        if not child_node.has_valid_coordinate_values():
-                            continue
-
-                    key = (child_node.x, child_node.y)
-                    if key in node_map:
-                        # A node with the same coordinates are already registered
-                        node_map[key].append(child_node)
-                        continue
-
-                    dist = self.distance(x, y, child_node.x, child_node.y)
-                    i = len(candidates)
-                    while i > 0:
-                        if dist >= candidates[i - 1].dist:
-                            break
-
-                        i -= 1
-
-                    if i < min_k or (i < k and dist <= max_dist):
-                        candidates.insert(i, NodeDist(dist, child_node))
-                        node_map[key] = [child_node]
-                        n = len(candidates)
-                        if n > k:
-                            delnode = candidates[k].node
-                            del candidates[k]
-                            delkey = (delnode.x, delnode.y)
-                            node_map[delkey].remove(delnode)
-                            if len(node_map[delkey]) == 0:
-                                del node_map[delkey]
-
-                        elif n > min_k and candidates[min_k].dist > max_dist:
-                            delnode = candidates[min_k].node
-                            del candidates[min_k]
-                            delkey = (delnode.x, delnode.y)
-                            node_map[delkey].remove(delnode)
-                            if len(node_map[delkey]) == 0:
-                                del node_map[delkey]
-
-            return (candidates, node_map)
-
         level = level or AddressLevel.AZA
 
         # Retrieve top k-nearest nodes using the R-tree index.
-        nearests = self.idx.nearest((x, y, x, y), 20)
-        node_dists, node_map = self._sort_by_dist(x, y, nearests)
-        node_dists = _remove_parent_nodes(node_dists)
-
-        if level > AddressLevel.BLOCK:
-            candidates, node_map = _get_k_nearest_child_nodes(
-                node_dists,
-                candidates=copy.copy(node_dists),
-                node_map=node_map,
-                min_k=1)
+        # If the node registered in the index is an intermediate node,
+        # expand its leaf nodes.
+        candidates = []
+        nearests = self.idx.nearest((x, y, x, y), 20, objects=True)
+        for item in nearests:
+            node = self._tree.get_node_by_id(item.id)
+            if item.bbox[0] == item.bbox[2] and item.bbox[1] == item.bbox[3]:
+                candidates.append(node)
+            else:
+                for child_id in range(node.id + 1, node.sibling_id):
+                    child_node = self._tree.get_node_by_id(child_id)
+                    if child_node.sibling_id == child_id + 1 and \
+                            child_node.has_valid_coordinate_values():
+                        candidates.append(child_node)
 
-            node_dists = _remove_parent_nodes(candidates)
+        node_dists = self._sort_by_dist(x, y, candidates)
 
         # Select the 3 nodes that make the smallest triangle
         # surrounding the target point
@@ -589,17 +550,6 @@ class Index(object):
         else:
             node_dists = DelaunayTriangle.select(x, y, node_dists)
 
-        # Restore nodes with the same coordinates
-        if node_map is not None:
-            _node_dists = []
-            for v in node_dists:
-                dist, node = v.dist, v.node
-                key = (node.x, node.y)
-                for n in node_map[key]:
-                    _node_dists.append(NodeDist(dist, n))
-
-            node_dists = _node_dists
-
         # Convert nodes to the dict format.
         results = []
         registered = set()
@@ -607,23 +557,14 @@ class Index(object):
             dist, node = v.dist, v.node
             while node.level > level:
                 node = node.parent
-                dist = None
-                if not node.has_valid_coordinate_values():
-                    node.x, node.y = v.node.x, v.node.y
 
             if node.id in registered:
                 continue
 
-            if dist is None:
-                dist = self.distance(x, y, node.x, node.y)
-
             results.append({
                 "candidate": node.as_dict() if as_dict else node,
                 "dist": dist
             })
             registered.add(node.id)
 
-        # Sort by distance
-        results = sorted(results, key=lambda r: r['dist'])
-
         return results

{jageocoder-2.1.7.dev3 → jageocoder-2.1.7.post1}/jageocoder/tree.py

@@ -9,6 +9,7 @@ from typing import Any, Union, List, Set, Optional
 
 from deprecated import deprecated
 
+import jaconv
 from jageocoder.address import AddressLevel
 from jageocoder.aza_master import AzaMaster
 from jageocoder.exceptions import AddressTreeException
@@ -849,7 +850,7 @@ class AddressTree(object):
             key = index[0:offset]
             rest_index = index[offset:]
             for node_id in trie_node.nodes:
-                node = self.get_address_node(id=node_id)
+                node = self.get_node_by_id(node_id=node_id)
 
                 if not node.has_valid_coordinate_values() \
                         and self.get_config('require_coordinates'):
@@ -1160,7 +1161,7 @@ class AddressTree(object):
         -----
         - The result list contains up to 3 nodes.
         - Each element is a dict type with the following structure:
-            {"candidate":AddressNode, "dist":float} 
+            {"candidate":AddressNode, "dist":float}
         """
         if self.reverse_index is None:
             from jageocoder.rtree import Index
@@ -1168,6 +1169,15 @@ class AddressTree(object):
 
         return self.reverse_index.nearest(x=x, y=y, level=level, as_dict=as_dict)
 
+    @classmethod
+    def _clean_numerical_string(cls, code: str) -> str:
+        """
+        Clean numeric string.
+        """
+        code = jaconv.zen2han(code, kana=False, ascii=False, digit=True)
+        code = re.sub(r'\D', '', code)
+        return code
+
     def search_by_machiaza_id(
             self,
             id: str
@@ -1194,6 +1204,7 @@ class AddressTree(object):
         - Otherwise, it searches for address nodes whose machiaza-id matches "id"
             from all municipalities. In this case, aza_id must be 7 characters.
         """
+        id = self._clean_numerical_string(id)
         if len(id) == 12:
             # jisx0402(5digits) + aza_id(7digits)
             citynode = self.search_by_citycode(code=id[0:5])
@@ -1247,6 +1258,7 @@ class AddressTree(object):
         -----
         - The "code" must be 7 characters.
         """
+        code = self._clean_numerical_string(code)
         if len(code) == 7:
             # Postcode(7digits)
             return self.search_nodes_by_codes(
@@ -1277,6 +1289,7 @@ class AddressTree(object):
         - If "code" is 2 characters, the code is considered the JISX0401 code.
         - If "code" is 6 characters, the code is considered the local-govenment code.
         """
+        code = self._clean_numerical_string(code)
         if len(code) == 2:
             # jisx0401(2digits)
             return self.search_nodes_by_codes(
@@ -1313,6 +1326,7 @@ class AddressTree(object):
         - If "code" is 5 characters, the code is considered the JISX0402 code.
         - If "code" is 6 characters, the code is considered the local-govenment code.
         """
+        code = self._clean_numerical_string(code)
         if len(code) == 5:
             # jisx0402(5digits)
             return self.search_nodes_by_codes(

{jageocoder-2.1.7.dev3 → jageocoder-2.1.7.post1}/pyproject.toml

@@ -1,6 +1,6 @@
 [tool.poetry]
 name = "jageocoder"
-version = "2.1.7.dev3"
+version = "2.1.7.post1"
 description = "A Japanese-address geocoder for Python."
 authors = ["Takeshi Sagara <sagara@info-proto.com>"]
 repository = "https://github.com/t-sagara/jageocoder/"