Comments on: PHP ForEach Last Item, Last Loop, Last Iteration

By: Ahmad Shukr

Ahmad Shukr — Tue, 17 Aug 2010 21:49:11 +0000

//much simpler , time less algorithm
$i = 0;
$length = count($arrray) – 1;

foreach($array as $key => $value){
if( $i != $length )
{
echo ‘Woooooooohooo iam not the last’;
}
else
{
echo ‘sadly iam the last one ‘;
}
$i++;
}

By: Scott

Scott — Thu, 21 Jan 2010 04:48:14 +0000

Thanks very much for this code. It didn’t work for me.
I have the following array:
[field_author] => Array ( [0] => Array ( [value] => 529 [view] => Barak Obama )


            [1] => Array

                (

                    [value] => 530

                    [view] => Dmitry Medvedev

                )
            [2] => Array

                (

                    [value] => 531

                    [view] => Gordon Brown

                )

)

…and modified your code as follows:
$last_item = end($node->field_author); $last_item = each($node->field_author); reset($node->field_author); foreach($node->field_author as $key => $value){ // code executed during standard iteration print ($value['view'].', '); if($node->field_author == $last_item['value'] && $key == $last_item['key']){ // code executed on the // last iteration of the foreach loop print $value['view']; } }

I get the following result:
Barak Obama, Dmitry Medvedev, Gordon Brown,

I don’t want the last comma
Any suggestions?
Thanks again,
Scott

PS. What I’d really like to be able to do is account for 1, 2, 3, 4 or more author cases, each having their own link. For example:
Barak Obama
Barak Obama and Dmitry Medvedev
Barak Obama, Dmitry Medvedev and Gordon Brown
Barak Obama, Dmitry Medvedev, Nicolas Sarkozy and Gordon Brown

By: Corey

Corey — Tue, 03 Nov 2009 23:21:14 +0000

If you’re worried about runtime, the worst case scenario for this is O(n). A hash table could be useful if you’re expecting lots of values.

By: Ahmed Gaber

Ahmed Gaber — Sun, 25 Oct 2009 18:32:40 +0000

I’ve spent hours looking for this solution,
nice working solution, but I wonder about the running time with large algorithms

any way,
Nice work

By: anler

anler — Sun, 11 Oct 2009 09:27:57 +0000

great!