Package org.apache.hadoop.fs

Examples of org.apache.hadoop.fs.FSDataInputStream.available()


    FSDataOutputStream out = fs.create(p, false, buffersize, REPLICATION,
        BLOCK_SIZE);
    FSDataInputStream in = fs.open(p);
    int available;

    available = in.available();
    TestCase.assertEquals(0, available);

    AppendTestUtil.write(out, 0, len1);
    out.sync();
View Full Code Here


    TestCase.assertEquals(0, available);

    AppendTestUtil.write(out, 0, len1);
    out.sync();

    available = in.available();
    TestCase.assertEquals(len1, available);
   
    long i = -1;
    for(i++; i < len1; i++) {
      TestCase.assertEquals((byte)i, (byte)in.read())
View Full Code Here

    long i = -1;
    for(i++; i < len1; i++) {
      TestCase.assertEquals((byte)i, (byte)in.read())
    }

    available = in.available();
    TestCase.assertEquals(0, available);

    final int len2 = (int) BLOCK_SIZE / 2 + 3;
    AppendTestUtil.write(out, len1, len2);
    out.sync();
View Full Code Here

    TestCase.assertEquals(0, available);

    final int len2 = (int) BLOCK_SIZE / 2 + 3;
    AppendTestUtil.write(out, len1, len2);
    out.sync();
    available = in.available();
    TestCase.assertEquals(len2, available);
    for(; i < len1 + len2; i++) {
      TestCase.assertEquals((byte)i, (byte)in.read())
    }
    available = in.available();
View Full Code Here

    available = in.available();
    TestCase.assertEquals(len2, available);
    for(; i < len1 + len2; i++) {
      TestCase.assertEquals((byte)i, (byte)in.read())
    }
    available = in.available();
    TestCase.assertEquals(0, available);

    // test available update until end of the block
    final int len3 = (int) BLOCK_SIZE / 2;
    AppendTestUtil.write(out, len1 + len2, len3);
View Full Code Here

    // test available update until end of the block
    final int len3 = (int) BLOCK_SIZE / 2;
    AppendTestUtil.write(out, len1 + len2, len3);
    out.sync();
    available = in.available();
    TestCase.assertEquals((int) BLOCK_SIZE / 2, available);
    for(; i < len1 + len2 + len3; i++) {
      TestCase.assertEquals(i +" th number is wrong..", (byte)i, (byte)in.read())
    }
    available = in.available();
View Full Code Here

    available = in.available();
    TestCase.assertEquals((int) BLOCK_SIZE / 2, available);
    for(; i < len1 + len2 + len3; i++) {
      TestCase.assertEquals(i +" th number is wrong..", (byte)i, (byte)in.read())
    }
    available = in.available();
    TestCase.assertEquals(0, available);

    final int len4 = (int)BLOCK_SIZE / 4 - 7;
    AppendTestUtil.write(out, len1 + len2 + len3, len4);
    out.sync();
View Full Code Here

    TestCase.assertEquals(0, available);

    final int len4 = (int)BLOCK_SIZE / 4 - 7;
    AppendTestUtil.write(out, len1 + len2 + len3, len4);
    out.sync();
    available = in.available();
    for(; i < len1 + len2 + len3 + len4; i++) {
      TestCase.assertEquals(i +" th number is wrong..", (byte)i, (byte)in.read())
    }
   
    final int len5 = 2;
View Full Code Here

    AppendTestUtil.write(out, len1 + len2 + len3 + len4, len5);
    TestCase.assertTrue(in.isUnderConstruction());

    out.sync();

    available = in.available();
    TestCase.assertEquals(len5, available);
    for(; i < len1 + len2 + len3 + len4 + len5; i++) {
      TestCase.assertEquals(i +" th number is wrong..", (byte)i, (byte)in.read())
    }
    available = in.available();
View Full Code Here

    available = in.available();
    TestCase.assertEquals(len5, available);
    for(; i < len1 + len2 + len3 + len4 + len5; i++) {
      TestCase.assertEquals(i +" th number is wrong..", (byte)i, (byte)in.read())
    }
    available = in.available();
    TestCase.assertEquals(0, available);

    out.close();

    available = in.available();
View Full Code Here

TOP
Copyright © 2018 www.massapi.com. 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.