<?xml version="1.0" encoding="UTF-8"?>
<rss xmlns:content="http://purl.org/rss/1.0/modules/content/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#" xmlns:taxo="http://purl.org/rss/1.0/modules/taxonomy/" version="2.0">
  <channel>
    <title>topic Re: Need C++ code for this logic in Operating System - Linux</title>
    <link>https://community.hpe.com/t5/operating-system-linux/need-c-code-for-this-logic/m-p/3880062#M99044</link>
    <description>format remain the same, and its not 1 its 1st, 2nd 3rd... etc.......</description>
    <pubDate>Fri, 13 Oct 2006 22:23:07 GMT</pubDate>
    <dc:creator>Tnameh</dc:creator>
    <dc:date>2006-10-13T22:23:07Z</dc:date>
    <item>
      <title>Need C++ code for this logic</title>
      <link>https://community.hpe.com/t5/operating-system-linux/need-c-code-for-this-logic/m-p/3880059#M99041</link>
      <description>Hello could someone help me in implementing a better logic in C++. I have a file Config, &lt;BR /&gt;To a program i wll pass&lt;BR /&gt;Record=3 Chance=4 it should display me all the 1ST 2ND 3RD  record of chance1 , chance2, Chance3 Chance4.&lt;BR /&gt;&lt;BR /&gt;It is assume that their wll be total 18 rows in each channel and max channel can be 5 . So in all(18.rows*5.channels) are there. And as shown below max Record can be 6 in each chance.&lt;BR /&gt;&lt;BR /&gt;2nd Example&lt;BR /&gt;Record =2 and Chance =3&lt;BR /&gt;Should display record&lt;BR /&gt;1st 2nD of chance1, Chance2 ,Chance3&lt;BR /&gt;&lt;BR /&gt;For Example 1&lt;BR /&gt;Since i have to avoid hard coding,what i have to do is , i wll read record &lt;BR /&gt;1st 2nd 3rd 4th of chance1 and skip all the remmaing records of chance1 .4th 5ht and 6th.&lt;BR /&gt;&lt;BR /&gt;then again i wll put my pointer to 1st Record of Chance2 and wll repeat up&lt;BR /&gt;to record 4rd and skip remmaing record of chance 2 &lt;BR /&gt;&lt;BR /&gt;Repeat this upto chance4.&lt;BR /&gt;&lt;BR /&gt;&lt;BR /&gt;&lt;BR /&gt;&lt;BR /&gt;&lt;BR /&gt;############################3&lt;BR /&gt;1ST:CHANCE1:&lt;BR /&gt;1ST:CHANCE1:&lt;BR /&gt;1ST:CHANCE1:&lt;BR /&gt;2ND:CHANCE1:&lt;BR /&gt;2ND:CHANCE1:&lt;BR /&gt;2ND:CHANCE1:&lt;BR /&gt;3RD:CHANCE1:&lt;BR /&gt;3RD:CHANCE1:&lt;BR /&gt;3RD:CHANCE1:&lt;BR /&gt;4TH:CHANCE1:&lt;BR /&gt;4TH:CHANCE1:&lt;BR /&gt;4TH:CHANCE1:&lt;BR /&gt;5TH:CHANCE1:&lt;BR /&gt;5TH:CHANCE1:&lt;BR /&gt;5TH:CHANCE1:&lt;BR /&gt;6TH:CHANCE1:&lt;BR /&gt;6TH:CHANCE1:&lt;BR /&gt;6TH:CHANCE1:&lt;BR /&gt;1ST:CHANCE2:&lt;BR /&gt;1ST:CHANCE2:&lt;BR /&gt;1ST:CHANCE2:&lt;BR /&gt;2ND:CHANCE2:&lt;BR /&gt;2ND:CHANCE2:&lt;BR /&gt;2ND:CHANCE2:&lt;BR /&gt;3RD:CHANCE2:&lt;BR /&gt;3RD:CHANCE2:&lt;BR /&gt;3RD:CHANCE2:&lt;BR /&gt;4TH:CHANCE2:&lt;BR /&gt;4TH:CHANCE2:&lt;BR /&gt;4TH:CHANCE2:&lt;BR /&gt;5TH:CHANCE2:&lt;BR /&gt;5TH:CHANCE2:&lt;BR /&gt;5TH:CHANCE2:&lt;BR /&gt;6TH:CHANCE2:&lt;BR /&gt;6TH:CHANCE2:&lt;BR /&gt;6TH:CHANCE2:&lt;BR /&gt;1ST:CHANCE3:&lt;BR /&gt;1ST:CHANCE3:&lt;BR /&gt;1ST:CHANCE3:&lt;BR /&gt;2ND:CHANCE3:&lt;BR /&gt;2ND:CHANCE3:&lt;BR /&gt;2ND:CHANCE3:&lt;BR /&gt;3RD:CHANCE3:&lt;BR /&gt;3RD:CHANCE3:&lt;BR /&gt;3RD:CHANCE3:&lt;BR /&gt;4TH:CHANCE3:&lt;BR /&gt;4TH:CHANCE3:&lt;BR /&gt;4TH:CHANCE3:&lt;BR /&gt;5TH:CHANCE3:&lt;BR /&gt;5TH:CHANCE3:&lt;BR /&gt;5TH:CHANCE3:&lt;BR /&gt;6TH:CHANCE3:&lt;BR /&gt;6TH:CHANCE3:&lt;BR /&gt;6ST:CHANCE3:&lt;BR /&gt;1ST:CHANCE4:&lt;BR /&gt;1ST:CHANCE4:&lt;BR /&gt;1ST:CHANCE4:&lt;BR /&gt;2ND:CHANCE4:&lt;BR /&gt;2ND:CHANCE4:&lt;BR /&gt;2ND:CHANCE4:&lt;BR /&gt;3RD:CHANCE4:&lt;BR /&gt;3RD:CHANCE4:&lt;BR /&gt;3RD:CHANCE4:&lt;BR /&gt;4TH:CHANCE4:&lt;BR /&gt;4TH:CHANCE4:&lt;BR /&gt;4TH:CHANCE4:&lt;BR /&gt;5TH:CHANCE4:&lt;BR /&gt;5TH:CHANCE4:&lt;BR /&gt;5TH:CHANCE4:&lt;BR /&gt;6TH:CHANCE4:&lt;BR /&gt;6TH:CHANCE4:&lt;BR /&gt;6TH:CHANCE4:</description>
      <pubDate>Fri, 13 Oct 2006 14:53:47 GMT</pubDate>
      <guid>https://community.hpe.com/t5/operating-system-linux/need-c-code-for-this-logic/m-p/3880059#M99041</guid>
      <dc:creator>Tnameh</dc:creator>
      <dc:date>2006-10-13T14:53:47Z</dc:date>
    </item>
    <item>
      <title>Re: Need C++ code for this logic</title>
      <link>https://community.hpe.com/t5/operating-system-linux/need-c-code-for-this-logic/m-p/3880060#M99042</link>
      <description>Mistake here ,&lt;BR /&gt;&lt;BR /&gt;It is assume that their wll be total 18 rows in each CHANCE and max channel(CHANCE) can be 5 . So in all(18.rows*5CHANCE) are there. And as shown below max Record can be 6 in each chance&lt;BR /&gt;NOT CHANNEL ,its CHANCE</description>
      <pubDate>Fri, 13 Oct 2006 14:58:31 GMT</pubDate>
      <guid>https://community.hpe.com/t5/operating-system-linux/need-c-code-for-this-logic/m-p/3880060#M99042</guid>
      <dc:creator>Tnameh</dc:creator>
      <dc:date>2006-10-13T14:58:31Z</dc:date>
    </item>
    <item>
      <title>Re: Need C++ code for this logic</title>
      <link>https://community.hpe.com/t5/operating-system-linux/need-c-code-for-this-logic/m-p/3880061#M99043</link>
      <description>Is this the exact format of your config file?  You actually use "1ST", instead of numbers?&lt;BR /&gt;&lt;BR /&gt;Also is there a known order of records in the file or do you have to search for them?</description>
      <pubDate>Fri, 13 Oct 2006 16:10:43 GMT</pubDate>
      <guid>https://community.hpe.com/t5/operating-system-linux/need-c-code-for-this-logic/m-p/3880061#M99043</guid>
      <dc:creator>Dennis Handly</dc:creator>
      <dc:date>2006-10-13T16:10:43Z</dc:date>
    </item>
    <item>
      <title>Re: Need C++ code for this logic</title>
      <link>https://community.hpe.com/t5/operating-system-linux/need-c-code-for-this-logic/m-p/3880062#M99044</link>
      <description>format remain the same, and its not 1 its 1st, 2nd 3rd... etc.......</description>
      <pubDate>Fri, 13 Oct 2006 22:23:07 GMT</pubDate>
      <guid>https://community.hpe.com/t5/operating-system-linux/need-c-code-for-this-logic/m-p/3880062#M99044</guid>
      <dc:creator>Tnameh</dc:creator>
      <dc:date>2006-10-13T22:23:07Z</dc:date>
    </item>
    <item>
      <title>Re: Need C++ code for this logic</title>
      <link>https://community.hpe.com/t5/operating-system-linux/need-c-code-for-this-logic/m-p/3880063#M99045</link>
      <description>order is same as its shown, I dont have to search...&lt;BR /&gt;Order of records is  1st(3)  2nd(3row) 3rd(3rows) 4th(3rows)... 6th(3rows)&lt;BR /&gt;so 6*3 =18rows ==1 CHANCE.&lt;BR /&gt;&lt;BR /&gt;Total CHANCE Max is 5 , 5*18 =90 rows</description>
      <pubDate>Fri, 13 Oct 2006 22:35:01 GMT</pubDate>
      <guid>https://community.hpe.com/t5/operating-system-linux/need-c-code-for-this-logic/m-p/3880063#M99045</guid>
      <dc:creator>Tnameh</dc:creator>
      <dc:date>2006-10-13T22:35:01Z</dc:date>
    </item>
    <item>
      <title>Re: Need C++ code for this logic</title>
      <link>https://community.hpe.com/t5/operating-system-linux/need-c-code-for-this-logic/m-p/3880064#M99046</link>
      <description>Attached is a C program that has a triply nested for-loop.  The inner loop always reads and prints 3 lines.  The next loop reads or skips up to 6 groups of those 3.  The outer loop just does Chance iterations.&lt;BR /&gt;&lt;BR /&gt;The program ignores the contents of the records and assumes the format is 5 groups of 6 of 3 lines.&lt;BR /&gt;&lt;BR /&gt;The trivial output is:&lt;BR /&gt;$ a.out Record=1 Chance=2&lt;BR /&gt;Doing 1, 2&lt;BR /&gt;1ST:CHANCE1:&lt;BR /&gt;1ST:CHANCE1:&lt;BR /&gt;1ST:CHANCE1:&lt;BR /&gt;1ST:CHANCE2:&lt;BR /&gt;1ST:CHANCE2:&lt;BR /&gt;1ST:CHANCE2:</description>
      <pubDate>Sat, 14 Oct 2006 00:46:35 GMT</pubDate>
      <guid>https://community.hpe.com/t5/operating-system-linux/need-c-code-for-this-logic/m-p/3880064#M99046</guid>
      <dc:creator>Dennis Handly</dc:creator>
      <dc:date>2006-10-14T00:46:35Z</dc:date>
    </item>
  </channel>
</rss>

