Help understanding multidimensional arrays, ...?

Quoting donjames

Disliked

Thanks Royce, I'll look over your code to get an idea of what I could do.

One question - since the ticket# is an integer, is there any way to use it as the index value in an array, or does each array index have to start with 0 and be sequential? - If so, it could potentially store the price and the ticket in one array... Just a thought.

Ignored

Quoting donjames

Disliked

int MAXTICKETS=20;

//declare a module wide array of 20 integers that we'll used to store and sort tickets

int tickets[MAXTICKETS];

I get an error saying "MAXTICKETS: integer number expected" Can you only use a variable if it's a definition?

Ignored

[indent]void AcquireTickets(int MagicNumber, int MaxTickets) {
   int ticket_count = 0;
   //Erase the array of tickets and re-load based on our filters
   int tickets[];
   ArrayInitialize(tickets, -1);
   for(int idx=OrdersTotal()-1; idx >= 0; idx--) {
      if (OrderSelect(idx, SELECT_BY_POS, MODE_TRADES)) {
         if (OrderMagicNumber()==MagicNumber) { 
            tickets[ticket_count] = OrderTicket();
            ticket_count++;
            if (ticket_count == MaxTickets) break;  //the array is full!
         }
      }
   }
   return tickets;
}

 
extern int SlippageAmt = 3;
extern string TrendType = "B";
extern int TrendMagicNumber = 111111;
extern int MaxTrendOrders = 5;
int Ticket;
//DECLARE ARRAYS & ASSOCIATED VARIABLES
int TrendTickets[];
int tickets[];
int MagicNumber;
int MaxTickets;
int ticket_count = 0;
double TrendTicketPrice[];
int TrendTicketNumber[];
 
//+------------------------------------------------------------------+
//| expert initialization function                                   |
//+------------------------------------------------------------------+
int init()
  {
//---- 
   // RESIZE TICKET ARRAYS BASED ON MAX ORDERS ALLOWED
      ArrayResize(TrendTickets, MaxTrendOrders);
      ArrayResize(tickets, MaxTrendOrders);
      ArrayResize(TrendTicketPrice, MaxTrendOrders);
//----
   return(0);
  }
//+------------------------------------------------------------------+
//| expert deinitialization function                                 |
//+------------------------------------------------------------------+
int deinit()
  {
//---- 
 
//----
   return(0);
  }
 
 
//**** FUNCTIONS
   //This function scans all orders with the given MagicNumber and returns the array tickets
   int AcquireTickets(int& tickets[]) {
      ticket_count = 0;
      //Erase the array of tickets and re-load based on our filters
      ArrayInitialize(tickets, -1);
      for(int idx=OrdersTotal()-1; idx >= 0; idx--)
      {
         if (OrderSelect(idx, SELECT_BY_POS, MODE_TRADES))
         {
            if (OrderMagicNumber()==MagicNumber) { 
               tickets[ticket_count] = OrderTicket();
               ticket_count++;
               if (ticket_count == MaxTickets) break;  //the array is full!
            }
 
         }
      }
      return (tickets);
   }  // END FUNCTION
 
   // ****** SORT TICKETS BY ASCENDING PRICE FUNCTION
   double SortTicketsByPrice(int& tickets[]) 
   {
 
      bool finished = false;
      int idx;
      int ooo_ticket;
      datetime openA, openB;
 
      //keep looping until we can't find any tickets out of order
      while(finished == false)
      {
         //limited scope variable. doesn't exist outside while loop and is re-init each loop
         bool found_out_of_order = false;
 
         //loop over the tickets array up to the next to last element or the first -1
         for(idx=0; idx < (MaxTickets - 1); idx++)
         {
            //look for -1's and assume we've reached the end of good data in the array      
            if (tickets[idx] == -1 || tickets[idx + 1] == -1) break;
 
            //collect the open prices for the current ticket in the array and the next one
            OrderSelect(tickets[idx], SELECT_BY_TICKET, MODE_TRADES);
            openA = OrderOpenPrice();
            OrderSelect(tickets[idx + 1], SELECT_BY_TICKET, MODE_TRADES);
            openB = OrderOpenPrice();
 
            //determine if the tickets are out of order
            if (openA > openB) {
               //swap the ticket numbers
               ooo_ticket = tickets[idx];
               tickets[idx] = tickets[idx+1];
               tickets[idx+1] = ooo_ticket;
               found_out_of_order = true;
            }
         }  // END FOR STATEMENT
 
         //If we made it though the entire array with out finding any thing that is
         //out of order then we can delcare ourselves finished sorting.
         if (found_out_of_order == false) finished = true;    
      }  // END WHILE STATEMENT
      return (tickets);
   }  // END FUNCTION
 
 
 
//+------------------------------------------------------------------+
//| expert start function                                            |
//+------------------------------------------------------------------+
int start()
  {
//---- 
 
// PLACE 5 TEST ORDERS 
   if(OrdersTotal()<5) {
      Ticket=OrderSend(Symbol(),OP_BUY,1,Ask,SlippageAmt,0,0,"Test",TrendMagicNumber,0,Green);
   }
 
// CHECK IF FUNCTIONS TO GET TICKETS AND SORT THEM ARE WORKING 
 
   AscendingOrder = true;
   MagicNumber = TrendMagicNumber;
   MaxTickets = MaxTrendOrders;
   AcquireTickets(TrendTickets);
   SortTicketsByPrice(TrendTickets); // SORT IN ASCENDING PRICE
 
   // GET OPEN ORDER PRICES FOR TICKETS:
 
      for(int i=0; i<ArraySize(TrendTickets); i++) {
         OrderSelect(TrendTickets[i], SELECT_BY_TICKET, MODE_TRADES);
         TrendTicketPrice[i] = OrderOpenPrice();
      }
 
 
   Comment("TEST TICKET FUNCTIONS: ",Symbol(),"\n",
           "TrendTickets[0] = ", TrendTickets[0], "   Price[0] = ", TrendTicketPrice[0],"\n",
           "TrendTickets[1] = ", TrendTickets[1], "   Price[1] = ", TrendTicketPrice[1],"\n",
           "TrendTickets[2] = ", TrendTickets[2], "   Price[2] = ", TrendTicketPrice[2],"\n",
           "TrendTickets[3] = ", TrendTickets[3], "   Price[3] = ", TrendTicketPrice[3],"\n",
           "TrendTickets[4] = ", TrendTickets[4], "   Price[4] = ", TrendTicketPrice[4]);
//----
   return(0);
  }
 
//+------------------------------------------------------------------+