Skip to content

Instantly share code, notes, and snippets.

@mahkoh

mahkoh/gist:69a6a7fbbc7b0f1c9160 Secret

Created January 17, 2015 14:54
Show Gist options
  • Star 0 You must be signed in to star a gist
  • Fork 0 You must be signed in to fork a gist
  • Save mahkoh/69a6a7fbbc7b0f1c9160 to your computer and use it in GitHub Desktop.
Save mahkoh/69a6a7fbbc7b0f1c9160 to your computer and use it in GitHub Desktop.
Download ZIP
Raw
gistfile1.txt
Q = Not clear from the code.
I = Loss of precision is desired.
C = Checked division is desired.
M = Use div_mod function.
H = Hack.
W = The code might be incorrect right now.
M ./src/libunicode/normalize.rs: let li = si / N_COUNT;
M ./src/libunicode/normalize.rs: let vi = (si % N_COUNT) / T_COUNT;
I ./src/libunicode/u_str.rs: (low / 2, high)
I ./src/libsyntax/codemap.rs: let m = (a + b) / 2u;
I ./src/libsyntax/codemap.rs: let m = (a + b) / 2u;
Q ./src/libsyntax/diagnostic.rs: let mut num = (lines.lines[0] + 1u) / 10u;
Q ./src/libterm/terminfo/parm.rs: (Number(y), Number(x)) => stack.push(Number(x / y)),
I ./src/libserialize/hex.rs: let mut b = Vec::with_capacity(self.len() / 2);
H ./src/librustc/middle/dataflow.rs: let words_per_id = (bits_per_id + uint::BITS - 1) / uint::BITS;
M ./src/librustc/middle/dataflow.rs: let word = bit / uint::BITS;
W ./src/rustbook/book.rs: }).sum() / 4 + 1;
C ./src/libarena/lib.rs: let diff = (end - start) / mem::size_of::<T>();
C ./src/libcore/num/int_macros.rs: pub const BYTES : uint = ($bits / 8);
C ./src/libcore/num/mod.rs: v => Some(self / v),
C ./src/libcore/num/mod.rs: v => Some(self / v),
I ./src/libcore/num/mod.rs: if is_positive && (prev_sig != (sig - digit as $T) / radix as $T)
I ./src/libcore/num/mod.rs: if !is_positive && (prev_sig != (sig + digit as $T) / radix as $T)
C ./src/libcore/num/uint_macros.rs: pub const BYTES : uint = ($bits / 8);
C ./src/libcore/ops.rs: fn div(self, other: $t) -> $t { self / other }
Q ./src/libcore/slice.rs: while i < ln / 2 {
C ./src/libcore/slice.rs: let exact = diff / (if size == 0 {1} else {size});
C ./src/libcore/slice.rs: diff / mem::size_of::<$t>()
M ./src/libcore/slice.rs: let n = self.v.len() / self.size;
M ./src/libcore/slice.rs: let n = self.v.len() / self.chunk_size;
./src/libcore/fmt/float.rs: let neg = num < _0 || (negative_zero && _1 / num == Float::neg_infinity());
./src/libcore/fmt/float.rs: (num / exp_base.powf(exp), cast::<T, i32>(exp).unwrap())
./src/libcore/fmt/float.rs: deccum = deccum / radix_gen;
./src/libcore/fmt/float.rs: if extra_digit >= radix / 2 { // -> need to round
./src/libcore/fmt/mod.rs: rt::AlignCenter => (padding / 2, (padding + 1) / 2),
./src/libcore/fmt/num.rs: x = x / base; // Deaccumulate the number.
./src/libcore/fmt/num.rs: x = x / base; // Deaccumulate the number.
./src/libcore/str/mod.rs: (len.saturating_add(3) / 4, Some(len))
./src/test/run-pass/div-mod.rs: assert_eq!(x / 5, 3);
./src/test/run-pass/div-mod.rs: assert_eq!(x / 4, 3);
./src/test/run-pass/div-mod.rs: assert_eq!(x / 3, 5);
./src/test/run-pass/div-mod.rs: assert_eq!(x / y, 3);
./src/test/run-pass/div-mod.rs: assert_eq!(15 / y, 3);
./src/test/run-pass/task-comm-5.rs: assert_eq!(sum, number_of_messages * (number_of_messages - 1) / 2);
./src/test/run-pass/task-comm-9.rs: assert_eq!(sum, number_of_messages * (number_of_messages - 1) / 2);
./src/test/run-pass/arith-2.rs: assert!(i32_c + i32_c * 2 / 3 * 2 + (i32_c - 7 % 3) ==
./src/test/run-pass/arith-2.rs: i32_c + i32_c * 2 / 3 * 2 + (i32_c - 7 % 3));
./src/test/run-pass/task-comm-12.rs:fn start(_task_number: int) { println!("Started / Finished task."); }
./src/test/run-pass/operator-associativity.rs:pub fn main() { assert!((3i * 5i / 2i == 7i)); }
./src/test/run-pass/const-binops.rs:static H: int = 3 / -1;
./src/test/run-pass/const-binops.rs:static I: uint = 3 / 3;
./src/test/run-pass/issue-2989.rs: let w = i / 64;
./src/test/run-pass/arith-1.rs: assert_eq!(i32_a / 10, 1);
./src/test/run-pass/arith-1.rs: assert_eq!(i32_a * i32_a / i32_a * i32_a, 100);
./src/test/run-pass/task-comm-1.rs:fn start() { println!("Started / Finished task."); }
./src/test/run-pass/parse-complex-macro-invoc-op.rs: id![1i] / 1;
./src/test/run-pass/arith-unsigned.rs: assert_eq!(250u8 / 10u8, 25u8);
./src/test/run-pass/arith-unsigned.rs: assert_eq!(60000u16 / 10u16, 6000u16);
./src/test/run-pass/arith-unsigned.rs: assert_eq!(4000000000u32 / 10u32, 400000000u32);
./src/test/run-pass/realloc-16687.rs: for i in range(0u, COUNT / 2) {
./src/test/run-pass/realloc-16687.rs: for i in range(0u, COUNT / 2) {
./src/test/run-pass/realloc-16687.rs: for i in range(0u, COUNT / 2) {
./src/test/run-pass/realloc-16687.rs: for i in range(0u, COUNT / 2) {
./src/test/run-pass/realloc-16687.rs: for i in range(0u, COUNT / 2) {
./src/test/run-pass/realloc-16687.rs: for i in range(0u, COUNT / 2) {
./src/test/run-pass/realloc-16687.rs: for i in range(0u, COUNT / 2).rev() {
./src/test/run-pass/realloc-16687.rs: for i in range(0u, COUNT / 2).rev() {
./src/test/run-pass/issue-8460.rs: assert!(Thread::scoped(move|| int::MIN / -1).join().is_err());
./src/test/run-pass/issue-8460.rs: assert!(Thread::scoped(move|| i8::MIN / -1).join().is_err());
./src/test/run-pass/issue-8460.rs: assert!(Thread::scoped(move|| i16::MIN / -1).join().is_err());
./src/test/run-pass/issue-8460.rs: assert!(Thread::scoped(move|| i32::MIN / -1).join().is_err());
./src/test/run-pass/issue-8460.rs: assert!(Thread::scoped(move|| i64::MIN / -1).join().is_err());
./src/test/run-pass/issue-8460.rs: assert!(Thread::scoped(move|| 1i / 0).join().is_err());
./src/test/run-pass/issue-8460.rs: assert!(Thread::scoped(move|| 1i8 / 0).join().is_err());
./src/test/run-pass/issue-8460.rs: assert!(Thread::scoped(move|| 1i16 / 0).join().is_err());
./src/test/run-pass/issue-8460.rs: assert!(Thread::scoped(move|| 1i32 / 0).join().is_err());
./src/test/run-pass/issue-8460.rs: assert!(Thread::scoped(move|| 1i64 / 0).join().is_err());
./src/test/run-pass/as-precedence.rs: assert_eq!(3 as (uint) / 3, 1);
./src/test/run-pass/issue-17718.rs:const C4: uint = C1 * C1 + C1 / C1;
./src/test/run-pass/task-comm-7.rs: assert_eq!(sum, number_of_messages * 4 * (number_of_messages * 4 - 1) / 2);
./src/test/compile-fail/binop-consume-args.rs: lhs / rhs;
./src/test/auxiliary/issue-17718.rs:pub const C4: uint = C1 * C1 + C1 / C1;
./src/test/bench/msgsend-pipes.rs: for _ in range(0u, size / workers) {
./src/test/bench/msgsend-pipes.rs: for _ in range(0u, size / workers) {
./src/test/bench/shootout-fannkuch-redux.rs: let d = idx / self.fact[i] as i32;
./src/test/bench/shootout-fannkuch-redux.rs: let k = perm.max() / N;
./src/test/bench/shootout-mandelbrot.rs: let w = (w + 7) / 8 * 8;
./src/test/bench/shootout-mandelbrot.rs: let chunk_size = h / WORKERS;
./src/test/bench/shootout-mandelbrot.rs: let mut rs = Vec::with_capacity(w / WORKERS);
./src/test/bench/shootout-mandelbrot.rs: let mut is = Vec::with_capacity(w / WORKERS);
./src/test/bench/shootout-mandelbrot.rs: let mut res: Vec<u8> = Vec::with_capacity((chunk_size * w) / 8);
./src/test/bench/shootout-fasta-redux.rs: let lines = n / LINE_LEN;
./src/test/bench/sudoku.rs: let row0 = (row / 3u8) * 3u8;
./src/test/bench/sudoku.rs: let col0 = (col / 3u8) * 3u8;
./src/test/bench/shootout-meteor.rs: let x = x + dx + (y + (dy % 2)) / 2;
./src/test/bench/shootout-meteor.rs: t.iter().filter_map(|p| mask(yx / 5, yx % 5, id, p)).collect()
./src/test/bench/noise.rs: let idx = (pixels[y*256+x] / 0.2) as uint;
./src/test/bench/shootout-spectralnorm.rs: (dot(u.as_slice(), v.as_slice()) / dot(v.as_slice(), v.as_slice())).sqrt()
./src/test/bench/shootout-spectralnorm.rs: sum += top / bot;
./src/test/bench/shootout-spectralnorm.rs: let size = v.len() / os::num_cpus() + 1;
./src/test/bench/task-perf-one-million.rs: calc(children / 2, &wait_chan);
./src/test/bench/shootout-reverse-complement.rs: let div = len / 4;
./src/test/bench/shootout-chameneos-redux.rs: num = num / 10;
./src/test/bench/msgsend-pipes-shared.rs: for _ in range(0u, size / workers) {
./src/test/bench/msgsend-pipes-shared.rs: print!("Throughput={} per sec\n", thruput / 1000.0);
./src/test/run-fail/divide-by-zero.rs: let _z = 1i / y;
./src/test/run-fail/bounds-check-no-overflow.rs: xs[uint::MAX / size_of::<int>() + 1];
./src/test/run-fail/bug-2470-bounds-check-overflow.rs: let idx = base / mem::size_of::<uint>();
./src/test/run-fail/hashmap-capacity-overflow.rs: let threshold = uint::MAX / size_of::<(u64, u64, u64)>();
./src/librustc_trans/back/link.rs: let id = id / EXTRA_CHARS.len();
./src/librustc_trans/back/link.rs: let id = id / EXTRA_CHARS.len();
./src/librustc_trans/trans/cabi_mips.rs: return (off + a - 1u) / a * a;
./src/librustc_trans/trans/cabi_mips.rs: ((llvm::LLVMGetIntTypeWidth(ty.to_ref()) as uint) + 7) / 8
./src/librustc_trans/trans/cabi_mips.rs: ((llvm::LLVMGetIntTypeWidth(ty.to_ref()) as uint) + 7) / 8
./src/librustc_trans/trans/cabi_mips.rs: *offset += align_up_to(size, align * 8) / 8;
./src/librustc_trans/trans/cabi_mips.rs: let mut n = size / 32;
./src/librustc_trans/trans/cabi_x86_64.rs: return (off + a - 1u) / a * a;
./src/librustc_trans/trans/cabi_x86_64.rs: ((llvm::LLVMGetIntTypeWidth(ty.to_ref()) as uint) + 7) / 8
./src/librustc_trans/trans/cabi_x86_64.rs: ((llvm::LLVMGetIntTypeWidth(ty.to_ref()) as uint) + 7) / 8
./src/librustc_trans/trans/cabi_x86_64.rs: let mut i = off / 8u;
./src/librustc_trans/trans/cabi_x86_64.rs: let e = (off + t_size + 7u) / 8u;
./src/librustc_trans/trans/cabi_x86_64.rs: unify(cls, ix + off / 8u, Int);
./src/librustc_trans/trans/cabi_x86_64.rs: unify(cls, ix + off / 8u, SSEFv);
./src/librustc_trans/trans/cabi_x86_64.rs: unify(cls, ix + off / 8u, SSEFs);
./src/librustc_trans/trans/cabi_x86_64.rs: unify(cls, ix + off / 8u, SSEDs);
./src/librustc_trans/trans/cabi_x86_64.rs: let words = (ty_size(ty) + 7) / 8;
./src/librustc_trans/trans/cabi_aarch64.rs: return (off + a - 1u) / a * a;
./src/librustc_trans/trans/cabi_aarch64.rs: ((llvm::LLVMGetIntTypeWidth(ty.to_ref()) as uint) + 7) / 8
./src/librustc_trans/trans/cabi_aarch64.rs: ((llvm::LLVMGetIntTypeWidth(ty.to_ref()) as uint) + 7) / 8
./src/librustc_trans/trans/cabi_aarch64.rs: Type::array(&Type::i64(ccx), ((size + 7 ) / 8 ) as u64)
./src/librustc_trans/trans/cabi_aarch64.rs: Type::array(&Type::i64(ccx), ((size + 7 ) / 8 ) as u64)
./src/librustc_trans/trans/cabi_arm.rs: return (off + a - 1u) / a * a;
./src/librustc_trans/trans/cabi_arm.rs: ((llvm::LLVMGetIntTypeWidth(ty.to_ref()) as uint) + 7) / 8
./src/librustc_trans/trans/cabi_arm.rs: cmp::min(4, ((llvm::LLVMGetIntTypeWidth(ty.to_ref()) as uint) + 7) / 8)
./src/librustc_trans/trans/cabi_arm.rs: ((llvm::LLVMGetIntTypeWidth(ty.to_ref()) as uint) + 7) / 8
./src/librustc_trans/trans/cabi_arm.rs: Type::array(&Type::i32(ccx), ((size + 3) / 4) as u64)
./src/librustc_trans/trans/cabi_arm.rs: Type::array(&Type::i64(ccx), ((size + 7) / 8) as u64)
./src/librustc_trans/trans/adt.rs: let align_units = (size + align_s - 1) / align_s - 1;
./src/librustc_trans/trans/adt.rs: a if a.count_ones() == 1 => Type::array(&Type::vector(&Type::i32(cx), a / 4),
./src/librustc_trans/trans/adt.rs: Type::array(&discr_ty, align_s / discr_size - 1),
./src/librustc_trans/trans/adt.rs:fn roundup(x: u64, a: u32) -> u64 { let a = a as u64; ((x + (a - 1)) / a) * a }
./src/libtest/stats.rs: self.sum() / FromPrimitive::from_uint(self.len()).unwrap()
./src/libtest/stats.rs: (self.std_dev() / self.mean()) * hundred
./src/libtest/stats.rs: (self.median_abs_dev() / self.median()) * hundred
./src/libtest/stats.rs: let rank = (pct / hundred) * length;
./src/libtest/stats.rs: (s.min / lomag).floor() * lomag
./src/libtest/stats.rs: (s.max / himag).ceil() * himag
./src/libtest/stats.rs: let char_step = range / range_float;
./src/libtest/lib.rs: Some(pct) => vold.value * pct / 100.0
./src/libtest/lib.rs: self.ns_elapsed() / cmp::max(self.iterations, 1)
./src/libtest/lib.rs: n = 1_000_000 / cmp::max(self.ns_per_iter(), 1);
./src/libtest/lib.rs: let iter_s = 1_000_000_000 / ns_iter;
./src/libtest/lib.rs: let mb_s = (bs.bytes * iter_s) / 1_000_000;
./src/librustc_typeck/variance.rs: debug!("Index {} Info {} / {:?} / {:?} Variance {:?}",
./src/libcollections/btree/node.rs: right._len = self.len() / 2;
./src/libcollections/btree/node.rs: cap / 2
./src/libcollections/bit.rs: bits / u32::BITS
./src/libcollections/bit.rs: bits / u32::BITS + 1
./src/libcollections/bit.rs: let complete_words = bytes.len() / 4;
./src/libcollections/bit.rs: let w = i / u32::BITS;
./src/libcollections/bit.rs: let w = i / u32::BITS;
./src/libcollections/bit.rs: let word_idx = self.next_idx / u32::BITS;
./src/libcollections/slice.rs: let elems = (right_end as uint - right as uint) / mem::size_of::<T>();
./src/libcollections/slice.rs: let elems = (right_start as uint - left as uint) / mem::size_of::<T>();
./src/libcollections/ring_buf.rs: let final_len = usable_cap / 2;
./src/libcollections/vec.rs: let exact = diff / (if size == 0 {1} else {size});
./src/libcollections/vec.rs: let exact = diff / (if size == 0 {1} else {size});
./src/libcollections/binary_heap.rs: let mut n = heap.len() / 2;
./src/libregex/re.rs: pub fn len(&self) -> uint { self.locs.len() / 2 }
./src/libregex/compile.rs: n / 2
./src/libcoretest/num/mod.rs: assert_eq!(ten.div(two), ten / two);
./src/librustc_back/sha2.rs: let take = (left + 1u) / 2u;
./src/libstd/time/mod.rs: return (ticks as u64 * 1000000000) / (ticks_per_s as u64);
./src/libstd/time/mod.rs: time * TIMEBASE.numer as u64 / TIMEBASE.denom as u64
./src/libstd/time/duration.rs: secs: i64::MIN / MILLIS_PER_SEC - 1,
./src/libstd/time/duration.rs: secs: i64::MAX / MILLIS_PER_SEC,
./src/libstd/time/duration.rs: self.num_days() / 7
./src/libstd/time/duration.rs: self.num_seconds() / SECS_PER_DAY
./src/libstd/time/duration.rs: self.num_seconds() / SECS_PER_HOUR
./src/libstd/time/duration.rs: self.num_seconds() / SECS_PER_MINUTE
./src/libstd/time/duration.rs: let nanos_part = self.nanos_mod_sec() / NANOS_PER_MILLI;
./src/libstd/time/duration.rs: let nanos_part = self.nanos_mod_sec() / NANOS_PER_MICRO;
./src/libstd/time/duration.rs: let mut secs = self.secs / rhs as i64;
./src/libstd/time/duration.rs: let extra_nanos = carry * NANOS_PER_SEC as i64 / rhs as i64;
./src/libstd/time/duration.rs: let mut nanos = self.nanos / rhs + extra_nanos as i32;
./src/libstd/time/duration.rs: let days = abs.secs / SECS_PER_DAY;
./src/libstd/time/duration.rs: try!(write!(f, "T{}.{:03}S", secs, abs.nanos / NANOS_PER_MILLI));
./src/libstd/time/duration.rs: try!(write!(f, "T{}.{:06}S", secs, abs.nanos / NANOS_PER_MICRO));
./src/libstd/time/duration.rs: (this / other, this % other)
./src/libstd/time/duration.rs: assert_eq!(Duration::days(i64::MAX / MICROS_PER_DAY).num_microseconds(),
./src/libstd/time/duration.rs: Some(i64::MAX / MICROS_PER_DAY * MICROS_PER_DAY));
./src/libstd/time/duration.rs: assert_eq!(Duration::days(i64::MIN / MICROS_PER_DAY).num_microseconds(),
./src/libstd/time/duration.rs: Some(i64::MIN / MICROS_PER_DAY * MICROS_PER_DAY));
./src/libstd/time/duration.rs: assert_eq!(Duration::days(i64::MAX / MICROS_PER_DAY + 1).num_microseconds(), None);
./src/libstd/time/duration.rs: assert_eq!(Duration::days(i64::MIN / MICROS_PER_DAY - 1).num_microseconds(), None);
./src/libstd/time/duration.rs: assert_eq!(Duration::days(i64::MAX / NANOS_PER_DAY).num_nanoseconds(),
./src/libstd/time/duration.rs: Some(i64::MAX / NANOS_PER_DAY * NANOS_PER_DAY));
./src/libstd/time/duration.rs: assert_eq!(Duration::days(i64::MIN / NANOS_PER_DAY).num_nanoseconds(),
./src/libstd/time/duration.rs: Some(i64::MIN / NANOS_PER_DAY * NANOS_PER_DAY));
./src/libstd/time/duration.rs: assert_eq!(Duration::days(i64::MAX / NANOS_PER_DAY + 1).num_nanoseconds(), None);
./src/libstd/time/duration.rs: assert_eq!(Duration::days(i64::MIN / NANOS_PER_DAY - 1).num_nanoseconds(), None);
./src/libstd/time/duration.rs: assert_eq!(Duration::zero() / i32::MAX, Duration::zero());
./src/libstd/time/duration.rs: assert_eq!(Duration::zero() / i32::MIN, Duration::zero());
./src/libstd/time/duration.rs: assert_eq!(Duration::nanoseconds(123_456_789) / 1, Duration::nanoseconds(123_456_789));
./src/libstd/time/duration.rs: assert_eq!(Duration::nanoseconds(123_456_789) / -1, -Duration::nanoseconds(123_456_789));
./src/libstd/time/duration.rs: assert_eq!(-Duration::nanoseconds(123_456_789) / -1, Duration::nanoseconds(123_456_789));
./src/libstd/time/duration.rs: assert_eq!(-Duration::nanoseconds(123_456_789) / 1, -Duration::nanoseconds(123_456_789));
./src/libstd/time/duration.rs: assert_eq!(Duration::seconds(1) / 3, Duration::nanoseconds(333_333_333));
./src/libstd/time/duration.rs: assert_eq!(Duration::seconds(4) / 3, Duration::nanoseconds(1_333_333_333));
./src/libstd/time/duration.rs: assert_eq!(Duration::seconds(-1) / 2, Duration::milliseconds(-500));
./src/libstd/time/duration.rs: assert_eq!(Duration::seconds(1) / -2, Duration::milliseconds(-500));
./src/libstd/time/duration.rs: assert_eq!(Duration::seconds(-1) / -2, Duration::milliseconds(500));
./src/libstd/time/duration.rs: assert_eq!(Duration::seconds(-4) / 3, Duration::nanoseconds(-1_333_333_333));
./src/libstd/time/duration.rs: assert_eq!(Duration::seconds(-4) / -3, Duration::nanoseconds(1_333_333_333));
./src/libstd/num/strconv.rs: deccum = deccum / radix_gen;
./src/libstd/num/strconv.rs: let neg = num < _0 || (negative_zero && _1 / num == Float::neg_infinity());
./src/libstd/num/strconv.rs: (num / exp_base.powf(exp), num::cast::<T, i32>(exp).unwrap())
./src/libstd/num/strconv.rs: deccum = deccum / radix_gen;
./src/libstd/num/strconv.rs: if extra_digit >= radix / 2 { // -> need to round
./src/libstd/num/mod.rs: assert_eq!(ten.div(two), ten / two);
./src/libstd/num/mod.rs: let third = uint::MAX / 3;
./src/libstd/num/mod.rs: assert!(($T::MAX / 2 + 1).is_power_of_two(), true);
./src/libstd/num/mod.rs: assert!(($T::MAX / 2).checked_next_power_of_two().is_some());
./src/libstd/os.rs: let chunk = MemoryMap::new(size / 2, &[
./src/libstd/os.rs: MapOption::MapOffset(size / 2)
./src/libstd/sys/unix/timer.rs: return (now.tv_sec as u64) * 1000 + (now.tv_usec as u64) / 1000;
./src/libstd/sys/unix/timer.rs: timeout.tv_sec = (tm / 1000) as libc::time_t;
./src/libstd/sys/unix/timer.rs: tv_sec: (ms / 1000) as libc::time_t,
./src/libstd/sys/unix/fs.rs: fn mktime(secs: u64, nsecs: u64) -> u64 { secs * 1000 + nsecs / 1000000 }
./src/libstd/sys/unix/fs.rs: actime: (atime / 1000) as libc::time_t,
./src/libstd/sys/unix/fs.rs: modtime: (mtime / 1000) as libc::time_t,
./src/libstd/sys/unix/mod.rs: tv_sec: (ms / 1000) as libc::time_t,
./src/libstd/sys/unix/c.rs: fds_bits: [i32; (FD_SETSIZE / 32)]
./src/libstd/sys/unix/c.rs: set.fds_bits[(fd / 32) as uint] |= 1 << ((fd % 32) as uint);
./src/libstd/sys/unix/c.rs: fds_bits: [libc::uintptr_t; (FD_SETSIZE / uint::BITS)]
./src/libstd/sys/unix/c.rs: set.fds_bits[fd / uint::BITS] |= 1 << (fd % uint::BITS);
./src/libstd/sys/unix/condvar.rs: tv_sec: (ns / 1000000000) as libc::time_t,
./src/libstd/sys/windows/timer.rs: return (ticks as u64 * 1000) / (ticks_per_s as u64);
./src/libstd/sys/windows/mod.rs: tv_sec: (ms / 1000) as libc::c_long,
./src/libstd/sys/windows/stack_overflow.rs:// get_task_info is called from an exception / signal handler.
./src/libstd/sys/common/stack.rs: record_sp_limit(limit - RED_ZONE / 2);
./src/libstd/collections/hash/map.rs: usable_size * 11 / 10
./src/libstd/collections/hash/map.rs: cap * 10 / 11
./src/libstd/collections/hash/map.rs: for _ in range(0, cap * 3 / 4) {
./src/libstd/collections/hash/map.rs: for _ in range(0, cap / 4) {
./src/libstd/collections/hash/map.rs: for _ in range(0, cap / 2 - 1) {
./src/libstd/collections/hash/map.rs: for _ in range(0, cap / 2 - 1) {
./src/librand/chacha.rs: for _ in range(0, CHACHA_ROUNDS / 2) {
./src/librand/isaac.rs: static MIDPOINT: uint = (RAND_SIZE / 2) as uint;
./src/librand/isaac.rs: for i in range(0, RAND_SIZE_64 / 8).map(|i| i * 8) {
./src/librand/isaac.rs: for i in range(0, RAND_SIZE_64 / 8).map(|i| i * 8) {
./src/librand/isaac.rs: const MIDPOINT: uint = RAND_SIZE_64 / 2;
./src/librand/isaac.rs: for base in range(0, MIDPOINT / 4).map(|i| i * 4) {
./src/librand/distributions/mod.rs: let i = idx + modifier / 2;
./src/librand/distributions/mod.rs: let x = (-1) as uint / 2;
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment