File: StrCodingBenchmarkDB.java

package info (click to toggle)
openjdk-21 21.0.8%2B9-1
  • links: PTS, VCS
  • area: main
  • in suites: forky, sid, trixie
  • size: 823,976 kB
  • sloc: java: 5,613,338; xml: 1,643,607; cpp: 1,296,296; ansic: 420,291; asm: 404,850; objc: 20,994; sh: 15,271; javascript: 11,245; python: 6,895; makefile: 2,362; perl: 357; awk: 351; sed: 172; jsp: 24; csh: 3
file content (139 lines) | stat: -rw-r--r-- 4,832 bytes parent folder | download | duplicates (13)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
/*
 * Copyright (c) 2009, 2012, Oracle and/or its affiliates. All rights reserved.
 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
 *
 * This code is free software; you can redistribute it and/or modify it
 * under the terms of the GNU General Public License version 2 only, as
 * published by the Free Software Foundation.
 *
 * This code is distributed in the hope that it will be useful, but WITHOUT
 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
 * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
 * version 2 for more details (a copy is included in the LICENSE file that
 * accompanied this code).
 *
 * You should have received a copy of the GNU General Public License version
 * 2 along with this work; if not, write to the Free Software Foundation,
 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
 *
 * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
 * or visit www.oracle.com if you need additional information or have any
 * questions.
 */

import java.util.*;
import java.nio.*;
import java.nio.charset.*;
import java.util.concurrent.*;
import java.util.regex.Pattern;

public class StrCodingBenchmarkDB extends StrCodingBenchmark {


    public static void main(String[] args) throws Throwable {
        final int itrs = Integer.getInteger("iterations", 100000);
        //final int itrs = Integer.getInteger("iterations", 12);
        final int size       = Integer.getInteger("size", 2048);
        final int subsize    = Integer.getInteger("subsize", 128);
        final int maxchar    = Integer.getInteger("maxchar", 128);
        final String regex = System.getProperty("filter");
        final Pattern filter = (regex == null) ? null : Pattern.compile(regex);
        final boolean useSecurityManager = Boolean.getBoolean("SecurityManager");
        if (useSecurityManager)
            System.setSecurityManager(new PermissiveSecurityManger());
        final Random rnd = new Random();

        String[] csns = new String[] {
            "Big5",
            "Johab",
            "EUC_CN",
            "EUC_KR",
            "MS932",
            "MS936",
            "MS949",
            "MS950",
            "GBK",

            "Big5_HKSCS",
            "Big5_HKSCS_2001",
            "Big5_Solaris",
            "MS950_HKSCS",
            "MS950_HKSCS_XP",
            "IBM1364",
            "IBM1381",
            "IBM1383",
            "IBM930",
            "IBM933",
            "IBM935",
            "IBM937",
            "IBM939",
            "IBM942",
            "IBM943",
            "IBM948",
            "IBM949",
            "IBM950",
            "IBM970",
        };

        ArrayList<long[]> sum = new ArrayList<>();

        for (final String csn : csns) {
            final Charset cs = Charset.forName(csn);
            List<Integer> cps = new ArrayList<>(0x4000);
            int off = 0;
            int cp = 0;
            int n = 0;
            CharsetEncoder enc = cs.newEncoder();
            while (cp < 0x10000 && n < cps.size()) {
                if (enc.canEncode((char)cp)) {
                    cps.add(cp);
                    n++;
                }
                cp++;
            }
            Collections.shuffle(cps);
            char[] ca = new char[cps.size()];
            for (int i = 0; i < cps.size(); i++)
                ca[i] = (char)(int)cps.get(i);


            System.out.printf("%n--------%s---------%n", csn);
            for (int sz = 8; sz <= 2048; sz *= 2) {
                System.out.printf("   [len=%d]%n", sz);

                final char[] chars  = Arrays.copyOf(ca, sz);
                final String str = new String(chars);
                final byte[] bs  = str.getBytes(cs);

                Job[] jobs = {

                    new Job("String decode: csn") {
                    public void work() throws Throwable {
                        for (int i = 0; i < itrs; i++)
                            new String(bs, csn);
                    }},

                    new Job("String decode: cs") {
                    public void work() throws Throwable {
                        for (int i = 0; i < itrs; i++)
                            new String(bs, cs);
                    }},

                    new Job("String encode: csn") {
                    public void work() throws Throwable {
                        for (int i = 0; i < itrs; i++)
                            str.getBytes(csn);
                    }},

                    new Job("String encode: cs") {
                    public void work() throws Throwable {
                        for (int i = 0; i < itrs; i++)
                            str.getBytes(cs);
                    }},
                };
                sum.add(time(jobs));

            }
        }
    }
}