nagra iv

Location and special variables for bash programming under Linux (iv)1.bash Position Variable:$, $, ... The 1th parameter, the second argument, ...Shift poll substitution, cullingExample: Using a script to interpret the meaning of positional variables, create the following script:Nano shift.sh Create a script file and add the following:#!/bin/bash#If [$#-lt 5]; Then the script is followed by no less than 5 parametersecho "./shift.sh ARG1 .... ARG5 "Exi

Shell Basics (iv) Uniq and TeeUniq is used to repeat the row, the most common option is only one, that is,-C count counts the number of repeated rows, and writes the number of repetitions in front.Note: Use the premise that you need to sort the files first, otherwise it won't work.#vim aming.txt "Write"111222111333#uniq aming.txt "Separate use of uniq, do not remove duplicate lines that are not together."111222111333#sort aming.txt |uniq "After using

"Algorithms IV" for solving the Kosaraju algorithm of strong connected componentsThe Kosaraju algorithm (also known as the kosaraju–sharir algorithm ) is a linear time to find a An algorithm for strongly connected components in a forward graph . The name of the mouthful came from his author, but he could not find his life. should be an Indian.Solving problems: Requiring the number/division of strongly connected components in a forward graphAlgorith

Linux Operations Phase II (iv) User managementI. Related documents"/etc/passwd user information fileRoot:x:0:0:root:/root:bin/bash(The 1th to 7th fields, in turn)1. User name2. Password Tag3,uid: Super User root uid is 0, ordinary users to upgrade to Administrator,uid changed to 0 (not recommended to establish multiple administrator accounts; 1-499 System User uid(pseudo-user), can not log into the system, used to run the system or service, where 1-9

Redis Usage Basics (iv)--redis Sorting and message notification(Reproduced please attach this article link--linhxx)First, sort1. CommandSort key [ALPHA] [DESC] [LIMIT start end], sorts the list, collection, and ordered collection, and when the ALPHA parameter is added, it can be sorted in dictionary order, with DESC in reverse order, plus LIMIT supporting paging.2. Key parametersBy parameter: By Key:*->val, you can specify criteria for sorting, you ca

; final不仅可以修饰基本数据类型 还可以引用类型 如果final修饰的是一个基本数据类型:基本数据类型的值不能再改变了... 如果final习俗的是一个引用类型数据:引用类型的地址值不能再改变了,但是堆内存中的成员变量的值可以变得Final initialization time:1) Final value can only be assigned once (final int a = 10) final int a ; //在使用之前进行初始化,赋值(在构造方法之前赋值) (非静态的...) (iv) polymorphicIn the same moment, manifested in different states;Water:Solid State gaseous liquid 猫狗案例的,创建猫的对象 Cat c = ne

C language IV, typedef keyword, and scope one, typedef keywordsIn the C language, there is a typedef keyword, the function of which is to allow you to define a new name for the type, that is, the individual nameFor example:　　int DWORDSo later, when we define a variable of type unsigned int, this does not have to write unsigned int. Direct DWORD.For example:　　DWORD name = 0;Usually used in the definition of struct, and function pointer.For example:　　ty

configuration method uses the parameterless constructor to inject:name= "A2" class= "com.edu.bean.Address"/> The 3rd configuration method, using the property setter method to inject:Beanname= "A3"class= "Com.edu.bean.Address"> Propertyname= "City"value= "Beijing"> Property> Propertyname= "School"value= "Tsinghua"> Property>Bean>The 4th configuration method uses the property's setter method to inject the reference property:Beanname= "Addr"class= "Com.edu.bean.Address"> Propertyname= "City"value

Java Learning Path (iv) methodJava as a programming language, the best way to learn is to write code. When you learn a class, you can write a simple example of the program to run, see what results, and then call a few more classes of methods, see the results of the operation, so very intuitive to the class to learn, and memory is very deep. Then you should not be satisfied to put the code to pass, you should think about if I do not write this, another

only if the data of the AJAX request is returned successfully*/$.Get("test.php", {name:"Rain", Age:" A"},function (data,textstatus) {//get method parameter can also be string //data: xml/json/html, etc.//textstatus: Request Status: success/error/notmodified/timeout 4 kinds},"JSON")//If the expected return data is in JSON format,set the parameter to "JSON"Iii. $.getscript () and $.getjson () methods$.getscript ("Jq.color.js", FN)//when JS is finished loading, execute the callback function//cross

Tags: logical Center database table right-click Follow Share Relationship tool startThird-party service Bmob back-end Cloud answer system small Project (iv) In advance: All operations here are implemented after integration of BMOBSDK, if Bmob still do not know, please follow my first article Bmob article Project Significance: The project is simple and difficult to deal with is the button reuse effect of the choice question. The project can update e

-allocated space) " Numextents ":,--Number of events " Indexes ":,--index number " Indexsize ": 163520,--Index file size " fileSize ": 67108864,--File size c10/> "Nssizemb": +, "datafileversion": { "Major": 4, "minor": 5 }, "Extentfreelist": { c16/> "num": 1, "totalsize": 131072 }, With this tool, you can view the basic information of the current database.4. Third-party toolsMongoDB from t

Oracle Notes (iv) Simple queries, qualifying queries, sorting dataFirst, simple querySQL (structured query Language) Structured Query language is a database query and programming language for accessing data and querying, updating, and managing relational database systems. ANSI (American National Standards Institute) claims that SQL is the standard language for relational database management systems.Oracle databases are well developed, primarily becaus

Tags: RedisIntroduction to NoSQL (iv)Redis Common operationsRedis Common Operations-stringset key3 zsset key3 lisi //第二次赋值会覆盖setnx key3 wangwu //返回0，则key3存在setnx key4 zhaoliu //返回1，则key4不存在创建key4setex key4 100 tianqi //给key4设置过期时间为100s，值为tianqi，若key4存在则覆盖Redis Common Operations-listlpush listb a //从左侧加入一个元素lpop listb a //从左侧取出一个元素rpush listb b //从右侧加入一个元素rpop listb //从右侧取出第一个元素linsert lista before a 1 //在(值)a的前面插入(值)1lset lista 3 3 //把下标为3对应的数值改为3l

Original: Some small places that are easy to overlook in SQL Development (iv)In this article I would like to make some corrections to some of the statements on the web for the use of nonclustered indexes . The following references the description of the nonclustered index structure under MSDN.Nonclustered index structure:1: Nonclustered indexes have the same B-tree structure as clustered indexes, and the significant difference between them is the foll

partition table in SQL Server 2005 (iv): Delete (merge) a partitionCategory: SQL Server2009-12-04 09:10 8735 People read comments (0) favorite reports SQL Server2010functionmerge Storage DatabaseIn the previous section we described how to create and use a partitioned table, with an example of placing data from different years in different physical partitions. The specific partitioning method is:1th Small table: Data prior to 2010-1-1 (not includin

The third Lesson IV speaking 03_04_linux user and authority detailed1. Libraries and processes are siblings. Process can get CPU time, memory address, call various files2. Permissions: Defines the access capabilities of computer resources and services called permissions3. Logical container, user-associated permissions are user groups. For assigning permissions, cannot log on independently4. The document belongs to the owner, the documents belong to th

thread objectsThread t1=NewThread (St, "Window 1")); Thread T2=NewThread (St, "Window 2")); Thread T3=NewThread (St, "Window 3")); //Start ThreadT1.start (); T2.start (); T3.start (); }}Explanation of the synchronous code block: For example, this figure is drawn by myself, not particularly good, when I can explain it slightly.Summarize the following points about synchronization:Features of synchronization:premise: Multiple threadswhen solving the problem, be aware that multipl

does not have this problem. There are two strategies for allocating contiguous memory to a two-dimensional array using malloc. Suppose a two-dimensional array has three rows and four columns. The first one-time allocation of all memory 3*4*sizeof (element) is then used to manually calculate the memory address to be accessed using the method previously mentioned in how to access array[i][j]. The second method is divided into two steps. The first step is to use malloc to allocate a piece of memor

back pointer forward. So end--can be moved out, and the outside else will be deleted.5. Workthrough6. Repair defects Let's test this method together.static void Main(string[] args) { int[] array = new int[] { 1, 2, 3, 4, 5 }; Switch(array); foreach (var a in array) { Console.WriteLine(a); } It's done, huh. You are welcome to pay attention to my public number, and my series of special courses Video Tutorials