提交 4d6836f4 编写于 作者: A Alex Crichton

Fix privacy fallout from previous change

上级 31ac9c42
......@@ -90,7 +90,7 @@ Reaching the end of the iterator is signalled by returning `None` instead of
# fn main() {}
/// A stream of N zeroes
struct ZeroStream {
priv remaining: uint
remaining: uint
}
impl ZeroStream {
......@@ -305,7 +305,7 @@ The `ZeroStream` from earlier can provide an exact lower and upper bound:
# fn main() {}
/// A stream of N zeroes
struct ZeroStream {
priv remaining: uint
remaining: uint
}
impl ZeroStream {
......
......@@ -148,7 +148,7 @@ fn clone(&self) -> Arc<T> {
****************************************************************************/
#[doc(hidden)]
struct MutexArcInner<T> { priv lock: Mutex, priv failed: bool, priv data: T }
struct MutexArcInner<T> { lock: Mutex, failed: bool, data: T }
/// An Arc with mutable data protected by a blocking mutex.
#[no_freeze]
......@@ -312,7 +312,7 @@ fn new<'a>(flag: &'a mut bool) -> PoisonOnFail {
****************************************************************************/
#[doc(hidden)]
struct RWArcInner<T> { priv lock: RWLock, priv failed: bool, priv data: T }
struct RWArcInner<T> { lock: RWLock, failed: bool, data: T }
/**
* A dual-mode Arc protected by a reader-writer lock. The data can be accessed
* mutably or immutably, and immutably-accessing tasks may run concurrently.
......
......@@ -38,12 +38,12 @@ pub struct DList<T> {
}
type Link<T> = Option<~Node<T>>;
struct Rawlink<T> { priv p: *mut T }
struct Rawlink<T> { p: *mut T }
struct Node<T> {
priv next: Link<T>,
priv prev: Rawlink<Node<T>>,
priv value: T,
next: Link<T>,
prev: Rawlink<Node<T>>,
value: T,
}
/// Double-ended DList iterator
......
......@@ -43,13 +43,13 @@
use std::ptr;
use std::cast;
struct KeyRef<K> { priv k: *K }
struct KeyRef<K> { k: *K }
struct LruEntry<K, V> {
priv key: Option<K>,
priv value: Option<V>,
priv next: *mut LruEntry<K, V>,
priv prev: *mut LruEntry<K, V>,
key: Option<K>,
value: Option<V>,
next: *mut LruEntry<K, V>,
prev: *mut LruEntry<K, V>,
}
/// An LRU Cache.
......
......@@ -709,8 +709,8 @@ pub struct Barrier {
// The inner state of a double barrier
struct BarrierState {
priv count: uint,
priv generation_id: uint,
count: uint,
generation_id: uint,
}
impl Barrier {
......
......@@ -257,7 +257,7 @@ pub enum AutoRef {
/// The data structure to keep track of all the information that typechecker
/// generates so that so that it can be reused and doesn't have to be redone
/// later on.
struct ctxt_ {
pub struct ctxt_ {
diag: @syntax::diagnostic::SpanHandler,
interner: RefCell<HashMap<intern_key, ~t_box_>>,
next_id: Cell<uint>,
......
......@@ -109,8 +109,8 @@ trait FixedBuffer {
/// A FixedBuffer of 64 bytes useful for implementing Sha256 which has a 64 byte blocksize.
struct FixedBuffer64 {
priv buffer: [u8, ..64],
priv buffer_idx: uint,
buffer: [u8, ..64],
buffer_idx: uint,
}
impl FixedBuffer64 {
......
......@@ -78,8 +78,8 @@ fn prefixes(p: &Path) -> Prefixes {
}
struct Prefixes {
priv components: ~[~str],
priv remaining: ~[~str]
components: ~[~str],
remaining: ~[~str]
}
impl Iterator<(Path, Path)> for Prefixes {
......
......@@ -126,7 +126,7 @@ fn fire_homing_missile(&mut self) -> HomingMissile {
/// task back to its appropriate home (if applicable). The field is used to
/// assert that we are where we think we are.
struct HomingMissile {
priv io_home: uint,
io_home: uint,
}
impl HomingMissile {
......
......@@ -95,7 +95,7 @@ pub struct Handle<'port, T> {
priv port: &'port mut Port<T>,
}
struct Packets { priv cur: *mut Packet }
struct Packets { cur: *mut Packet }
impl Select {
/// Creates a new selection structure. This set is initially empty and
......
......@@ -122,7 +122,7 @@ struct PathSegmentAndBoundSet {
}
/// A path paired with optional type bounds.
struct PathAndBounds {
pub struct PathAndBounds {
path: ast::Path,
bounds: Option<OptVec<TyParamBound>>,
}
......
......@@ -13,7 +13,7 @@
// part of issue-6919.rs
struct C<'a> {
k: 'a ||,
pub k: 'a ||,
}
fn no_op() { }
......
......@@ -18,8 +18,8 @@ fn iterate<'a, T>(x: T, f: 'a |&T| -> T) -> Iterate<'a, T> {
Iterate {f: f, next: x}
}
struct Iterate<'a, T> {
priv f: 'a |&T| -> T,
priv next: T
f: 'a |&T| -> T,
next: T
}
impl<'a, T> Iterator<T> for Iterate<'a, T> {
fn next(&mut self) -> Option<T> {
......@@ -35,7 +35,7 @@ enum List<'a, T> {
Cons(T, &'a List<'a, T>)
}
struct ListIterator<'a, T> {
priv cur: &'a List<'a, T>
cur: &'a List<'a, T>
}
impl<'a, T> List<'a, T> {
fn iter(&'a self) -> ListIterator<'a, T> {
......
......@@ -20,7 +20,7 @@
struct Foo {
a: int,
priv b: int,
b: int,
}
pub struct PubFoo { //~ ERROR: missing documentation
......@@ -99,7 +99,7 @@ pub fn baz() {}
enum Baz {
BazA {
a: int,
priv b: int
b: int
},
BarB
}
......
......@@ -9,7 +9,7 @@
// except according to those terms.
struct cat {
priv meows : uint,
meows : uint,
how_hungry : int,
}
......
......@@ -9,7 +9,7 @@
// except according to those terms.
struct cat {
priv meows : uint,
meows : uint,
how_hungry : int,
}
......
......@@ -8,8 +8,8 @@
// option. This file may not be copied, modified, or distributed
// except according to those terms.
struct A { pub i: int } //~ ERROR: unnecessary `pub`
struct B { priv i: int } // don't warn b/c B can still be returned
struct A { pub i: int }
struct B { priv i: int } //~ ERROR: unnecessary `priv`
pub enum C { pub Variant } //~ ERROR: unnecessary `pub`
enum D { priv Variant2 } //~ ERROR: unnecessary `priv`
......
......@@ -15,7 +15,7 @@ trait noisy {
}
struct dog {
priv barks: uint,
barks: uint,
volume: int,
}
......@@ -50,7 +50,7 @@ fn dog() -> dog {
#[deriving(Clone)]
struct cat {
priv meows: uint,
meows: uint,
how_hungry: int,
name: ~str,
......
......@@ -15,7 +15,7 @@ trait noisy {
}
struct cat {
priv meows: uint,
meows: uint,
how_hungry: int,
name: ~str,
}
......
......@@ -27,7 +27,7 @@ fn ne(&self, other: &cat_type) -> bool { !(*self).eq(other) }
// ok: T should be in scope when resolving the trait ref for map
struct cat<T> {
// Yes, you can have negative meows
priv meows : int,
meows : int,
how_hungry : int,
name : T,
......
......@@ -14,7 +14,7 @@
use cci_class_trait::animals::noisy;
struct cat {
priv meows: uint,
meows: uint,
how_hungry : int,
name : ~str,
......
......@@ -16,7 +16,7 @@ trait noisy {
#[deriving(Clone)]
struct cat {
priv meows : uint,
meows : uint,
how_hungry : int,
name : ~str,
......
......@@ -9,7 +9,7 @@
// except according to those terms.
struct cat {
priv meows : uint,
meows : uint,
how_hungry : int,
}
......
......@@ -9,8 +9,8 @@
// except according to those terms.
struct cat<U> {
priv info : ~[U],
priv meows : uint,
info : ~[U],
meows : uint,
how_hungry : int,
}
......
......@@ -12,7 +12,7 @@
// xfail-fast
struct cat {
priv meows : uint,
meows : uint,
how_hungry : int,
name : ~str,
......
......@@ -9,7 +9,7 @@
// except according to those terms.
struct cat<U> {
priv meows : uint,
meows : uint,
how_hungry : int,
}
......
......@@ -9,7 +9,7 @@
// except according to those terms.
struct cat {
priv meows : uint,
meows : uint,
how_hungry : int,
}
......
......@@ -9,7 +9,7 @@
// except according to those terms.
struct cat {
priv meows : uint,
meows : uint,
how_hungry : int,
}
......
......@@ -9,7 +9,7 @@
// except according to those terms.
struct cat {
priv meows : uint,
meows : uint,
how_hungry : int,
name : ~str,
......
......@@ -47,8 +47,8 @@ struct Rect {
struct AsciiArt {
width: uint,
height: uint,
priv fill: char,
priv lines: ~[~[char]],
fill: char,
lines: ~[~[char]],
// This struct can be quite large so we'll disable copying: developers need
// to either pass these structs around via references or move them.
......
......@@ -9,7 +9,7 @@
// except according to those terms.
struct cat {
priv meows : uint,
meows : uint,
how_hungry : int,
}
......
......@@ -9,7 +9,7 @@
// except according to those terms.
struct cat {
priv meows : uint,
meows : uint,
how_hungry : int,
}
......
Markdown is supported
0% .
You are about to add 0 people to the discussion. Proceed with caution.
先完成此消息的编辑!
想要评论请 注册