mule cookbook

Problem: Look for two dictionaries in the middle of the same place (same key, same value, etc.)Solution: Use the keys () or the items () method to perform common collection operations (such as seek a set, intersection, and difference sets)>>> a={'x': 1,'y': 2,'Z': 3}>>> b={'ww': 10,'x': 11,'y': 2}>>> A.keys () B.keys () #键的交集 {'y','x'}>>> A.keys ()-B.keys () #键的差集 {'Z'}>>> A.keys () |B.keys () #键的并集 {'ww','y','x','Z'}>>> A.items () B.items () {('y', 2)}>>> A.items ()-B.items () {('Z', 3), ('x',

fixed-length queue that automatically removes the oldest record when a new element is added and the queue is full: from Import deque>>> q=deque (maxlen=3)>>> q.append (1)>>> q.append (2 )>>> q.append (3)>>> qdeque ([1, 2, 3], maxlen=3)>>> Q.append (4)>>> qdeque ([2, 3, 4], maxlen=3)>>> q.append (5) >>> qdeque ([3, 4, 5], maxlen=3)>>>Although this can be done manually on the list (append, Del), this solution for the queue is much more elegant and runs much faster.If you do not specify a queue l

first. >>> import JSON >> > Dordereddict ([( " foo , 1), (" bar , 2), (" spam , 3), ( ' grok , 4)]) >>> Json.dumps (d) " {" foo ": 1," Bar ": 2," Spam ": 3," Grok ": 4} >>> Add: Ordereddict internally maintains a doubly linked list, which arranges the position of the keys according to the order in which they are added. The first newly added element is placed at the end of the list, and subsequent re-assignment of the existing key does not change the order of the keys.Note: The s

slice object s, you can get information about the object by S.start, S.stop, and S.step properties, respectively.>>> items=[0,1,2,3,4,5,6]>>> a=slice (2,4)>>> Aslice (2, 4 , None)>>> a.start2>>> a.stop4>>> a.step>>> b= Slice (1,5,2)>>> bslice (1, 5, 2)>>> b.start1>>> b.stop5>>> b.stepIn addition, you can map slices to a sequence of a specific size by using the indices (size) method. This returns a (start,stop,step) tuple in which all values have been properly restricted within the bounds (as a

; Format (text,'')'Hello World'>>> Format (text,'^20')'Hello World'>>> Format (text,'*>20')#other padding characters that are extra empty can be specified before the alignment'*********hello World'>>> Format (text,'=')'Hello world========='>>> Format (text,'%^20')'%%%%hello world%%%%%'>>>#when multiple values are formatted, the formatting code code can be used in the format () method>>>'{: >10} {: >10}'. Format ('Hello',' World')'Hello World'>>>‘{: >10} {:%^10}‘. Format(‘Hello' ,'World')' Hello%

Problem: Use regular expressions to match text patterns to identify the longest possible match to find the shortest possible matchWorkaround: Add after the * operator in the matching pattern. ModifierImportRe#Sample TextText ='computer says "No." Phone says "Yes."'#(a) Regex that finds quoted Strings-longest matchStr_pat = Re.compile (r'\"(.*)\"')Print(Str_pat.findall (text))#(b) Regex that finds quoted Strings-shortest matchStr_pat = Re.compile (r'\"(.*?) \"')Print(Str_pat.findall (text))>>> ==

Alpha to 0.5}endcg//the Ztest greater is set above, only the areas that are obscured are rendered. So the next place to render the area without occlusion. Zwrite onztest lequal//greater/gequal/less/lequal/equal/notequal/always/never/off default is LEqual if you want to draw the Z-value of the pixel The small remainder equals the value in the depth buffer, then replaces it with the new pixel color value. Cgprogram#pragma Surface Surf lambertsampler2d _maintex;struct Input {float2 uv_maintex;}; v

= tex2d (_maintex, In.uv_maintex); O. Albedo = C.rgb;o. Alpha = C.A;} ENDCG} FallBack "Diffuse"}Select the new Shader in the Material, and then drag the material to a point near the Sphere body, you will find the original near a point of the Sphere is a little farther Sphere covered!Unity provides a number of default render queues.Background: Background, first rendered, used for sky boxes, etc. Render Queue Value =1000Geometry: Geometry, default render queue, for most objects, opaque geometry U

:_cutoff is specified in the #pragma statement#pragma surface surf Lambert alphatest:_cutoffWhen Alphatest:_cutoff is specified, our shader becomes a transparent clipping shader. When the Alpha value of the fragment 2. Assign the channel value to O.alphaO.alpha = C.R;According to the above, I thought the workflow was like this.Float _cutoff=0.5o. Alpha = texture. Rif (O.alpha But looking at unity-generated shader code discovery is using the Clip () functionThis sentence in the box Alpha Test C

selected according to requirements.struct Appdata_base { float4 vertex:position; FLOAT3 Normal:normal; Float4 texcoord:texcoord0;}; struct Appdata_tan { float4 vertex:position; FLOAT4 tangent:tangent; FLOAT3 Normal:normal; Float4 texcoord:texcoord0;};3. Use the vertex color as the output in the surf () function.void Surf (Input in, InOut surfaceoutput o) {o.albedo=in.vertexcolor;}Full shader codeShader "Cookbookshaders/chapt7-1/vertexcolor" {Properties {_maintex ("Base (RGB

Smooth python and cookbook learning notes (2), pythoncookbook1. Value assignment of the packet splitting and decompression sequence of tuples Any sequence (or iteratable object) can be decompressed and assigned to multiple variables through a simple assignment statement. The only premise is that the number of variables must be the same as the number of sequential elements. 1. Parallel assignment: >>> X = (1, 2) >>> a, B = x # tuples >>> a1 >>> b2 2. U

1 Sequence decompression: through * to pass the match*a, B = somelist, First, *mid, last = Somelist, a, *b = Somelist2 using bidirectional queues: From collections import dequeQ = deque (maxlen=5) can be fixed lengthQ = deque () can also be any lengthcan be inserted and removed from both ends, append, Appendleft, pop, popleft3 finding the largest or smallest n elements: using heapq (heap queue)HEAPQ. nlargest (N, Alist) heapq. nsmallest (n, alist) is suitable when n is relatively smallYou can al

Smooth python and cookbook learning notes (9), pythoncookbook1. Reduce the number of parameters of callable objects and use functools. partial to freeze Parameters Use functools. partial () to fix one or more values to reduce the call parameters. >>> Def spam (a, B, c, d ):... print (a, B, c, d)...> from functools import partial >>> s1 = partial (spam, 1) # set the value of a to 1 >>> s1 (2, 3, 4) 1 2 3 4> s1 (4, 2, 7) 1 4 2 7> s2 = partial (spam, d =

Smooth python and cookbook learning notes (5), pythoncookbook1. Random selection Use the random module to generate random numbers in python. 1. Randomly select elements from the sequence and use random. choice () >>> import random>>> values = [1, 2, 3, 4, 5, 6]>>> random.choice(values)3>>> random.choice(values)3>>> random.choice(values)1>>> random.choice(values)1>>> random.choice(values)4 2. Retrieve the specified number of elements and use random. sa

Python cookbook (data structure and algorithm) to find the maximum or minimum N elements implementation method example, pythoncookbook This example describes how to find the maximum or minimum N elements in python. We will share this with you for your reference. The details are as follows: Problem:To find the maximum or minimum N elements in a collection Solution:In the heapq modulenlargest()Andnsmallest()The two functions are exactly what we need. >>

handle non-file-name strings.#example.py##Example of using Shell-wildcard style matching in list comprehensions fromFnmatchImportFnmatchcase as Matchaddresses= [ '5412 N CLARK ST', '1060 W ADDISON ST', '1039 W GRANVILLE AVE', '2122 N CLARK ST', '4802 N BROADWAY',]a= [addr forAddrinchAddressesifMatch (addr,'* ST')]Print(a) b= [addr forAddrinchAddressesifMatch (addr,'54[0-9][0-9] *clark*')]Print(b)>>> ================================ RESTART ================================>>> ['

into my eyes,the eyes, the eyes, the eyes, notaroundthe eyes, Don.'T look around the eyes,Look to my eyes, you're under.Look to my eyes, look into Myeyes, the eyes, the eyes, the eyes, notaround the eyes, Don'T look around theEyes, look to my eyes, you're under.Look to my eyes, look into my eyes, the eyes, the eyes, the eyes, notaround the eyes, Don'T Look aroundThe eyes, look to my eyes, you'Reunder.>>>For the size of the terminal, it can be obtained by os.get_terminal_size ():Import os>>> os.

not define its own Equals method, it inherits the Equals method of the object class, and the implementation code for the Equals method of the object class is as follows:Boolean equals (Obejct o) {This==o;}This means that if a class does not define its own Equals method, its default Equals method (inherited from the object class) is using the = = operator, and whether the object pointed to by the two variables is the same object, using equals and using = = will get the same result. If the compar

Bash CookBook (1)-basics, bashcookbook Bash was written by brian Fox in January 10, 1988 out of Richard Stallman's suggestion. 1. Run the template: Interactive Login shell, bash reads and executes/etc/profile after login. Then read ~ /. Bash_profile ,~ /. Bash_login ,~ /. Profile, the first executable is found to be executed. When you log out, it will read and execute ~ /. Bash_logout. Interactive non-login startup will read and execute ~ /. B

Page elementsUse the Text-align property to center the text in block-level elements. When Margin-left and Margin-right are set to auto, the element is centered relative to the parent element. However, some of the newer browsers that are popular today are not able to render this appearance correctly, such as IE5 and Netscape Navigator. If you use the th element in an HTML table, the contents of the cell are centered by default. On the basis of horizontal centering, you can center vertically and n