mirror of
https://github.com/pgpainless/pgpainless.git
synced 2024-11-23 04:42:06 +01:00
Add test for SignatureSubpacket.fromCodes()
This commit is contained in:
parent
4947f17842
commit
fee3041bcb
1 changed files with 40 additions and 0 deletions
|
@ -0,0 +1,40 @@
|
||||||
|
/*
|
||||||
|
* Copyright 2021 Paul Schaub.
|
||||||
|
*
|
||||||
|
* Licensed under the Apache License, Version 2.0 (the "License");
|
||||||
|
* you may not use this file except in compliance with the License.
|
||||||
|
* You may obtain a copy of the License at
|
||||||
|
*
|
||||||
|
* http://www.apache.org/licenses/LICENSE-2.0
|
||||||
|
*
|
||||||
|
* Unless required by applicable law or agreed to in writing, software
|
||||||
|
* distributed under the License is distributed on an "AS IS" BASIS,
|
||||||
|
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
|
||||||
|
* See the License for the specific language governing permissions and
|
||||||
|
* limitations under the License.
|
||||||
|
*/
|
||||||
|
package org.pgpainless.algorithm;
|
||||||
|
|
||||||
|
import static org.junit.jupiter.api.Assertions.assertEquals;
|
||||||
|
|
||||||
|
import java.util.List;
|
||||||
|
|
||||||
|
import org.junit.jupiter.api.Test;
|
||||||
|
|
||||||
|
public class SignatureSubpacketTest {
|
||||||
|
|
||||||
|
@Test
|
||||||
|
public void testFromCodes() {
|
||||||
|
int[] codes = new int[] {
|
||||||
|
SignatureSubpacket.issuerKeyId.getCode(),
|
||||||
|
SignatureSubpacket.preferredSymmetricAlgorithms.getCode(),
|
||||||
|
SignatureSubpacket.preferredHashAlgorithms.getCode()
|
||||||
|
};
|
||||||
|
|
||||||
|
List<SignatureSubpacket> subpacketList = SignatureSubpacket.fromCodes(codes);
|
||||||
|
assertEquals(3, subpacketList.size());
|
||||||
|
assertEquals(SignatureSubpacket.issuerKeyId, subpacketList.get(0));
|
||||||
|
assertEquals(SignatureSubpacket.preferredSymmetricAlgorithms, subpacketList.get(1));
|
||||||
|
assertEquals(SignatureSubpacket.preferredHashAlgorithms, subpacketList.get(2));
|
||||||
|
}
|
||||||
|
}
|
Loading…
Reference in a new issue