Package org.apache.log4j.helpers

Examples of org.apache.log4j.helpers.BoundedFIFO

61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
     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
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
     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
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
     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
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
     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
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
    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
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
    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
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
    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
69
70
71
72
73
74
75
76
77
78
  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
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
     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
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
     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
TOP

Related Classes of org.apache.log4j.helpers.BoundedFIFO

  • org.apache.log4j.helpers.BoundedFIFOTestCase
  • org.apache.log4j.spi.LoggingEvent
  • org.apache.log4j.test.UnitTestBoundedFIFO
  • org.commoncrawl.util.shared.AsyncAppender
    • Copyright © 2018 www.massapicom. All rights reserved.
    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.