Sidnumreringsutmaning

#include <iostream>
#include <cassert>
using namespace std;

enum { 
	LINK_DEFAULT, 
	LINK_FIRST, 
	LINK_LAST, 
	LINK_NEXT, 
	LINK_PREV, 
	LINK_SELECTED 
};

void emitSeparator() { cout << " ... "; }

void emitPageLink(int page, int type = LINK_DEFAULT) 
{ 
	cout << " ";
	
	switch(type) {
		case LINK_DEFAULT: 	
			cout << page;
			break;
		case LINK_FIRST:
			cout << "first";
			break;
		case LINK_LAST:
			cout << "last";
			break;
		case LINK_NEXT:
			cout << "| next";
			break;
		case LINK_PREV:
			cout << "prev |";
			break;
		case LINK_SELECTED:
			cout << "[" << page << "]";
			break;
		default:
			assert(0);
	}
	
	cout << " ";
}

void makePageFooter(int firstPage, int currentPage, int lastPage, int numToWrap, int numAtEnds)
{
	assert(firstPage > 0);
	assert(lastPage >= firstPage);
	assert(currentPage >= firstPage && currentPage <= lastPage);
	assert(numToWrap > 0);
	assert(numAtEnds > 0);

	if (currentPage > firstPage) {
		if ((currentPage - 1) != firstPage) emitPageLink(firstPage, LINK_FIRST);
		emitPageLink(currentPage - 1, LINK_PREV);
	}

	if( (firstPage + numAtEnds - 1) < (currentPage - numToWrap) ) {
		for ( int i = 0; i < numAtEnds; i++ ) emitPageLink(firstPage + i);
		emitSeparator();
	}

	int wrapBegin = max(firstPage, currentPage - numToWrap);
	for(int i = wrapBegin; i < currentPage; i++) emitPageLink(i);	
	emitPageLink(currentPage, LINK_SELECTED);	
	int wrapEnd = min(lastPage, currentPage + numToWrap);	
	for (int i = currentPage + 1; i <= wrapEnd; i++) emitPageLink(i);

	if ( (lastPage - numAtEnds + 1) > (currentPage + numToWrap) ) {
		emitSeparator();
		for ( int i = numAtEnds; i > 0 ; i-- ) emitPageLink(lastPage - i + 1);
	}

	if (currentPage < lastPage) {
		emitPageLink(currentPage + 1, LINK_NEXT);
		if ((currentPage + 1) != lastPage ) emitPageLink(lastPage, LINK_LAST);
	}
}


int main(int argc, char* argv[])
{
	makePageFooter(1, 5, 10, 1, 2);
	return 0;
}

function paginate( $url_start, $url_end, $pages, $page, $padding_ends, $padding_middle ) {
	$str = '<div class="gbpager">';
	$str .= ( $page > 1 ) ? '<a href="' . format_url( $url_start . ( $page - 1 ) . $url_end ) . '">←</a>' : '<span class="nolink">←</span>';
	for( $i = 1; $i <= $pages; $i++ ) {
		if( $i <= $padding_ends || $i > $pages - $padding_ends || ( $i > $page - $padding_middle && $i < $page + $padding_middle ) ) {
			if( $i == $page )
				$str .= '<span class="nolink">' . $i . '</span>';
			else
				$str .= '<a href="' . format_url( $url_start . $i . $url_end ) . '">' . $i . '</a>';
		} else {
			$str .= '.';
		}
	}
	$str = preg_replace( '/(?<=\>)(\.+)((?=\<))/', '...', $str );
	$str .= ( $page < $pages ) ? '<a href="' . format_url( $url_start . ( $page + 1 ) . $url_end ) . '">→</a>' : '<span class="nolink">→</span>';
	$str .= '</div>';
	return $str;
}

paginate( 'index.php?page=', '', $total_amount_of_pages, $current_page, 2, 2 );

def pageNumbering(currPage, numPages):	
	startPage = 1
	endPage = numPages	
	toShowInBeg = 2
	toShowInEnd = 2
	onEachSide = 2

	outstr = ''
		
	leftSide  = currPage-onEachSide
	rightSide = currPage+onEachSide
	
	rightSide +=max(0, startPage-leftSide)
	leftSide -= max(0, rightSide-endPage)

	rightSide = max(currPage, min(endPage, rightSide))
	leftSide = max(startPage, min(currPage, leftSide))
		
	

	lastOfBeg = min(toShowInBeg+1, leftSide)
	for i in range(1, lastOfBeg):				#motsvarar for(i=1;i<lastOfBeg;i++) i C/C++/Java osv
		outstr += str(i) + ' '
	
	if lastOfBeg < leftSide:
		outstr +=  '... '

	for i in range(leftSide, currPage):
		outstr +=  str(i) + ' '

	outstr+= '[' + str(currPage) + '] '
	
	for i in range(currPage+1, rightSide+1):
		outstr += str(i) + ' '
	
	if rightSide < numPages - toShowInEnd:
		outstr +=  '... '
	
	firstOfEnd = max(numPages - toShowInEnd, rightSide) + 1
	for i in range(firstOfEnd, numPages+1):
		outstr += str(i) + ' '

	return outstr[:-1	]  #Ta bort det sista mellanslaget som alltid genererats.