安装完x-pack插件后kibana出现的问题

x-pack是参考这篇文章https://blog.51cto.com/chenx1242/2045569安装的,
安装完x-pack插件后kibana弹出这个错误。
我的es也是在运行的。
不知道是什么情况求大神解答。
在线等,急!!
图片说明

图片说明

启动kibana报错信息
图片说明

1个回答

es和kibana都要装,你的es装了吗

另外,好像要在kibana.yml文件里面加上账号密码吧,不太记得了
elasticsearch.username: "elastic"
elasticsearch.password: "changeme"

zhouchao6
zhouchao6 回复Swaggy_Z0306: curl -XPUT -u elastic:changeme 'http://192.168.100.509200/_xpack/license?acknowledge=true' -d @license.json 是用这样的指令导入的吧
6 个月之前 回复
BinJiLinZuo
Swaggy_Z0306 回复zhouchao6: [root@localhost ~]# curl -XPUT -u elastic 'http://192.168.200.1229200/_xpack/license' -H "Content-Type: application/json" -d @zhao-yixin-158ed7d9-f797-4a3b-85f5-05ad2ad58eaa-v5.json Enter host password for user 'elastic': Warning: Couldn't read data from file Warning: "zhao-yixin-158ed7d9-f797-4a3b-85f5-05ad2ad58eaa-v5.json", this makes Warning: an empty POST. 那个license要放在哪个目录下
6 个月之前 回复
BinJiLinZuo
Swaggy_Z0306 回复zhouchao6: 行等会我试试
6 个月之前 回复
BinJiLinZuo
Swaggy_Z0306 回复zhouchao6: es是正常的 elasticsearch-head可以看es状态
6 个月之前 回复
zhouchao6
zhouchao6 回复Swaggy_Z0306: 或者你看看es是不是正常的,用一些查询命令看下
6 个月之前 回复
zhouchao6
zhouchao6 回复Swaggy_Z0306: 我也不知道了,网页报错又说可能是license问题,但是刚安装应该可以使用一个月啊。实在不行,你去官网申请个免费license替换吧,也是免费一个月,然后试试行不行,没问题了,再把license破解掉
6 个月之前 回复
BinJiLinZuo
Swaggy_Z0306 回复zhouchao6: es跟kibana都是5.6.7的 我是用install x-pack安装的 他应该会安装同版本的xpack的
6 个月之前 回复
BinJiLinZuo
Swaggy_Z0306 回复zhouchao6: 输入./bin/elasticsearch-plugin list 也输出了 x-pack 我快炸了
6 个月之前 回复
zhouchao6
zhouchao6 回复Swaggy_Z0306: 你安装的x-pack跟你的es kibana一致吗?
6 个月之前 回复
BinJiLinZuo
Swaggy_Z0306 回复zhouchao6: [root@localhost elasticsearch-5.6.7]# ./bin/elasticsearch-plugin list x-pack
6 个月之前 回复
zhouchao6
zhouchao6 回复Swaggy_Z0306: 不用
6 个月之前 回复
BinJiLinZuo
Swaggy_Z0306 回复zhouchao6: 我是单节点es,必须要配集群吗
6 个月之前 回复
zhouchao6
zhouchao6 回复Swaggy_Z0306: 看那个error就是 es集群没有安装x-pack
6 个月之前 回复
BinJiLinZuo
Swaggy_Z0306 先给es装的x-pack,kibana.yml也配置了
6 个月之前 回复
Csdn user default icon
上传中...
上传图片
插入图片
抄袭、复制答案,以达到刷声望分或其他目的的行为,在CSDN问答是严格禁止的,一经发现立刻封号。是时候展现真正的技术了!
其他相关推荐
linux中用 elasticsearch 下载的 x-pack 没有 setup-passwords
linux中用 elasticsearch 下载的 x-pack 没有 setup-passwords
Kibana5.6.7安装X-Pack插件报错
错误如图 第一次安装是正常的 然后remove掉之后重新install就这样了 ![图片说明](https://img-ask.csdn.net/upload/201909/03/1567501116_1613.png)
elasticsearch6.12 安装了x-pack之后TLS该如何配置?
我该如何通过x-pack的certutil 生成证书及密钥,这理该生成什么类型的证书呢? 证书生成之后该如何配置每个elasticsearch节点的配置文件以及kibana的kibana.yml呢? 我用的全是6.12版本。
ELK+wazuh安装X-pack报错
1.vi /etc/elasticsearch/elasticsearch.yml ![图片说明](https://img-ask.csdn.net/upload/201907/05/1562311392_444624.png) 启用Xpack后elasticsearch 无法启动 ![图片说明](https://img-ask.csdn.net/upload/201907/05/1562311650_460817.png)
ES 5.2.2中安装x-pack后出现无法用curl localhost:9200启动
在用curl localhost:9200显示以下的错误:{"error":{"root_cause":[{"type":"security_exception","reason":"missing authentication token for REST request [/]","header":{"WWW-Authenticate":"Basic realm=\"security\" charset=\"UTF-8\""}}],"type":"security_exception","reason":"missing authentication token for REST request [/]","header":{"WWW-Authenticate":"Basic realm=\"security\" charset=\"UTF-8\""}},"status":401}
谁用过git?git clone时报错service=git-upload-pack not found
谁用过git?git clone时报错https://github.com/hello.git/info/refs?service=git-upload-pack not found?怎么解决
如何让VirtualBox 上安装的 android X86系统实现鼠标能在宿主机与虚拟机无缝切换?
目前我在 VB 上安装了自己编译的 android 7.0 的 X86 系统,但在使用的过程中 发现,鼠标不能在宿主机于虚拟机之间无缝切换。 目前我使用过的解决方案 1: 鼠标集成功能(不能实现无缝切换); 2: 安装Oracle_VM_VirtualBox_Extension_Pack-5.2.34-133893.vbox-extpack(结果依然是不能解决无缝切换); 3: 在虚拟机中挂载 VBoxGuestAdditions_5.2.34.iso ,镜像文件,执行 VBoxLinuxAdditions.run 时,报MD5 验证失败, 这应该是环境的原因,这条路同样以失败告终。我在 linux 上尝试了以下,这种方式是可以的,但 android不行。 请大神出来指点一二,感谢
使用TortoiseGit,git clone时出现git-upload-pack:Permission denied
&lt;!--StartFragment --&gt; <div>git.exe clone --progress -v "<a href="mailto:test1@192.168.223.128:e:%5CSample-Project">test1@192.168.223.128:e:\Sample-Project</a>" "E:\project\Sample-Project"</div> <div>Cloning into 'E:\project\Sample-Project'...<br>bash: /cygdrive/d/Git/cmd/git-upload-pack: Permission denied<br>fatal: The remote end hung up unexpectedly</div> <div>git did not exit cleanly (exit code 128)</div>
关于tkinter的notebook问题
![图片说明](https://img-ask.csdn.net/upload/202002/01/1580541360_699863.png) 一个窗口上有四个页面,希望可以右键点击其中任意一个可以将其那一页关闭 ,试了很多次,def add_note 的第三行必须是 bind note,而不能是tab,但是改成note就变为,点击notebook任意一个地方都会删除其中一个,而不是想删哪个是哪个 原意:是想做一个类似漫画下载器一样的东西,在输入框内输入搜索的东西后,会弹出一个notebook的新的一页,之后想关闭的时候就可以将其关闭,类似选项卡一样 顺便问一下,tkinter有没有想浏览器里的选项卡一样有 ‘x’ 号 代码如下: class a: def destroy(self, event): self.note.forget(self.tab) def add_note(self, text): self.tab = Frame(self.note) self.note.add(self.tab, text=text) self.note.bind('<Button-3>', self.destroy) def main(self): root = Tk() root.geometry('500x400') self.note = Notebook(root) self.tab1 = Frame(self.note) tab2 = Frame(self.note) self.note.add(self.tab1, text='热门推荐') self.note.add(tab2, text='推荐') self.note.pack() self.add_note('123') self.add_note('123') root.mainloop() a().main()
弱弱的问个问题,安装Azure pack 至少要多少台物理机?
弱弱的问个问题,安装Azure pack 至少要多少台物理机?
3dsmax2020安装失败。
安装3dsmax失败, ![图片说明](https://img-ask.csdn.net/upload/201912/18/1576629427_276006.png) 说我VC++2013库安装不了,然后我单独安装,提示 这个库还是不行 ![图片说明](https://img-ask.csdn.net/upload/201912/18/1576629495_345638.png) 以下是日志文件: [1080:3944][2019-12-18T08:31:28]i001: Burn v3.7.2829.0, Windows v6.3 (Build 9600: Service Pack 0), path: D:\Program Files\3D MAX 2018\安装包\3rdParty\x86\VCRedist\2013\vcredist_x86.exe, cmdline: '' [1080:3944][2019-12-18T08:31:28]i000: Setting string variable 'WixBundleLog' to value 'C:\Users\HP\AppData\Local\Temp\dd_vcredist_x86_20191218083128.log' [1080:3944][2019-12-18T08:31:28]i000: Setting string variable 'WixBundleOriginalSource' to value 'D:\Program Files\3D MAX 2018\安装包\3rdParty\x86\VCRedist\2013\vcredist_x86.exe' [1080:3944][2019-12-18T08:31:28]i000: Setting string variable 'WixBundleName' to value 'Microsoft Visual C++ 2013 Redistributable (x86) - 12.0.30501' [1080:3944][2019-12-18T08:31:28]i100: Detect begin, 2 packages [1080:3944][2019-12-18T08:31:28]i102: Detected related bundle: {050d4fc8-5d48-4b8f-8972-47c82c46020f}, type: Upgrade, scope: PerMachine, version: 12.0.30501.0, operation: None [1080:3944][2019-12-18T08:31:28]i102: Detected related bundle: {1b103cea-f037-4504-81de-956057b442c3}, type: Upgrade, scope: PerMachine, version: 12.0.30501.0, operation: None [1080:3944][2019-12-18T08:31:28]i101: Detected package: vcRuntimeMinimum_x86, state: Absent, cached: Complete [1080:3944][2019-12-18T08:31:28]i101: Detected package: vcRuntimeAdditional_x86, state: Absent, cached: Complete [1080:3944][2019-12-18T08:31:28]i052: Condition 'VersionNT >= v6.0 OR (VersionNT = v5.1 AND ServicePackLevel >= 2) OR (VersionNT = v5.2 AND ServicePackLevel >= 1)' evaluates to true. [1080:3944][2019-12-18T08:31:28]i199: Detect complete, result: 0x0 [1080:3944][2019-12-18T08:31:31]i200: Plan begin, 2 packages, action: Install [1080:3944][2019-12-18T08:31:31]i000: Setting string variable 'WixBundleRollbackLog_vcRuntimeMinimum_x86' to value 'C:\Users\HP\AppData\Local\Temp\dd_vcredist_x86_20191218083128_0_vcRuntimeMinimum_x86_rollback.log' [1080:3944][2019-12-18T08:31:31]i000: Setting string variable 'WixBundleLog_vcRuntimeMinimum_x86' to value 'C:\Users\HP\AppData\Local\Temp\dd_vcredist_x86_20191218083128_0_vcRuntimeMinimum_x86.log' [1080:3944][2019-12-18T08:31:31]i000: Setting string variable 'WixBundleRollbackLog_vcRuntimeAdditional_x86' to value 'C:\Users\HP\AppData\Local\Temp\dd_vcredist_x86_20191218083128_1_vcRuntimeAdditional_x86_rollback.log' [1080:3944][2019-12-18T08:31:31]i000: Setting string variable 'WixBundleLog_vcRuntimeAdditional_x86' to value 'C:\Users\HP\AppData\Local\Temp\dd_vcredist_x86_20191218083128_1_vcRuntimeAdditional_x86.log' [1080:3944][2019-12-18T08:31:31]i201: Planned package: vcRuntimeMinimum_x86, state: Absent, default requested: Present, ba requested: Present, execute: Install, rollback: Uninstall, cache: No, uncache: No, dependency: Register [1080:3944][2019-12-18T08:31:31]i201: Planned package: vcRuntimeAdditional_x86, state: Absent, default requested: Present, ba requested: Present, execute: Install, rollback: Uninstall, cache: No, uncache: No, dependency: Register [1080:3944][2019-12-18T08:31:31]i207: Planned related bundle: {050d4fc8-5d48-4b8f-8972-47c82c46020f}, type: Upgrade, default requested: None, ba requested: None, execute: None, rollback: None, dependency: None [1080:3944][2019-12-18T08:31:31]i207: Planned related bundle: {1b103cea-f037-4504-81de-956057b442c3}, type: Upgrade, default requested: None, ba requested: None, execute: None, rollback: None, dependency: None [1080:3944][2019-12-18T08:31:31]i299: Plan complete, result: 0x0 [1080:3944][2019-12-18T08:31:31]i300: Apply begin [3914:2324][2019-12-18T08:31:31]i360: Creating a system restore point. [3914:2324][2019-12-18T08:31:31]w363: Could not create system restore point, error: 0x80070422. Continuing... [3914:2324][2019-12-18T08:31:31]i370: Session begin, registration key: SOFTWARE\Microsoft\Windows\CurrentVersion\Uninstall\{f65db027-aff3-4070-886a-0d87064aabb1}, options: 0x4, disable resume: No [3914:2324][2019-12-18T08:31:31]e000: Error 0x80070005: Failed to create registration key. [3914:2324][2019-12-18T08:31:31]e000: Error 0x80070005: Failed to begin registration session. [1080:3944][2019-12-18T08:31:31]e000: Error 0x80070005: Failed to begin registration session in per-machine process. [1080:3944][2019-12-18T08:31:31]e000: Error 0x80070005: Failed to register bundle. [1080:3944][2019-12-18T08:31:32]i399: Apply complete, result: 0x80070005, restart: None, ba requested restart: No 求大佬帮忙看看怎么解决 问题解决了,注册表没清理干净,后续: 用了auto uninstaller,20块钱20天的密匙。 ![图片说明](https://img-ask.csdn.net/upload/201912/18/1576654315_531736.png) 有需要的可以来找我拿。
python:tkinter用bind绑定双击事件不成功?
工具:win10 python3.4 tkinter 最近学习python遇到奇怪的问题: 这段程序就是画了一个text文本框,然后绑定一个双击事件,当双击时打印出“双击”可是打印不出来,奇怪的是程序刚运行时却打印出“双击”,之后双击却不打印,有人知道是什么问题吗? 代码如下: import tkinter from tkinter import * def p(): print('双击') root=tkinter.Tk() text=tkinter.Text(root,width=30,height=5) text.pack() text.bind("<Double-Button-1>",p()) root.mainloop() ![图片说明](https://img-ask.csdn.net/upload/202002/02/1580622356_904845.png)
Treasure of the Chimp Island 算法实现
Problem Description Bob Bennett, the young adventurer, has found the map to the treasure of the Chimp Island, where the ghost zombie pirate LeChimp, the infamous evil pirate of the Caribbeans has hidden somewhere inside the Zimbu Memorial Monument (ZM2). ZM2 is made up of a number of corridors forming a maze. To protect the treasure, LeChimp has placed a number of stone blocks inside the corridors to block the way to the treasure. The map shows the hardness of each stone block which determines how long it takes to destroy the block. ZM2 has a number of gates on the boundary from which Bob can enter the corridors. Fortunately, there may be a pack of dynamites at some gates, so that if Bob enters from such a gate, he may take the pack with him. Each pack has a number of dynamites that can be used to destroy the stone blocks in a much shorter time. Once entered, Bob cannot exit ZM2 and enter again, nor can he walk on the area of other gates (so, he cannot pick more than one pack of dynamites). The hardness of the stone blocks is an integer between 1 and 9, showing the number of days required to destroy the block. We neglect the time required to travel inside the corridors. Using a dynamite, Bob can destroy a block almost immediately, so we can ignore the time required for it too. The problem is to find the minimum time at which Bob can reach the treasure. He may choose any gate he wants to enter ZM2. Input The input consists of multiple test cases. Each test case contains the map of ZM2 viewed from the above. The map is a rectangular matrix of characters. Bob can move in four directions up, down, left, and right, but cannot move diagonally. He cannot enter a location shown by asterisk characters (*), even using all his dynamites! The character ($) shows the location of the treasure. A digit character (between 1 and 9) shows a stone block of hardness equal to the value of the digit. A hash sign (#) which can appear only on the boundary of the map indicates a gate without a dynamite pack. An uppercase letter on the boundary shows a gate with a pack of dynamites. The letter A shows there is one dynamite in the pack, B shows there are two dynamite in the pack and so on. All other characters on the boundary of the map are asterisks. Corridors are indicated by dots (.). There is a blank line after each test case. The width and the height of the map are at least 3 and at most 100 characters. The last line of the input contains two dash characters (--). Output For each test case, write a single line containing a number showing the minimum number of days it takes Bob to reach the treasure, if possible. If the treasure is unreachable, write IMPOSSIBLE. Sample Input *****#********* *.1....4..$...* *..***..2.....* *..2..*****..2* *..3..******37A *****9..56....* *.....******..* ***CA********** ***** *$3** *.2** ***#* -- Sample Output 1 IMPOSSIBLE
Typesetting 程序编写
Problem Description Modern fonts are generally of two varieties: outline fonts, whose glyphs (the individual character shapes) are specified mathematically as a set of curves, and bitmap fonts, whose glyphs are specified as patterns of pixels. Fonts may also include embedded information such as kerning pairs (adjusting the spacing between certain pairs of glyphs, such as "AW", so that they appear spaced correctly), tracking hints (for managing inter-glyph spacing), antialiasing hints (smoothing of pixellated edges), and much more. To be sure, modern fonts are more than a simple collection of shapes, and displaying them properly is a common programming challenge. For this problem we will concern ourselves with bitmapped fonts and a simple form of typesetting called glyph packing. Essentially, the idea is to pack the glyphs as tightly as possible while maintaining at least one horizontal pixel of separation between glyphs. For example, consider the glyphs shown to the left below for the Roman characters "P" and "J". The figure to the right shows them after glyph packing. Note that they are as close as possible without touching horizontally. Here's another example. In this case, notice that the final glyph cannot be packed at all. After packing, pixels from distinct glyphs may be adjacent diagonally or vertically, but not horizontally. The following example shows that pixels may be adjacent diagonally. The "Love" test case in the example input section shows that they may be adjacent vertically. Glyph packing has the nice property that it's easy to build "fancy" glyphs into the font so that glyph packing creates special effects with no extra work. Look at the "Toy" example below. The same simple packing process has been applied to these glyphs as to the ones above, but the result is more dramatic: Glyph packing has a few caveats, however, one of which we must concern ourselves with for this problem. Consider the example on the left below where a glyph for a hyphen is followed by a glyph for an underscore. Based on our one horizontal pixel of separation rule, how would this pack? Clearly something more is needed, and that something more is hinting within the glyphs themselves. Recall that in actual practice, fonts contain kerning pairs, tracking hints, etc. For our purposes, our hinting will be limited to "invisible" pixels that count as a pixel for the purpose of packing, but not for display. The center image below represents invisible pixels as open dots instead of closed dots. Now the two glyphs can be properly packed, resulting in the output shown on the right. Now for the formal definition of a proper packing: (1) Glyphs are packed as close as possible without allowing any pixels from different glyphs to be immediately horizontally adjacent; (2) Given two glyphs, they may not be packed in such a way that any pixel of the leftmost glyph at a given height ends up positioned to the right of any pixel at the same height in the rightmost glyph. Condition (2) above is easily understood by visualizing two glyphs sitting side by side, separated by a small space. If you "squeeze" them together, condition (2) says that their pixels are not allowed to "pass through" one another. Consider the example to the left below. The center image is not the proper packing, because it violates condition (2) of the formal definition. The image on the right is the proper packing of these glyphs. Input The input for this problem is sets of glyphs to be packed. In a given test case, all glyphs are the same height, and an integer, N, on the first line of the test case specifies this height. The next N lines contain the glyphs to be packed. Empty pixels in a glyph are represented by a dot '.' character. Non-empty pixels are represented by a hash mark '#' for visible pixels, and a zero '0' for invisible pixels. Glyphs are separated by a single column of space characters. The input will always consist of more than one glyph, at least one of which will always contain at least one visible pixel. A glyph will always have at least one non-empty pixel in its leftmost and rightmost column, and every glyph will have at least one non-empty pixel at the same height as at least one other glyph in the input. The minimum dimension of a glyph is 1 × 1, the maximum dimension is 20 × 20, and the maximum number of glyphs that will appear in any test case is 20. Test cases continue until a value of zero is specified for N. Output For each test case, first output the number of that test case (starting with 1) on a line by itself. Then output the proper packing of the input glyphs, using the dot '.' character for empty pixels and for invisible pixels, and the hash mark '#' character for visible pixels. Omit leading and trailing empty columns (columns with no visible pixels) so that both the leftmost and rightmost output columns contain at least one visible pixel. Sample Input 8 ###. ...# #..# ...# #..# ...# ###. ...# #... ...# #... ...# #... #..# #... #### 8 ############# .... ............. ..#.......... .... ............. ..#.......... .##. .........#..# ..#.......... #..# .........#..# ..#.......... #..# .........#..# ..#.......... .##. ..........### ............. .... ............# ............. .... ############. 8 ############# ............. ..#.......... ............. ..#.......... .........#..# ..#.......... .........#..# ..#.......... .........#..# ..#.......... ..........### ............. ............# ............. ############. 5 0..0 0..0 0..0 0..0 #### 0..0 0..0 0..0 0..0 #### 5 #.... .###. #.... #...# #...# #...# #...# ....# .###. ....# 3 ### 0.0 ### #.# 0.0 #.# ### 0.0 ### 3 0.0 ### 0.0 0.0 #.# 0.0 0.0 ### 0.0 8 #.... .... ..... .... #.... .... ..... .... #.... .##. #...# .##. #.... #..# .#.#. #..# #.... #..# .#.#. #..# #.... #..# .#.#. ###. #.... .##. ..#.. #... ##### .... ..#.. .### 0 Sample Output 1 ###..# #..#.# #..#.# ###..# #....# #....# #.#..# #.#### 2 ############# ..#.......... ..#..##..#..# ..#.#..#.#..# ..#.#..#.#..# ..#..##...### ............# ############. 3 .....############# .......#.......... .......#.#..#..... .......#.#..#..... .......#.#..#..... .......#..###..... ............#..... ############...... 4 ......... ......... ####..... ......... .....#### 5 #......###. #.....#...# #...#.#...# #...#.....# .###......# 6 ###.....### #.#.....#.# ###.....### 7 ### #.# ### 8 #.............. #.............. #..##.#...#.##. #.#..#.#.#.#..# #.#..#.#.#.#..# #.#..#.#.#.###. #..##...#..#... #####...#...###
CakeMan 程序的设计问题
Problem Description If you ask one student of HDU “who is the superstar in HDU now?” ,the answer must be “HDU CakeMan” .He sells little cakes in the gate of the HDU students’ dormitory every day .As he says “做人要有小蛋糕精神,不怕风吹雨打,永远三块钱”.But he has no permission. So once seeing ChengGuan coming , he have to run home as fast as possible. Now , ChengGuan is coming now. After some days investigation,ChengGuan have the map of HDU , and know the home of CakeMan, so can you tell me the minimum time ChengGuan cost to catch CakeMan? Once seeing ChengGuan coming, CakeMan will run home through a way which cost the least time , if there are more than one ways , he will randomly choose one ,so none knows which way he takes this time. ChengGuan are be ordered to catch him today, so they want to know the nearest grid which CakeMan will surely pass (excluding the start point of CakeMan and CakeMan’s home). Input The first line of input gives the number of cases, T (at most 90). the first line of each case has four numbers n,m. (2<=n,m<=100) then n lines with m characters describe the maze ‘D’ represents the init position of CakeMan. ‘S’ represents the position of the home of CakeMan. ‘C’ represents the position of the home of ChengGuan. ‘.’ represents the grids can be walked on. ‘X’ represents the wall which can not be stepped on. ‘A’ A is a integer between 0 and 9, represents the grid stands one HDU student who want A pack of Cake. when CakeMan pass on the grid has a integer on it ,he have to stay A seconds to sell cakes to the students (total costs A + 1 seconds to pass the grid), otherwise he pass the grid in one second. And the data makes sure that there must be at least one way to let CakeMan home. Output If there is one nearest grid on the map where ChengGuan can catch CakeMan surely, output how much time(one second one step) can ChengGuan get to this grid.output -1 other wise. Sample Input 1 4 9 ..X..S... ......... X...123.. D.......C Sample Output 7
用linux安装软件出现的问题 ERROR: Exception: Traceback (most recent call last)
edx@ubuntu:~$ git clone https://github.com/kan-bayashi/PytorchWaveNetVocoder.git 正克隆到 'PytorchWaveNetVocoder'... remote: Enumerating objects: 330, done. remote: Counting objects: 100% (330/330), done. remote: Compressing objects: 100% (159/159), done. remote: Total 2328 (delta 220), reused 258 (delta 171), pack-reused 1998 接收对象中: 100% (2328/2328), 436.01 KiB | 736.00 KiB/s, 完成. 处理 delta 中: 100% (1436/1436), 完成. edx@ubuntu:~$ cd PytorchWaveNetVocoder/tools edx@ubuntu:~/PytorchWaveNetVocoder/tools$ make test -d venv || virtualenv -p python3.6 venv Running virtualenv with interpreter /usr/bin/python3.6 Using base prefix '/usr' New python executable in /home/edx/PytorchWaveNetVocoder/tools/venv/bin/python3.6 Also creating executable in /home/edx/PytorchWaveNetVocoder/tools/venv/bin/python Installing setuptools, pkg_resources, pip, wheel...done. . venv/bin/activate && pip install --upgrade pip Requirement already up-to-date: pip in ./venv/lib/python3.6/site-packages (19.3.1) . venv/bin/activate && cd ../ && pip install torch==1.0.1 torchvision==0.2.2 Collecting torch==1.0.1 Downloading https://files.pythonhosted.org/packages/f7/92/1ae072a56665e36e81046d5fb8a2f39c7728c25c21df1777486c49b179ae/torch-1.0.1-cp36-cp36m-manylinux1_x86_64.whl (560.0MB) |████████████████████████████████| 560.0MB 98kB/s eta 0:00:01ERROR: Exception: Traceback (most recent call last): File "/home/edx/PytorchWaveNetVocoder/tools/venv/lib/python3.6/site-packages/pip/_internal/cli/base_command.py", line 153, in _main status = self.run(options, args) File "/home/edx/PytorchWaveNetVocoder/tools/venv/lib/python3.6/site-packages/pip/_internal/commands/install.py", line 382, in run resolver.resolve(requirement_set) File "/home/edx/PytorchWaveNetVocoder/tools/venv/lib/python3.6/site-packages/pip/_internal/legacy_resolve.py", line 201, in resolve self._resolve_one(requirement_set, req) File "/home/edx/PytorchWaveNetVocoder/tools/venv/lib/python3.6/site-packages/pip/_internal/legacy_resolve.py", line 365, in _resolve_one abstract_dist = self._get_abstract_dist_for(req_to_install) File "/home/edx/PytorchWaveNetVocoder/tools/venv/lib/python3.6/site-packages/pip/_internal/legacy_resolve.py", line 313, in _get_abstract_dist_for req, self.session, self.finder, self.require_hashes File "/home/edx/PytorchWaveNetVocoder/tools/venv/lib/python3.6/site-packages/pip/_internal/operations/prepare.py", line 194, in prepare_linked_requirement progress_bar=self.progress_bar File "/home/edx/PytorchWaveNetVocoder/tools/venv/lib/python3.6/site-packages/pip/_internal/download.py", line 465, in unpack_url progress_bar=progress_bar File "/home/edx/PytorchWaveNetVocoder/tools/venv/lib/python3.6/site-packages/pip/_internal/download.py", line 316, in unpack_http_url progress_bar) File "/home/edx/PytorchWaveNetVocoder/tools/venv/lib/python3.6/site-packages/pip/_internal/download.py", line 551, in _download_http_url _download_url(resp, link, content_file, hashes, progress_bar) File "/home/edx/PytorchWaveNetVocoder/tools/venv/lib/python3.6/site-packages/pip/_internal/download.py", line 253, in _download_url hashes.check_against_chunks(downloaded_chunks) File "/home/edx/PytorchWaveNetVocoder/tools/venv/lib/python3.6/site-packages/pip/_internal/utils/hashes.py", line 80, in check_against_chunks for chunk in chunks: File "/home/edx/PytorchWaveNetVocoder/tools/venv/lib/python3.6/site-packages/pip/_internal/download.py", line 223, in written_chunks for chunk in chunks: File "/home/edx/PytorchWaveNetVocoder/tools/venv/lib/python3.6/site-packages/pip/_internal/utils/ui.py", line 160, in iter for x in it: File "/home/edx/PytorchWaveNetVocoder/tools/venv/lib/python3.6/site-packages/pip/_internal/download.py", line 212, in resp_read decode_content=False): File "/home/edx/PytorchWaveNetVocoder/tools/venv/lib/python3.6/site-packages/pip/_vendor/urllib3/response.py", line 564, in stream data = self.read(amt=amt, decode_content=decode_content) File "/home/edx/PytorchWaveNetVocoder/tools/venv/lib/python3.6/site-packages/pip/_vendor/urllib3/response.py", line 507, in read data = self._fp.read(amt) if not fp_closed else b"" File "/home/edx/PytorchWaveNetVocoder/tools/venv/lib/python3.6/site-packages/pip/_vendor/cachecontrol/filewrapper.py", line 65, in read self._close() File "/home/edx/PytorchWaveNetVocoder/tools/venv/lib/python3.6/site-packages/pip/_vendor/cachecontrol/filewrapper.py", line 52, in _close self.__callback(self.__buf.getvalue()) File "/home/edx/PytorchWaveNetVocoder/tools/venv/lib/python3.6/site-packages/pip/_vendor/cachecontrol/controller.py", line 300, in cache_response cache_url, self.serializer.dumps(request, response, body=body) File "/home/edx/PytorchWaveNetVocoder/tools/venv/lib/python3.6/site-packages/pip/_vendor/cachecontrol/serialize.py", line 72, in dumps return b",".join([b"cc=4", msgpack.dumps(data, use_bin_type=True)]) File "/home/edx/PytorchWaveNetVocoder/tools/venv/lib/python3.6/site-packages/pip/_vendor/msgpack/__init__.py", line 46, in packb return Packer(**kwargs).pack(o) File "/home/edx/PytorchWaveNetVocoder/tools/venv/lib/python3.6/site-packages/pip/_vendor/msgpack/fallback.py", line 900, in pack self._pack(obj) File "/home/edx/PytorchWaveNetVocoder/tools/venv/lib/python3.6/site-packages/pip/_vendor/msgpack/fallback.py", line 891, in _pack nest_limit - 1) File "/home/edx/PytorchWaveNetVocoder/tools/venv/lib/python3.6/site-packages/pip/_vendor/msgpack/fallback.py", line 985, in _pack_map_pairs self._pack(v, nest_limit - 1) File "/home/edx/PytorchWaveNetVocoder/tools/venv/lib/python3.6/site-packages/pip/_vendor/msgpack/fallback.py", line 891, in _pack nest_limit - 1) File "/home/edx/PytorchWaveNetVocoder/tools/venv/lib/python3.6/site-packages/pip/_vendor/msgpack/fallback.py", line 984, in _pack_map_pairs self._pack(k, nest_limit - 1) File "/home/edx/PytorchWaveNetVocoder/tools/venv/lib/python3.6/site-packages/pip/_vendor/msgpack/fallback.py", line 847, in _pack return self._buffer.write(obj) MemoryError Makefile:6: recipe for target 'venv/bin/activate' failed make: *** [venv/bin/activate] Error 2 这是运行出来的错误 ,因为时第一次使用,所以没有看懂什么意思,想求助大佬们,怎么解决![图片说明](https://img-ask.csdn.net/upload/201911/07/1573114791_122624.png)这是代码运行make的文件程序
关于spring-boot-thin-launcher打出的jar包里仍然含有许多jar的问题
想把springboot打出的jar包瘦身下,找了下https://github.com/spring-projects-experimental/spring-boot-thin-launcher 然后我加配置 ``` xml <?xml version="1.0" encoding="UTF-8"?> <project xmlns="http://maven.apache.org/POM/4.0.0" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://maven.apache.org/POM/4.0.0 https://maven.apache.org/xsd/maven-4.0.0.xsd"> <modelVersion>4.0.0</modelVersion> <parent> <groupId>org.springframework.boot</groupId> <artifactId>spring-boot-starter-parent</artifactId> <version>2.0.0.RELEASE</version> <relativePath/> <!-- lookup parent from repository --> </parent> <groupId>learn.springboot</groupId> <artifactId>thin-pack-demo</artifactId> <version>1.0.0</version> <name>thin-pack-demo</name> <description>demo to show how to pack thin jar and run</description> <properties> <java.version>1.8</java.version> </properties> <dependencies> <dependency> <groupId>org.springframework.boot</groupId> <artifactId>spring-boot-starter-web</artifactId> </dependency> <dependency> <groupId>org.springframework.boot</groupId> <artifactId>spring-boot-starter-test</artifactId> <scope>test</scope> </dependency> </dependencies> <build> <plugins> <plugin> <groupId>org.springframework.boot</groupId> <artifactId>spring-boot-maven-plugin</artifactId> <dependencies> <dependency> <groupId>org.springframework.boot.experimental</groupId> <artifactId>spring-boot-thin-layout</artifactId> <version>1.0.21.RELEASE</version> </dependency> </dependencies> </plugin> </plugins> </build> </project> ``` mvn package 后为啥打出的app.jar里还是有很多的jar 包,如下图 ![图片说明](https://img-ask.csdn.net/upload/201910/19/1571471310_262141.png) 我删除这些jar包后,执行 java -jar app.jar --thin.root c:\me\.m2 可以运行。 什么地方配置可以去除这些jar包呢
idea,gradle项目报错,解决不了/(ㄒoㄒ)/~~.
``` import javax.swing.*; public class test { private JPanel panel1; public static void main(String[] args) { JFrame frame = new JFrame("test"); frame.setContentPane(new test().panel1); frame.setDefaultCloseOperation(JFrame.EXIT_ON_CLOSE); frame.pack(); frame.setVisible(true); } } //自动生成的方法,第六行会报错,注释掉能运行...... ``` ![图片说明](https://img-ask.csdn.net/upload/201909/21/1569072123_755971.png) 报错信息: ------------------------------------------------------------------------------- Gradle Daemon started in 2 s 140 ms > Task :compileJava > Task :processResources NO-SOURCE > Task :classes > Task :test.main() FAILED Exception in thread "main" java.awt.IllegalComponentStateException: contentPane cannot be set to null. at java.desktop/javax.swing.JRootPane.setContentPane(JRootPane.java:598) at java.desktop/javax.swing.JFrame.setContentPane(JFrame.java:679) at test.main(test.java:8) FAILURE: Build failed with an exception. * What went wrong: Execution failed for task ':test.main()'. > Process 'command 'C:/Program Files/Java/jdk-12.0.2/bin/java.exe'' finished with non-zero exit value 1 * Try: Run with --stacktrace option to get the stack trace. Run with --info or --debug option to get more log output. Run with --scan to get full insights. * Get more help at https://help.gradle.org Deprecated Gradle features were used in this build, making it incompatible with Gradle 6.0. Use '--warning-mode all' to show the individual deprecation warnings. See https://docs.gradle.org/5.2.1/userguide/command_line_interface.html#sec:command_line_warnings BUILD FAILED in 6s 2 actionable tasks: 2 executed 21:15:23: External task execution finished ' 'test.main()''. --------------------------------------------------------------------------- ![图片说明](https://img-ask.csdn.net/upload/201909/21/1569072154_766250.png) 根据网上的教程搞得,以前可以运行,一顿操作后就报错了,更新版本,然后插件出了问题,卸载自己安装的插件.jdk一直是最新的12.
想用原始套接字发送syn请求,出现一个问题,是因为构建的包的格式有问题吗?
``` import random import socket import struct import array def create_socket(): s = socket.socket(socket.AF_INET, socket.SOCK_RAW, socket.IPPROTO_TCP) s.setsockopt(socket.IPPROTO_IP, socket.IP_HDRINCL,1) return s def get_host_ip(): s=socket.socket(socket.AF_INET,socket.SOCK_DGRAM) s.connect(('8.8.8.8',80)) ip=s.getsockname()[0] s.close() return ip def doCksum(packet): words = array.array('h', packet) sum = 0 for word in words: sum += (word & 0xffff) sum = (sum >> 16) + (sum & 0xffff) sum += (sum >> 16) return (~sum) & 0xffff def create_ip_header(source_ip, dest_ip): # ip 头部选项 headerlen = 5 version = 4 tos = 0 tot_len = 20 + 20 id = random.randrange(18000,65535,1) frag_off = 0 ttl = 255 protocol = socket.IPPROTO_TCP check = 10 saddr = socket.inet_aton ( source_ip ) daddr = socket.inet_aton ( dest_ip ) hl_version = (version << 4) + headerlen ip_header = struct.pack('BBHHHBBH4s4s', hl_version, tos, tot_len, id, frag_off, ttl, protocol, check, saddr, daddr) return ip_header def create_tcp_syn_header(source_ip, dest_ip, dest_port): source = random.randrange(32000,62000,1) seq = 0 ack_seq = 0 doff = 5 fin = 0 syn = 1 rst = 0 psh = 0 ack = 0 urg = 0 window = socket.htons(8192) check = 0 urg_ptr = 0 offset_res = (doff << 4) + 0 tcp_flags = fin + (syn<<1) + (rst<<2) + (psh<<3) + (ack<<4) + (urg<<5) tcp_header = struct.pack('HHLLBBHHH', source, dest_port, seq, ack_seq, offset_res, tcp_flags, window, check, urg_ptr) source_address = socket.inet_aton( source_ip ) dest_address = socket.inet_aton( dest_ip ) placeholder = 0 protocol = socket.IPPROTO_TCP tcp_length = len(tcp_header) psh = struct.pack('4s4sBBH', source_address, dest_address, placeholder, protocol, tcp_length) psh = psh + tcp_header tcp_checksum = doCksum(psh) tcp_header = struct.pack('HHLLBBHHH', source, dest_port, seq, ack_seq, offset_res, tcp_flags, window, tcp_checksum, urg_ptr) return tcp_header source_ip = get_host_ip() dest_ip = '112.80.248.75' s = create_socket() ip_header = create_ip_header(source_ip,dest_ip) tcp_header = create_tcp_syn_header(source_ip,dest_ip,80) packet = ip_header + tcp_header s.sendto(packet,(dest_ip,80)) ``` **结果** ![图片说明](https://img-ask.csdn.net/upload/201912/17/1576595985_556527.png)
130 个相见恨晚的超实用网站,一次性分享出来
相见恨晚的超实用网站 持续更新中。。。
字节跳动视频编解码面经
三四月份投了字节跳动的实习(图形图像岗位),然后hr打电话过来问了一下会不会opengl,c++,shador,当时只会一点c++,其他两个都不会,也就直接被拒了。 七月初内推了字节跳动的提前批,因为内推没有具体的岗位,hr又打电话问要不要考虑一下图形图像岗,我说实习投过这个岗位不合适,不会opengl和shador,然后hr就说秋招更看重基础。我当时想着能进去就不错了,管他哪个岗呢,就同意了面试...
win10系统安装教程(U盘PE+UEFI安装)
一、准备工作 u盘,电脑一台,win10原版镜像(msdn官网) 二、下载wepe工具箱 极力推荐微pe(微pe官方下载) 下载64位的win10 pe,使用工具箱制作启动U盘打开软件, 选择安装到U盘(按照操作无需更改) 三、重启进入pe系统 1、关机后,将U盘插入电脑 2、按下电源后,按住F12进入启动项选择(技嘉主板是F12) 选择需要启...
程序员必须掌握的核心算法有哪些?
由于我之前一直强调数据结构以及算法学习的重要性,所以就有一些读者经常问我,数据结构与算法应该要学习到哪个程度呢?,说实话,这个问题我不知道要怎么回答你,主要取决于你想学习到哪些程度,不过针对这个问题,我稍微总结一下我学过的算法知识点,以及我觉得值得学习的算法。这些算法与数据结构的学习大多数是零散的,并没有一本把他们全部覆盖的书籍。下面是我觉得值得学习的一些算法以及数据结构,当然,我也会整理一些看过...
Python——画一棵漂亮的樱花树(不同种樱花+玫瑰+圣诞树喔)
最近翻到一篇知乎,上面有不少用Python(大多是turtle库)绘制的树图,感觉很漂亮,我整理了一下,挑了一些我觉得不错的代码分享给大家(这些我都测试过,确实可以生成) one 樱花树 动态生成樱花 效果图(这个是动态的): 实现代码 import turtle as T import random import time # 画樱花的躯干(60,t) def Tree(branch, ...
大学四年自学走来,这些私藏的实用工具/学习网站我贡献出来了
大学四年,看课本是不可能一直看课本的了,对于学习,特别是自学,善于搜索网上的一些资源来辅助,还是非常有必要的,下面我就把这几年私藏的各种资源,网站贡献出来给你们。主要有:电子书搜索、实用工具、在线视频学习网站、非视频学习网站、软件下载、面试/求职必备网站。 注意:文中提到的所有资源,文末我都给你整理好了,你们只管拿去,如果觉得不错,转发、分享就是最大的支持了。 一、电子书搜索 对于大部分程序员...
《奇巧淫技》系列-python!!每天早上八点自动发送天气预报邮件到QQ邮箱
将代码部署服务器,每日早上定时获取到天气数据,并发送到邮箱。 也可以说是一个小人工智障。 思路可以运用在不同地方,主要介绍的是思路。
致 Python 初学者
欢迎来到“Python进阶”专栏!来到这里的每一位同学,应该大致上学习了很多 Python 的基础知识,正在努力成长的过程中。在此期间,一定遇到了很多的困惑,对未来的学习方向感到迷茫。我非常理解你们所面临的处境。我从2007年开始接触 python 这门编程语言,从2009年开始单一使用 python 应对所有的开发工作,直至今天。回顾自己的学习过程,也曾经遇到过无数的困难,也曾经迷茫过、困惑过。开办这个专栏,正是为了帮助像我当年一样困惑的 Python 初学者走出困境、快速成长。希望我的经验能真正帮到你
Java描述设计模式(19):模板方法模式
本文源码:GitHub·点这里 || GitEE·点这里 一、生活场景 通常一款互联网应用的开发流程如下:业务需求,规划产品,程序开发,测试交付。现在基于模板方法模式进行该过程描述。 public class C01_InScene { public static void main(String[] args) { DevelopApp developApp = n...
加快推动区块链技术和产业创新发展,2019可信区块链峰会在京召开
11月8日,由中国信息通信研究院、中国通信标准化协会、中国互联网协会、可信区块链推进计划联合主办,科技行者协办的2019可信区块链峰会将在北京悠唐皇冠假日酒店开幕。   区块链技术被认为是继蒸汽机、电力、互联网之后,下一代颠覆性的核心技术。如果说蒸汽机释放了人类的生产力,电力解决了人类基本的生活需求,互联网彻底改变了信息传递的方式,区块链作为构造信任的技术有重要的价值。   1...
C语言魔塔游戏
很早就很想写这个,今天终于写完了。 游戏截图: 编译环境: VS2017 游戏需要一些图片,如果有想要的或者对游戏有什么看法的可以加我的QQ 2985486630 讨论,如果暂时没有回应,可以在博客下方留言,到时候我会看到。 下面我来介绍一下游戏的主要功能和实现方式 首先是玩家的定义,使用结构体,这个名字是可以自己改变的 struct gamerole { char n...
第三个java程序(表白小卡片)
前言: &nbsp;向女神表白啦,作为一个程序员,当然也有爱情啦。只不过,虽然前面两个程序都只是学习了基础的语法结构和向量哈希表。这里涉及的是Swing,awt图形用户界面和一点文件输入输出流的知识。 &nbsp; 表白代码如下: 另附:里面的音乐和图片可以放在一个自己创建的包里面,也可以放在src里面,或者使用绝对路径。至于布局,我自己的使用的是简单的排班,简单的继承。后面的程序会慢慢实现。 ...
8年经验面试官详解 Java 面试秘诀
作者 |胡书敏 责编 | 刘静 出品 | CSDN(ID:CSDNnews) 本人目前在一家知名外企担任架构师,而且最近八年来,在多家外企和互联网公司担任Java技术面试官,前后累计面试了有两三百位候选人。在本文里,就将结合本人的面试经验,针对Java初学者、Java初级开发和Java开发,给出若干准备简历和准备面试的建议。 Java程序员准备和投递简历的实...
知乎高赞:中国有什么拿得出手的开源软件产品?(整理自本人原创回答)
知乎高赞:中国有什么拿得出手的开源软件产品? 在知乎上,有个问题问“中国有什么拿得出手的开源软件产品(在 GitHub 等社区受欢迎度较好的)?” 事实上,还不少呢~ 本人于2019.7.6进行了较为全面的回答,对这些受欢迎的 Github 开源项目分类整理如下: 分布式计算、云平台相关工具类 1.SkyWalking,作者吴晟、刘浩杨 等等 仓库地址: apache/skywalking 更...
化繁为简 - 腾讯计费高一致TDXA的实践之路
导语:腾讯计费是孵化于支撑腾讯内部业务千亿级营收的互联网计费平台,在如此庞大的业务体量下,腾讯计费要支撑业务的快速增长,同时还要保证每笔交易不错账。采用最终一致性或离线补...
Linux网络服务-----实验---PXE和Kickstart的无人值守装机
目录 一.PXE的原理 二.kickstart的原理 三.PXE与kickstart的结合使用自动装机 一.PXE的原理 PXE(preboot execute environment,预启动执行环境)是由Intel公司开发的最新技术,工作于Client/Server的网络模式,支持工作站通过网络从远端服务器下载映像,并由支持通过网络启动操作系统,再启动过程中,终端要求服务器分配IP地址...
究竟你适不适合买Mac?
我清晰的记得,刚买的macbook pro回到家,开机后第一件事情,就是上了淘宝网,花了500元钱,找了一个上门维修电脑的师傅,上门给我装了一个windows系统。。。。。。 表砍我。。。 当时买mac的初衷,只是想要个固态硬盘的笔记本,用来运行一些复杂的扑克软件。而看了当时所有的SSD笔记本后,最终决定,还是买个好(xiong)看(da)的。 已经有好几个朋友问我mba怎么样了,所以今天尽量客观...
A*搜索算法概述
编者按:本文作者奇舞团前端开发工程师魏川凯。A*搜索算法(A-star search algorithm)是一种常见且应用广泛的图搜索和寻径算法。A*搜索算法是通过使用启...
程序员写了一个新手都写不出的低级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岁以后,方法论比经验重要》,收到了不少读者的反馈,觉得挺受启发。其实,冯唐写了不少关于职场方面的文章,都挺不错的。可惜大家只记住了“春风十里不如你”、“如何避免成为油腻腻的中年人”等不那么正经的文章。 本文整理了冯...
从顶级黑客到上市公司老板
一看标题,很多老读者就知道我在写什么了。今天Ucloud成功上市,季昕华成为我所熟悉的朋友里又双叒叕一个成功上市的案例。我们认识大概是十五年多吧,如果没记错,第一次见面应该是2004年,...
蓝桥杯知识点汇总:基础知识和常用算法
文章目录基础语法部分:算法竞赛常用API:算法部分数据结构部分 此系列包含蓝桥杯绝大部分所考察的知识点,以及真题题解~ 基础语法部分: 备战蓝桥杯java(一):一般输入输出 和 快速输入输(BufferedReader&amp;BufferedWrite) 备战蓝桥杯java(二):java编程规范和常用数据类型 备战蓝桥杯java(三):常用功能符以及循环结构和分支结构 备战蓝桥杯java(四...
作为一个程序员,CPU的这些硬核知识你必须会!
CPU对每个程序员来说,是个既熟悉又陌生的东西? 如果你只知道CPU是中央处理器的话,那可能对你并没有什么用,那么作为程序员的我们,必须要搞懂的就是CPU这家伙是如何运行的,尤其要搞懂它里面的寄存器是怎么一回事,因为这将让你从底层明白程序的运行机制。 随我一起,来好好认识下CPU这货吧 把CPU掰开来看 对于CPU来说,我们首先就要搞明白它是怎么回事,也就是它的内部构造,当然,CPU那么牛的一个东...
破14亿,Python分析我国存在哪些人口危机!
一、背景 二、爬取数据 三、数据分析 1、总人口 2、男女人口比例 3、人口城镇化 4、人口增长率 5、人口老化(抚养比) 6、各省人口 7、世界人口 四、遇到的问题 遇到的问题 1、数据分页,需要获取从1949-2018年数据,观察到有近20年参数:LAST20,由此推测获取近70年的参数可设置为:LAST70 2、2019年数据没有放上去,可以手动添加上去 3、将数据进行 行列转换 4、列名...
强烈推荐10本程序员在家读的书
很遗憾,这个春节注定是刻骨铭心的,新型冠状病毒让每个人的神经都是紧绷的。那些处在武汉的白衣天使们,尤其值得我们的尊敬。而我们这些窝在家里的程序员,能不外出就不外出,就是对社会做出的最大的贡献。 有些读者私下问我,窝了几天,有点颓丧,能否推荐几本书在家里看看。我花了一天的时间,挑选了 10 本我最喜欢的书,你可以挑选感兴趣的来读一读。读书不仅可以平复恐惧的压力,还可以对未来充满希望,毕竟苦难终将会...
Linux自学篇——linux命令英文全称及解释
man: Manual 意思是手册,可以用这个命令查询其他命令的用法。 pwd:Print working directory 意思是密码。 su:Swith user 切换用户,切换到root用户 cd:Change directory 切换目录 ls:List files 列出目录下的文件 ps:Process Status 进程状态 mkdir:Make directory ...
Python实战:抓肺炎疫情实时数据,画2019-nCoV疫情地图
今天,群里白垩老师问如何用python画武汉肺炎疫情地图。白垩老师是研究海洋生态与地球生物的学者,国家重点实验室成员,于不惑之年学习python,实为我等学习楷模。先前我并没有关注武汉肺炎的具体数据,也没有画过类似的数据分布图。于是就拿了两个小时,专门研究了一下,遂成此文。
疫情数据接口api
返回json示例 { "errcode":0,//0标识接口正常 "data":{ "date":"2020-01-30 07:47:23",//实时更新时间 "diagnosed":7736,//确诊人数 "suspect":12167,//疑是病例人数 "death":170,//死亡人数 "cur...
智力题(程序员面试经典)
NO.1  有20瓶药丸,其中19瓶装有1克/粒的药丸,余下一瓶装有1.1克/粒的药丸。给你一台称重精准的天平,怎么找出比较重的那瓶药丸?天平只能用一次。 解法 有时候,严格的限制条件有可能反倒是解题的线索。在这个问题中,限制条件是天平只能用一次。 因为天平只能用一次,我们也得以知道一个有趣的事实:一次必须同时称很多药丸,其实更准确地说,是必须从19瓶拿出药丸进行称重。否则,如果跳过两瓶或更多瓶药...
相关热词 c# 压缩图片好麻烦 c#计算数组中的平均值 c#获取路由参数 c#日期精确到分钟 c#自定义异常必须继承 c#查表并返回值 c# 动态 表达式树 c# 监控方法耗时 c# listbox c#chart显示滚动条
立即提问