Examples of BoundedFIFO

org.apache.log4j.helpers.BoundedFIFO
BoundedFIFO serves as the bounded first-in-first-out buffer heavily used by the {@link org.apache.log4j.AsyncAppender}. @author Ceki Gülcü @since version 0.9.1

Examples of org.apache.log4j.helpers.BoundedFIFO

     Pattern: +++++..-----..
   */
  public
  void test1() {
    for(int size = 1; size <= 128; size *=2) {
      BoundedFIFO bf = new BoundedFIFO(size);
    
      assertEquals(bf.getMaxSize(), size);
      assertNull(bf.get());
      
      int i;
      int j;
      int k;


      for(i = 1; i < 2*size; i++) {      
  for(j = 0; j < i; j++) {
    //System.out.println("Putting "+e[j]);
    bf.put(e[j]); assertEquals(bf.length(), j < size ?  j+1 : size);
  }
  int max = size < j ? size : j;
  j--;
  for(k = 0; k <= j; k++) {    
    //System.out.println("max="+max+", j="+j+", k="+k);
    assertEquals(bf.length(), max - k > 0 ? max - k : 0); 
    Object r = bf.get();
    //System.out.println("Got "+r);
    if(k >= size) 
      assertNull(r);
    else 
      assertEquals(r, e[k]);

View Full Code Here

Examples of org.apache.log4j.helpers.BoundedFIFO

     Pattern: ++++--++--++
   */
  public
  void test2() {
    int size = 3;
    BoundedFIFO bf = new BoundedFIFO(size);
    
    bf.put(e[0]);  
    assertEquals(bf.get(), e[0]);
    assertNull(bf.get());


    bf.put(e[1]); assertEquals(bf.length(), 1);
    bf.put(e[2]); assertEquals(bf.length(), 2);
    bf.put(e[3]); assertEquals(bf.length(), 3);
    assertEquals(bf.get(), e[1]); assertEquals(bf.length(), 2);
    assertEquals(bf.get(), e[2]); assertEquals(bf.length(), 1);
    assertEquals(bf.get(), e[3]); assertEquals(bf.length(), 0);
    assertNull(bf.get()); assertEquals(bf.length(), 0);
  }

View Full Code Here

Examples of org.apache.log4j.helpers.BoundedFIFO

     Pattern: +++++..-----..
   */
  public
  void test1() {
    for(int size = 1; size <= 128; size *=2) {
      BoundedFIFO bf = new BoundedFIFO(size);
    
      assertEquals(bf.getMaxSize(), size);
      assertNull(bf.get());
      
      int i;
      int j;
      int k;


      for(i = 1; i < 2*size; i++) {      
  for(j = 0; j < i; j++) {
    //System.out.println("Putting "+e[j]);
    bf.put(e[j]); assertEquals(bf.length(), j < size ?  j+1 : size);
  }
  int max = size < j ? size : j;
  j--;
  for(k = 0; k <= j; k++) {    
    //System.out.println("max="+max+", j="+j+", k="+k);
    assertEquals(bf.length(), max - k > 0 ? max - k : 0); 
    Object r = bf.get();
    //System.out.println("Got "+r);
    if(k >= size) 
      assertNull(r);
    else 
      assertEquals(r, e[k]);

View Full Code Here

Examples of org.apache.log4j.helpers.BoundedFIFO

     Pattern: ++++--++--++
   */
  public
  void test2() {
    int size = 3;
    BoundedFIFO bf = new BoundedFIFO(size);
    
    bf.put(e[0]);  
    assertEquals(bf.get(), e[0]);
    assertNull(bf.get());


    bf.put(e[1]); assertEquals(bf.length(), 1);
    bf.put(e[2]); assertEquals(bf.length(), 2);
    bf.put(e[3]); assertEquals(bf.length(), 3);
    assertEquals(bf.get(), e[1]); assertEquals(bf.length(), 2);
    assertEquals(bf.get(), e[2]); assertEquals(bf.length(), 1);
    assertEquals(bf.get(), e[3]); assertEquals(bf.length(), 0);
    assertNull(bf.get()); assertEquals(bf.length(), 0);
  }

View Full Code Here

Examples of org.apache.log4j.helpers.BoundedFIFO

    int size = 10;


    for(int n = 1; n < size*2; n++) {
      for(int i = 0; i < size*2; i++) {


        BoundedFIFO bf = new BoundedFIFO(size);
        for(int f = 0; f < i; f++) {
          bf.put(e[f]);
        }


        bf.resize(n);
        int expectedSize = min(n, min(i, size));
        assertEquals(bf.length(), expectedSize);
        for(int c = 0; c < expectedSize; c++) {
          assertEquals(bf.get(), e[c]);
        }
      }
    }
  }

View Full Code Here

Examples of org.apache.log4j.helpers.BoundedFIFO


    for(int n = 1; n < size*2; n++) {
      for(int i = 0; i < size*2; i++) {
  for(int d = 0; d < min(i,size); d++) {
    
    BoundedFIFO bf = new BoundedFIFO(size);
    for(int p = 0; p < i; p++) {
      bf.put(e[p]);
    }


    for(int g = 0; g < d; g++) {
      bf.get();
    }


    // x = the number of elems in 
    int x = bf.length();


    bf.resize(n);


    int expectedSize = min(n, x);
    assertEquals(bf.length(), expectedSize);


    for(int c = 0; c < expectedSize; c++) {
      assertEquals(bf.get(), e[c+d]);
    }
    assertNull(bf.get());
  }
      }
    }
  }

View Full Code Here

Examples of org.apache.log4j.helpers.BoundedFIFO

    for(int n = 1; n < size*2; n++) {
      for(int i = 0; i < size; i++) {
  for(int d = 0; d < i; d++) {
    for(int r = 0; r < d; r++) {
    
      BoundedFIFO bf = new BoundedFIFO(size);
      for(int p0 = 0; p0 < i; p0++)
        bf.put(e[p0]);


      for(int g = 0; g < d; g++) 
        bf.get();      
      for(int p1 = 0; p1 < r; p1++) 
        bf.put(e[i+p1]);
      


      
      int x =  bf.length();


      bf.resize(n);
      


      int expectedSize = min(n, x);
      assertEquals(bf.length(), expectedSize);


      for(int c = 0; c < expectedSize; c++) {
        assertEquals(bf.get(), e[c+d]);
      }
      //assertNull(bf.get());
    }
  }
      }

View Full Code Here

Examples of org.apache.log4j.helpers.BoundedFIFO

  boolean                 interruptedWarningMessage = false;


  public AsyncAppender(int logBufferQueueSize) {
    // Note: The dispatcher code assumes that the aai is set once and
    // for all.
    bf = new BoundedFIFO(Math.max(DEFAULT_BUFFER_SIZE, logBufferQueueSize));
    aai = new AppenderAttachableImpl();
    dispatcher = new Dispatcher(bf, this);
    dispatcher.start();
  }

View Full Code Here

Examples of org.apache.log4j.helpers.BoundedFIFO

     Pattern: +++++..-----..
   */
  public
  void test1() {
    for(int size = 1; size <= 128; size *=2) {
      BoundedFIFO bf = new BoundedFIFO(size);
    
      assertEquals(bf.getMaxSize(), size);
      assertNull(bf.get());
      
      int i;
      int j;
      int k;


      for(i = 1; i < 2*size; i++) {      
  for(j = 0; j < i; j++) {
    //System.out.println("Putting "+e[j]);
    bf.put(e[j]); assertEquals(bf.length(), j < size ?  j+1 : size);
  }
  int max = size < j ? size : j;
  j--;
  for(k = 0; k <= j; k++) {    
    //System.out.println("max="+max+", j="+j+", k="+k);
    assertEquals(bf.length(), max - k > 0 ? max - k : 0); 
    Object r = bf.get();
    //System.out.println("Got "+r);
    if(k >= size) 
      assertNull(r);
    else 
      assertEquals(r, e[k]);

View Full Code Here

Examples of org.apache.log4j.helpers.BoundedFIFO

     Pattern: ++++--++--++
   */
  public
  void test2() {
    int size = 3;
    BoundedFIFO bf = new BoundedFIFO(size);
    
    bf.put(e[0]);  
    assertEquals(bf.get(), e[0]);
    assertNull(bf.get());


    bf.put(e[1]); assertEquals(bf.length(), 1);
    bf.put(e[2]); assertEquals(bf.length(), 2);
    bf.put(e[3]); assertEquals(bf.length(), 3);
    assertEquals(bf.get(), e[1]); assertEquals(bf.length(), 2);
    assertEquals(bf.get(), e[2]); assertEquals(bf.length(), 1);
    assertEquals(bf.get(), e[3]); assertEquals(bf.length(), 0);
    assertNull(bf.get()); assertEquals(bf.length(), 0);
  }

View Full Code Here

0 1

TOP

All source code are property of their respective owners. Java is a trademark of Sun Microsystems, Inc and owned by ORACLE Inc. Contact coftware#gmail.com.