/protocols/ss7/map/map-impl/src/test/java/org/mobicents/protocols/ss7/map/Utils.java

http://mobicents.googlecode.com/ · Java · 62 lines · 34 code · 6 blank · 22 comment · 7 complexity · 7162cb641d18c7997ef36dfeea8aa0ed MD5 · raw file

  1. /*
  2. * JBoss, Home of Professional Open Source
  3. * Copyright 2011, Red Hat, Inc. and individual contributors
  4. * by the @authors tag. See the copyright.txt in the distribution for a
  5. * full listing of individual contributors.
  6. *
  7. * This is free software; you can redistribute it and/or modify it
  8. * under the terms of the GNU Lesser General Public License as
  9. * published by the Free Software Foundation; either version 2.1 of
  10. * the License, or (at your option) any later version.
  11. *
  12. * This software is distributed in the hope that it will be useful,
  13. * but WITHOUT ANY WARRANTY; without even the implied warranty of
  14. * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
  15. * Lesser General Public License for more details.
  16. *
  17. * You should have received a copy of the GNU Lesser General Public
  18. * License along with this software; if not, write to the Free
  19. * Software Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA
  20. * 02110-1301 USA, or see the FSF site: http://www.fsf.org.
  21. */
  22. package org.mobicents.protocols.ss7.map;
  23. public class Utils {
  24. public final static String dump(byte[] buff, int size, boolean asBits) {
  25. String s = "";
  26. for (int i = 0; i < size; i++) {
  27. String ss = null;
  28. if(!asBits)
  29. {
  30. ss = Integer.toHexString(buff[i] & 0xff);
  31. }
  32. else
  33. {
  34. ss = Integer.toBinaryString(buff[i] & 0xff);
  35. }
  36. ss = fillInZeroPrefix(ss,asBits);
  37. s += " " + ss;
  38. }
  39. return s;
  40. }
  41. public final static String fillInZeroPrefix(String ss, boolean asBits) {
  42. if (asBits) {
  43. if (ss.length() < 8) {
  44. for (int j = ss.length(); j < 8; j++) {
  45. ss = "0" + ss;
  46. }
  47. }
  48. } else {
  49. // hex
  50. if (ss.length() < 2) {
  51. ss = "0" + ss;
  52. }
  53. }
  54. return ss;
  55. }
  56. }