Categories
Uncategorized

Startup Code (directory)

Appear for a while, but what hasn’t been how to get to know more about it.On the one hand, and the work of reason, on the other hand, if the original feel of the iconic, but eventually escaped and continued to do java seems not to know its fate.So thinking of spending a period of time to learn, plan according to the following directory and give myself an overall concept, also expects to encounter some problems can be based on this knowledge to dig out of a catalogue of problems, even if it cannot be covered and how much detail.

directory:

    Examples of objects constructed

    The core logic run method

    Introduction to Environment

    the application configuration file loading process

    Create ApplicationContext

    ioc container before refresh

    ioc container refresh process (to be)

    ioc container refresh process (3)

    ioc dependency injection

    automatic configuration mechanisms

    aop cut process

    Automatic configuration transaction

    automatic configuration of the mvc

Auxiliary reading:

    spring. factories profile factory mode

    @ annotation analysis principle

Application:

    how to customize the starter

Categories
Uncategorized

UE4 to add module

Add – on module in this article has been described in connection with the detailed description:

Creating Custom Modules

But this article missing one step:

end by

Implementation of the project name of the Provisions of the Editor. Target. cs

and

Implementation of the Provisions of the name of your project. Target. cs

in a few modifications:

ExtraModuleNames.AddRange( new string[] { ... } ); 

Here is to join the new module name string.4. 21 in an actual test found that the only way normally.

To name one example, to a name with a Test Engineering added called Ken.

Ken.h:

#pragma once
#include "CoreMinimal.h"
#include "ModuleManager.h"
class FKen:public IModuleInterface
{
    public:
    /** IModuleInterface implementation */
    virtual void StartupModule() override;
    virtual void ShutdownModule() override;
};

Ken.cpp:

#include "Ken.h"
#include "Modules/ModuleManager.h"
#define LOCTEXT_NAMESPACE "FKen"
void FKen::StartupModule()
{    
UE_LOG(LogTemp, Warning, TEXT("KEN MODULE Start"));
}
void FKen::ShutdownModule()
{
    UE_LOG(LogTemp, Warning, TEXT("KEN MODULE End"));
}
IMPLEMENT_MODULE(FKen, Ken)
#undef LOCTEXT_NAMESPACE

Ken. Build. cs file:

// Copyright 1998-2018 Epic Games, Inc. All Rights Reserved.
using UnrealBuildTool;
public class Ken : ModuleRules
{
    public Ken(ReadOnlyTargetRules Target) : base(Target)
    {
        PCHUsage = ModuleRules.PCHUsageMode.UseExplicitOrSharedPCHs;    
        PublicIncludePaths.AddRange(
            new string[] {
                // ... add public include paths required here ...
            }
            );    
        PrivateIncludePaths.AddRange(
            new string[] {
                // ... add other private include paths required here ...
            }
            );
        PublicDependencyModuleNames.AddRange(
            new string[]
            {
                "Core",

                // ... add other public dependencies that you statically link with here ...
            }
            );
        PrivateDependencyModuleNames.AddRange(
            new string[]
            {
                "Test",
                "Projects",
                "InputCore",
                "UnrealEd",
                "LevelEditor",
                "CoreUObject",
                "Engine",
                // ... add private dependencies that you statically link with here ...    
            }
            );
        DynamicallyLoadedModuleNames.AddRange(
            new string[]
            {
                // ... add any modules that your module loads dynamically here ...
            }
            );
    }
}

Test. Target. cs file:

using UnrealBuildTool;
using System.Collections.Generic;

public class TestTarget : TargetRules
{
    public TestTarget(TargetInfo Target) : base(Target)
    {
        Type = TargetType.Game;

        ExtraModuleNames.AddRange( new string[] { "Test","Ken" } );
    }
}

. Target. cs file:

using UnrealBuildTool;
using System.Collections.Generic;

public class TestEditorTarget : TargetRules
{
    public TestEditorTarget(TargetInfo Target) : base(Target)
    {
        Type = TargetType.Editor;

        ExtraModuleNames.AddRange( new string[] { "Test","Ken" } );
    }
}

 

 

Please use the mobile phone “brush” x

Categories
Uncategorized

20 sessions of school in the Zhao – Ctrip examination questions – expression parsing

 

find an idea: 1671

Train of thought: here began thinking of directly using the analog stack, directly after writing imploded, Think about the amount of data, and also, only one pass of processing.You’re seeing is a method, a recording position of the array corresponding to parentheses, “(with Stack), then normal order output, if the current encounter parentheses, brackets are transferred to the other side, and back added.Brackets has been added to the current.But there is a problem, again to the current brackets, which in turn will jump to the corresponding brackets, how to jump out?A very ingenious method, a direction flag setting d = 1, every time they encounter parentheses is negated, when once again returned to the same brace, outlined within it’s been taken care of, flipped twice, and further in the forward direction of the output.

A lost

code:

package interview;

import java.io.*;
import java.util.*;
import java.text.*;
import java.math.*;
import java.util.regex.*;

public class Ctrip2 {


    /*

Please complete the following function, to realize the functions of:completely your ^ - ^* * *

*/ static String resolve(String expr) { StringBuilder sb = new StringBuilder(); int[] resIdx = new int[expr.length()]; Stack stack = new Stack<>(); int length = expr.length(); int index; for (int i=0;i){ if (expr.charAt(i) == '('){ stack.push(i); }else if ( expr.charAt(i) == ')'){ index = stack.pop(); resIdx[i] = index; resIdx[index] = i; } } int cur = 0, dir = 1; while (cur != expr.length()){ if (expr.charAt(cur) == '(' || expr.charAt(cur) == ')'){ cur = resIdx[cur]; dir = -dir; cur += dir; }else { sb.append(expr.charAt(cur)); cur += dir; } } return sb.toString(); } /**

* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * write code to end * * * * * * * * * * * * * * * * * * * * * * * * * *

*/ public static void main(String[] args){ Scanner in = new Scanner(System.in); String res; String _expr; try { _expr = in.nextLine(); } catch (Exception e) { _expr = null; } res = resolve(_expr); System.out.println(res); } }

 

Categories
Uncategorized

The good news, and the strap – on computer course for Seagate portable hard disk shipped!

We finish today, open the door and built the mountains.I refuse to make a delivery?

When When When When is the following:

800 G with learning materials of mobile hard disk, as seen in FIG..

 

Even to achieve learning computers on the network, the cobbled – together, trying to find a lot of learning resources.It’s a pity that many of the resources of public praise, good quality, but requires payment.

Alas, as a yet – to – be, it is possible to achieve the economic independence of poor, impoverished.Only through some of the ways in which they can buy some online classes.

However, these video courses frequently hundreds of G – – well, they sent me a tray of Baidu network links.

But everybody also knows, Baidu does not recharge as long as the disc member, and he’s downloading speed of a tortoise.

So on the one hand, I own the money they get (in short, to back this)

On the other hand, also for the kind of money, but if you want to learn the technique of the classmates, will be able to have a cheap online classes.

 

Mobile hard disk + course was offered for sale.Thus, it is to dispense with the complex of the download process.Directly from the external drive can see.

 

I own the Seagate portable hard disk is 1T, the price in more than 300

 

If you buy the other of the hard disk itself, then I go to the buy orders.Then, I’ll copy the hard courses.

 

About the price: the price of mobile HDD + $100, with free shipping.

Is, I’ll buy you a mobile hard disk, a hard disk, I give you the original prices, 100 Yuan for the course fees.

In my classes, is mostly waste from MOOCs, geek time by word of mouth is good, the quality is good – paying courses.

I prepared myself in interviews, a lot on these courses.During the interview, the interviewer can spend.

 

In addition, if you are from the computer, have been wrestling with for postgraduate studies or finding work, but schools are also conventional mode (dual – mono).

So, then.

I also think with their experience, and all these years to see an old schoolmate of the candidates, the candidates themselves, and then to the younger brothers applied for a job, a variety of experiences.

Offer you some advice.

If you are the one!

If you are interest, please add my QQ: 392371202.

 

Categories
Uncategorized

programming training – PAT A1101 Quick Sort (25 points)

Quick Sort 1101 (25 points)

There is a classical process named partition in the famous quick sort algorithm. In this process we typically choose one element as the pivot. Then the elements less than the pivot are moved to its left and those larger than the pivot to its right. Given N distinct positive integers after a run of partition, could you tell how many elements could be the selected pivot for this partition?

For example, given N=5 and the numbers 1, 3, 2, 4, and 5. We have:

  • 1 could be the pivot since there is no element to its left and all the elements to its right are larger than it;
  • 3 must not be the pivot since although all the elements to its left are smaller, the number 2 to its right is less than it as well;
  • 2 must not be the pivot since although all the elements to its right are larger, the number 3 to its left is larger than it as well;
  • and for the similar reason, 4 and 5 could also be the pivot.

Hence in total there are 3 pivot candidates.

Input Specification:

Each input file contains one test case. For each case, the first line gives a positive integer N (≤105). Then the next line contains N distinct positive integers no larger than 109. The numbers in a line are separated by spaces.

Output Specification:

For each test case, output in the first line the number of pivot candidates. Then in the next line print these candidates in increasing order. There must be exactly 1 space between two adjacent numbers, and no extra space at the end of each line.

Sample Input:

5
1 3 2 4 5

Sample Output:

3
1 4 5

Analysis: For each element i num, to record the left to the right of the maximum and minimum of the number, and then traverses again to find out the main candidate metadata

#include
#include
#include
#include
#include
#include
#include
#include
#include
using namespace std;
int main(){
    #ifdef ONLINE_JUDGE
    #else
    freopen("input.txt", "r", stdin);
    #endif // ONLINE_JUDGE
    int n;
    scanf("%d", &n);
    int num[n], lmax[n], rmin[n];
    lmax[0] = 0;
    for(int i = 0; i < n; ++i){
        scanf("%d", &num[i]);
        if(i > 0)lmax[i] = max(lmax[i - 1], num[i - 1]);
    }
    rmin[n - 1] = num[n - 1] + 1;
    for(int i = n - 2; i >= 0; --i){
        rmin[i] = min(rmin[i + 1], num[i + 1]);
    }
    vectorans;
    for(int i = 0; i < n; ++i){
        if(num[i] > lmax[i] && num[i] < rmin[i])ans.push_back(num[i]);
    }
    sort(ans.begin(), ans.end());
    printf("%d\n", ans.size());
    for(int i = 0; i < ans.size(); ++i){
        if(i > 0)printf(" ");
        printf("%d", ans[i]);
    }
    printf("\n");
    return 0;
}
Categories
Uncategorized

jQuery object with a dom object transformation

To start with jQuery, might become momentarily confused with what is a jQuery object, which is a DOM object.As to the DOM object does not do more to explain, who we work too much, to focus on your jQuery, and relative to one another.

What is the jQuery object?

– – – is through jQuery object generated after packaging the DOM object.JQuery is unique to the jQuery object, which may be used in the method of jQuery.

For example:

$(“# =” urn: schemas – microsoft – com: office: office “/”). html () is taken to mean: to acquire an ID of the test element to generate the html code.wherein (html) jQuery are the method involved

This code is equivalent to that achieved using DOM code:

 

document.getElementById(“id”).innerHTML;

 

Although the jQuery object DOM object after packaging is produced, but cannot use the jQuery object of any DOM methods, as well as DOM object cannot use the jQuery method. using random errors.For example: $(“# =” urn: schemas – microsoft – com: office: office “/”). innerHTML, document. getElementById (“id”). html () versions are wrong.

Another is to be noted that: The id selector is acquired as a jQuery object with the document. getElementById (“id”) to obtain the DOM object, both of which are not equivalent.Please see the following said both of the transitions between them.

Since the jQuery differentiated but also related to each other, and then the jQuery object with the DOM object also can be switched from one to the other.In the re – converted both in the first instance, before we give a deal: If a jQuery object is acquired, then we are in front of plus the $a variable, such as: $var = jQuery object;If the acquisition of a DOM object, and then the normal habits like: var = DOM object;So just agreed with the distinction between the purpose of illustration, in actual use is not specified.

jQuery object is converted into a DOM object:

Two converting a jQuery object is converted into a DOM object: and an index (index);

(1) the jQuery object is a data object, via at least one of the index of method, to obtain the corresponding DOM object.

As: $var v = $(“#” and “v”); // jQuery object

var v = $v 0; / / DOM object

alert (v. / / checked) checkbox is checked whether this detection

jQuery (2) itself is provided, through the RootPanel. get () method, to obtain the corresponding DOM object

As: $var v = $(“#” and “v”); // jQuery object

var v = $v. get (0); / / DOM object

alert (v. / / checked) checkbox is checked whether this detection

DOM object into the jQuery object:

For already is a DOM object, you only need $(DOM) objects together in a package, it is possible to obtain a jQuery object.$(DOM object)

As: var v = document. getElementById (“v”); / / DOM object

var v = $v $(); // jQuery object

After the conversion, it is possible to arbitrarily use the jQuery method.

By the above method, may be an arbitrary conversion of jQuery objects and DOM objects.Re – emphasizes the need for attention is: a DOM object can use the DOM in the method, the jQuery object is not in the DOM method may be used.

Categories
Uncategorized

minimum spanning tree

Prim and Kruskal and the artist is an undirected graph in terms of

5 a b c d 1 a 2 a 3 b 6 c 4 c d b e d e c e 3 2 generates a weighted undirected graph, and generates a minimum spanning tree

#include 
#include 
#define MaxVertexNum 100
#define BIG 100
typedef char VertexType;//

vertex node of the data type

typedef int EdgeType;//

edge - weight type

typedef struct{ VertexType Vertex[MaxVertexNum];//

vertex table

EdgeType Edge[MaxVertexNum][MaxVertexNum];//

adjacency, edge table

int vertexnum,arcnum;//

the number of vertices and edges

}MGraph;//

adjacency matrix of the storage structure

int Locate(VertexType v){ if(v>=97){return (int)v-97;} else {return (int)v-65;} }//

Vertices are converted to corresponding position

typedef struct{ int a,b;//

a and b to the one side, as indicated by the two vertices

EdgeType w;//

the weight values of edges

}Road,RoadList[MaxVertexNum]; void CreatGraph(MGraph &M,Road RoadList[]){ EdgeType e; VertexType v1,v2; printf("

the input node and the number of edges:

"); scanf("%d %d",&M.vertexnum,&M.arcnum); printf("

input node:

"); for(int i=0;i){ getchar(); scanf("%c",&M.Vertex[i]); } for(int i=0;i){ for(int j=0;j){ M.Edge[i][j]=BIG; } } fflush(stdin);//

clear cache, to prevent the next from the scanf () function failure

printf("

Enter the path and the weight values of the two nodes:\ n

"); for(int i=0;i){ scanf("%d %c %c",&e,&v1,&v2); M.Edge[Locate(v1)][Locate(v2)]=e; M.Edge[Locate(v2)][Locate(v1)]=e; RoadList[i].w=e; RoadList[i].a=Locate(v1); RoadList[i].b=Locate(v2); } }//

constructing a digraph

void PrintGraph(MGraph &M){ printf("

adjacency matrix\ n

"); for(int i=0;i){ printf(" %c ",M.Vertex[i]); for(int j=0;j){ if(M.Edge[i][j]!=BIG){ printf("%d ",M.Edge[i][j]); } else{printf("");} } printf("\n"); } }//

printing matrix

void visited(int v){ printf("%c ",v+'a'); }//

The current location of the access node

void Prim(MGraph &M,VertexType c){ int v0=Locate(c); int vertexvisit[M.vertexnum];//

record already visited vertex

int lowcost[MaxVertexNum];//

the current spanning tree to the remaining vertex of the shortest side of the right value

int v,min,sum=0,k;//

represents the cumulative sum of weight values of the current tree

for(int i=0;i){ vertexvisit[i]=0; lowcost[i]=M.Edge[v0][i]; if(lowcost[i]==0){lowcost[i]=10;} } vertexvisit[v0]=1; printf("

Prim's MST (Minimum Spanning Tree):

"); visited(v0); for(int i=0;i1;i++){ min=10;//

Find the minimum of the edge, the initial value is set to be greater than all of the weight values of edges

for(int j=0;j){ if(vertexvisit[j]==0&&lowcost[j]<min){ min=lowcost[j]; k=j;//

recording the current position of the

} } vertexvisit[k]=1; v=k; visited(v); sum=sum+min; for(int j=0;j){ if(vertexvisit[j]==0&&M.Edge[v][j]<lowcost[j]){ lowcost[j]=M.Edge[v][j];//

The newly incorporated with the vertex of the edge candidate media update

} } } printf("

\ n of the sum of the minimum spanning tree path:% d\ n

",sum); }//

Prim's algorithm for minimum spanning tree

int ver[MaxVertexNum];//

Definition and finding set

int getRoot(int a){ while(a!=ver[a])a=ver[a]; return a; }//

Checked in and found in the root node

void sort(Road RoadList[],int m){ Road temp; for(int i=0;i){ for(int j=0;j1-i;j++){ if(RoadList[j].w>RoadList[j+1].w){ temp=RoadList[j]; RoadList[j]=RoadList[j+1]; RoadList[j+1]=temp; } } } }//

in that figure is in all sides according to their weights, it goes

void Kruskal(MGraph &M,Road RoadList[]){ int sum=0; int a,b; for(int i=0;i){ ver[i]=i; } sort(RoadList,M.arcnum); printf("

Kruskal minimum spanning tree:

"); for(int i=0;i){ a=getRoot(RoadList[i].a); b=getRoot(RoadList[i].b); if(a!=b){ ver[a]=b; sum=sum+RoadList[i].w; printf("%c-%c ",RoadList[i].a+'a',RoadList[i].b+'a'); } } printf("

\ n of the sum of the minimum spanning tree path:% d\ n

",sum); }//

Kruskal minimum spanning tree

int main(){ MGraph M; Road RoadList[MaxVertexNum]; CreatGraph(M,RoadList); PrintGraph(M); Prim(M,'a'); Kruskal(M,RoadList); }

Categories
Uncategorized

how to install the jdk Java SE and Java environment (configuration) of the super – detailed eclipse installation and simple to use

Installation of Preparation:

First check the computer the number of bits: Right click My Computer, point attribute, into your computer to see the number of bits as:

it can be seen that the system is a 64 bit operating system, here are my terms, by 64 bits;

download JDK download address:http: / / www. oracle. com / / java / java se / downloads / jdk8 – downloads – 2133151. html

      

personal selection of the first, the Java SE Development Kit 8u211 then find its own system of downloading,click on Accept License Agreement

download JDK

1. First, the disc is created in a folder, Java, Java folder create two folders, and jdk jre.

2, find good just download the installation files, click, and altering the installation path to a just and a new folder, e.g., I is the E:\ Java\ jdk, then determined;

            

After completion of installation of the jdk jre installation interface will pop up, here to choose the installation path into the newly created folder jre below, after the installation, click Close.

 

configuration of environment variables:

Right – click My Computer, open the Advanced System Settings, then click the Environment Variables;

In the System variables below point to New, variable “JAVA _ HOME”, variable values, must oneself are installed jdk when a path, such as the installation path I is the E:\ java jdk\, path problems also need attention;

Next find CLASSPATH, not a new one, the variable named CLASSPATH variable value. “;% JAVA _ HOME%\ lib\ dt. jar;% JAVA _ HOME%\ lib\ tool. jar;”

Find the Path, edited in its original variable’s value should be inserted before the words”;% JAVA _ HOME%\ bin;% JAVA _ HOME%\ bin\ jre; “, add the method is such a C: the value of the variable;Then click OK, click OK.

a little experiment, Win + R keyboard input cmd Open a DOS interface, respectively input with java and javac, the java – version, appear as a result;

            

Configuration successfully!

 

eclipse installation

Download address: https: / / www. eclipse. org / downloads /

Select Download Package

 

download Java EE with the same version, click Download start downloading;

Then the eclipse to thank you and offered you a download request for a contribution, if after a period of time without a download, click click here

 

start up the eclipse

Find download eclipse before decompression, find this program, click open.

   

open eclipse

Prompt needs to select a work space.In the columns, click browse, choose their own work space (“to be the code stored in the folder)

After selecting, click launch to enter the eclipse

Enter home page, a page navigation.The lower right of the checkbox on the show (Always Welcome at start up) are no pop – up show this Welcome page again.(see his selected)

Then click the Workbench can enter the edit page

Next click on the right corner of the File – gt; Project to create a Java java project.In the Project name “to fill in the name of the project

In order to avoid the trouble of jre, directly check Use default JRE, then click Finish to create success.

Then, find the directory of the src folder right mouse button and choose New – Class created a class.Package is a package name, selectivity can be named.

Name is the name of the class, to fill in.Recommends the use of English words and the first letter uppercase, checking (a public static void main (String args)), click Finish to complete the class creation.

In the sixth row write on System. out. println (“Hello!!!”); Note that semicolons, and finally finished after clicking on the triangle block (FIG.), then it is ready to run.

        

Run to completion.

 

 

 

Categories
Uncategorized

jQuery object with a dom object is also used to convert the jQuery object with a dom object transformation

Go to: http: / / www.. com / design / 2010 / 0309 / 108144. shtml

To start with jQuery, might become momentarily confused with what is a jQuery object, which is a DOM object.As to the DOM object does not do more to explain, who we work too much, to focus on your jQuery, and relative to one another.

What is the jQuery object?

– – – is through jQuery object generated after packaging the DOM object.JQuery is unique to the jQuery object, which may be used in the method of jQuery.

For example:

$(“# =” urn: schemas – microsoft – com: office: office “/”). html () is taken to mean: to acquire an ID of the test element to generate the html code.wherein (html) jQuery are the method involved

This code is equivalent to that achieved using DOM code:

 

document.getElementById(“id”).innerHTML;

Although the jQuery object DOM object after packaging is produced, but cannot use the jQuery object of any DOM methods, as well as DOM object cannot use the jQuery method. using random errors.For example: $(“# =” urn: schemas – microsoft – com: office: office “/”). innerHTML, document. getElementById (“id”). html () versions are wrong.

Another is to be noted that: The id selector is acquired as a jQuery object with the document. getElementById (“id”) to obtain the DOM object, both of which are not equivalent.Please see the following said both of the transitions between them.

Since the jQuery differentiated but also related to each other, and then the jQuery object with the DOM object also can be switched from one to the other.In the re – converted both in the first instance, before we give a deal: If a jQuery object is acquired, then we are in front of plus the $a variable, such as: $var = jQuery object;If the acquisition of a DOM object, and then the normal habits like: var = DOM object;So just agreed with the distinction between the purpose of illustration, in actual use is not specified.

jQuery object is converted into a DOM object:

Two converting a jQuery object is converted into a DOM object: and an index (index);

(1) the jQuery object is a data object, via at least one of the index of method, to obtain the corresponding DOM object.

 

As: $var v = $(“#” and “v”); // jQuery object

var v = $v 0; / / DOM object

alert (v. / / checked) checkbox is checked whether this detection

jQuery (2) itself is provided, through the RootPanel. get () method, to obtain the corresponding DOM object

As: $var v = $(“#” and “v”); // jQuery object

var v = $v. get (0); / / DOM object

alert (v. / / checked) checkbox is checked whether this detection

DOM object into the jQuery object:

For already is a DOM object, you only need $(DOM) objects together in a package, it is possible to obtain a jQuery object.$(DOM object)

As: var v = document. getElementById (“v”); / / DOM object

var v = $v $(); // jQuery object

After the conversion, it is possible to arbitrarily use the jQuery method.

By the above method, may be an arbitrary conversion of jQuery objects and DOM objects.Re – emphasizes the need for attention is: a DOM object can use the DOM in the method, the jQuery object is not in the DOM method may be used.

Categories
Uncategorized

relaxed and well – versed in database management and maintenance patrol (one of the server and a hardware status indicators)

Foreword

Perform daily inspection and maintenance of the database management is an important step, but also required each time the inspection date, the results of registration, may require a patrol report.

This series is designed to solve some common problem s which are:

    don’t know what is needed for the patrol

    t know how to take care of convenient physical examination

    Too much trouble physical examination machine

    generating a report difficulties, cannot visualize the result

Server hardware conditions for the most part, there is a hardware group specialized in charge of the patrol, but as a manager of the database server, we also must always be vigilant, in the event of a hardware of a lazy little brother,You managed data server problems also cannot find, or a combination of a hardware configuration of the performance of the resulting glycidol, which are also the inspection of the necessary hardware.

The overall situation overview

1. Check in the all – item or environment page to view the whole system hardware resources may be used.If the hardware problems affecting the database, then the detected an alert appears.

  

 

2. In the system – processor hardware page to view, physical memory, disks, network cards, etc.

  

 

operation environment and version

In the system – environment operating system software to view information and SQL Server information

  

  

 

The Disk Usage

disk space without so much as introduced when little is left of the disk space require timely planning and a clean – up, according to the database of the incremental disk scenario planning is necessary (in the inspection database data of the inspection sections introduce incremental approach)

1. In the SQL of cloud expert overview page graphic to see how disk space

  

 

2. In the system – hardware – disk in view of the disk may be used and the physical disk partition, etc.

  

 

3. The pressure disk analysis

disk performance counter pressure through the diagnostic (For details, see: system pressure disk analysis)

  

 

Memory usage situation

1. In the SQL of cloud expert overview page to view the graphic servers currently available.

   

 

2. In the system – hardware physical memory page to view details.

  

3. Analysis of memory pressure

memory pressure may be performance counters to diagnose (For details, see: system memory pressure analysis)

  

The processor case

1. In the SQL expert overview of the performance counters or graphical page viewing server CPU.

   

 

2. whether the CPU can be fully identified or used

In all – item inspection or environment may result in an overall system view page using hardware resources.If the CPU cannot be detected by the CPU or the CPU is less than the number of the system configuration, the warning will appear.

  

network environment

1. In system – hardware network card details page to view the object.

  

 

2. The performance counter page to view the system pressure network

  

 

 

summarize

Routine inspection system with a view to finding problems and potential risks, is any database administrators, maintenance personnel necessary for the operation, the core system for personal advice at least once a month for detailed examination, the auxiliary system at least once every three month check – ups,To ensure the normal operation, eliminate hidden dangers, the operation and maintenance personnel is not impersonating a firefighter, database operation and maintenance management is no longer difficult.