Welcome to mirror list, hosted at ThFree Co, Russian Federation.

gitlab.com/quite/humla-spongycastle.git - Unnamed repository; edit this file 'description' to name the repository.
summaryrefslogtreecommitdiff
diff options
context:
space:
mode:
authorDavid Hook <dgh@cryptoworkshop.com>2014-04-15 15:15:07 +0400
committerDavid Hook <dgh@cryptoworkshop.com>2014-04-15 15:15:07 +0400
commit1abb1ce6ad1ff2527dbb2f7ca1237488e8ad7987 (patch)
treea7974228979d4062827fca8f5e2dd2ca603122b8 /core/src/main/java/org/bouncycastle/crypto/tls
parent3efee8b0f1e67c727b0c204c45ef399a5c9c4652 (diff)
minor cleanup
Diffstat (limited to 'core/src/main/java/org/bouncycastle/crypto/tls')
-rw-r--r--core/src/main/java/org/bouncycastle/crypto/tls/ByteQueue.java4
1 files changed, 2 insertions, 2 deletions
diff --git a/core/src/main/java/org/bouncycastle/crypto/tls/ByteQueue.java b/core/src/main/java/org/bouncycastle/crypto/tls/ByteQueue.java
index 9daf4fb9..560ea459 100644
--- a/core/src/main/java/org/bouncycastle/crypto/tls/ByteQueue.java
+++ b/core/src/main/java/org/bouncycastle/crypto/tls/ByteQueue.java
@@ -8,7 +8,7 @@ public class ByteQueue
/**
* @return The smallest number which can be written as 2^x which is bigger than i.
*/
- public static final int nextTwoPow(int i)
+ public static int nextTwoPow(int i)
{
/*
* This code is based of a lot of code I found on the Internet which mostly
@@ -30,7 +30,7 @@ public class ByteQueue
/**
* The buffer where we store our data.
*/
- private byte[] databuf;;
+ private byte[] databuf;
/**
* How many bytes at the beginning of the buffer are skipped.