配置nginx使用basic http认证方式
server {
#proxy server for gerrit
listen 80; ## listen for ipv4; this line is default and implied
listen [::]:88 default ipv6only=on; ## listen for ipv6
index index.html index.htm;
配置nginx使用basic http认证方式
server {
#proxy server for gerrit
listen 80; ## listen for ipv4; this line is default and implied
listen [::]:88 default ipv6only=on; ## listen for ipv6
index index.html index.htm;
package test.jvm.gc; | |
public class TestFinalizeMethod { | |
public static T t; | |
public static void main(String[] args) throws InterruptedException { | |
run(); | |
System.out.println(t==null?1:2); | |
System.gc(); |
#!/usr/bin/env python | |
# coding: utf-8 | |
""" | |
在一棵树中,查找两个节点值差值的绝对值的最大值 | |
""" | |
__author__ = 'caoxudong' | |
from datastructure.common_datastructure import node |
#!/usr/bin/env python | |
__author__ = 'caoxudong' | |
from datastructure.common_datastructure import node | |
def visit_node(node): | |
print(node.data) | |
def depth_first_search(root=node.Node): |
package com.meiliao.ops.utils.security; | |
import java.security.NoSuchAlgorithmException; | |
import java.security.NoSuchProviderException; | |
import java.security.SecureRandom; | |
import java.util.HashMap; | |
import java.util.Map; | |
import java.util.Queue; | |
import java.util.concurrent.ConcurrentLinkedQueue; |
package appcloud.common.util.web.session.sharedsession; | |
import java.io.IOException; | |
import javax.servlet.Filter; | |
import javax.servlet.FilterChain; | |
import javax.servlet.FilterConfig; | |
import javax.servlet.ServletContext; | |
import javax.servlet.ServletException; | |
import javax.servlet.ServletRequest; |
<?xml version="1.0" encoding="UTF-8"?> | |
<configuration debug="false"> | |
<appender name="console" class="ch.qos.logback.core.ConsoleAppender"> | |
<encoder> | |
<pattern>%d{HH:mm:ss.SSS} [%thread] %-5level %logger{36} - %msg%n</pattern> | |
</encoder> | |
</appender> | |
<appender name="rollingFile" class="ch.qos.logback.core.rolling.RollingFileAppender"> |
方案1:
int solution1(int x) {
int count = 0;
for (int i=0; i<32; i++) {
if (i & 1 == 1) {
count++''
}
}
return count;
1 b java.lang.String::charAt (33 bytes) | |
2 b java.lang.Math::max (11 bytes) | |
3 b java.util.jar.Manifest$FastInputStream::readLine (167 bytes) | |
4 b sun.nio.cs.UTF_8$Decoder::decodeArrayLoop (553 bytes) | |
5 b java.util.Properties$LineReader::readLine (383 bytes) | |
6 b java.lang.String::hashCode (60 bytes) | |
7 b java.lang.String::indexOf (151 bytes) | |
8 b sun.nio.cs.ext.DoubleByteDecoder::decodeSingle (10 bytes) | |
9 b java.lang.String::lastIndexOf (156 bytes) | |
10 b java.lang.String::replace (142 bytes) |
$ java -version
java version "1.8.0_20"
Java(TM) SE Runtime Environment (build 1.8.0_20-b26)
Java HotSpot(TM) 64-Bit Server VM (build 25.20-b23, mixed mode)
OQL is SQL-like query language to query Java heap. OQL allows to filter/select information wanted from Java heap. While pre-defined queries such as "show all instances of class X" are already supported by HAT, OQL adds more flexibility. OQL is based on JavaScript expression language.