zoukankan      html  css  js  c++  java
  • 原生js获取手机定位信息

    <script type="text/javascript">
    function Location() {};

    Location.prototype.getLocation = function (callback) {
    var options = {
    enableHighAccuracy: true,
    maximumAge: 1000
    };
    this.callback = Object.prototype.toString.call(callback) == "[object Function]" ?
    callback :
    function (address) {
    alert(address.province + address.city);
    console.log("getocation(callbackFunction) 可获得定位信息对象");
    };
    var self = this;
    if (navigator.geolocation) {
    //浏览器支持geolocation
    navigator.geolocation.getCurrentPosition(function (position) {
    //经度
    var longitude = position.coords.longitude;
    //纬度
    var latitude = position.coords.latitude;
    self.loadMapApi(longitude, latitude);
    }, self.onError, options);
    } else {
    //浏览器不支持geolocation
    }
    };

    Location.prototype.loadMapApi = function (longitude, latitude) {
    var self = this;
    var oHead = document.getElementsByTagName('HEAD').item(0);
    var oScript = document.createElement("script");
    oScript.type = "text/javascript";
    oScript.src = "http://api.map.baidu.com/getscript?v=2.0&ak=A396783ee700cfdb9ba1df281ce36862&services=&t=20140930184510";
    oHead.appendChild(oScript);
    oScript.onload = function (date) {
    var point = new BMap.Point(longitude, latitude);
    var gc = new BMap.Geocoder();
    gc.getLocation(point, function (rs) {
    var addComp = rs.addressComponents;
    self.callback(addComp);
    });
    }
    };

    Location.prototype.onError = function (error) {
    switch (error.code) {
    case 1:
    alert("位置服务被拒绝");
    break;
    case 2:
    alert("暂时获取不到位置信息");
    break;
    case 3:
    alert("获取信息超时");
    break;
    case 4:
    alert("未知错误");
    break;
    }
    };

    //调用
    var local = new Location();
    local.getLocation(function (res) {
    //此处就是返回的地理位置信息
    console.log(res);
    //JSON.stringify(res),把返回的对象转为字符串了,自己根据需求截取下就好
    var resstr = JSON.stringify(res);
    alert(resstr);
    });
    </script>

  • 相关阅读:
    oop klass

    广义表
    Huffman树
    二叉搜索树
    二叉树的前序、中序、后序、层序遍历
    循环链表解决约瑟夫环问题
    搭建局域网SVN代码服务器
    【CheckList】精简用例,提升执行效率,减少漏测(总结篇)
    测试资源不同时,如何有针对性的设计测试用例?
  • 原文地址:https://www.cnblogs.com/lwj820876312/p/9639610.html
Copyright © 2011-2022 走看看