zoukankan
html css js c++ java
Gmap.net的逆地理编码
protected void Page_Load(object sender, EventArgs e) { if (!Page.IsPostBack) { this.arreglarMapa(); } } private void arreglarMapa() { GMap1.addControl(new GControl(GControl.preBuilt.LargeMapControl)); GMap1.enableHookMouseWheelToZoom = true; StringBuilder sb = new StringBuilder(); sb.Append("function(marker, point) {"); GLatLng latlng = new GLatLng("point"); GInfoWindow window = new GInfoWindow(latlng, "<div style=\"height:140px;\"><blink>Loading...</blink></div>"); sb.Append(window.ToString(GMap1.GMap_Id)); sb.Append("}"); GMap1.addListener(new GListener(GMap1.GMap_Id, GListener.Event.click, sb.ToString())); StringBuilder sb2 = new StringBuilder(); sb2.Append("function goTo(point){"); GLatLng point = new GLatLng("point"); sb2.AppendFormat("{0}.setZoom(11);", GMap1.GMap_Id); GMove move = new GMove(1, point); sb2.Append(move.ToString(GMap1.GMap_Id)); GMarker marker = new GMarker(point); sb2.Append(marker.ToString(GMap1.GMap_Id)); sb2.Append("}"); GMap1.addCustomJavascript(sb2.ToString()); } protected string GMap1_Click(object s, GAjaxServerEventArgs e) { inverseGeocodingManager igeoManager = new inverseGeocodingManager(e.point, "es"); inverseGeocoding iGeos = igeoManager.inverseGeoCodeRequest(); geoName geo; if (iGeos.geonames.Count > 0) { geo = iGeos.geonames[0]; StringBuilder sb = new StringBuilder(); sb.Append("<div align=\"left\">"); sb.Append(""<b>Nearest Place "</b>"); sb.Append("<br />"); sb.AppendFormat("Place name: "<i>{0}"</i> ", geo.name); sb.Append("<br />"); sb.AppendFormat("Point: "<i>{0}"</i>", geo.nearestPlacePoint.ToString()); sb.Append("<br />"); sb.AppendFormat("Elevation: "<i>{0}"</i>", geo.nearestPlaceElevation > -9000 ? geo.nearestPlaceElevation.ToString() : "No info"); sb.Append("<br />"); sb.AppendFormat("Country Name (Code): "<i>{0} ({1})"</i>", geo.countryName, geo.countryCode); sb.Append("<br />"); sb.AppendFormat("Click point - Nearest Place distance (Km): "<i>{0}"</i>", Math.Round(geo.distance, 3)); sb.Append("</div>"); sb.Append("<br />"); sb.Append("<div align=\"left\">"); sb.Append(""<b>Click point"</b>"); sb.Append("<br />"); sb.AppendFormat("Point: "<i>{0}"</i>", geo.initialPoint.ToString()); sb.Append("<br />"); sb.AppendFormat("Elevation: "<i>{0}"</i>", geo.initialPointElevation > -9000 ? geo.initialPointElevation.ToString() : "No info"); sb.Append("<br />"); sb.Append("</div>"); GInfoWindow window = new GInfoWindow(e.point, sb.ToString(), true); return window.ToString(e.map); } else return string.Empty; }
查看全文
相关阅读:
优先队列插入、删除
堆排序
UVALive 2474 Balloons in a Box(枚举)
二叉树的建立、四种遍历、求深度、求叶子结点数
说说尾递归(转载)
1#Two Sum(qsort用法)
马克思:青年在选择职业时的考虑
最要紧的是,我们首先要善良,其次是要诚实,再次是以后永远不要相互遗忘。
多重背包优化算法
poj2976 Dropping tests(01分数规划 好题)
原文地址:https://www.cnblogs.com/javawebsoa/p/2458160.html
最新文章
STM32-CAN通信
STM32-ETH-Lwip以太网通信
STM32-SPI读写串行FLASH
数据库区默认分大小写,改成不区分(记录)
Linux 一些常识命令
PHP 好用的函数
redis 常用操作
框架Thinkphp5 简单的实现行为 钩子 Hook
php-fpm 启动参数及重要配置详解
explain分析sql语句执行效率
热门文章
Jellyfin 安装 Docker 版
更新Host的Bat脚本
Linux内核下的 内核线程,用户线程, 纤程LWP辨析
Linux内核空间布局
Kernel Debug with QEMU
《内核源码情景分析》(浙大)笔记
Makefile自动生成(Automake)
Java注解 Annotation
Java Collection
九大排序算法(C++实现)
Copyright © 2011-2022 走看看