zoukankan
html css js c++ java
Windows Phone 7 开发之检查手机网络
using System; using System.Collections.Generic; using System.Linq; using System.Net; using System.Windows; using System.Windows.Controls; using System.Windows.Documents; using System.Windows.Input; using System.Windows.Media; using System.Windows.Media.Animation; using System.Windows.Shapes; using Microsoft.Phone.Controls; using System.Net.NetworkInformation; using Microsoft.Phone.Net.NetworkInformation; namespace checknet { public partial class MainPage : PhoneApplicationPage { private bool networkIsAvailable; private NetworkInterfaceType _currentNetworkType; //网络连接的类型 public MainPage() { InitializeComponent(); } private void button1_Click(object sender, RoutedEventArgs e) { networkIsAvailable = Microsoft.Phone.Net.NetworkInformation.NetworkInterface.GetIsNetworkAvailable();//当前网络是否可用 _currentNetworkType = Microsoft.Phone.Net.NetworkInformation.NetworkInterface.NetworkInterfaceType;//获取当前网络的类型 if (networkIsAvailable) { Message.Text = "联网状态"; Message.Background = new SolidColorBrush(Colors.Green); } else { Message.Text = "断网状态"; Message.Background = new SolidColorBrush(Colors.Red); } switch (_currentNetworkType) { case NetworkInterfaceType.MobileBroadbandCdma: netname.Text = "Cdma网络"; break; case NetworkInterfaceType.MobileBroadbandGsm: netname.Text = "Csm网络"; break; case NetworkInterfaceType.Wireless80211: netname.Text = "Wireless网络"; break; case NetworkInterfaceType.Ethernet: netname.Text = "Ethernet网络"; break; case NetworkInterfaceType.None: netname.Text = "网络不可用"; break; default: netname.Text = "其他的网络"; break; } } } }
查看全文
相关阅读:
POJ 2029 (二维树状数组)题解
HDU 4819 Mosaic (二维线段树&区间最值)题解
HDU 1823 Luck and Love (二维线段树&区间最值)题解
POJ1061 青蛙的约会(扩展欧几里得)题解
POJ 2155 Matrix (二维树状数组)题解
POJ 1751 Highways(最小生成树&Prim)题解
HDU 6148 Valley Numer (数位DP)题解
HDU3652 B-number(数位DP)题解
HDU 4734 (数位DP)题解
HDU 2089 不要62 (数位DP)题解
原文地址:https://www.cnblogs.com/javawebsoa/p/2458110.html
最新文章
【HDU1205/POJ2356/POJ3370】鸽巢原理专题
【HDU1205/POJ2356/POJ3370】鸽巢原理专题
【BZOJ4034】树上操作(HAOI2015)-树链剖分
【BZOJ4034】树上操作(HAOI2015)-树链剖分
【APIO2009T3】抢掠计划-强连通分量缩点+DAG单源最长路
【APIO2009T3】抢掠计划-强连通分量缩点+DAG单源最长路
【BashuOJ1145】虚-组合数+求逆元
【BashuOJ1145】虚-组合数+求逆元
【HDU3622】Bomb Game-二分答案+2-SAT
【HDU3622】Bomb Game-二分答案+2-SAT
热门文章
deleted
deleted
deleted
deleted
deleted
deleted
deleted
deleted
deleted
deleted
Copyright © 2011-2022 走看看