Creating implementation for idiom 257 : Traverse list backwards

Idiom

# 257 Traverse list backwards

Created by

Lead paragraph

Print each index i and value x from the list items, from the last down to the first.

New implementation

Language

Imports

Code

Documentation URL

Original attribution URL

Online runnable demo

Username

Be concise.

Be useful.

All contributions dictatorially edited by webmasters to match personal tastes.

Please do not paste any copyright violating material.

Please try to avoid dependencies to third-party libraries and frameworks.

Other implementations

#include <cstdio>

int i {items.size()};
while (i--)
    printf("%d %s\n", i, items[i]);

for(int i = items.Count - 1; i >= 0; i--)
{
    Console.WriteLine($"Index = {i}, Item = {items[i]}");
}

Demo

var i = items.length ;
for (var e in items.reversed) {
  i--;
  print("$i, $e");
}

do i=size(items),1,-1
  print *,i,items(i)
end do

import "slices"

for i, x := range slices.Backward(items) {
	fmt.Printf("Item %d = %v \n", i, x)
}

Demo
Doc

import "fmt"

for i := len(items) - 1; i >= 0; i-- {
	x := items[i]
	fmt.Printf("Item %d = %v \n", i, x)
}

Demo

[...items].reverse().forEach((item, index) => 
console.log(Math.abs(index -= items.length), item));

import static java.lang.System.out;

T x;
int i = items.size() - 1;
while (i != -1) {
    x = items.get(i);
    out.printf("%s %s%n", i--, x);
}

import static java.lang.System.out;
import java.util.ListIterator;

ListIterator<X> g
    = items.reversed().listIterator();
X x;
int i, n = items.size() - 1;
while (g.hasNext()) {
    i = g.nextIndex();
    x = g.next();
    out.printf("%s %s%n", n - i, x);
}

for(int i = items.length-1;i>=0;i--){
	System.out.println("Index:"+ i +", Value:" + items[i]); 
}

import static java.lang.System.out;
import static java.util.Collections.reverse;

reverse(items);
int i = items.size() - 1;
for (T x : items)
    out.printf("%s %s%n", i--, x);

import static java.lang.System.out;
import static java.util.stream.IntStream.iterate;

int n = items.size();
iterate(n - 1, x -> x - 1)
    .limit(n)
    .forEach(i -> {
        out.println(i + " " + items.get(i));
    });

for i := items.count-1 downto 0 do writeln(i,' ',items[i]);

for ($i = $#items; $i >= 0; $i--) {
    print "$i $items[$i]\n";
}

Demo

i = len(items)
while i:
    i -= 1
    x = items[i]
    print(i, x)

for i in range(len(items)-1, -1, -1):
    print(i, items[i])

length = len(items)
i = length - 1
for x in reversed(items):
    print(i, x)
    i -= 1

items.each_with_index.reverse_each{|x, i| puts "#{i} #{x}" }

Demo
Doc

  for (i, x) in items.iter().rev().enumerate() {
    println!("{i} = {x}");
  }

Demo

for (i, item) in items.iter().enumerate().rev() {
    println!("{} = {}", i, *item);
}

Demo

(define (reversed-inspect items)
  (foldl (lambda (x i)
          (display (format "~a ~a\n" i x))
          (sub1 i))
         (sub1 (length items))
        (reverse items)))

Preview