tomcat ali

Developer Blog:blockcanary-easy to find the Android app interface lag culpritOpen Source code: Moduth/blockcanaryBlockcanary fully transparent monitoring of the main thread operation, and can output effective information, help develop analysis, locate the problem, and quickly optimize the application. The features are: Non-intrusive, simple two lines to turn on monitoring, do not need to go everywhere, breaking code elegance. Precision, the output of information can help to locate t

back every night to find you. Ah, a lifetime really fast, half an hour is over, now into another branch, is also more likely to branch, if there is no wife and children, put on the skin of normal people, after the parents, to find a quiet place, the morning sleep to natural wake, afternoon reading, the number of stars, the number of stars to fight the plane, So one day at, perhaps a day without money, perhaps one day do not want to continue, lying in bed quietly waiting for death, perhaps a few

(Serialnumberkey, Nextserialnumber ());System.out.println (Threadlocal.get (Serialnumberkey)); Thread local variable refactoring 2 public class ThreadLocal {Public ThreadLocal () {}public void Set (Object value);Public Object get ();} unwanted code was removed from the API and client code . static ThreadLocal serialnumber = new ThreadLocal ();Serialnumber.set (Nextserialnumber ());System.out.println (Serialnumber.get ()); SummarizeAPI design is a very high-end a

, the maximum number of repetitions can be introduced, please describe the idea and complete the code.Ideas: Generated by the G () equal probability random number generation function, can refer to the introduction of the algorithm or this blog The number of times ( for example, 10 times ) is random by an equal-to-random function, and 1024 results are generated, and each structure is equal. Then we can analyze each random result, each random result can be expressed in decimal, for ex

if(C[i +1] =='*') -Tag =false; the + if(TAG) AT *=Ten; thei++; + } - if(M.count (t)) $ { $m[t]++; -}Else -M[T] =1; the -J + +;Wuyi } the -mapint,int>::iterator res =M.begin (); Wu for(mapint,int>::iterator iter = M.begin (); Iter!=m.end (); iter++) - { About if(Iter->second > res->second) $res =iter; - - } -cout Endl; A + m.clear (); the } -System"Pause"); $

Initially want to pour into the local jar package, directly using the import local jar package, found that it is not possible, because it is MAVEN unified management jar package, so direct import is not possible. And then on the Internet to see a lot of ways, including installing the jar package in the terminal, but found that their command did not, to install MAVEN (I am IntelliJ bring maven), for a long time, in fact, I just want to join a local jar package, do a lot of trouble to find it usel

smallest may be __.181715131210 Assuming that the base value is a quick sort of the first element of the array, the following data distribution results in the lowest efficiency of the fast algorithm , to make the arrays satisfy the non-descending arrangement.2-6-3-7-5-1-46-2-3-5-4-1-77-5-3-2-4-1-61-5-7-2-4-6-31-2-3-4-5-6-74-1-3-7-5-6-2 Two Additional Big questions:1. In the process of PHP development, it is unavoidable to deal with a variety of program errors, which PHP functions you u

function zadan (obj) {$ (obj). Children ("span"). Hide ();Eggclick ($ (obj));};function Donghua () {$ ("#hammer"). Animate ({Top: "150px",Left: "420px"}, 1000);$ ("#hammer"). Animate ({Top: "110px",Left: "455px"}, 1000);}var Dingshi = setinterval ("Donghua ()", 2000);var Dansui = 1;function Eggclick (obj) {if (Dansui = = 0) {Alert ("The eggs are all broken off");Return}$ ("#hammer"). Stop (true);Clearinterval (Dingshi);var _this = obj;$ (". Hammer"). CSS ({"Top": "170px","Left": "420px"});SetTim

into the corresponding method to invoke the logical layer of the method to achieve response to the customer.There are no doget, dopost, and so on in the Servlet interface and Genericservlet, these methods are defined in HttpServlet, but all return error information, so, each time we define a servlet, Must implement these methods such as Doget or Dopost.Each custom servlet must implement the Servlet interface, and the Servlet interface defines five methods, of which the more important three meth

]); X->next.push_back (x->Child[i]); } Trie*p,*T; while(!Q.empty ()) {T=q.front (), Q.pop (), n++; for(intI=0; i) if(t->Child[i]) {P=t->fail; while(P!=x !p->child[i]) p=p->fail; if(P->child[i]) p=p->Child[i]; T->child[i]->fail=p,p->next.push_back (t->Child[i]); Q.push (t-Child[i]); } ElseT->child[i]=t->fail->Child[i]; }}voidDFS (Trie *x) {x->id=++CNT; if(X->mark) l[x->mark]=CNT; for(intI=0; INext[i]); if(X->mark) r[x->mark]=CNT;}intSum (intp) { intret=0; while(p) re

of the ruler? I dare not go on guessing, only sigh pity. To say one thing about myself, I had the ability to design a programming language on my own a few years ago, but when I was designing grammar, I encountered a problem-the human problem-how to get other program apes to accept and use the language I designed? The answer is "no" , because we all advocate American things, no matter how advanced my language (of course, did not come out, everyone shot brick I skipped), is not to be promoted. W

. Adjust the policies for caching and reusing pictures.Use the phone's cache to cache frequently used images, such as the home page image, and the often-opened image setting algorithm.4. Optimize Network RequestsUse Okhttp. OkHttp supports faster retries under a bad network environment and can also use the SPDY protocol for Fast Concurrent network requests.Use Okhttp to adjust the image's pre-fetch algorithm to ensure that the image in front of the download queue in the app is prioritized, preve

collection*/ Private Static voidjson2javabeanm4 () {String s= "[{\" id\ ": \" 0375\ ", \" city\ ": \" Mesa \ "},{\" id\ ": \" 0377\ ", \" city\ ": \" Nanyang \ "}]"; Listclass); for(Weibo weibo:list) {System.out.println (weibo.getcity ()); } /*** Print: * Pingdingshan * Nanyang*/ } /*** Convert JSON data to Jsonarray: * Note: After getting to Jsonarray (we just get to Jsonarray instead of the list collection of JavaBean) * Get the data in Jsonarray convert to Stri The NG ty

Deb Http://mirrors.aliyun.com/ubuntu/trusty main restricted universe multiverseDeb Http://mirrors.aliyun.com/ubuntu/trusty-security main restricted universe multiverseDeb Http://mirrors.aliyun.com/ubuntu/trusty-updates main restricted universe multiverseDeb http://mirrors.aliyun.com/ubuntu/trusty-proposed main restricted universe multiverseDeb Http://mirrors.aliyun.com/ubuntu/trusty-backports main restricted universe multiverseDEB-SRC http://mirrors.aliyun.com/ubuntu/trusty main restricted unive

many nodes along the fail pointer can find x in query y how many y nodes can be found along the reverse fail pointerThe fail pointer has no ring, only one out of each node, and then it's obviously a tree. The node to which the fail pointer is located along the opposite end is the subtree of x.So we can go along the reverse of the fail pointer to the DFS sequence x is located in the sub-tree is DFS in the corresponding interval we want to query the x corresponding to the interval of how many yWa

machines, and underlying operating system (OS) settings. There are several tools for developers to use when analyzing and optimizing, and you can learn and use them by reading Java tools for Source Code optimization and analyses.It is important to understand that no two applications can use the same optimizations, and there is no perfect reference path for optimizing Java applications. Use best practices and stick with the right way to handle performance optimizations. To achieve true maximum p

with size n. Fortunately, an array is passed in, and we can traverse it from front to back. The way I come up with this is:Use two temporary variables Maxl and MAXR to record the maximum value when traversing between the two ends. The smaller side of Max takes action, the action content is to access the next element, and if this element is less than Max, then Max does not change, the difference between the element and Max is the amount of water. If the element is greater than Max,max, the eleme

a stack frame in the virtual machine stack into the stack of the process.The local variable table holds the various basic data types known to the compiler (Boolean, Byte, char, short, int, float, long, double), object reference (reference type, which is not equivalent to the object itself, It may be a reference pointer to the start address of the object, or it may point to a handle representing the object or other location associated with the object, and the ReturnAddress type, which points to

, enter.Code snippet //Select the varButton = $ ("a[data-id= ' 6 ')"); //Execute once per second, click if the button status is available varFUC = SetInterval (function() { //if a button to refresh the verification code appears, you have grabbed if($ (". Refresh-btn"). Length > 0) {window.clearinterval (FUC); //Desktop notifications, only Chrome,firefox browsers support the desktop APINotification.requestpermission (function(status) {varn =NewNotification (' notif

owns the lock gets the lock again, then the fetch counter increases by 1, and then the lock needs to be freed two times to get a true release. This mimics the semantics of synchronized; If a thread enters a synchronized block that is protected by a monitor that the thread already owns, it allows the thread to continue and does not release the lock when the thread exits the second (or subsequent) synchronized block. The lock is released only when the thread exits the first synchronized block tha