Bill Joy

  查看Vi的历史时,才知道了这个大名鼎鼎的编辑器的作者──Bill Joy,在wiki里看了一下他的介绍,简直是神一般的人物啊,我觉得按照实力肯定超过RMS,至少跟Knuth是同一个量级的人物。金庸的小说我不太熟,不过要是用我有限的关于《天龙八部》的了解做类比的话,RMS应该是乔峰,Knuth差不多应该是乔峰老爹,Bill则是那个扫地僧。当然最后两个可能有些失当,因为Knuth并不是那么穷凶极恶的人,而Bill在计算机界并不像扫地僧那么默默无闻,相反,他的知名度不亚于另一个Bill──Bill Gates(我觉得Gates差不多是个慕容复的角色,当然只是指他的身份是皇族。虽然MS有些垄断,不过Gates真是个不错的人)

     网上的介绍太少了,连wiki上都只有短短的几行,所以这里想稍微整理一下他的资料,好好膜拜一下这家伙。
     Bill Joy其实并不叫Bill,他的真名是William Nelson Joy,不知道为什么通称叫Bill Joy。他和三个斯坦福的人创办了Sun Microsystem(前段时间,Sun已经被Oracle收购了,真是可惜,Sun是计算机界少有的很无私的公司,做了很多开源的好东
西,MySql,OpenOffice,OpenSolaris,VBox……),2003年时他辞去了在Sun的首席科学家职务。
     Bill出生于1954年,他在密歇根州度过了他的童年时光。和很多武侠小说里的人物不一样的是,Bill是受了正规教育的,并且小时候就展现出大师的潜质。16岁的时候,他进入了密歇根大学。Bill在这里接触到了计算机并开始迷恋上编程。那时候的计算机非常昂贵,学校只给每个学生分配了一定的机时,开机时输入时间数,超过这个时间就没法使用了。不过有个家伙发现,如果选择输入的时间是一个字母,那么系统就不会终止你使用。Bill每天夜里都跑到机房去编程,到凌晨才回来。Bill仿佛那个扫地僧一般,利用自己的身份偷偷学习武功秘籍。从密歇根大学毕业后,Bill进入了加州大学伯克利分校。刚进入伯克利时,Bill的武功并不是最好的。不过他继续发疯似的编程,功力大大提升。1979年时,Bill获得了电气工程与计算机科学硕士学位,并且继续在伯克利攻读博士学位。这时候他的功力已经可以在高手云集的电脑武林中有一席之地了。在博士期间,Bill和另一个人一起开发Unix的伯克利分支,也就是BSD,另立宗派。BSD后来有了许多分支,包括FreeBSD,NetBSD和OpenBSD等,以及商业上的MacOSX,实力不容小觑。在伯克利期间,Bill还开发了著名的编辑器Vi,由于他的modem只有300K,所以这个编辑器的操作方式非常古怪,许多初学电脑的人完全不知道该如何操作,不过这并不妨碍它成为Unix上最出名的两个编辑器之一。除了这两个软件之外,Bill的引人注意的贡献还有TCP/IP以及csh,这两个东西现在还在广泛使用之中。
     不过Bill再天才毕竟也是一个人,精力还是有限的。由于把大部分时间都花在了BSD上,自己的博士项目则没有好好研究,遭到师傅的痛骂。不过OS的事情也是师傅交给他的,所以他觉得师傅实在不够厚道,心里颇有微词。恰好这时候,斯坦福大学的两个人听说了Bill的大名,慕名打电话要和Bill办公司。Bill不知道是诸葛亮附体,还是故意给斯坦福的人难堪(因为斯坦福是伯克利的死敌,类似于国内的清华北大的关系,虽然清华还不足以与斯坦福他们相比),接了十几次电话愣是没有出山。他们陆续地打了一个多月电话,Bill实在拗不过,只好答应和他们见面。打电话的两个人分别是Vinod Khosla和Scott McNealy,分别是Sun的第一任和第二任CEO,见面的时候,他们还带上了有硬件诗人之称的Andy Bechtolsheim。Bill和前面两个人对生意的讨论说不上话,和这个硬件诗人倒是很投缘,两人互相切磋武艺,相谈甚欢。Bill再想到自己在伯克利的龌龊之事,狠下心来签了字,做了叛逃师门的勾当。
     Bill在Sun主管软件开发,继续**武艺。他在自己以前开发的BSD上继续发展成为Sun的镇派之宝,并且主持设计了SPARC微处理器,更是Sun的独门绝技。凭借着SPARC的优异性能,Sun在高端微处理器市场击退众多高手,取得领先地位。除了这些秘籍之外,Bill还主持开发了万能语言──Java,此兵器更是所向披靡。虽然略显笨重,却是武林中难觅敌手的重量级兵器,在众多语言排行榜上力压C语言排名第一。Bill之强,不仅使Sun迅速成为足以与IBM和HP抗衡的企业之一,也给计算机界注入了新动力。
     2003年,Bill退出了自己工作了20多年的Sun,在这之前,Sun已经在走下坡路了。Bill的离开更是一个沉重的打击。Bill并没有归隐,但也没有立刻投入工作。他把一部分精力投入研究高科技的潜在风险之中。他认为生物技术和纳米技术可能会造成人们无法控制的灾难。科学家通常只是从纯技术的角度研究问题,不能避免这些成果被政府、组织甚至个人利用造成伤害。我个人对此是很赞同的,人类历史上已经不止一次发生了科技滥用的现象,从大炮到核武器,都是人类利用科技自相残杀。Bill准备深入涉及公共政策领域研究,也就是参与科学政策制定,让人们深刻认识和采取措施应对潜在的巨大科学风险。
    Bill真是硅谷罕见的技术天才,不仅创作了许多重量级的软件,给开源社区做了很大的贡献,同时也对技术本身的作用进行了深刻的反思。我想这才是真正的大牛,真正的科学家。
有个网站好像是用来查看权限配置的,To find where setResourceMonitors is defined: defs:setResourceMonitors To find files that use sprintf in usr/src/cmd/cmd-inet/usr.sbin/: refs:sprintf path:usr/src/cmd/cmd-inet/usr.sbin To find assignments to variable foo: "foo =" To find Makefiles where the pstack binary is being built: pstack path:Makefile to search for phrase "Bill Joy": "Bill Joy" To find perl files that do not use /usr/bin/perl but something else: -"/usr/bin/perl" +"/bin/perl" To find all strings beginning with foo use the wildcard: foo* To find all files which have . c in their name (dot is a token!): ". c" To find all files which start with "ma" and then have only alphabet characters do: path:/ma[a-zA-Z]*/ To find all main methods in all files analyzed by C analyzer (so .c, .h, ...) do: main type:c More info: A Query is a series of clauses. A clause may be prefixed by: a plus "+" or a minus "-" sign, indicating that the clause is required or prohibited respectively; or a term followed by a colon ":", indicating the field to be searched. This enables one to construct queries which search multiple fields. A clause may be either: a term, indicating all the documents that contain this term; or a phrase - group of words surrounded by double quotes " ", e.g. "hello dolly" a nested query, enclosed in parentheses "(" ")" (also called query/field grouping) . Note that this may be used with a +/- prefix to require any of a set of terms. boolean operators which allow terms to be combined through logic operators. Supported are AND(&&), "+", OR(||), NOT(!) and "-" (Note: they must be ALL CAPS). Regular Expression, Wildcard, Fuzzy, Proximity and Range Searches: to perform a regular expression search use the "/" enclosure, e.g. /[mb]an/ - will search for man or for ban; NOTE: path field search escapes "/" by default, so it only supports regexps when the search string starts and ends with "/". More info can be found on Lucene regexp page. to perform a single character wildcard search use the "?" symbol, e.g. te?t to perform a multiple character wildcard search use the "*" symbol, e.g. test* or te*t you can use a * or ? symbol as the first character of a search (unless not enabled using indexer option -a). to do a fuzzy search (find words similar in spelling, based on the Levenshtein Distance, or Edit Distance algorithm) use the tilde, "~", e.g. rcs~ to do a proximity search use the tilde, "~", symbol at the end of a Phrase. For example to search for a "opengrok" and "help" within 10 words of each other enter: "opengrok help"~10 range queries allow one to match documents whose field(s) values are between the lower and upper bound specified by the Range Query. Range Queries can be inclusive or exclusive of the upper and lower bounds. Sorting is done lexicographically. Inclusive queries are denoted by square brackets [ ] , exclusive by curly brackets { }. For example: title:{Aida TO Carmen} - will find all documents between Aida to Carmen, exclusive of Aida and Carmen. Escaping special characters: Opengrok supports escaping special characters that are part of the query syntax. Current special characters are: + - && || ! ( ) { } [ ] ^ " ~ * ? : \ / To escape these character use the \ before the character. For example to search for (1+1):2 use the query: \(1\+1\)\:2 NOTE on analyzers: Indexed words are made up of Alpha-Numeric and Underscore characters. One letter words are usually not indexed as symbols! Most other characters (including single and double quotes) are treated as "spaces/whitespace" (so even if you escape them, they will not be found, since most analyzers ignore them). The exceptions are: @ $ % ^ & = ? . : which are mostly indexed as separate words. Because some of them are part of the query syntax, they must be escaped with a reverse slash as noted above. So searching for \+1 or \+ 1 will both find +1 and + 1. Valid FIELDs are full Search through all text tokens (words,strings,identifiers,numbers) in index. defs Only finds symbol definitions (where e.g. a variable (function, ...) is defined). refs Only finds symbols (e.g. methods, classes, functions, variables). path path of the source file (no need to use dividers, or if, then use "/" - Windows users, "\" is an escape key in Lucene query syntax! Please don't use "\", or replace it with "/"). Also note that if you want just exact path, enclose it in "", e.g. "src/mypath", otherwise dividers will be removed and you get more hits. type Type of analyzer used to scope down to certain file types (e.g. just C sources). Current mappings: [ada=Ada, asm=Asm, bzip2=Bzip(2), c=C, clojure=Clojure, csharp=C#, cxx=C++, eiffel=Eiffel, elf=ELF, erlang=Erlang, file=Image file, fortran=Fortran, golang=Golang, gzip=GZIP, haskell=Haskell, hcl=HCL, jar=Jar, java=Java, javaclass=Java class, javascript=JavaScript, json=Json, kotlin=Kotlin, lisp=Lisp, lua=Lua, mandoc=Manual pages, pascal=Pascal, perl=Perl, php=PHP, plain=Plain Text, plsql=PL/SQL, powershell=PowerShell script, python=Python, r=R, ruby=Ruby, rust=Rust, scala=Scala, sh=Shell script, sql=SQL, swift=Swift, tar=Tar, tcl=Tcl, terraform=Terraform, troff=Troff, typescript=TypeScript, uuencode=UUEncoded, vb=Visual Basic, verilog=Verilog, xml=XML, yaml=Yaml, zip=Zip] The term (phrases) can be boosted (making it more relevant) using a caret ^ , e.g. help^4 opengrok - will make term help boosted Opengrok search is powered by Lucene, for more detail on query syntax refer to Lucene docs. Intelligence Window这是用例,我该怎么来查找这个权限
最新发布
11-14
评论 2
成就一亿技术人!
拼手气红包6.0元
还能输入1000个字符
 
红包 添加红包
表情包 插入表情
 条评论被折叠 查看
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值