kinds of hats

virtual reference, it will add the virtual reference to the reference queue associated with it before reclaiming the object's memory. The program can determine whether a virtual reference has been added to the reference queue to understandWhether the referenced object will be garbage collected. If the program finds that a virtual reference has been added to the reference queue, it can take the necessary action before the memory of the referenced object is recycled.In particular, the use of weak

-project.org/) is also very strong, personal feeling experience better, closer to the native. 21.Medoo : http://medoo.lvtao.net/Lightweight PHP database framework for improved development efficiency. Very light weight is only 13KB, just include. Simple and easy to learn, quick to get started. Powerful support for a variety of common SQL queries. Compatible support for various data: MySQL, MSSQL, SQLite. Security prevents SQL injection Free MIT protocol and you can make any modifications. 22.Html

, inputbytearray.length);Cs. FlushFinalBlock ();StringBuilder ret = new StringBuilder ();foreach (Byte b in Ms. ToArray ()){Ret. AppendFormat ("{0:x2}", b);}Ret. ToString ();return ret. ToString ();}///DEC decryption Process///public static string Decrypt (String ptodecrypt, String SKey){Descryptoserviceproviderdes = new DESCryptoServiceProvider ();byte[] Inputbytearray = new BYTE[PTODECRYPT.LENGTH/2];for (int x = 0; x {int i = (Convert.ToInt32 (ptodecrypt.substring (x * 2, 2), 16));INPUTBYTEARR

(version.lucene_35, "content", new StandardAnalyzer (version.lucene_35)); Query q = parser.parse (query);//Gets the last element of the previous page Scoredoc LASTSD = Getlastscoredoc (PageIndex, PageSize, Q, searcher);// Go through the last element to search for the next page of elements topdocs tds = Searcher.searchafter (Lastsd,q, pageSize); for (Scoredoc Sd:tds.scoreDocs) {Document doc = Searcher.doc (Sd.doc); System.out.println (sd.doc+ ":" +doc.get ("path") + "-" +doc.get ("FileName "));

the properties of the light cone) Shadowcameranear Shadowcamerafar Shadowcameraleft Shadowcameraright Shadowcameratop ShadowcamerabottomFront and rear left and right position, reference positive projection cameraCode var pointcolor ="#ff5808";var directionallight = new Three. DirectionalLight(Pointcolor);DirectionalLight. Position. Set(- +, -, -Ten);DirectionalLight. Castshadow= True;DirectionalLight. Shadowcameranear=2;DirectionalLight. Shadowcamerafar= $;Direction

There are six types of dependencies in Android studioCompile,provided,apk,test Compile,debug compile,release CompileCompileCompile is for all build type and favlors to be compiled and packaged into the final apk file.providedProvided is for all build type and favlors only at compile time, similar to external-libs in Eclipse, only participates in compiling, not packaging to the final apk.APKIt will only be packaged into the APK file, not compiled, so you can no longer call the class or method in

) {//Response clicked Event//......} }Method Four:Fit scenario: Suitable for different types of controls on the interface, which implements the OnClick method of all controls in a single method, and looks relatively concise//directly Onclicklistener interface in activity:import android.view.view.onclicklistener;publicclassmyactivityextends activityimplementsonclicklistener{ @Override public voidoncreate (bundlesavedinstancestate) {super.oncreate ( Savedinstancestate); setcontentview (R.layout.ma

1. The difference between ancestors. Link is an XHTML tag, and @import is completely a way to provide CSS. Besides the ability to load CSS, link tags can do a lot of things, such as defining the Rel connection properties, @import can only load CSS.2. Differences in loading order. When a page is loaded, the CSS referenced by link is loaded at the same time, and the CSS referenced by @import waits until the page is loaded and loaded. So sometimes browsing @import loading CSS page when there is no

values are small, the representation is wide, equal Description This is a square (data contract length width and number are less than 10000); Output Sequential output The number length of all eligible rectangles for each set of data Sample input 181 1 11 1 11 1 21 2 11 2 22 1 12 1 22 2 1 Sample output 1 1 11 2 11 2 22 1 12 2 1 Idea: The use of the sor

personally define:The main navigationSearch in the stationSecond-level navigation (slightly controversial)In-page navigation (e.g. long articles)Since there is no absolute right or wrong, so according to an informal vote and my own explanation, the following situation, whether you put it or not, I do not put in Paging controlSocial links (although some social links are also the main navigation, such as "about" "Favorites")Tags for blog postsCategories of blog PostsLevel Three navigationA long f

object.Examples are as follows://Sessionworkspace objects inherit from Backbone.js Backbone.model objects//var Model = Backbone.model = function (attributes, options) {};//_.extend (Model.prototype, Events, {//initialize:function () {}// });//Initialize/destroy/url and fetch are methods of the parent class, and Sessionworkspace overrides the method//Refresh/process_datasources/prefetch_dimensions is a custom method Sessionworkspace alone//So, it's kinda like Java's inheritance.varSessionworksp

this var person = function () { this . Age = 19 this . Name = "Mr Jing" ; return "{}" ;}; var p = new person (); alert (p.name); // pop up undefined, because the function returns an object, So the object is returned directly to the person, ignoring the Age,name property var person = function () { this . Age = 19 this . Name = "Mr Jing" ; return 123 var p = new 　　 person (); alert (p.name); // popup "Mr Jing", because the return value is not an object, the return val

(improve performance) {Insertsort (arr, right-left);}//int div = PartSort1 (arr, left, right);int div = PartSort2 (arr, left, right);int div = PARTSORT3 (arr, left, right);QuickSort (arr, left, Div-1); QuickSort (arr, div + 1, right);} non-recursive implementation quick sort VOIDNBSP;QUICKSORT_NONR (int*arr,intleft,intright)//fast Sort---non-recursive method (using stack) { ASSERT (arr);stackMerge sort (Merg sort)1. Algorithm Description:Merge sort is an effective way to set up a merge operatio

file:Copy CodeThe code is as follows: $ (function () {$ ("#upload_file"). Change (function () {$ ("#uploadFrom"). Submit ();});});function Stopsend (str) {var im= "$ ("#msg"). append (IM);}upload.php file:Copy CodeThe code is as follows: $file =$_files[' upfile '];$name =rand (0,500000). Dechex (rand (0,10000)). ". JPG ";Move_uploaded_file ($file [' Tmp_name '], "upload/images/". $name);Invoking the JS function of the IFRAME parent windowecho "";?>Method Three, the original eco-ajax file Upload

One Public function Add () { $this,display (); } Public function Ajaxsave () { if(is_ajax) { echo ' execute input '; $model = M ("Tb_user"); $model, create (); $model, add (); Echo ' Execution succeeded '; } }In viewAdd.htmlTwo kinds of Ajax methods spoken in TP

Directly on the code:#define SWAP (b) {a ^= B; b ^= A; a ^= B;}void sort (int *arr, int num) {for (int i = 0; i bool IsOk = true; Is the sort complete?for (int j = 0; J if (Arr[j] > arr[j + 1]) {IsOk = false;Swap (Arr[j], arr[j + 1]);}if (isOk) {Return}}}void Test () {int arr[5] = {0,2,1,4,5};Sort (arr, 5);}Idea: bubble sort, if the sort is already finished, exit directly.Avoid unnecessary ordering (the sorting is done when the exchange is not occurring);After each round is sorted. The largest n

]+\\]. [0-9]*[1-9][0-9]*) | ([0-9]*[1-9][0-9]*\\. [0-9]+) | ([0-9]*[1-9][0-9]*))) $ "//negative floating-point number^ (-?\\d+) (\\.\\d+)? $ "//floating-point number"^[a-za-z]+$"//A string consisting of 26 English letters"^[a-z]+$"//A string consisting of 26 uppercase letters in English"^[a-z]+$"//String consisting of 26 English letters in lowercase"^[a-za-z0-9]+$"//string consisting of a number and 26 English letters"^\\w+$"//A string consisting of numbers, 26 letters or underscores"^[\\w-]+ (\

1 . test{width:300px; padding:30px 20px; margin-left:60px; background: #beceeb; position:relative;}2 . Test span{width:0; height:0; font-size:0; overflow:hidden; position:absolute;}3 . Test span.bot{4 border-width:20px;5 Border-style:solid;6 border-color: #ffffff #beceeb #beceeb #ffffff;7 left:-40px;8 top:40px;9 }Ten . Test span.top{ One border-width:10px 20px; A border-style:dashed solid solid dashed; - border-color:transparent #ffffff #ffffff transparent; - left:-40px; the top:60px; - } -

node of the K node represented by biggerindex+1 existsif (biggerindexLastIndex) {//If the value of the right child node is largeif (data[biggerindex]]){//Biggerindex always records the index of a larger child node biggerindex++; } }//If the value of the K-node is less than the value of its larger child nodesif (data[k]Data[biggerindex]) {//Exchange them swap (data,k,biggerindex); // give the Biggerindex to K, start the next loop of the while loop, Re-guarantee that the value of the K-node is gr

the DOM, and the value is the same as offsetx/y, which is the same as Firefox used to replace the offsetx/y, the base point is the upper-left corner of the border, but one condition is that The DOM that is triggered needs to be set to position:relative or Position:absolute, otherwise the distance from the upper-left corner of the relative HTML document area is returnedCompatibility: IE6/7/8 not supported, opera does not support, IE9/10 and Chrome, Safari supportscreenx/y:Screenx/y gets the dist