/*******************************************************************************
* Copyright (c) 2013 Lectorius, Inc.
* Authors:
* Vijay Pandurangan (vijayp@mitro.co)
* Evan Jones (ej@mitro.co)
* Adam Hilss (ahilss@mitro.co)
*
*
* This program is free software: you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation, either version 3 of the License, or
* (at your option) any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program. If not, see <http://www.gnu.org/licenses/>.
*
* You can contact the authors at inbound@mitro.co.
*******************************************************************************/
package co.mitro.core.util;
import static org.junit.Assert.assertTrue;
import org.junit.Test;
public class GuavaRequestRateLimiterTest {
private static final int COUNT_LIMIT = 20;
@Test
public void getPublicKeyRateLimited() throws InterruptedException {
GuavaRequestRateLimiter rateLimiter = new GuavaRequestRateLimiter();
int count = countPermitted(rateLimiter, "/somepath");
// should permit some number of requests before rejecting them
assertTrue(0 < count && count < COUNT_LIMIT);
}
private int countPermitted(
final GuavaRequestRateLimiter rateLimiter, final String endpoint) throws InterruptedException {
// must be done in parallel, since the default "wait for up to 1 second" is slow enough to allow all requests
class IsPermittedRequestor extends Thread {
public boolean result;
public void run() {
result = rateLimiter.isRequestPermitted("127.0.0.1", endpoint);
}
};
IsPermittedRequestor[] requestors = new IsPermittedRequestor[COUNT_LIMIT];
for (int count = 0; count < COUNT_LIMIT; count++) {
requestors[count] = new IsPermittedRequestor();
requestors[count].start();
}
int totalSuccesses = 0;
for (int count = 0; count < COUNT_LIMIT; count++) {
requestors[count].join();
if (requestors[count].result) {
totalSuccesses += 1;
}
}
return totalSuccesses;
}
}