GeoHash代码实现--java

GeoHash代码实现–java

package com.sd.leo.geohash;

import java.util.ArrayList;
import java.util.BitSet;
import java.util.HashMap;

public class GeoHash {

    public static final double MINLAT = -90;
    public static final double MAXLAT = 90;
    public static final double MINLNG = -180;
    public static final double MAXLNG = 180;

    private static int numbits = 20; //经纬度单独编码长度

    private static double minLat;
    private static double minLng;


    private final static char[] digits = {'0', '1', '2', '3', '4', '5', '6', '7', '8',
            '9', 'b', 'c', 'd', 'e', 'f', 'g', 'h', 'j', 'k', 'm', 'n', 'p',
            'q', 'r', 's', 't', 'u', 'v', 'w', 'x', 'y', 'z'};

    //定义编码映射关系
    final static HashMap<Character, Integer> lookup = new HashMap<Character, Integer>();

    //初始化编码映射内容
    static {
        int i = 0;
        for (char c : digits) {
            lookup.put(c, i++);
        }
    }

    public GeoHash() {
        setMinLatLng();
    }

    public String encode(double lat, double lon) {
        BitSet latbits = getBits(lat, -90, 90);
        BitSet lonbits = getBits(lon, -180, 180);
        StringBuilder buffer = new StringBuilder();
        for (int i = 0; i < numbits; i++) {
            buffer.append((lonbits.get(i)) ? '1' : '0');//添加经度的编码
            buffer.append((latbits.get(i)) ? '1' : '0');//添加纬度的编码
        }
        String code = base32(Long.parseLong(buffer.toString(), 2));
        //Log.i("okunu", "encode  lat = " + lat + "  lng = " + lon + "  code = " + code);
        return code;
    }



    //根据经纬度和范围,获取对应的二进制
    private BitSet getBits(double lat, double floor, double ceiling) {
        BitSet buffer = new BitSet(numbits);//指定初始大小为numbits
        for (int i = 0; i < numbits; i++) {
            double mid = (floor + ceiling) / 2;//求二分法中间值
            //大于中心值记为true
            if (lat >= mid) {
                buffer.set(i);//将指定索引处的位设置为 true。
                floor = mid;  //区间设置为(mid,ceiling)
            } else {
                ceiling = mid;//区间设置为(floor,mid)
            }
        }
        return buffer;
    }

    //将经纬度合并后的二进制进行指定的32位编码
    private String base32(long i) {
        char[] buf = new char[65];
        int charPos = 64;
        boolean negative = (i < 0);
        if (!negative) {
            i = -i;
        }
        while (i <= -32) {
            //逆序赋值
            buf[charPos--] = digits[(int) (-(i % 32))];
            i /= 32;
        }
        buf[charPos] = digits[(int) (-i)];
        if (negative) {
            buf[--charPos] = '-';
        }
        return new String(buf, charPos, (65 - charPos));//从charPos开始,到65 - charPos开始解译,也就是从最后赋值的
    }

    private void setMinLatLng() {
        //计算经纬度的最小单元,最小的区间的中心值
        minLat = MAXLAT - MINLAT;
        for (int i = 0; i < numbits; i++) {
            minLat /= 2.0;
        }
        minLng = MAXLNG - MINLNG;
        for (int i = 0; i < numbits; i++) {
            minLng /= 2.0;
        }
    }

    //对编码后的字符串解码
    public double[] decode(String geohash) {
        StringBuilder buffer = new StringBuilder();
        for (char c : geohash.toCharArray()) {
            int i = lookup.get(c) + 32;//32的二进制为:100000,要让每位十进制数转为二进制时,都满五位,所以+32
            buffer.append(Integer.toString(i, 2).substring(1));//去掉最高位,减32,还原数字
        }

        BitSet lonset = new BitSet();
        BitSet latset = new BitSet();

        //偶数位,经度,从0开始,每次后移两位
        int j = 0;
        for (int i = 0; i < numbits * 2; i += 2) {
            boolean isSet = false;
            if (i < buffer.length()) {
                isSet = buffer.charAt(i) == '1';
            }
            lonset.set(j++, isSet);
        }

        //奇数位,纬度,从1开始,每次后移两位
        j = 0;
        for (int i = 1; i < numbits * 2; i += 2) {
            boolean isSet = false;
            if (i < buffer.length()) {
                isSet = buffer.charAt(i) == '1';
            }
            latset.set(j++, isSet);
        }

        double lon = decode(lonset, -180, 180);
        double lat = decode(latset, -90, 90);

        return new double[]{lat, lon};
    }

    //根据二进制和范围解码
    private double decode(BitSet bs, double floor, double ceiling) {
        double mid = 0;
        for (int i = 0; i < bs.length(); i++) {
            //区间中心值
            mid = (floor + ceiling) / 2;
            if (bs.get(i)) {
                floor = mid;
            } else {
                ceiling = mid;
            }
        }
        return mid;
    }

    //查询该经纬度的geoHash以及该geoHash附近的8个geoHash点
    public ArrayList<String> getArroundGeoHash(double lat, double lon) {
        //Log.i("okunu", "getArroundGeoHash  lat = " + lat + "  lng = " + lon);
        ArrayList<String> list = new ArrayList<>();
        double uplat = lat + minLat;
        double downLat = lat - minLat;

        double leftlng = lon - minLng;
        double rightLng = lon + minLng;

        String leftUp = encode(uplat, leftlng);
        list.add(leftUp);

        String leftMid = encode(lat, leftlng);
        list.add(leftMid);

        String leftDown = encode(downLat, leftlng);
        list.add(leftDown);

        String midUp = encode(uplat, lon);
        list.add(midUp);

        String midMid = encode(lat, lon);
        list.add(midMid);

        String midDown = encode(downLat, lon);
        list.add(midDown);

        String rightUp = encode(uplat, rightLng);
        list.add(rightUp);

        String rightMid = encode(lat, rightLng);
        list.add(rightMid);

        String rightDown = encode(downLat, rightLng);
        list.add(rightDown);

        //Log.i("okunu", "getArroundGeoHash list = " + list.toString());
        return list;
    }

    public static void main(String[] args) throws Exception {
        GeoHash geohash = new GeoHash();
        String  geoHashCode= geohash.encode(40.222012, 116.248283);
        System.out.println(geoHashCode);
        ArrayList<String> arroundGeoHash = geohash.getArroundGeoHash(40.222012, 116.248283);
        System.out.println(arroundGeoHash);
        //对geoHash点解码
        double[] geo = geohash.decode(geoHashCode);
        //geo[0]为纬度,geo[1]为经度
        System.out.println(geo[0] + " " + geo[1]);
    }
}

  • 0
    点赞
  • 6
    收藏
    觉得还不错? 一键收藏
  • 打赏
    打赏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包

打赏作者

跳舞 D 猴子

你的鼓励将是我创作的最大动力

¥1 ¥2 ¥4 ¥6 ¥10 ¥20
扫码支付:¥1
获取中
扫码支付

您的余额不足,请更换扫码支付或充值

打赏作者

实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值