Strategy pattern: differenze tra le versioni

Versione delle 17:13, 27 ott 2012

Versione delle 11:56, 29 ott 2012

Riga 14:

== Esempio ==

{{...}}

//classe concreta

class Document

{

private string title;

private string codice;

public Document(string title, string codice)

{

this.title = title;

this.codice = codice;

}

public string Title

{

get { return title; }

}

public string Codice

{

get { return codice; }

}

}

//Contesto

class SortedDocumentList

Line 64 ⟶ 45:

}

Console.WriteLine();

}

}

//classe concreta

class Document

{

private string title;

private string codice;

public Document(string title, string codice)

{

this.title = title;

this.codice = codice;

}

public string Title

{

get { return title; }

}

public string Codice

{

get { return codice; }

}

}

Line 86 ⟶ 89:

private void Sort(List<Document> list, int left, int right)

{

int//ordinamento lholdda = left;implementare

int rhold = right;

// Use a random pivot

Random random = new Random();

int pivot = random.Next(left, right);

Swap(list, pivot, left);

pivot = left;

left++;

while (right >= left)

{

int compareleft = list[left].Title.CompareTo(list[pivot].Title);

int compareright = list[right].Title.CompareTo(list[pivot].Title);

if ((compareleft >= 0) && (compareright < 0))

{

Swap(list, left, right);

}

else

{

if (compareleft >= 0)

{

right--;

}

else

{

if (compareright < 0)

{

left++;

}

else

{

right--;

left++;

}

}

}

}

Swap(list, pivot, right);

pivot = right;

if (pivot > lhold) Sort(list, lhold, pivot);

if (rhold > pivot + 1) Sort(list, pivot + 1, rhold);

}

// Swap helper function

private void Swap(List<Document> list, int left, int right)

{

Document temp = list[right];

list[right] = list[left];

list[left] = temp;

}

}