Internal iterators are just syntactic sugar for a higher-order function. As long as Rust has higher-order functions, internal iteration will be possible (just not "the standard way to do things").
Edit: In fact, this is true of any language with higher-order functions. For example, this is how you'd define a Rust-style internal iterator for lists in Racket scheme:
(define (iter l f)
(when (and (pair? l) (f (car l)))
(iter (cdr l) f)))
And how you'd use it: ;; displays elements of the list, up to and including the first one >= 3
(iter '(1 2 3 4) (lambda (x) (display x) (< x 3)))