1.1 --- /dev/null Thu Jan 01 00:00:00 1970 +0000
1.2 +++ b/emul/mini/src/main/java/org/apidesign/bck2brwsr/emul/lang/System.java Wed Jan 23 22:55:28 2013 +0100
1.3 @@ -0,0 +1,64 @@
1.4 +/**
1.5 + * Back 2 Browser Bytecode Translator
1.6 + * Copyright (C) 2012 Jaroslav Tulach <jaroslav.tulach@apidesign.org>
1.7 + *
1.8 + * This program is free software: you can redistribute it and/or modify
1.9 + * it under the terms of the GNU General Public License as published by
1.10 + * the Free Software Foundation, version 2 of the License.
1.11 + *
1.12 + * This program is distributed in the hope that it will be useful,
1.13 + * but WITHOUT ANY WARRANTY; without even the implied warranty of
1.14 + * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
1.15 + * GNU General Public License for more details.
1.16 + *
1.17 + * You should have received a copy of the GNU General Public License
1.18 + * along with this program. Look for COPYING file in the top folder.
1.19 + * If not, see http://opensource.org/licenses/GPL-2.0.
1.20 + */
1.21 +package org.apidesign.bck2brwsr.emul.lang;
1.22 +
1.23 +/**
1.24 + *
1.25 + * @author Jaroslav Tulach <jtulach@netbeans.org>
1.26 + */
1.27 +public class System {
1.28 + private System() {
1.29 + }
1.30 +
1.31 + public static void arraycopy(char[] value, int srcBegin, char[] dst, int dstBegin, int count) {
1.32 + if (srcBegin < dstBegin) {
1.33 + while (count-- > 0) {
1.34 + dst[dstBegin + count] = value[srcBegin + count];
1.35 + }
1.36 + } else {
1.37 + while (count-- > 0) {
1.38 + dst[dstBegin++] = value[srcBegin++];
1.39 + }
1.40 + }
1.41 + }
1.42 +
1.43 + public static void arraycopy(byte[] value, int srcBegin, byte[] dst, int dstBegin, int count) {
1.44 + if (srcBegin < dstBegin) {
1.45 + while (count-- > 0) {
1.46 + dst[dstBegin + count] = value[srcBegin + count];
1.47 + }
1.48 + } else {
1.49 + while (count-- > 0) {
1.50 + dst[dstBegin++] = value[srcBegin++];
1.51 + }
1.52 + }
1.53 + }
1.54 +
1.55 + public static void arraycopy(Object[] value, int srcBegin, Object[] dst, int dstBegin, int count) {
1.56 + if (srcBegin < dstBegin) {
1.57 + while (count-- > 0) {
1.58 + dst[dstBegin + count] = value[srcBegin + count];
1.59 + }
1.60 + } else {
1.61 + while (count-- > 0) {
1.62 + dst[dstBegin++] = value[srcBegin++];
1.63 + }
1.64 + }
1.65 + }
1.66 +
1.67 +}