byte数组快速拷贝,byte数组合并,System.arraycopy详解

33 篇文章 1 订阅

博客来源:

项目过程中用到byte[]数组相加问题,给出两个byte[] 需要合并成一个byte[]进行计算…那么需求来了……数据量达10W级,怎么合并

 调用系统自带方法(System.arraycopy)

参考程序

@org.junit.Test
public void fun(){
    //创建一个存储被拷贝的字节数组,长度一定要比被拷贝字节数组大
    byte[] bytes = new byte[20];
    //创建一个需要字节拷贝的数组
    byte[] byte_name = "xiaoming".getBytes();
    //调用系统方法进行拷贝
    System.arraycopy(byte_name, 0, bytes, 5, byte_name.length);
    //输出原字节数组,两者进行比较
    for (byte bb :byte_name) {
        System.out.print(bb);
    }
    //换行
    System.out.println();
    //输出被拷贝的数组,两者进行比较
    for (byte bb :bytes) {
        System.out.print(bb);
    }
}

运行结果,已经按照程序要就进行拷贝

下面进行详细介绍下,系统方法  (System.arraycopy)

简单用法:

java.lang.System public static void

arraycopy(@NotNull     Object src,           被拷贝的字节数组
                                              int srcPos,          从被拷贝的字节数组的第几位开始拷贝
                                              @NotNull Object dest,    拷贝到这个字节数组中
                                              int destPos,        从第几位开始拷贝被拷贝的数组
                                              int length            拷贝多少位被拷贝的字节数组

来!看一下官方解释, 其实也就是上面的解释,加之上面的程序,尝试几次就好啦

 

java.lang.System public static void arraycopy(@NotNull Object src,
                                                         int srcPos,
                                                         @NotNull Object dest,
                                                         int destPos,
                                                         int length)
Copies an array from the specified source array, beginning at the specified position, to the specified position of the destination array. A subsequence of array components are copied from the source array referenced by src to the destination array referenced by dest. The number of components copied is equal to the length argument. The components at positions srcPos through srcPos+length-1 in the source array are copied into positions destPos through destPos+length-1, respectively, of the destination array.
If the src and dest arguments refer to the same array object, then the copying is performed as if the components at positions srcPos through srcPos+length-1 were first copied to a temporary array with length components and then the contents of the temporary array were copied into positions destPos through destPos+length-1 of the destination array.
If dest is null, then a NullPointerException is thrown.
If src is null, then a NullPointerException is thrown and the destination array is not modified.
Otherwise, if any of the following is true, an ArrayStoreException is thrown and the destination is not modified:

  •     The src argument refers to an object that is not an array.
  •     The dest argument refers to an object that is not an array.
  •     The src argument and dest argument refer to arrays whose component types are different primitive types.
  •     The src argument refers to an array with a primitive component type and the dest argument refers to an array with a reference component type.
  •     The src argument refers to an array with a reference component type and the dest argument refers to an array with a primitive component type.

Otherwise, if any of the following is true, an IndexOutOfBoundsException is thrown and the destination is not modified:

  •     The srcPos argument is negative.
  •     The destPos argument is negative.
  •     The length argument is negative.
  •     srcPos+length is greater than src.length, the length of the source array.
  •     destPos+length is greater than dest.length, the length of the destination array.

Otherwise, if any actual component of the source array from position srcPos through srcPos+length-1 cannot be converted to the component type of the destination array by assignment conversion, an ArrayStoreException is thrown. In this case, let k be the smallest nonnegative integer less than length such that src[srcPos+k] cannot be converted to the component type of the destination array; when the exception is thrown, source array components from positions srcPos through srcPos+k-1 will already have been copied to destination array positions destPos through destPos+k-1 and no other positions of the destination array will have been modified. (Because of the restrictions already itemized, this paragraph effectively applies only to the situation where both arrays have component types that are reference types.)

Params:
                    src – the source array.
                    srcPos – starting position in the source array.
                    dest – the destination array.
                    destPos – starting position in the destination data.
                    length – the number of array elements to be copied.
                    
Throws:
                    IndexOutOfBoundsException – if copying would cause access of data outside array bounds.
                    ArrayStoreException – if an element in the src array could not be stored into the dest array because of a type mismatch.
                    NullPointerException – if either src or dest is null.
                    
External annotations:
                    Parameter src: @org.jetbrains.annotations.NotNull
                    Parameter dest: @org.jetbrains.annotations.NotNull

 

 

 

 

 

好的,下面是一个用Java语言实现的合并两个指定文件并排序的例子: ```java import java.io.*; public class MergeFiles { public static void main(String[] args) { String file1 = "file1.txt"; String file2 = "file2.txt"; String outputFile = "output.txt"; try { // 读取文件1和文件2 FileInputStream fis1 = new FileInputStream(file1); FileInputStream fis2 = new FileInputStream(file2); DataInputStream dis1 = new DataInputStream(fis1); DataInputStream dis2 = new DataInputStream(fis2); // 创建输出文件 FileOutputStream fos = new FileOutputStream(outputFile); DataOutputStream dos = new DataOutputStream(fos); // 读取文件1和文件2的内容,合并成一个数组 int[] arr = new int[100]; int i = 0; while (dis1.available() > 0) { arr[i++] = dis1.readInt(); } while (dis2.available() > 0) { arr[i++] = dis2.readInt(); } // 将数组排序 int n = i; for (i = 0; i < n - 1; i++) { for (int j = i + 1; j < n; j++) { if (arr[i] > arr[j]) { int temp = arr[i]; arr[i] = arr[j]; arr[j] = temp; } } } // 将排序后的数组写入输出文件 for (i = 0; i < n; i++) { dos.writeInt(arr[i]); } // 关闭文件流 fis1.close(); fis2.close(); fos.close(); dis1.close(); dis2.close(); dos.close(); System.out.println("文件合并并排序完成!"); } catch (IOException e) { e.printStackTrace(); } } } ``` 在这个例子中,我们先定义了文件1、文件2和输出文件的名称,然后使用文件字节输入流和数据输入流读取文件1和文件2的内容,并将它们合并到一个数组中。接着,我们对这个数组进行排序,最后使用文件字节输出流和数据输出流将排序后的数组写入输出文件中。最后,我们关闭文件流,并输出一个提示信息。 注意,这个例子中使用了一个比较简单的排序算法,实际上,在处理大量数据时,我们应该使用更高效的排序算法,比如归并排序或快速排序。
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值