1 /* -*- Mode: C++; tab-width: 2; indent-tabs-mode: nil; c-basic-offset: 2 -*- */
2 /* This Source Code Form is subject to the terms of the Mozilla Public
3 * License, v. 2.0. If a copy of the MPL was not distributed with this file,
4 * You can obtain one at http://mozilla.org/MPL/2.0/. */
5
6 #include "gtest/gtest.h"
7 #include "OpusParser.h"
8 #include <algorithm>
9
10 using namespace mozilla;
11
TEST(OpusParser,Mapping2)12 TEST(OpusParser, Mapping2)
13 {
14 uint8_t validChannels[] = {1, 3, 4, 6, 9, 11, 16, 18, 25, 27,
15 36, 38, 49, 51, 64, 66, 81, 83, 100, 102,
16 121, 123, 144, 146, 169, 171, 196, 198, 225, 227};
17 for (uint8_t channels = 0; channels < 255; channels++) {
18 bool found = OpusParser::IsValidMapping2ChannelsCount(channels);
19 bool foundTable =
20 std::find(std::begin(validChannels), std::end(validChannels),
21 channels) != std::end(validChannels);
22 EXPECT_EQ(found, foundTable);
23 }
24 }
25