uni-app音频全局播放功能思路 5C

我要在uni-app加音频播放功能,怎么让音频在app内一直播放,切换页面也不消失,播放窗口始终在屏幕下方。哪位大神给个思路?

2个回答

我用#CSDN#这个app发现了有技术含量的博客,小伙伴们求同去《uni-app实现网易云音乐小程序版本》, 一起来围观吧 https://blog.csdn.net/qq_33081841/article/details/100424159?utm_source=app 这个实现了

weixin_44123936
心想))事成 回复grhrhr5: 你解决了吗?用plus.webview.create
6 个月之前 回复
grhrhr5
grhrhr5 回复心想))事成: 卧槽,楼主找到方法没,我也是同样问题,只要切换了页面就断了音乐播放,息屏之后还不能自动播放下一首
7 个月之前 回复
weixin_44123936
心想))事成 这个只是定义全局变量调用,我点击切换页面会中断音频播放吧?
7 个月之前 回复
Csdn user default icon
上传中...
上传图片
插入图片
抄袭、复制答案,以达到刷声望分或其他目的的行为,在CSDN问答是严格禁止的,一经发现立刻封号。是时候展现真正的技术了!
其他相关推荐
uni-app中查找main.css文件查找不见,路径正确,
这个项目在我使用使用的是uni-app框架,在使用uni-app中的dcloud插件的时候他就一直报错,这个路径就是与插件有关的文件,main.css是一个css库,我只要在app.Vue中添加@import "app.css"保存在把这个代码删除掉就能运行了,但是我用手机模拟器运行的时候怎么也运行不了,有没有大神们帮我看一下,万分感谢,所有回答我的人我都会关注他的,谢谢.![图片说明](https://img-ask.csdn.net/upload/201907/14/1563098581_2789.jpg)
在做一个app,用的uni-app,想要实现跟微信这个差不多的样式功能,点击加号,弹出选项,右边图片右边文字
![图片说明](https://img-ask.csdn.net/upload/201908/01/1564623286_234625.png) 有这样的插件吗
uni-app怎么选中一段文本并弹出一个自己定义的搜索、复制悬浮框,并给选中文字划线。
在安卓和ios端显示的一段文本,当手指长按时会出现“复制、划重点、笔记、讨论、提问、词典”等文字的弹框。然后手指按住选中文字两端的水滴图标,左右上下滑动可以改变选中区域的大小。当点击"划重点"或者“笔记”时就会出现被选中文本的背景色改变。![图片说明](https://img-ask.csdn.net/upload/201907/26/1564109624_893663.png)![图片说明](https://img-ask.csdn.net/upload/201907/26/1564109600_5880.png)
Multi-bit Trie 程序的思想
Problem Description   IP lookup is one of the key functions of routers for packets forwarding and classifying. Generally, IP lookup can be simplified as a Longest Prefix Matching (LPM) problem. That's to find the longest prefix in the Forwarding Information Base (FIB) that matches the input packet's destination address, and then output the corresponding Next Hop information.   Trie-based solution is the most wildly used one to solve LPM. As shown in Fig.1(b), an uni-bit trie is just a binary tree. Processing LPM on it needs only traversing it from the root to some leaf, according to the input packet's destination address. The longest prefix along this traversing path is the matched one. In order to reduce the memory accesses for one lookup, we can compress some consecutively levels of the Uni-bit Trie into one level, transforming the Uni-bit Trie into a Multi-bit Trie.   For example, suppose the strides array is {3, 2, 1, 1}, then we can transform the Uni-bit Trie shown in Fig.1(b) into a Multi-bit Trie as shown in Fig.1(c). During the transforming process, some prefixes must be expanded. Such as 11(P2), since the first stride is 3, it should be expanded to 110(P2) and 111(P2). But 110(P5) is already exist in the FIB, so we only store the longer one 110(P5).   Multi-bit Trie can obviously reduce the tree level, but the problem is how to build a Multi-bit Trie with the minimal memory consumption (the number of memory units). As shown in Fig.1, the Uni-bit Trie has 23 nodes and consumes 46 memory units in total, while the Multi-bit Trie has 12 nodes and consumes 38 memory units in total. Input   The first line is an integer T, which is the number of testing cases.   The first line of each case contains one integer L, which means the number of levels in the Uni-bit Trie.   Following L lines indicate the nodes in each level of the Uni-bit Trie.   Since only 64 bits of an IPv6 address is used for forwarding, a Uni-bit Trie has maximal 64 levels. Moreover, we suppose that the stride for each level of a Multi-bit Trie must be less than or equal to 20. Output   Output the minimal possible memory units consumed by the corresponding Multi-bit Trie. Sample Input 1 7 1 2 4 4 5 4 3 Sample Output 38
iphone6s 中的video标签
![图片说明](https://img-ask.csdn.net/upload/201905/23/1558580962_859937.png) 使用的是uni-app开发,android,ios,小程序端都没有问题。但是H5平台上有点问题,在iPhone6s上浏览时,会出现两个播放按钮,video组件上已经设置了关闭视频中间的播放按钮。就只有iPhone6s上出现这样的问题。如何解决。
Multi-bit Trie 是怎么编写代码
Problem Description   IP lookup is one of the key functions of routers for packets forwarding and classifying. Generally, IP lookup can be simplified as a Longest Prefix Matching (LPM) problem. That's to find the longest prefix in the Forwarding Information Base (FIB) that matches the input packet's destination address, and then output the corresponding Next Hop information.   Trie-based solution is the most wildly used one to solve LPM. As shown in Fig.1(b), an uni-bit trie is just a binary tree. Processing LPM on it needs only traversing it from the root to some leaf, according to the input packet's destination address. The longest prefix along this traversing path is the matched one. In order to reduce the memory accesses for one lookup, we can compress some consecutively levels of the Uni-bit Trie into one level, transforming the Uni-bit Trie into a Multi-bit Trie.   For example, suppose the strides array is {3, 2, 1, 1}, then we can transform the Uni-bit Trie shown in Fig.1(b) into a Multi-bit Trie as shown in Fig.1(c). During the transforming process, some prefixes must be expanded. Such as 11(P2), since the first stride is 3, it should be expanded to 110(P2) and 111(P2). But 110(P5) is already exist in the FIB, so we only store the longer one 110(P5).   Multi-bit Trie can obviously reduce the tree level, but the problem is how to build a Multi-bit Trie with the minimal memory consumption (the number of memory units). As shown in Fig.1, the Uni-bit Trie has 23 nodes and consumes 46 memory units in total, while the Multi-bit Trie has 12 nodes and consumes 38 memory units in total. Input   The first line is an integer T, which is the number of testing cases.   The first line of each case contains one integer L, which means the number of levels in the Uni-bit Trie.   Following L lines indicate the nodes in each level of the Uni-bit Trie.   Since only 64 bits of an IPv6 address is used for forwarding, a Uni-bit Trie has maximal 64 levels. Moreover, we suppose that the stride for each level of a Multi-bit Trie must be less than or equal to 20. Output   Output the minimal possible memory units consumed by the corresponding Multi-bit Trie. Sample Input 1 7 1 2 4 4 5 4 3 Sample Output 38
component 动态组件为子组件, props获取不到数据
props 获取的值为undefined 需求: 1、需要将 父组件获取到的数据传递到对应组件的data里 ,通过:list 传递给小组件到的 这是引入component 的 父组件 ``` <template> <!-- <web-view :webview-styles="webviewStyles" src="https://uniapp.dcloud.io/static/web-view.html"></web-view> --> <eptaskpage :lists="lists"></eptaskpage> </template> <script> import eptaskpage from "@/pages/task/task-page/task-page.vue" export default { components: { eptaskpage, }, data() { return { lists: { banner: [], grid: [], } } }, onLoad() { console.log('开始加载数据') // this.getBanner(), this.getGrid() // this.getLcard2() // this.getAdList(); }, methods: { async getBanner() { let _self = this; let param = { type: '0' }; _self.banner = await _self.$apis.getBanner(param); }, // getGrid() { // var _self = this; // console.log(_self,9585) // }, getGrid() { var _self = this; uni.request({ url: 'http://122.112.191.190:8080/API/more_video', //请求接口 data: { 'video_type': '', 'price_order': '', 'hot_order': '', 'price': 'F', 'discount': '', 'general_order': '' }, success: (res) => { _self.lists.grid = res.data.data console.log(res, "111111111111") this.flag = true } }); }, ``` 这是component 子组件,用import 引入的小组件来动态生成的页面,封装成为组件 ``` <template> <joy-page class="ep-taskpage"> <div v-for="(item,i) in page_template.items" :key="i" v-if="lists"> <component :is="item.component.tag" :list="item.component.data"></component> </div> </joy-page> </template> <script> import { mapState, mapGetters } from 'vuex' import epSearch from "@/components/ep-search/ep-search.vue" import epSwiper from "@/components/ep-swiper/ep-swiper.vue" import listTitM from "@/components/ep-tit/ep-tit-m.vue" import listTit from "@/components/ep-tit/ep-tit.vue" import epGrid from "@/components/ep-grid/ep-grid.vue" import epCard from "@/components/ep-card/ep-card.vue" import epCcard from "@/components/ep-ccard/ep-ccard.vue" import epCcard2 from "@/components/ep-ccard/ep-ccard2.vue" import epBox2 from "@/components/ep-box/ep-box-2.vue" import epLoadMore from '@/components/ep-b-tab/uni-load-more.vue' import epListCp from "@/components/ep-list-c/ep-list-cp.vue" export default { name: 'eptaskpage', components: { epSearch, epSwiper, listTit, epGrid, epCard, epCcard, epCcard2, epBox2, listTitM, epLoadMore, epListCp }, props: { lists: { type: [Array, Object, Number], default () { return } } }, data() { return { page_template: { //页面的模板,整页 template: "", //可以指定前端对应的templete,无则默认 items: [ //页面上的组件数组,按顺序显示 { component: { tag: "ep-search", data: ['grid'] } }, { component: { tag: "ep-swiper", data: ['banner'] } }, { component: { tag: "ep-grid", data: ['grid'] } }, { component: { tag: "list-tit", data: ['listtit'] } }, { component: { tag: "ep-box-2", data: ['adList'] } }, { component: { tag: "list-tit", data: ['listtit'] } }, { component: { tag: "ep-ccard", data: ['lcard'], } }, { component: { tag: "list-tit", data: ['listtit'] } }, { component: { tag: "ep-ccard", data: ['lcard2'], } }, { component: { tag: "list-tit-m", data: ['listTitM'] } }, { component: { tag: "ep-ccard2", data: ['lcard3'], } }, ] }, } }, ```
Multi-bit Trie
Problem Description   IP lookup is one of the key functions of routers for packets forwarding and classifying. Generally, IP lookup can be simplified as a Longest Prefix Matching (LPM) problem. That's to find the longest prefix in the Forwarding Information Base (FIB) that matches the input packet's destination address, and then output the corresponding Next Hop information. ![](http://acm.hdu.edu.cn/data/images/C468-1006-1.jpg)   Trie-based solution is the most wildly used one to solve LPM. As shown in Fig.1(b), an uni-bit trie is just a binary tree. Processing LPM on it needs only traversing it from the root to some leaf, according to the input packet's destination address. The longest prefix along this traversing path is the matched one. In order to reduce the memory accesses for one lookup, we can compress some consecutively levels of the Uni-bit Trie into one level, transforming the Uni-bit Trie into a Multi-bit Trie.   For example, suppose the strides array is {3, 2, 1, 1}, then we can transform the Uni-bit Trie shown in Fig.1(b) into a Multi-bit Trie as shown in Fig.1(c). During the transforming process, some prefixes must be expanded. Such as 11(P2), since the first stride is 3, it should be expanded to 110(P2) and 111(P2). But 110(P5) is already exist in the FIB, so we only store the longer one 110(P5).   Multi-bit Trie can obviously reduce the tree level, but the problem is how to build a Multi-bit Trie with the minimal memory consumption (the number of memory units). As shown in Fig.1, the Uni-bit Trie has 23 nodes and consumes 46 memory units in total, while the Multi-bit Trie has 12 nodes and consumes 38 memory units in total. Input   The first line is an integer T, which is the number of testing cases.   The first line of each case contains one integer L, which means the number of levels in the Uni-bit Trie.   Following L lines indicate the nodes in each level of the Uni-bit Trie.   Since only 64 bits of an IPv6 address is used for forwarding, a Uni-bit Trie has maximal 64 levels. Moreover, we suppose that the stride for each level of a Multi-bit Trie must be less than or equal to 20. Output   Output the minimal possible memory units consumed by the corresponding Multi-bit Trie. Sample Input 1 7 1 2 4 4 5 4 3 Sample Output 38
uniapp怎么实现轨迹显示
想要做一个根据n条经纬度来实现回显车辆的行驶轨迹,现在是使用map的polyline属性来实现,但是地图显示一直是乱的。 ``` selectMap(data).then(res => { if (res.success) { const that = this; that.polylines=[{ points:res.data, width: 2, color: "0000CC" }]; uni.showToast({ icon: 'none', title: "获取位置成功" }); } else { uni.showToast({ icon: 'none', title: res.msg }); } }) ``` ![图片说明](https://img-ask.csdn.net/upload/202001/04/1578143852_422685.png)
uniapp怎么实现轨迹显示?
想用uniapp做车辆的行驶轨迹回显,使用map的polyline属性来做连线,根据n条经纬度连接实现轨迹显示。但是地图显示都是错乱的 ``` <map id="maps" :latitude="latitude" :longitude="longitude" :markers="markers" :polyline="polylines" scale="10"></map> ``` res.data是调用接口返回的经度和纬度集合,需要根据res.data返回的上万条经纬度进行连线形成轨迹图 ![图片说明](https://img-ask.csdn.net/upload/202001/05/1578200579_241803.png) ``` selectMap(data).then(res => { if (res.success) { const that = this; that.polylines=[{ points:res.data, width: 2, color: "0000CC" }]; uni.showToast({ icon: 'none', title: "获取位置成功" }); } else { uni.showToast({ icon: 'none', title: res.msg }); } }) }, ![图片说明](https://img-ask.csdn.net/upload/202001/05/1578200606_624225.png)
来看下这个字符的编码的问题采用C语言怎么做了,位编码怎么得到的数字
Problem Description   IP lookup is one of the key functions of routers for packets forwarding and classifying. Generally, IP lookup can be simplified as a Longest Prefix Matching (LPM) problem. That's to find the longest prefix in the Forwarding Information Base (FIB) that matches the input packet's destination address, and then output the corresponding Next Hop information.   Trie-based solution is the most wildly used one to solve LPM. As shown in Fig.1(b), an uni-bit trie is just a binary tree. Processing LPM on it needs only traversing it from the root to some leaf, according to the input packet's destination address. The longest prefix along this traversing path is the matched one. In order to reduce the memory accesses for one lookup, we can compress some consecutively levels of the Uni-bit Trie into one level, transforming the Uni-bit Trie into a Multi-bit Trie.   For example, suppose the strides array is {3, 2, 1, 1}, then we can transform the Uni-bit Trie shown in Fig.1(b) into a Multi-bit Trie as shown in Fig.1(c). During the transforming process, some prefixes must be expanded. Such as 11(P2), since the first stride is 3, it should be expanded to 110(P2) and 111(P2). But 110(P5) is already exist in the FIB, so we only store the longer one 110(P5).   Multi-bit Trie can obviously reduce the tree level, but the problem is how to build a Multi-bit Trie with the minimal memory consumption (the number of memory units). As shown in Fig.1, the Uni-bit Trie has 23 nodes and consumes 46 memory units in total, while the Multi-bit Trie has 12 nodes and consumes 38 memory units in total. Input   The first line is an integer T, which is the number of testing cases.   The first line of each case contains one integer L, which means the number of levels in the Uni-bit Trie.   Following L lines indicate the nodes in each level of the Uni-bit Trie.   Since only 64 bits of an IPv6 address is used for forwarding, a Uni-bit Trie has maximal 64 levels. Moreover, we suppose that the stride for each level of a Multi-bit Trie must be less than or equal to 20. Output   Output the minimal possible memory units consumed by the corresponding Multi-bit Trie. Sample Input 1 7 1 2 4 4 5 4 3 Sample Output 38
uni.canvasToTempFilePath 图片部分机型会出现空白
调用uni.canvasToTempFilePath截取图片的时候,输出生成的图片是正常的,输出在页面也 可以正常显示。但是上传给服务器后,当服务器返回该图片确实空白的。 这种情况只在一部分机型的h5端出现,一部分机型正常。出现这种情况的机型的app端也是正常显示的,没有任何问题。只是h5出了问题。 **下面是代码:**(代码应该是没有问题的,因为一部分机型完成是正常的) ``` ctx.draw(true, () => { // 获取画布要裁剪的位置和宽度 均为百分比 * 画布中图片的宽度 保证了在微信小程序中裁剪的图片模糊 位置不对的问题 canvasT = (_this.cutT / _this.cropperH) * (_this.imageH / pixelRatio) var canvasW = ((_this.cropperW - _this.cutL - _this.cutR) / _this.cropperW) * IMG_REAL_W; var canvasH = ((_this.cropperH - _this.cutT - _this.cutB) / _this.cropperH) * IMG_REAL_H; var canvasL = (_this.cutL / _this.cropperW) * IMG_REAL_W; var canvasT = (_this.cutT / _this.cropperH) * IMG_REAL_H; uni.canvasToTempFilePath({ x: canvasL, y: canvasT, width: canvasW, height: canvasH, destWidth: canvasW, destHeight: canvasH, quality: 0.5, canvasId: 'myCanvas', success: function (res) { uni.hideLoading(); // 成功获得地址的地方 let tempFacePath = res.tempFilePath; // 截取到新的像以后,就进行上传 uni.showLoading({ mask: true, title: '上传中...' }); uni.uploadFile({ url: config.serverUrl + '/user/uploadFace?userId=' + _this.globalUser.id + '&qq=' + config.qq, filePath: tempFacePath, name: 'file', header: { headerUserId: _this.globalUser.id, headerUserToken: _this.globalUser.userUniqueToken, withCredentials: true }, success:(res) => { let resData = JSON.parse(res.data); if (resData.status == 200) { // 获得最新的用户数据 var userInfo = resData.data; uni.setStorageSync('globalUser', userInfo); uni.hideLoading(); uni.redirectTo({ url: '../settings/settings' }); uni.navigateBack({ delta: 1 }); } else if (resData.status == 502 || resData.status == 500) { uni.hideLoading(); uni.showModal({ title: '提示', content: '当前是异地登录,请重新登录', showCancel: false, success: (res) => { if(res.confirm){ post('/user/logout',{userId: _this.globalUser.id}).then((res) => { if(res.status == 200){ uni.removeStorageSync("globalUser"); uni.reLaunch({ url: '../registerLogin/registerLogin?showToHome=true' }); } }); } }, fail: () => { uni.removeStorageSync("globalUser"); uni.reLaunch({ url: '../registerLogin/registerLogin?showToHome=true' }); } }) }else{ uni.hideLoading(); uni.showToast({ title: resData.msg, icon: 'none', image: '/static/icos/error.png', duration: 3000 }); } }, fail: (res) => { uni.hideLoading(); uni.showModal({ title: '上传失败', content: res.errMsg, showCancel: false }); } }); } }); }); ```
ngrx和双向绑定的关系?
我问他们为啥不用ngrx做状态管理,他们说ngrx是uni-directional(单向的),为了项目看起来简单他们用service和two-way binding(双向绑定)。。。我不是很了解ngrx请问他们这说法对吗? ngrx就不可以用two-way binding了吗? 谢谢!
redirect_uni参数错误
![图片说明](https://img-ask.csdn.net/upload/201711/14/1510645584_802730.png) 相关代码: public function getOauthUserInfoUrl($callback, $state = '') { return "https://open.weixin.qq.com/connect/oauth2/authorize?appid={$this->account['key']}&redirect_uri={$callback}&response_type=code&scope=snsapi_userinfo&state={$state}#wechat_redirect"; } -------------------------------------------------------------------------------------- $url = (!empty($unisetting['oauth']['host']) ? ($unisetting['oauth']['host'] . '/') : $_W['siteroot']) . "app/index.php?i={$_W['uniacid']}{$str}&c=auth&a=oauth&scope=userinfo"; $callback = urlencode($url); $oauth_account = WeAccount::create($_W['account']['oauth']); $forward = $oauth_account->getOauthUserInfoUrl($callback, $state); header('Location: ' . $forward); exit;
URLs
In the early nineties, the World Wide Web (WWW) was invented. Nowadays, most people think that the WWW simply consists of all the pretty (or not so pretty) HTML-pages that you can read with your WWW browser. But back then, one of the main intentions behind the design of the WWW was to unify several existing communication protocols. Then (and even now), information on the Internet was available via a multitude of channels: FTP, HTTP, E-Mail, News, Gopher, and many more. Thanks to the WWW, all these services can now be uniformly addressed via URLs (Uniform Resource Locators). The syntax of URLs is defined in the Internet standard RFC 1738. For our problem, we consider a simplified version of the syntax, which is as follows: <protocol> "://" <host> [ ":" <port> ] [ "/" <path> ] The square brackets [] mean that the enclosed string is optional and may or may not appear. Examples of URLs are the following: http://www.informatik.uni-ulm.de/acm ftp://acm.baylor.edu:1234/pub/staff/mr-p gopher://veryold.edu More specifically, <protocol> is always one of http, ftp or gopher. <host> is a string consisting of alphabetic (a-z, A-Z) or numeric (0-9) characters and points (.). <port> is a positive integer, smaller than 65536. <path> is a string that contains no spaces. You are to write a program that parses an URL into its components. Input The input starts with a line containing a single integer n, the number of URLs in the input. The following n lines contain one URL each, in the format described above. The URLs will consist of at most 60 characters each. Output For each URL in the input first print the number of the URL, as shown in the sample output. Then print four lines, stating the protocol, host, port and path specified by the URL. If the port and/or path are not given in the URL, print the string <default> instead. Adhere to the format shown in the sample output. Print a blank line after each test case. Sample Input 3 ftp://acm.baylor.edu:1234/pub/staff/mr-p http://www.informatik.uni-ulm.de/acm gopher://veryold.edu Sample Output URL #1 Protocol = ftp Host = acm.baylor.edu Port = 1234 Path = pub/staff/mr-p URL #2 Protocol = http Host = www.informatik.uni-ulm.de Port = <default> Path = acm URL #3 Protocol = gopher Host = veryold.edu Port = <default> Path = <default>
vue如何将api请求收到的数据动态的显示到模板上呢?
我使用的是uniapp的框架,与vue差不多。我在请求服务端的数据后会返回给我一段数据,我想将这段数据动态的显示在模板上,请问该如何实现呢?网络请求的数据已经拿到了,但是是在请求的回调函数中。 ``` onLoad() { uni.request({ url: 'http://hd215.api.okayapi.com/?s=App.Main_Meta.Get&', method: 'GET', data: { key: 'usermeta', app_key: --- }, success: (res) => { // res.data.data.data; console.log(res.data.data.data) uni.showToast({ title: '查询成功!', mask: true, duration: 1500 }); }, }); }, ``` onload下为页面加载时执行的方法,uni.request为发起请求的方法。控制台输出为 ``` add_time:"2019-01-19 00:53:17" data:{content: "哈哈哈哈哈"} err_code:0 err_msg:"" key:"usermeta" update_time:"" ```
freeswitch对接mod_unimrcp进行ASR语音识别时,unimrcp服务器一直显示检测中,但检测不到语音?
2019-07-11 10:41:10:706791 [INFO] Receive SIP Event [nua_i_invite] Status 100 Trying [SIP-Agent-1] 2019-07-11 10:41:10:706842 [INFO] Receive SIP Event [nua_i_state] Status 100 Trying [SIP-Agent-1] 2019-07-11 10:41:10:706848 [NOTICE] SIP Call State [received] 2019-07-11 10:41:10:706880 [INFO] Create Session 0x7f3bf4004728 <new> [uni2] 2019-07-11 10:41:10:706905 [INFO] Remote SDP 0x7f3bf4004728 <new> v=0 o=FreeSWITCH 7957069661587620113 7436270796488759771 IN IP4 172.17.1.116 s=- c=IN IP4 172.17.1.116 t=0 0 m=application 9 TCP/MRCPv2 1 a=setup:active a=connection:new a=resource:speechrecog a=cmid:1 m=audio 4002 RTP/AVP 0 8 96 a=rtpmap:0 PCMU/8000 a=rtpmap:8 PCMA/8000 a=rtpmap:96 L16/8000 a=sendonly a=mid:1 2019-07-11 10:41:10:706939 [NOTICE] Add Session <579805baa38511e9> 2019-07-11 10:41:10:706943 [INFO] Receive Offer 0x7f3bf4004728 <579805baa38511e9> [c:1 a:1 v:0] 2019-07-11 10:41:10:707015 [INFO] Add Pending Control Channel <579805baa38511e9@speechrecog> [1] 2019-07-11 10:41:10:716519 [INFO] Enable RTP Session 172.17.2.196:5002 2019-07-11 10:41:10:716594 [INFO] Open RTP Receiver 172.17.2.196:5002 <- 172.17.1.116:4002 playout [50 ms] bounds [0 - 600 ms] adaptive [1] skew detection [1] 2019-07-11 10:41:10:716604 [INFO] Media Path 0x7f3bf4004728 Source->[PCMU/8000/1]->Decoder->[LPCM/8000/1]->Bridge->[LPCM/8000/1]->Sink 2019-07-11 10:41:10:716652 [INFO] Send Answer 0x7f3bf4004728 <579805baa38511e9> [c:1 a:1 v:0] Status OK 2019-07-11 10:41:10:716663 [INFO] Local SDP 0x7f3bf4004728 <579805baa38511e9> v=0 o=UniMRCPServer 0 0 IN IP4 172.17.2.196 s=- c=IN IP4 172.17.2.196 t=0 0 m=application 1544 TCP/MRCPv2 1 a=setup:passive a=connection:new a=channel:579805baa38511e9@speechrecog a=cmid:1 m=audio 5002 RTP/AVP 0 a=rtpmap:0 PCMU/8000 a=recvonly a=mid:1 2019-07-11 10:41:10:717118 [INFO] Receive SIP Event [nua_i_state] Status 200 OK [SIP-Agent-1] 2019-07-11 10:41:10:717159 [NOTICE] SIP Call State 0x7f3bf4004728 [completed] 2019-07-11 10:41:10:718486 [NOTICE] Accepted TCP/MRCPv2 Connection 172.17.2.196:1544 <-> 172.17.1.116:52216 2019-07-11 10:41:10:718523 [INFO] Receive SIP Event [nua_i_ack] Status 200 OK [SIP-Agent-1] 2019-07-11 10:41:10:718529 [INFO] Receive SIP Event [nua_i_state] Status 200 OK [SIP-Agent-1] 2019-07-11 10:41:10:718533 [NOTICE] SIP Call State 0x7f3bf4004728 [ready] 2019-07-11 10:41:10:718535 [INFO] Receive SIP Event [nua_i_active] Status 200 Call active [SIP-Agent-1] 2019-07-11 10:41:10:726777 [INFO] Receive MRCPv2 Data 172.17.2.196:1544 <-> 172.17.1.116:52216 [468 bytes] MRCP/2.0 468 DEFINE-GRAMMAR 1 Channel-Identifier: 579805baa38511e9@speechrecog Content-Type: application/srgs+xml Content-Id: 5ce63f65-0f98-42da-93d8-f26bdbc88476 Content-Length: 278 <?xml version="1.0"?> <grammar xmlns="http://www.w3.org/2001/06/grammar" xml:lang="en-US" version="1.0" mode="voice" root="digit"> <rule id="digit"> <one-of> <item>one</item> <item>two</item> <item>three</item> </one-of> </rule> </grammar> 2019-07-11 10:41:10:726822 [INFO] Assign Control Channel <579805baa38511e9@speechrecog> to Connection 172.17.2.196:1544 <-> 172.17.1.116:52216 [0] -> [1] 2019-07-11 10:41:10:726844 [INFO] Process DEFINE-GRAMMAR Request <579805baa38511e9@speechrecog> [1] 2019-07-11 10:41:10:726869 [INFO] Process DEFINE-GRAMMAR Response <579805baa38511e9@speechrecog> [1] 2019-07-11 10:41:10:726890 [INFO] Send MRCPv2 Data 172.17.2.196:1544 <-> 172.17.1.116:52216 [112 bytes] MRCP/2.0 112 1 200 COMPLETE Channel-Identifier: 579805baa38511e9@speechrecog Completion-Cause: 000 success 2019-07-11 10:41:10:727815 [INFO] Receive MRCPv2 Data 172.17.2.196:1544 <-> 172.17.1.116:52216 [273 bytes] MRCP/2.0 273 RECOGNIZE 2 Channel-Identifier: 579805baa38511e9@speechrecog Content-Type: text/uri-list Cancel-If-Queue: false Recognition-Timeout: 10000 Start-Input-Timers: true No-Input-Timeout: 5000 Content-Length: 44 session:5ce63f65-0f98-42da-93d8-f26bdbc88476 2019-07-11 10:41:10:727865 [INFO] Process RECOGNIZE Request <579805baa38511e9@speechrecog> [2] 2019-07-11 10:41:10:727876 [INFO] Open Utterance Output File [/usr/local/unimrcp/var/utter-8kHz-579805baa38511e9.pcm] for Writing 2019-07-11 10:41:10:728055 [INFO] Process RECOGNIZE Response <579805baa38511e9@speechrecog> [2] 2019-07-11 10:41:10:728077 [INFO] State Transition IDLE -> RECOGNIZING <579805baa38511e9@speechrecog> 2019-07-11 10:41:10:728134 [INFO] Send MRCPv2 Data 172.17.2.196:1544 <-> 172.17.1.116:52216 [83 bytes] MRCP/2.0 83 2 200 IN-PROGRESS Channel-Identifier: 579805baa38511e9@speechrecog 2019-07-11 10:41:11:537114 [INFO] Activity Detector state changed [1] 2019-07-11 10:41:11:547093 [INFO] Activity Detector state changed [0] 2019-07-11 10:41:11:577014 [INFO] Activity Detector state changed [1] 2019-07-11 10:41:11:586826 [INFO] Activity Detector state changed [0] 2019-07-11 10:41:11:596742 [INFO] Activity Detector state changed [1] 2019-07-11 10:41:11:606087 [INFO] Activity Detector state changed [0] 2019-07-11 10:41:11:616821 [INFO] Activity Detector state changed [1] 2019-07-11 10:41:11:626158 [INFO] Activity Detector state changed [0] 2019-07-11 10:41:11:636391 [INFO] Activity Detector state changed [1] 2019-07-11 10:41:11:646711 [INFO] Activity Detector state changed [0] 2019-07-11 10:41:11:656691 [INFO] Activity Detector state changed [1] 2019-07-11 10:41:11:666200 [INFO] Activity Detector state changed [0] 2019-07-11 10:41:11:676635 [INFO] Activity Detector state changed [1] 2019-07-11 10:41:11:686583 [INFO] Activity Detector state changed [0] 2019-07-11 10:41:11:696703 [INFO] Activity Detector state changed [1] 2019-07-11 10:41:11:706603 [INFO] Activity Detector state changed [0] 2019-07-11 10:41:11:716682 [INFO] Activity Detector state changed [1] 2019-07-11 10:41:11:726704 [INFO] Activity Detector state changed [0] 2019-07-11 10:41:11:736657 [INFO] Activity Detector state changed [1] 2019-07-11 10:41:11:746644 [INFO] Activity Detector state changed [0] 2019-07-11 10:41:11:756449 [INFO] Activity Detector state changed [1] 2019-07-11 10:41:11:766582 [INFO] Activity Detector state changed [0] 2019-07-11 10:41:11:776901 [INFO] Activity Detector state changed [1] 2019-07-11 10:41:11:786758 [INFO] Activity Detector state changed [0] 2019-07-11 10:41:11:796875 [INFO] Activity Detector state changed [1] 2019-07-11 10:41:11:806867 [INFO] Activity Detector state changed [0] 2019-07-11 10:41:11:816656 [INFO] Activity Detector state changed [1] 2019-07-11 10:41:11:826178 [INFO] Activity Detector state changed [0] 2019-07-11 10:41:11:836737 [INFO] Activity Detector state changed [1] 2019-07-11 10:41:11:846277 [INFO] Activity Detector state changed [0] 2019-07-11 10:41:11:956524 [INFO] Activity Detector state changed [1] 2019-07-11 10:41:11:966486 [INFO] Activity Detector state changed [0] 2019-07-11 10:41:11:976403 [INFO] Activity Detector state changed [1] 2019-07-11 10:41:11:986385 [INFO] Activity Detector state changed [0] 2019-07-11 10:41:11:996284 [INFO] Activity Detector state changed [1] 2019-07-11 10:41:12:006528 [INFO] Activity Detector state changed [0] 2019-07-11 10:41:12:016476 [INFO] Activity Detector state changed [1] 2019-07-11 10:41:12:026282 [INFO] Activity Detector state changed [0] 2019-07-11 10:41:12:036295 [INFO] Activity Detector state changed [1] 2019-07-11 10:41:12:046218 [INFO] Activity Detector state changed [0] 2019-07-11 10:41:12:416443 [INFO] Activity Detector state changed [1] 2019-07-11 10:41:12:426244 [INFO] Activity Detector state changed [0] 2019-07-11 10:41:12:754256 [INFO] Receive MRCPv2 Data 172.17.2.196:1544 <-> 172.17.1.116:52216 [72 bytes] MRCP/2.0 72 STOP 3 Channel-Identifier: 579805baa38511e9@speechrecog 2019-07-11 10:41:12:754472 [INFO] Process STOP Request <579805baa38511e9@speechrecog> [3] 2019-07-11 10:41:12:756876 [INFO] Process STOP Response <579805baa38511e9@speechrecog> [3] 2019-07-11 10:41:12:756977 [INFO] State Transition RECOGNIZING -> IDLE <579805baa38511e9@speechrecog> 2019-07-11 10:41:12:757051 [INFO] Send MRCPv2 Data 172.17.2.196:1544 <-> 172.17.1.116:52216 [108 bytes] MRCP/2.0 108 3 200 COMPLETE Channel-Identifier: 579805baa38511e9@speechrecog Active-Request-Id-List: 2 2019-07-11 10:41:12:761118 [INFO] TCP/MRCPv2 Peer Disconnected 172.17.2.196:1544 <-> 172.17.1.116:52216 2019-07-11 10:41:12:761411 [INFO] Receive SIP Event [nua_i_bye] Status 200 Session Terminated [SIP-Agent-1] 2019-07-11 10:41:12:761443 [INFO] Receive SIP Event [nua_i_state] Status 200 Session Terminated [SIP-Agent-1] 2019-07-11 10:41:12:761795 [NOTICE] SIP Call State 0x7f3bf4004728 [terminated] 2019-07-11 10:41:12:761838 [INFO] Receive SIP Event [nua_i_terminated] Status 200 Session Terminated [SIP-Agent-1] 2019-07-11 10:41:12:761908 [INFO] Deactivate Session 0x7f3bf4004728 <579805baa38511e9> 2019-07-11 10:41:12:761933 [INFO] Terminate Session 0x7f3bf4004728 <579805baa38511e9> 2019-07-11 10:41:12:762049 [INFO] Remove Control Channel <579805baa38511e9@speechrecog> [0] 2019-07-11 10:41:12:766471 [INFO] Close RTP Receiver 172.17.2.196:5002 <- 172.17.1.116:4002 [r:101 l:0 j:96 p:50 d:0 i:0] 2019-07-11 10:41:12:766549 [INFO] Remove RTP Session 172.17.2.196:5002 2019-07-11 10:41:12:766649 [NOTICE] Destroy TCP/MRCPv2 Connection 172.17.2.196:1544 <-> 172.17.1.116:52216 2019-07-11 10:41:12:766694 [NOTICE] Remove Session <579805baa38511e9> 2019-07-11 10:41:12:766724 [INFO] Session Terminated 0x7f3bf4004728 <579805baa38511e9> 2019-07-11 10:41:12:766785 [NOTICE] Destroy Session <579805baa38511e9> ``` ```
《奇巧淫技》系列-python!!每天早上八点自动发送天气预报邮件到QQ邮箱
将代码部署服务器,每日早上定时获取到天气数据,并发送到邮箱。 也可以说是一个小人工智障。 思路可以运用在不同地方,主要介绍的是思路。
Linux(服务器编程):15---两种高效的事件处理模式(reactor模式、proactor模式)
前言 同步I/O模型通常用于实现Reactor模式 异步I/O模型则用于实现Proactor模式 最后我们会使用同步I/O方式模拟出Proactor模式 一、Reactor模式 Reactor模式特点 它要求主线程(I/O处理单元)只负责监听文件描述符上是否有事件发生,有的话就立即将时间通知工作线程(逻辑单元)。除此之外,主线程不做任何其他实质性的工作 读写数据,接受新的连接,以及处...
为什么要学数据结构?
一、前言 在可视化化程序设计的今天,借助于集成开发环境可以很快地生成程序,程序设计不再是计算机专业人员的专利。很多人认为,只要掌握几种开发工具就可以成为编程高手,其实,这是一种误解。要想成为一个专业的开发人员,至少需要以下三个条件: 1) 能够熟练地选择和设计各种数据结构和算法 2) 至少要能够熟练地掌握一门程序设计语言 3) 熟知所涉及的相关应用领域的知识 其中,后两个条件比较容易实现,而第一个...
C语言魔塔游戏
很早就很想写这个,今天终于写完了。 游戏截图: 编译环境: VS2017 游戏需要一些图片,如果有想要的或者对游戏有什么看法的可以加我的QQ 2985486630 讨论,如果暂时没有回应,可以在博客下方留言,到时候我会看到。 下面我来介绍一下游戏的主要功能和实现方式 首先是玩家的定义,使用结构体,这个名字是可以自己改变的 struct gamerole { char n
进程通信方式总结与盘点
​ 进程通信是指进程之间的信息交换。这里需要和进程同步做一下区分,进程同步控制多个进程按一定顺序执行,进程通信是一种手段,而进程同步是目标。从某方面来讲,进程通信可以解决进程同步问题。 ​ 首先回顾下我们前面博文中讲到的信号量机制,为了实现进程的互斥与同步,需要在进程间交换一定的信息,因此信号量机制也可以被归为进程通信的一种方式,但是也被称为低级进程通信,主要原因为: 效率低:一次只可操作少量的...
究竟你适不适合买Mac?
我清晰的记得,刚买的macbook pro回到家,开机后第一件事情,就是上了淘宝网,花了500元钱,找了一个上门维修电脑的师傅,上门给我装了一个windows系统。。。。。。 表砍我。。。 当时买mac的初衷,只是想要个固态硬盘的笔记本,用来运行一些复杂的扑克软件。而看了当时所有的SSD笔记本后,最终决定,还是买个好(xiong)看(da)的。 已经有好几个朋友问我mba怎么样了,所以今天尽量客观
听说了吗?阿里双11作战室竟1根网线都没有
双11不光是购物狂欢节,更是对技术的一次“大考”,对于阿里巴巴企业内部运营的基础保障技术而言,亦是如此。 回溯双11历史,这背后也经历过“小米加步枪”的阶段:作战室从随处是网线,交换机放地上的“一地狼藉”;到如今媲美5G的wifi网速,到现场却看不到一根网线;从当年使用商用AP(无线路由器),让光明顶双11当天断网一分钟,到全部使用阿里自研AP……阿里巴巴企业智能事业部工程师们提供的基础保障...
在阿里,40岁的奋斗姿势
在阿里,40岁的奋斗姿势 在阿里,什么样的年纪可以称为老呢?35岁? 在云网络,有这样一群人,他们的平均年龄接近40,却刚刚开辟职业生涯的第二战场。 他们的奋斗姿势是什么样的呢? 洛神赋 “翩若惊鸿,婉若游龙。荣曜秋菊,华茂春松。髣髴兮若轻云之蔽月,飘飖兮若流风之回雪。远而望之,皎若太阳升朝霞;迫而察之,灼若芙蕖出渌波。” 爱洛神,爱阿里云 2018年,阿里云网络产品部门启动洛神2.0升...
关于研发效能提升的思考
研发效能提升是最近比较热门的一个话题,本人根据这几年的工作心得,做了一些思考总结,由于个人深度有限,暂且抛转引入。 三要素 任何生产力的提升都离不开这三个因素:人、流程和工具,少了其中任何一个因素都无法实现。 人,即思想,也就是古人说的“道”,道不同不相为谋,是制高点,也是高层建筑的基石。 流程,即方法,也是古人说的“法”。研发效能的提升,也就是要提高投入产出比,既要增加产出,也要减...
Python爬虫爬取淘宝,京东商品信息
小编是一个理科生,不善长说一些废话。简单介绍下原理然后直接上代码。 使用的工具(Python+pycharm2019.3+selenium+xpath+chromedriver)其中要使用pycharm也可以私聊我selenium是一个框架可以通过pip下载 pip install selenium -i https://pypi.tuna.tsinghua.edu.cn/simple/ 
阿里程序员写了一个新手都写不出的低级bug,被骂惨了。
这种新手都不会范的错,居然被一个工作好几年的小伙子写出来,差点被当场开除了。
Java工作4年来应聘要16K最后没要,细节如下。。。
前奏: 今天2B哥和大家分享一位前几天面试的一位应聘者,工作4年26岁,统招本科。 以下就是他的简历和面试情况。 基本情况: 专业技能: 1、&nbsp;熟悉Sping了解SpringMVC、SpringBoot、Mybatis等框架、了解SpringCloud微服务 2、&nbsp;熟悉常用项目管理工具:SVN、GIT、MAVEN、Jenkins 3、&nbsp;熟悉Nginx、tomca
2020年,冯唐49岁:我给20、30岁IT职场年轻人的建议
点击“技术领导力”关注∆  每天早上8:30推送 作者| Mr.K   编辑| Emma 来源| 技术领导力(ID:jishulingdaoli) 前天的推文《冯唐:职场人35岁以后,方法论比经验重要》,收到了不少读者的反馈,觉得挺受启发。其实,冯唐写了不少关于职场方面的文章,都挺不错的。可惜大家只记住了“春风十里不如你”、“如何避免成为油腻腻的中年人”等不那么正经的文章。 本文整理了冯
程序员该看的几部电影
##1、骇客帝国(1999) 概念:在线/离线,递归,循环,矩阵等 剧情简介: 不久的将来,网络黑客尼奥对这个看似正常的现实世界产生了怀疑。 他结识了黑客崔妮蒂,并见到了黑客组织的首领墨菲斯。 墨菲斯告诉他,现实世界其实是由一个名叫“母体”的计算机人工智能系统控制,人们就像他们饲养的动物,没有自由和思想,而尼奥就是能够拯救人类的救世主。 可是,救赎之路从来都不会一帆风顺,到底哪里才是真实的世界?
入职阿里5年,他如何破解“技术债”?
简介: 作者 | 都铎 作为一名技术人,你常常会听到这样的话: “先快速上线” “没时间改” “再缓一缓吧” “以后再解决” “先用临时方案处理” …… 当你埋下的坑越来越多,不知道哪天哪位同学就会踩上一颗雷。特别赞同“人最大的恐惧就是未知,当技术债可说不可见的时候,才是最让人不想解决的时候。” 作为一个程序员,我们反对复制粘贴,但是我们经常会见到相似的代码,相同的二方包,甚至整个代码...
Python绘图,圣诞树,花,爱心 | Turtle篇
每周每日,分享Python实战代码,入门资料,进阶资料,基础语法,爬虫,数据分析,web网站,机器学习,深度学习等等。 公众号回复【进群】沟通交流吧,QQ扫码进群学习吧 微信群 QQ群 1.画圣诞树 import turtle screen = turtle.Screen() screen.setup(800,600) circle = turtle.Turtle()...
作为一个程序员,CPU的这些硬核知识你必须会!
CPU对每个程序员来说,是个既熟悉又陌生的东西? 如果你只知道CPU是中央处理器的话,那可能对你并没有什么用,那么作为程序员的我们,必须要搞懂的就是CPU这家伙是如何运行的,尤其要搞懂它里面的寄存器是怎么一回事,因为这将让你从底层明白程序的运行机制。 随我一起,来好好认识下CPU这货吧 把CPU掰开来看 对于CPU来说,我们首先就要搞明白它是怎么回事,也就是它的内部构造,当然,CPU那么牛的一个东
破14亿,Python分析我国存在哪些人口危机!
2020年1月17日,国家统计局发布了2019年国民经济报告,报告中指出我国人口突破14亿。 猪哥的朋友圈被14亿人口刷屏,但是很多人并没有看到我国复杂的人口问题:老龄化、男女比例失衡、生育率下降、人口红利下降等。 今天我们就来分析一下我们国家的人口数据吧! 一、背景 1.人口突破14亿 2020年1月17日,国家统计局发布了 2019年国民经济报告 ,报告中指出:年末中国大陆总人口(包括31个
在家远程办公效率低?那你一定要收好这个「在家办公」神器!
相信大家都已经收到国务院延长春节假期的消息,接下来,在家远程办公可能将会持续一段时间。 但是问题来了。远程办公不是人在电脑前就当坐班了,相反,对于沟通效率,文件协作,以及信息安全都有着极高的要求。有着非常多的挑战,比如: 1在异地互相不见面的会议上,如何提高沟通效率? 2文件之间的来往反馈如何做到及时性?如何保证信息安全? 3如何规划安排每天工作,以及如何进行成果验收? ......
作为一个程序员,内存和磁盘的这些事情,你不得不知道啊!!!
截止目前,我已经分享了如下几篇文章: 一个程序在计算机中是如何运行的?超级干货!!! 作为一个程序员,CPU的这些硬核知识你必须会! 作为一个程序员,内存的这些硬核知识你必须懂! 这些知识可以说是我们之前都不太重视的基础知识,可能大家在上大学的时候都学习过了,但是嘞,当时由于老师讲解的没那么有趣,又加上这些知识本身就比较枯燥,所以嘞,大家当初几乎等于没学。 再说啦,学习这些,也看不出来有什么用啊!
2020年的1月,我辞掉了我的第一份工作
其实,这篇文章,我应该早点写的,毕竟现在已经2月份了。不过一些其它原因,或者是我的惰性、还有一些迷茫的念头,让自己迟迟没有试着写一点东西,记录下,或者说是总结下自己前3年的工作上的经历、学习的过程。 我自己知道的,在写自己的博客方面,我的文笔很一般,非技术类的文章不想去写;另外我又是一个还比较热衷于技术的人,而平常复杂一点的东西,如果想写文章写的清楚点,是需要足够...
别低估自己的直觉,也别高估自己的智商
所有群全部吵翻天,朋友圈全部沦陷,公众号疯狂转发。这两周没怎么发原创,只发新闻,可能有人注意到了。我不是懒,是文章写了却没发,因为大家的关注力始终在这次的疫情上面,发了也没人看。当然,我...
Java坑人面试题系列: 包装类(中级难度)
Java Magazine上面有一个专门坑人的面试题系列: https://blogs.oracle.com/javamagazine/quiz-2。 这些问题的设计宗旨,主要是测试面试者对Java语言的了解程度,而不是为了用弯弯绕绕的手段把面试者搞蒙。 如果你看过往期的问题,就会发现每一个都不简单。 这些试题模拟了认证考试中的一些难题。 而 “中级(intermediate)” 和 “高级(ad
深度学习入门笔记(十八):卷积神经网络(一)
欢迎关注WX公众号:【程序员管小亮】 专栏——深度学习入门笔记 声明 1)该文章整理自网上的大牛和机器学习专家无私奉献的资料,具体引用的资料请看参考文献。 2)本文仅供学术交流,非商用。所以每一部分具体的参考资料并没有详细对应。如果某部分不小心侵犯了大家的利益,还望海涵,并联系博主删除。 3)博主才疏学浅,文中如有不当之处,请各位指出,共同进步,谢谢。 4)此属于第一版本,若有错误,还需继续修正与...
这个世界上人真的分三六九等,你信吗?
偶然间,在知乎上看到一个问题 一时间,勾起了我深深的回忆。 以前在厂里打过两次工,做过家教,干过辅导班,做过中介。零下几度的晚上,贴过广告,满脸、满手地长冻疮。 再回首那段岁月,虽然苦,但让我学会了坚持和忍耐。让我明白了,在这个世界上,无论环境多么的恶劣,只要心存希望,星星之火,亦可燎原。 下文是原回答,希望能对你能有所启发。 如果我说,这个世界上人真的分三六九等,...
节后首个工作日,企业们集体开晨会让钉钉挂了
By 超神经场景描述:昨天 2 月 3 日,是大部分城市号召远程工作的第一天,全国有接近 2 亿人在家开始远程办公,钉钉上也有超过 1000 万家企业活跃起来。关键词:十一出行 人脸...
Java基础知识点梳理
Java基础知识点梳理 摘要: 虽然已经在实际工作中经常与java打交道,但是一直没系统地对java这门语言进行梳理和总结,掌握的知识也比较零散。恰好利用这段时间重新认识下java,并对一些常见的语法和知识点做个总结与回顾,一方面为了加深印象,方便后面查阅,一方面为了学好java打下基础。 Java简介 java语言于1995年正式推出,最开始被命名为Oak语言,由James Gosling(詹姆
2020年全新Java学习路线图,含配套视频,学完即为中级Java程序员!!
新的一年来临,突如其来的疫情打破了平静的生活! 在家的你是否很无聊,如果无聊就来学习吧! 世上只有一种投资只赚不赔,那就是学习!!! 传智播客于2020年升级了Java学习线路图,硬核升级,免费放送! 学完你就是中级程序员,能更快一步找到工作! 一、Java基础 JavaSE基础是Java中级程序员的起点,是帮助你从小白到懂得编程的必经之路。 在Java基础板块中有6个子模块的学
B 站上有哪些很好的学习资源?
哇说起B站,在小九眼里就是宝藏般的存在,放年假宅在家时一天刷6、7个小时不在话下,更别提今年的跨年晚会,我简直是跪着看完的!! 最早大家聚在在B站是为了追番,再后来我在上面刷欧美新歌和漂亮小姐姐的舞蹈视频,最近两年我和周围的朋友们已经把B站当作学习教室了,而且学习成本还免费,真是个励志的好平台ヽ(.◕ฺˇд ˇ◕ฺ;)ノ 下面我们就来盘点一下B站上优质的学习资源: 综合类 Oeasy: 综合
你也能看懂的:蒙特卡罗方法
蒙特卡罗方法,也称统计模拟方法,是1940年代中期由于科学技术的发展和电子计算机的发明,而提出的一种以概率统计理论为指导的数值计算方法。是指使用随机数(或更常见的伪随机数)来解决很多计算问题的方法 蒙特卡罗方法可以粗略地分成两类:一类是所求解的问题本身具有内在的随机性,借助计算机的运算能力可以直接模拟这种随机的过程。另一种类型是所求解问题可以转化为某种随机分布的特征数,比如随机事件出现的概率,或...
如何优雅地打印一个Java对象?
你好呀,我是沉默王二,一个和黄家驹一样身高,和刘德华一样颜值的程序员。虽然已经写了十多年的 Java 代码,但仍然觉得自己是个菜鸟(请允许我惭愧一下)。 在一个月黑风高的夜晚,我思前想后,觉得再也不能这么蹉跎下去了。于是痛下决心,准备通过输出的方式倒逼输入,以此来修炼自己的内功,从而进阶成为一名真正意义上的大神。与此同时,希望这些文章能够帮助到更多的读者,让大家在学习的路上不再寂寞、空虚和冷。 ...
雷火神山直播超两亿,Web播放器事件监听是怎么实现的?
Web播放器解决了在手机浏览器和PC浏览器上播放音视频数据的问题,让视音频内容可以不依赖用户安装App,就能进行播放以及在社交平台进行传播。在视频业务大数据平台中,播放数据的统计分析非常重要,所以Web播放器在使用过程中,需要对其内部的数据进行收集并上报至服务端,此时,就需要对发生在其内部的一些播放行为进行事件监听。 那么Web播放器事件监听是怎么实现的呢? 01 监听事件明细表 名...
相关热词 c# 时间比天数 c# oracle查询 c# 主动推送 事件 c# java 属性 c# 控制台 窗体 c# 静态类存值 c#矢量作图 c#窗体调用外部程式 c# enum是否合法 c# 如何卸载引用
立即提问