Results 1 to 7 of 7

Thread: top5 players in voice commands

  1. #1
    Private First Class
    Join Date
    Feb 2013
    Posts
    201
    Thanks
    4
    Thanked 10 Times in 7 Posts

    top5 players in voice commands

    hello, how can i make 5 top5 players?

    1. Nick
    Rank :
    Exp :

    2....
    3....
    4....
    5....

    i have menu . how make first position?
    Last edited by malyczolg; 29th June 2013 at 19:10.

  2. #2
    Private
    Join Date
    Jan 2013
    Location
    Hungary
    Posts
    113
    Thanks
    10
    Thanked 74 Times in 45 Posts
    Im not sure its possible to place dvars in quickresponse menus. If i'm wrong, then you get all players and sort them according to score, and set the first 5 player's name in cvars. (self setclientcvar("first", player[0].name); )

  3. #3
    Private First Class RobsoN's Avatar
    Join Date
    Jan 2013
    Location
    /home/cod2/
    Posts
    230
    Thanks
    119
    Thanked 95 Times in 64 Posts
    Of course it's possible.

  4. #4
    Assadministrator kung foo man's Avatar
    Join Date
    Jun 2012
    Location
    trailerpark
    Posts
    2,011
    Thanks
    2,102
    Thanked 1,084 Times in 753 Posts
    PHP Code:
    isPlayerAlongerHunterAsB(ab)
    {
        if (
    a.lastTimeOfDeathAsHunter b.lastTimeOfDeathAsHunter)
            return 
    1;
        else
            return 
    0;
    }

    // sample-function for sort()
    a_bigger_b(ab)
    {
        if (
    b)
            return 
    1;
        else
            return 
    0;
    }

    // slow, but works... cba for quicksort now
    sort(elementsisAbiggerB)
    {
        for (
    i=0i<elements.sizei++)
        {
            for (
    j=i+1j<elements.sizej++)
            {
                
    //if (elements[i] < elements[j])
                
    if (
                    ! 
    // big to small...
                    
    [[isAbiggerB]](elements[i], elements[j])
                )
                {
                    
    // swap
                    
    tmp elements[j];
                    
    elements[j] = elements[i];
                    
    elements[i] = tmp;
                }
            }
        }

        return 
    elements;


    Example:
    PHP Code:
        elements = [];
        
    elements[elements.size] = 6;
        
    elements[elements.size] = 3;
        
    elements[elements.size] = 7;
        
    elements[elements.size] = 34;
        
    elements[elements.size] = 2;
        
    elements[elements.size] = 6;
        
    elements[elements.size] = 3;
        
    elements[elements.size] = 5;
        
    elements[elements.size] = 0;
        
    elements[elements.size] = 2;

        
    sorted sort(elements, ::a_bigger_b);

        
    iprintln("sorted.size="+sorted.size);
        for (
    i=0i<elements.sizei++)
            
    iprintln("sorted["+i+"]=" sorted[i]); 
    timescale 0.01

  5. #5
    Private First Class RobsoN's Avatar
    Join Date
    Jan 2013
    Location
    /home/cod2/
    Posts
    230
    Thanks
    119
    Thanked 95 Times in 64 Posts
    And menu dvar file looks something like this:

    PHP Code:
    itemDef
            
    {
                
    name            "window"
                
    group            ingamebox
                visible            1
                rect            16 16 0 0
                origin            ORIGIN_QUICKMESSAGEWINDOW
                forecolor        1 1 1 1
                textfont        UI_FONT_NORMAL
                textscale        .24
                textaligny        8
                dvar            
    "your_dvar_name"
                
    decoration
            


  6. The Following User Says Thank You to RobsoN For This Useful Post:

    guiismiti (7th December 2014)

  7. #6
    Assadministrator IzNoGoD's Avatar
    Join Date
    Aug 2012
    Posts
    1,718
    Thanks
    17
    Thanked 1,068 Times in 674 Posts
    something a bit faster than kung's method:
    PHP Code:
    sort(elementsmax_sort)
    {
        if(
    elements.size max_sort)
            
    max_sort elements.size;
        
    result = [];
        for(
    0max_sorti++)
        {
            
    smallest undefined;
            
    num elements.size 1;
            for(
    0elements.size ij++)
            {
                if(!
    isdefined(smallest) || elements[j] < smallest)
                {
                    
    smallest elements[j];
                    
    num j;
                }
            }
            
    elements[num] = elements[elements.size 1];
            
    elements[elements.size 1] = smallest;
            
    result[result.size] = smallest;
        }
        return 
    result;


  8. The Following User Says Thank You to IzNoGoD For This Useful Post:

    kung foo man (30th June 2013)

  9. #7
    Assadministrator kung foo man's Avatar
    Join Date
    Jun 2012
    Location
    trailerpark
    Posts
    2,011
    Thanks
    2,102
    Thanked 1,084 Times in 753 Posts
    The function signature is incompatible though
    timescale 0.01

Posting Permissions

  • You may not post new threads
  • You may not post replies
  • You may not post attachments
  • You may not edit your posts
  •