fn appendx()

in src/codec/thrift_cache.rs [77:121]

• 35 lines of code
• 4 McCabe index (conditional complexity)

    fn appendx(rng: &mut SmallRng, keyspace: &Keyspace, buf: &mut Session) {
        let key = keyspace.generate_key(rng);
        let mut values = Vec::new();
        for _ in 0..keyspace.batch_size() {
            values.push(keyspace.generate_value(rng).unwrap_or_else(|| b"".to_vec()));
        }

        let mut buffer = thrift::ThriftBuffer::new();
        buffer.protocol_header();
        buffer.method_name("appendx");
        buffer.sequence_id(0);

        buffer.write_bytes(&[thrift::LIST]);
        buffer.write_i16(1);
        buffer.write_bytes(&[thrift::STRUCT]);
        buffer.write_i32(1);

        buffer.write_bytes(&[thrift::STRING]);
        buffer.write_i16(1);
        buffer.write_i32(1);
        buffer.write_bytes(b"0");

        buffer.write_bytes(&[thrift::STRING]);
        buffer.write_i16(2);
        buffer.write_i32(key.len() as i32);
        buffer.write_bytes(&key);

        buffer.write_bytes(&[thrift::LIST]);
        buffer.write_i16(3);
        buffer.write_bytes(&[thrift::STRING]);
        buffer.write_i32(values.len() as i32);

        for value in values {
            buffer.write_i32(value.len() as i32);
            buffer.write_bytes(&value);
        }

        // stop request struct
        buffer.stop();

        buffer.stop();
        buffer.frame();

        let _ = buf.write(buffer.as_bytes());
    }