Skip to content

Commit 07c8a25

Browse files
committed
Remove unused type aliases
1 parent 4497196 commit 07c8a25

File tree

7 files changed

+2
-23
lines changed

7 files changed

+2
-23
lines changed

src/librustc_borrowck/borrowck/mir/abs_domain.rs

+2-4
Original file line numberDiff line numberDiff line change
@@ -21,13 +21,11 @@
2121
//! `a[x]` would still overlap them both. But that is not this
2222
//! representation does today.)
2323
24-
use rustc::mir::{Lvalue, LvalueElem};
25-
use rustc::mir::{Operand, Projection, ProjectionElem};
24+
use rustc::mir::LvalueElem;
25+
use rustc::mir::{Operand, ProjectionElem};
2626

2727
#[derive(Copy, Clone, PartialEq, Eq, Hash, Debug)]
2828
pub struct AbstractOperand;
29-
pub type AbstractProjection<'tcx> =
30-
Projection<'tcx, Lvalue<'tcx>, AbstractOperand>;
3129
pub type AbstractElem<'tcx> =
3230
ProjectionElem<'tcx, AbstractOperand>;
3331

src/librustc_borrowck/borrowck/mod.rs

-2
Original file line numberDiff line numberDiff line change
@@ -300,8 +300,6 @@ struct BorrowStats {
300300
guaranteed_paths: usize
301301
}
302302

303-
pub type BckResult<'tcx, T> = Result<T, BckError<'tcx>>;
304-
305303
///////////////////////////////////////////////////////////////////////////
306304
// Loans and loan paths
307305

src/librustc_incremental/persist/load.rs

-2
Original file line numberDiff line numberDiff line change
@@ -32,8 +32,6 @@ use super::file_format;
3232

3333
pub type DirtyNodes = FnvHashSet<DepNode<DefPathIndex>>;
3434

35-
type CleanEdges = Vec<(DepNode<DefId>, DepNode<DefId>)>;
36-
3735
/// If we are in incremental mode, and a previous dep-graph exists,
3836
/// then load up those nodes/edges that are still valid into the
3937
/// dep-graph for this session. (This is assumed to be running very

src/librustc_resolve/macros.rs

-3
Original file line numberDiff line numberDiff line change
@@ -12,7 +12,6 @@ use {Module, Resolver};
1212
use build_reduced_graph::BuildReducedGraphVisitor;
1313
use rustc::hir::def_id::{CRATE_DEF_INDEX, DefIndex};
1414
use rustc::hir::map::{self, DefCollector};
15-
use rustc::util::nodemap::FnvHashMap;
1615
use std::cell::Cell;
1716
use std::rc::Rc;
1817
use syntax::ast;
@@ -80,8 +79,6 @@ pub struct LegacyBinding<'a> {
8079
span: Span,
8180
}
8281

83-
pub type LegacyImports = FnvHashMap<ast::Name, (Rc<SyntaxExtension>, Span)>;
84-
8582
impl<'a> base::Resolver for Resolver<'a> {
8683
fn next_node_id(&mut self) -> ast::NodeId {
8784
self.session.next_node_id()

src/librustc_trans/adt.rs

-6
Original file line numberDiff line numberDiff line change
@@ -48,7 +48,6 @@ use std;
4848
use llvm::{ValueRef, True, IntEQ, IntNE};
4949
use rustc::ty::layout;
5050
use rustc::ty::{self, Ty, AdtKind};
51-
use syntax::attr;
5251
use build::*;
5352
use common::*;
5453
use debuginfo::DebugLoc;
@@ -66,8 +65,6 @@ pub enum BranchKind {
6665
Single
6766
}
6867

69-
type Hint = attr::ReprAttr;
70-
7168
#[derive(Copy, Clone)]
7269
pub struct MaybeSizedValue {
7370
pub value: ValueRef,
@@ -119,9 +116,6 @@ fn compute_fields<'a, 'tcx>(cx: &CrateContext<'a, 'tcx>, t: Ty<'tcx>,
119116
}
120117
}
121118

122-
/// This represents the (GEP) indices to follow to get to the discriminant field
123-
pub type DiscrField = Vec<usize>;
124-
125119
/// LLVM-level types are a little complicated.
126120
///
127121
/// C-like enums need to be actual ints, not wrapped in a struct,

src/librustc_typeck/astconv.rs

-2
Original file line numberDiff line numberDiff line change
@@ -171,8 +171,6 @@ struct ConvertedBinding<'tcx> {
171171
span: Span,
172172
}
173173

174-
type TraitAndProjections<'tcx> = (ty::PolyTraitRef<'tcx>, Vec<ty::PolyProjectionPredicate<'tcx>>);
175-
176174
/// Dummy type used for the `Self` of a `TraitRef` created for converting
177175
/// a trait object, and which gets removed in `ExistentialTraitRef`.
178176
/// This type must not appear anywhere in other converted types.

src/libstd/collections/hash/table.rs

-4
Original file line numberDiff line numberDiff line change
@@ -113,10 +113,6 @@ pub struct FullBucket<K, V, M> {
113113
table: M,
114114
}
115115

116-
pub type EmptyBucketImm<'table, K, V> = EmptyBucket<K, V, &'table RawTable<K, V>>;
117-
pub type FullBucketImm<'table, K, V> = FullBucket<K, V, &'table RawTable<K, V>>;
118-
119-
pub type EmptyBucketMut<'table, K, V> = EmptyBucket<K, V, &'table mut RawTable<K, V>>;
120116
pub type FullBucketMut<'table, K, V> = FullBucket<K, V, &'table mut RawTable<K, V>>;
121117

122118
pub enum BucketState<K, V, M> {

0 commit comments

Comments
 (0)