java se 8 programmer

Objective The basic encoding is a standard BASE64 encoding for handling conventional requirements: the output does not add line breaks, and the output is composed of letters plus numbers. Recently made a Web template, which wants to use the Base64 background image. Although the network has a ready-made encoder, but always want to implement one of their own. As many people may not know, the new Base64 class provided by JDK 8 can handle this task very

PackageJaxp (Sun), Jdom, dom4j, Pull (Android SDK comes with)(1) Jaxp-dom parsing XML (curd)JAXP (Java API for XML processing)JAXP is a set of XML parsing APIs provided by SunJaxp is a good way to support DOM and sax parsingThe JAXP development Pack is part of the J2SE, including the following packages or sub-packagesJavax.xmlOrg.w3c.domOrg.xml.saxIn the Javax.xml.parsers package, several factory classes are defined, and the

do not feel mysterious, can go to analyze the underlying causes of abnormal faults, I deliberately summed up a system of learning programs, this knowledge is systematically passed through a small program case to everyone.Performance tuning:Application Framework Source code interpretation:Distributed architecture:Micro-service Topics:Team Collaboration Development:Shopping mall Project Combat:To help you get out of this midlife crisis, take the path to a raise.This time we recommend a free learn

The last time is to upload a txt file, this time uploading is a picture. Again, uploading success requires feedback to the client.Difference:TXT file opened with Notepad, we can understand, so with a buffer character stream, the channel within the byte stream packaging.and the picture with Notepad open, we can not understand, so just use buffer byte stream, only need to transfer the bytes in the channel into the efficient stream of words.Client:　　1 Public classClinedemo {2 Public Static vo

Direct Insert SortInsert sort directly int[] Insertsort (int[] a) {for (int i = 1; i Hill SortHill sort public int[] Shellsort (int[] a) { int n = a.length; int gap = n;//array number while (Gap > 0) { gap = gap/2;//reduces the array by half for (int x = 0; x Simple Selection SortingSimple Select Sort public int[] Simplesort (int[] a) { int n = a.length; for (int i = 0, i Heap Sort Heap sort public void heapsort (int[] a) {