Swap.java
来源:互联网 发布:软件开发合同范本下载 编辑:程序博客网 时间:2024/06/14 07:17
public class Swap{ /* float */ public static float swap (float value){ int intValue = Float.floatToRawIntBits (value); intValue = swap (intValue); return Float.intBitsToFloat (intValue); } /* int */ public static int swap (int value){ int b1 = (value >> 0) & 0xff; int b2 = (value >> 8) & 0xff; int b3 = (value >> 16) & 0xff; int b4 = (value >> 24) & 0xff; return b1 << 24 | b2 << 16 | b3 << 8 | b4 << 0; } /* short */ public static short swap (short value){ int b1 = value & 0xff; int b2 = (value >> 8) & 0xff; return (short) (b1 << 8 | b2 << 0); } /* long */ public static long swap (long value){ long b1 = (value >> 0) & 0xff; long b2 = (value >> 8) & 0xff; long b3 = (value >> 16) & 0xff; long b4 = (value >> 24) & 0xff; long b5 = (value >> 32) & 0xff; long b6 = (value >> 40) & 0xff; long b7 = (value >> 48) & 0xff; long b8 = (value >> 56) & 0xff; return b1 << 56 | b2 << 48 | b3 << 40 | b4 << 32 | b5 << 24 | b6 << 16 | b7 << 8 | b8 << 0; } /* double */ public static double swap (double value){ long longValue = Double.doubleToLongBits (value); longValue = swap (longValue); return Double.longBitsToDouble (longValue); } /* short array */ public static void swap (short[] array){ for ( int i = 0 ; i < array.length ; i ++ ) array[i] = swap (array[i]); } /* int array */ public static void swap (int[] array){ for ( int i = 0 ; i < array.length ; i ++ ) array[i] = swap (array[i]); } /* long array */ public static void swap (long[] array){ for ( int i = 0 ; i < array.length ; i ++ ) array[i] = swap (array[i]); } /* float array */ public static void swap (float[] array){ for ( int i = 0 ; i < array.length ; i ++ ) array[i] = swap (array[i]); } /* double array */ public static void swap (double[] array){ for ( int i = 0 ; i < array.length ; i ++ ) array[i] = swap (array[i]); }}
阅读全文
0 0
- java swap
- Swap.java
- 【Java】Java中的swap
- java puzzler - Swap Meat
- java之swap
- Java Swap函数
- JAVA实现swap
- 利用java实现swap
- 670. Maximum Swap(Java)
- java SortedSet接口swap方法
- Swap Nodes in Pairs Java
- Swap Nodes in Pairs (Java)
- java中swap()的实现
- java学习之swap问题
- LeetCode-Medium-Java-Maximum Swap
- swap
- swap
- swap
- 统计自然语言处理概率论和信息论基本概念及其推导过程
- Sublime_text3
- LeetCode 448. Find All Numbers Disappeared in an Array
- 网址访问过程
- Shell、Bash,与终端配置文件
- Swap.java
- QFontDialog
- R-CNN物体检测三篇开山制作阅读笔记
- jdk安装与部署
- [Struts2] Struts2接受参数的几种类型和接受复杂类型参数
- bzoj 3943: [Usaco2015 Feb]SuperBull
- Webpack入门教程
- 程序员必定会爱上的10款软件
- Codeforces Round #433 (Div. 2) C. Planning