mind

elasticsearch 的 URL 查询

喜夏-厌秋 提交于 2020-03-15 12:01:18
示例 GET /movies/_search?q=2012&df=title { "profile": true } # 泛查询 GET /movies/_search?q=2012 { "profile": true } # 指定字段查询 GET /movies/_search?q=title:2012 { "profile": true } #Term or phrase # "beautiful mind" 等价于 beautiful AND mind, 还要求前后顺序保持一致 # beautiful mind 等价于 beautiful OR mind # 使用引号,短语查询 GET /movies/_search?q=title:"beautiful mind" { "profile": true } # 分组查询 GET /movies/_search?q=title:(beautiful mind) { "profile": true } # 错误使用分组,mind 为泛查询 GET /movies/_search?q=title:beautiful mind { "profile": true } # 逻辑运算 GET /movies/_search?q=title:(beautiful AND mind) { "profile": true } GET

Mind map 在 Wikipedia 的定义

…衆ロ難τιáo~ 提交于 2019-12-07 17:55:55
好不容易找到了 Mind map 在 Wikipedia 的定义,现在看来 Mind map 会成为我工作中的一个重要助手,从上周针对 PDF Form and Pattern Render 的 Mind 就可以看出一点端倪。 Mind map From Wikipedia, the free encyclopedia (Redirected from Mind mapping ) Jump to: navigation , search A mind map (or mind-map ) is a diagram used for linking words and ideas to a central key word or idea. It is used to visualize , classify , structure , and generate ideas, as well as an aid in study , problem solving , and decision making . It is similar to a semantic network or cognitive map but there are no formal restrictions on the kinds of links used. Most often the map

[模板]Dijkstra-优先队列优化-单元最短路

人走茶凉 提交于 2019-12-04 01:06:19
输入: 6 9 1 1 2 1 1 3 12 2 3 9 2 4 3 3 5 5 4 3 4 4 5 13 4 6 15 5 6 4 输出: 0 1 8 4 13 17 Code: 1 #include<iostream> 2 #include<cstring> 3 #include<queue> 4 using namespace std; 5 #define PII pair<int,int> 6 const int maxn=10000,maxm=1000; 7 int cnt=0,edge[maxm],ver[maxm],nxt[maxm],head[maxn]; 8 int d[maxn]; 9 bool v[maxn];//v[i]表示i点是否松弛 10 priority_queue < PII,vector<PII>,greater<PII> > q;//优先队列,以p.first最小优先 11 inline void add(int x,int y,int z) 12 { 13 cnt++; 14 ver[cnt]=y; 15 edge[cnt]=z; 16 nxt[cnt]=head[x]; 17 head[x]=cnt; 18 } 19 inline void dijk(int t) 20 { 21 int i; 22 memset(d,0x3f,sizeof

codeforces 1245DShichikuji and Power Grid

谁都会走 提交于 2019-12-03 14:50:25
题意::求让所有城市连接起来的最小花费 连接方式(1:在城市建立发电站 2:用电线连接有发电站的城市 ) 思路::最小生成树,倘若在城市建电站,花费 c[ i ] ,反之连接 其他城市 花费 k[i]+k[j])*(i,j曼哈顿距离) 我们可以建立一个虚点,他到所有城市的花费即为自建花费 然后跑最小生成树,不仅保证图联通,还是最小花费,需要注意一下自建电站情况 Kruskal 1 #include<bits/stdc++.h> 2 #define ll long long 3 const ll inf=1e15+7; 4 using namespace std; 5 const int maxn=2005; 6 7 struct node 8 { 9 int x,y; 10 ll x1,y1,val; 11 bool operator < (const node &lh)const {return val<lh.val;} 12 }ma[maxn],mb[maxn*maxn+2500]; 13 int n,t=0,f[maxn],a[maxn]; 14 ll sum=0,c[maxn],k[maxn]; 15 vector<pair<int,int> >v; 16 17 ll dis(int x,int y) 18 { 19 ll num=(abs(ma[x].x1-ma[y]

Python 入门 之 初识面向对象

匿名 (未验证) 提交于 2019-12-02 22:51:30
# 面向过程编程 s = "alexdsb" count = 0 for i in s : count += 1 print ( count ) s = [ 1 , 2 , 7 , 3 , 4 , 5 ,] count = 0 for i in s : count += 1 print ( count ) # 面向对象编程 def my_len ( s ): count = 0 for i in s : count += 1 print ( count ) my_len ([ 1 , 2 , 3 , 4 , 5 ]) 可得出结论: # 面向函数编程 def login (): pass def check_buy_goods (): pass def change_pwd (): pass def shopping (): pass def register (): pass def check_unbuy_goods (): pass # 面向对象编程 class Auth : def login ( self ): pass def register ( self ): pass def change_pwd ( self ): pass class Shopping : def shopping ( self ): pass def check_buy_goods (

一,对象初识

人盡茶涼 提交于 2019-11-29 00:04:19
1.1 回顾面向过程编程vs函数式编程 # 面向过程编程 测量对象的元素个个数。 s1 = 'fjdsklafsjda' count = 0 for i in s1: count += 1 l1 = [1,2,3,4] count = 0 for i in l1: count += 1 View Code def func(s): count = 0 for i in s: count += 1 return count func('fdsafdsa') func([1,2,3,4]) View Code 通过对比可知:函数编程较之面向过程编程最明显的两个特点: 1,减少代码的重用性。 2,增强代码的可读性。 1.2 函数式编程vs面向对象编程 # 函数式编程 # auth 认证相关 def login(): pass def regisgter(): pass # account 账户相关 def func1(): pass def func2(): pass # 购物车相关 def shopping(username,money): pass def check_paidgoods(username,money): pass def check_unpaidgoods(username,money): pass def save(username,money): pass

Python之面向对象(一)面向对象初识

╄→尐↘猪︶ㄣ 提交于 2019-11-28 16:23:47
6.2 面向对象初识 面向对象初识 回顾面向过程编程VS函数式编程 面向过程编程 # 面向过程编程 测量对象的元素个个数。 s1 = 'fjdsklafsjda' count = 0 for i in s1: count += 1 l1 = [1,2,3,4] count = 0 for i in l1: count += 1 #面向过程编程 函数式编程 def func(s): count = 0 for i in s: count += 1 return count func('fdsafdsa') func([1,2,3,4]) #函数式编程 通过对比可知,函数编程和面向过程编程明显有两个特点:1.减少代码的重复性。2.增强代码的可读性 函数式编程VS面向对象编程 # 函数式编程 # auth 认证相关 def login(): pass def regisgter(): pass # account 账户相关 def func1(): pass def func2(): pass # 购物车相关 def shopping(username,money): pass def check_paidgoods(username,money): pass def check_unpaidgoods(username,money): pass def save(username

百万年薪python之路 -- 面向对象初始

99封情书 提交于 2019-11-27 21:47:45
面向对象初始 1.1 面向过程编程vs函数式编程 函数编程较之面向过程编程最明显的两个特点: 1,减少代码的重用性。 2,增强代码的可读性。 1.2 函数式编程vs面向对象编程 面向对象编程:是一类相似功能函数的集合,使你的代码更清晰化,更合理化。 面向对象的程序设计的核心是对象(上帝式思维),要理解对象为何物,必须把自己当成上帝,上帝眼里世间存在的万物皆为对象,不存在的也可以创造出来。 类:就是具有相同属性和功能的一类事物。 对象:就是类的具体表现,类的实例化。 ⾯向对象思维, 要⾃⼰建立对象. ⾃⼰建立场景. 你是就是⾯向对象世界中的上帝. 你想让⻋⼲嘛就⼲嘛. 你想让⼈⼲嘛⼈就能⼲嘛。 面向对象,要拥有上帝的视角看问题,类其实就是一个公共模板(厂房),对象就从具体的模板实例化出来(慢慢体会)。 1.3 类的结构 class Human: """ 此类主要是构建人类 """ mind = '有思想' # 第一部分:静态属性 属性 静态变量 静态字段 dic = {} l1 = [] def work(self): # 第二部分:方法 函数 动态属性 print('人类会工作') class 是关键字与def用法相同,定义一个类。 Human是此类的类名,类名使用驼峰(CamelCase)命名风格,首字母大写,私有类可用一个下划线开头。 类的结构从大方向来说就分为两部分:

CISO Leadership Mind Map

假如想象 提交于 2019-11-26 16:17:32
SANS Cisco Mind Map A CISO (Chief Information Security Officer) has a complex role within a company. They have a wide array of tasks to perform, that involves many differing parts, which the average individual is not always aware of. CISO Mind Map is an overview of responsibilities and ever expanding role of the CISO. This Security Leadership poster made by SANS shows exactly the matters a CISO needs to mind when creating a world class IT Security team. It also highlights the essential features necessary of a Security Operations Centre (SOC). To make this chart more practical, I put them into