Base64 algorithm logic in TOOL Code

Has anybody out there written a base64 algorithm logic in TOOL code and are
willing to share some code?

Hi Smitha,
Go to SPRO>Logistics Execution> Direct Store Delivery.
Where it has to be configured and the configuration guide is available in the below link:
http://help.sap.com/bp_bblibrary/500/BBlibrary_start.htm
after going to this link take Wholesale Distribution and Country as US. Then take the building block G70 & G76
Hope it will be useful and if so mention.
Regards,
Elanchezhian. K.C.

Similar Messages

FW: (forte-users) base64 algorithm logic in TOOLCode

Thank you to everybody for your response but I think this something that
needs to be shared with everybody.
THANK YOU IAN!!! The HttpSupport library worked great.
Just to give you some background on my problem was that we were using ui4 c
type in our implementation of base64 logic and
it was not working in compiled partition on Sun OS but worked on
non-compiled partition. That was the reason why I made a request for some
code sample. Thank you everybody again and use the HttpSupport library for
base64 logic.
ka
-----Original Message-----
From: Ian Chalmers [mailto:[email protected]]
Sent: Tuesday, May 15, 2001 1:37 PM
To: Amin, Kamran
Subject: RE: (forte-users) base64 algorithm logic in TOOL Code
Hi Amin,
You could try the HTTPSupport.HTTPBaseMesssage class:
DecodeBase64 Decodes an encodedText parameter using the Base64 encoding
algorithm.
EncodeBase64 Encodes a plaintext parameter using the Base64 encoding
algorithm
You will need Forte version 3.0.N.0 or later as there was a bug
(52887)
which was fixed in in 3N0
Regards
Ian
~~~~~~~~~~~~~~~~~~~~~
Ian Chalmers
iPlanet 4GL/iIS SQA
Sun Microsystems Ltd
-----Original Message-----
From: Amin, Kamran [mailto:[email protected]]
Sent: 15 May 2001 18:00
To: 'Forte User Group'
Subject: (forte-users) base64 algorithm logic in TOOL Code
Has anybody out there written a base64 algorithm logic in TOOL
code and are
willing to share some code?
For the archives, go to: http://lists.xpedior.com/forte-users and use
the login: forte and the password: archive. To unsubscribe, send in a new
email the word: 'Unsubscribe' to: [email protected]

Thank you to everybody for your response but I think this something that
needs to be shared with everybody.
THANK YOU IAN!!! The HttpSupport library worked great.
Just to give you some background on my problem was that we were using ui4 c
type in our implementation of base64 logic and
it was not working in compiled partition on Sun OS but worked on
non-compiled partition. That was the reason why I made a request for some
code sample. Thank you everybody again and use the HttpSupport library for
base64 logic.
ka
-----Original Message-----
From: Ian Chalmers [mailto:[email protected]]
Sent: Tuesday, May 15, 2001 1:37 PM
To: Amin, Kamran
Subject: RE: (forte-users) base64 algorithm logic in TOOL Code
Hi Amin,
You could try the HTTPSupport.HTTPBaseMesssage class:
DecodeBase64 Decodes an encodedText parameter using the Base64 encoding
algorithm.
EncodeBase64 Encodes a plaintext parameter using the Base64 encoding
algorithm
You will need Forte version 3.0.N.0 or later as there was a bug
(52887)
which was fixed in in 3N0
Regards
Ian
~~~~~~~~~~~~~~~~~~~~~
Ian Chalmers
iPlanet 4GL/iIS SQA
Sun Microsystems Ltd
-----Original Message-----
From: Amin, Kamran [mailto:[email protected]]
Sent: 15 May 2001 18:00
To: 'Forte User Group'
Subject: (forte-users) base64 algorithm logic in TOOL Code
Has anybody out there written a base64 algorithm logic in TOOL
code and are
willing to share some code?
For the archives, go to: http://lists.xpedior.com/forte-users and use
the login: forte and the password: archive. To unsubscribe, send in a new
email the word: 'Unsubscribe' to: [email protected]

SQL functions in TOOL code

In my original email I should have made the point clear that an indexed
column was required, that led to some confusion, apologies.
Under Oracle 7 even if the column is indexed the query engine still does a
full scan of the index to find the maximum or minimum value. As strange as
this seems it is possible to view it using the Oracle trace functions such
as tkprof. This method is quicker than not having an index but the cursor
method is far more efficient.
When using a cursor based approach Oracle will go straight to the first
record of the index (depending on MAX or MIN) and retrieve the data. By
exiting at that point the function has been performed and the I/O operations
are extremely low compared to a full index scan.
Of course there is a trade off depending on the amount of rows but for large
indexed tables the cursor approach will be far faster than the normal
functions. I'm not sure how other RDBMS's handle MAX/MIN but this has been
my experience with Oracle. This process may be faster still by using PL/SQL
but then you are incorporating specific database languages which is
obviously a problem if you port to a different RDBMS. Here is some code you
can try for Oracle PL/SQL functions:
declare
cursor myCur1 is
select number_field
from number_table
order by number_field desc;
begin
open myCur1;
fetch myCur1 into :max_val;
close myCur1;
end;
I hope this clarifies things a bit more. If in doubt of the execution plan
of a performance critical query use the database trace functions as they
show up all sorts of surprises. MAX and MIN are easy to understand when
viewing code but perform poorly under Oracle, whether v8 behaves differently
I have yet to discover.
Cheers,
Dylan.
-----Original Message-----
From: [email protected] [mailto:[email protected]]
Sent: Thursday, 7 January 1999 3:37
To: [email protected]
Subject: RE: SQL functions in TOOL code
I guess my point is that MAX can always be implemented more
efficiently than the SORT/ORDER-BY approach (but may not be the
case, depending on the RDBMS). If an ORDER-BY
can use an index (which means that the indexing mechanism involves
a sorted collection rather than an unordered hashtable) so can
MAX - in which case finding a MAX value could be implemented
in either O(1) or O(logn) time, depending on the implementation.
The last sentence being the major point of this whole discussion,
which is that your mileage may vary depending on the RDBMS - so
try using both approaches if performance is a problem.
In terms of maintenance, MAX is the much more intuitive approach
(In My Opinion, of course), since a programmer can tell right away
what the code is attempting to do.
Chad Stansbury
BORN Information Services, Inc.
-----Original Message-----
From: [email protected]
To: [email protected]; [email protected]; [email protected]
Sent: 1/6/99 10:45 AM
Subject: RE: SQL functions in TOOL code
Well, yes, but in that specific case (looking for max() value) would not
be
true that, if you have an index (and only then) on that specific column
some
databases (like Oracle) will be smart enough to use index and find max
value
without full table scan and without using order by clause?
Dariusz Rakowicz
Consultant
BORN Information Services (http://www.born.com)
8101 E. Prentice Ave, Suite 310
Englewood, CO 80111
303-846-8273
[email protected]
-----Original Message-----
From: Sycamore [SMTP:[email protected]]
Sent: Wednesday, January 06, 1999 10:29 AM
To: [email protected]; [email protected]
Subject: Re: SQL functions in TOOL code
If (and only if) an index exists on the exact columns in the ORDER BY
clause, some databases are smart enough to traverse the index (inforward
or
reverse order) instead of doing a table scan followed by a sort.
If there is no appropriate index, you always end up with some kind ofsort
step.
Of course this is all highly schema- and database-dependent, so youmust
weigh those factors when deciding to exploit this behavior.
Kevin Klein
Sycamore Group, LLC
Milwaukee
-----Original Message-----
From: [email protected] <[email protected]>
To: [email protected] <[email protected]>
Date: Wednesday, January 06, 1999 9:40 AM
Subject: RE: SQL functions in TOOL code
This seems a bit counter-intuitive to me... primarily due to
the fact that both MAX and ORDER-BY functionality would require
a full table scan on the given column... no? However, I would
think that a MAX can be implemented more efficiently since it
just requires the max value in a given set (which can be performed
in O(n) time on an unordered set) versus an ORDER-BY (sort)
performance on an unordered set of at best O(nlogn) time.
Am I missing something? Please set me straight on this 'un.
Chad Stansbury
BORN Information Services, Inc.
-----Original Message-----
From: Jones, Dylan
To: 'Vuong, Van'
Cc: [email protected]
Sent: 1/5/99 4:42 PM
Subject: RE: SQL functions in TOOL code
Hi Van,
Operating a function such as MAX or MIN is possible as given in your
example
but it is worth pointing out the performance overhead with such a
method.
When you use MAX, Oracle will do a full table scan of the column so
if
you
have a great many rows it is very inefficient.
In this case use a cursor based approach and depending on your
requirments
(MAX/MIN) use a descending or ascending ORDER BY clause.
eg.
begin transaction
for ( aDate : SomeDateDomain ) in
sql select DATE_FIELD
from DATE_TABLE
order by
DATE_FIELD DESC
on session MySessionSO
do
found = TRUE;
aLatestDate.SetValue(aDate);
// Only bother about the first record
exit;
end for;
end transaction;
On very large tables the performance increases with the above method
will be
considerable so it is worth considering which method to use whensizing
your
database and writing your code.
Cheers,
Dylan.
-----Original Message-----
From: Vuong, Van [mailto:[email protected]]
Sent: Tuesday, 5 January 1999 6:50
To: [email protected]
Subject: SQL functions in TOOL code
Is it possible to execute a SQL function from TOOL code?
For example:
SQL SELECT Max(Version) INTO :MyVersion
FROM Template_Design
WHERE Template_Name = :TemplateName
ON SESSION MySession;
The function in this example is MAX().
I am connected to an Oracle database.
Thanks,
Van Vuong
To unsubscribe, email '[email protected]' with
'unsubscribe forte-users' as the body of the message.
Searchable thread archive<URL:http://pinehurst.sageit.com/listarchive/>
To unsubscribe, email '[email protected]' with
'unsubscribe forte-users' as the body of the message.
Searchable thread archive<URL:http://pinehurst.sageit.com/listarchive/>
>
To unsubscribe, email '[email protected]' with
'unsubscribe forte-users' as the body of the message.
Searchable thread archive<URL:http://pinehurst.sageit.com/listarchive/>
To unsubscribe, email '[email protected]' with
'unsubscribe forte-users' as the body of the message.
Searchable thread archive <URL:http://pinehurst.sageit.com/listarchive/>
To unsubscribe, email '[email protected]' with
'unsubscribe forte-users' as the body of the message.
Searchable thread archive <URL:http://pinehurst.sageit.com/listarchive/>
To unsubscribe, email '[email protected]' with
'unsubscribe forte-users' as the body of the message.
Searchable thread archive <URL:http://pinehurst.sageit.com/listarchive/>

Simple logic for the code

HI All,
      Please expalin the logic behind the code and how can we put it simpler this logic by reducing the number of lines of the following logic
FORM fisical_period.
data : l_start_month like v_start_month,
         l_end_month like v_end_month.
data: l_current_year like t009b-bdatj,
            l_variant like t009-periv.
      call function 'CCODE_GET_FISCAL_YEAR_VARIANT'
        EXPORTING
          company_code           = p_bukrs
        IMPORTING
          fiscal_year_variant    = l_variant
        EXCEPTIONS
          company_code_not_found = 1
          others                 = 2.
      if sy-subrc <> 0.
        message i368(00) with 'Unable to get Fiscal year'.
      endif.
      l_current_year = sy-datum(4).
      call function 'FIRST_AND_LAST_DAY_IN_YEAR_GET'
        EXPORTING
          i_gjahr        = l_current_year
          i_periv        = l_variant
        IMPORTING
          e_first_day    = p_fiscal-low
          e_last_day     = p_fiscal-high
        EXCEPTIONS
          input_false    = 1
          t009_notfound = 2
          t009b_notfound = 3
          others         = 4.
      if sy-subrc <> 0.
        message i368(00) with 'Unable to get the first and last day'.
      endif.
      if sy-datum < p_fiscal-low.
        p_fiscal-low = p_fiscal-low - 365.
        p_fiscal-high = p_fiscal-high - 365.
      endif.
      append p_fiscal.
      v_start_month = p_fiscal-low+4(2).
      v_end_month   = p_fiscal-high+4(2).
      if v_start_month >= 01 and v_start_month <= 03.
        move 01 to fiscal_quarter_1-month.
        append fiscal_quarter_1.
        move 02 to fiscal_quarter_1-month.
        append fiscal_quarter_1.
        move 03 to fiscal_quarter_1-month.
        append fiscal_quarter_1.
        move 04 to fiscal_quarter_2-month.
        append fiscal_quarter_2.
        move 05 to fiscal_quarter_2-month.
        append fiscal_quarter_2.
        move 06 to fiscal_quarter_2-month.
        append fiscal_quarter_2.
        move 07 to fiscal_quarter_3-month.
        append fiscal_quarter_3.
        move 08 to fiscal_quarter_3-month.
        append fiscal_quarter_3.
        move 09 to fiscal_quarter_3-month.
        append fiscal_quarter_3.
        move 10 to fiscal_quarter_4-month.
        append fiscal_quarter_4.
        move 11 to fiscal_quarter_4-month.
        append fiscal_quarter_4.
        move 12 to fiscal_quarter_4-month.
        append fiscal_quarter_4.
      elseif v_start_month >= 04 and v_start_month <= 06.
        move 04 to fiscal_quarter_1-month.
        append fiscal_quarter_1.
        move 05 to fiscal_quarter_1-month.
        append fiscal_quarter_1.
        move 06 to fiscal_quarter_1-month.
        append fiscal_quarter_1.
        move 07 to fiscal_quarter_2-month.
        append fiscal_quarter_2.
        move 08 to fiscal_quarter_2-month.
        append fiscal_quarter_2.
        move 09 to fiscal_quarter_2-month.
        append fiscal_quarter_2.
        move 10 to fiscal_quarter_3-month.
        append fiscal_quarter_3.
        move 11 to fiscal_quarter_3-month.
        append fiscal_quarter_3.
        move 12 to fiscal_quarter_3-month.
        append fiscal_quarter_3.
        move 01 to fiscal_quarter_4-month.
        append fiscal_quarter_4.
        move 02 to fiscal_quarter_4-month.
        append fiscal_quarter_4.
        move 03 to fiscal_quarter_4-month.
        append fiscal_quarter_4.
      elseif v_start_month >= 07 and v_start_month <= 09.
        move 07 to fiscal_quarter_1-month.
        append fiscal_quarter_1.
        move 08 to fiscal_quarter_1-month.
        append fiscal_quarter_1.
        move 09 to fiscal_quarter_1-month.
        append fiscal_quarter_1.
        move 10 to fiscal_quarter_2-month.
        append fiscal_quarter_2.
        move 11 to fiscal_quarter_2-month.
        append fiscal_quarter_2.
        move 12 to fiscal_quarter_2-month.
        append fiscal_quarter_2.
        move 01 to fiscal_quarter_3-month.
        append fiscal_quarter_3.
        move 02 to fiscal_quarter_3-month.
        append fiscal_quarter_3.
        move 03 to fiscal_quarter_3-month.
        append fiscal_quarter_3.
        move 04 to fiscal_quarter_4-month.
        append fiscal_quarter_4.
        move 05 to fiscal_quarter_4-month.
        append fiscal_quarter_4.
        move 06 to fiscal_quarter_4-month.
        append fiscal_quarter_4.
      else.
        move 10 to fiscal_quarter_1-month.
        append fiscal_quarter_1.
        move 11 to fiscal_quarter_1-month.
        append fiscal_quarter_1.
        move 12 to fiscal_quarter_1-month.
        append fiscal_quarter_1.
        move 01 to fiscal_quarter_2-month.
        append fiscal_quarter_2.
        move 02 to fiscal_quarter_2-month.
        append fiscal_quarter_2.
        move 03 to fiscal_quarter_2-month.
        append fiscal_quarter_2.
        move 04 to fiscal_quarter_3-month.
        append fiscal_quarter_3.
        move 05 to fiscal_quarter_3-month.
        append fiscal_quarter_3.
        move 06 to fiscal_quarter_3-month.
        append fiscal_quarter_3.
        move 07 to fiscal_quarter_4-month.
        append fiscal_quarter_4.
        move 08 to fiscal_quarter_4-month.
        append fiscal_quarter_4.
        move 09 to fiscal_quarter_4-month.
        append fiscal_quarter_4.
      endif.
      IF NOT p_fiscal IS INITIAL.
        perform get_fiscal_year.
      ENDIF.
      IF NOT p_fiscal IS INITIAL.
        v_start_year = p_fiscal-low+2(2).
        v_end_year = p_fiscal-high+2(2).
        v_start_year = r_gfiscal-low+2(2).
        v_end_year = r_gfiscal-high+2(2).
        v_start_month = r_gfiscal-low+4(2).
        v_end_month = r_gfiscal-high+4(2).
        move 'Jan' to i_months-month.
        append i_months.
        move 'Feb' to i_months-month.
        append i_months.
        move 'Mar' to i_months-month.
        append i_months.
        move 'Apr' to i_months-month.
        append i_months.
        move 'May' to i_months-month.
        append i_months.
        move 'Jun' to i_months-month.
        append i_months.
        move 'Jul' to i_months-month.
        append i_months.
        move 'Aug' to i_months-month.
        append i_months.
        move 'Sep' to i_months-month.
        append i_months.
        move 'Oct' to i_months-month.
        append i_months.
        move 'Nov' to i_months-month.
        append i_months.
        move 'Dec' to i_months-month.
        append i_months.
        if v_end_month < v_start_month.
          v_find_month = 13 - v_start_month.
          do v_find_month times.
            read table i_months index v_start_month.
            move v_start_month to fiscal_months-month.
            move i_months-month to fiscal_months-literal.
            move v_start_year to fiscal_months-year.
            append fiscal_months.
            add 1 to: v_number_of_months, v_start_month.
          enddo.
          do v_end_month times.
            read table i_months index sy-index.
            move sy-index to fiscal_months-month.
            move i_months-month to fiscal_months-literal.
            move v_end_year to fiscal_months-year.
            append fiscal_months.
            add 1 to v_number_of_months.
          enddo.
        else.
          v_find_month = v_end_month - v_start_month + 1.
          do v_find_month times.
            read table i_months index v_start_month.
            move v_start_month to fiscal_months-month.
            move i_months-month to fiscal_months-literal.
            move v_start_year to fiscal_months-year.
            append fiscal_months.
            add 1 to: v_number_of_months, v_start_month.
          enddo.
        endif.
      ENDIF.
ENDFORM.
form get_fiscal_year.
      data : l_lst_day like sy-datum,
             l_frst_day like sy-datum,
             l_fisc_vnt like t009-periv, "fiscal year variant
             l_fisc_prd like t009b-poper,
             l_fisc_yr like t009b-bdatj,
             l_lines like sy-index.
      data : i_periods like table of periods with header line.
      perform get_fiscal_year_variant using p_bukrs
                                   changing l_fisc_vnt.
      perform get_period_on_date using p_fiscal-low
                                       l_fisc_vnt
                              changing l_fisc_prd
                                       l_fisc_yr.
      call function 'G_PERIODS_OF_YEAR_GET'
        EXPORTING
          variant             = l_fisc_vnt
          year                = l_fisc_yr
        IMPORTING
          last_normal_period = l_fisc_prd
        TABLES
          i_periods           = i_periods
        EXCEPTIONS
          variant_not_defined = 1
          year_not_defined    = 2
          others              = 3.
      if sy-subrc <> 0.
        message i368(00) with 'Unable to Convert Periods'.
      endif.
      describe table i_periods lines l_lines.
      read table i_periods index 1.
      move i_periods-datab to r_gfiscal-low.
      read table i_periods index l_lines.
      move : i_periods-datbi to r_gfiscal-high,
             'I' to r_gfiscal-sign,
             'BT' to r_gfiscal-option.
      append r_gfiscal.
    endform.                    " get_fiscal_year
form get_fiscal_year_variant using    p_p_ccode like t001-bukrs
                                 changing p_g_fisc_vnt like t009-periv.
      call function 'CCODE_GET_FISCAL_YEAR_VARIANT'
        EXPORTING
          company_code           = p_p_ccode
        IMPORTING
          fiscal_year_variant    = p_g_fisc_vnt
        EXCEPTIONS
          company_code_not_found = 1
          others                 = 2.
      if sy-subrc <> 0.
        message i368(00) with 'Unable to retrieve fiscal year variant'.
      endif.
    endform.                    " get_fiscal_year_variant
form get_period_on_date using    p_p_dcfp like sy-datum
                                     p_g_fisc_vnt like t009-periv
                         changing    p_g_fisc_prd like t009b-poper
                                     p_g_fisc_yr like t009b-bdatj.
      call function 'DATE_TO_PERIOD_CONVERT'
        exporting
          i_date               = p_p_dcfp
          i_periv              = p_g_fisc_vnt
       importing
         e_buper              = p_g_fisc_prd
         e_gjahr              = p_g_fisc_yr
       exceptions
         input_false          = 1
         t009_notfound        = 2
         t009b_notfound       = 3
         others               = 4
      if sy-subrc <> 0.
        message i368(00) with 'Unable to get period on date'.
      endif.
    endform.                    " get_period_on_date
Thanks

Hi,
Try to use FMs : (type quarter in fm name field and press f4.
FMs like follows will be dispalyed :
BKK_GET_QUARTER_DATE
HR99S00_TIME             Generic time related functions
HR_99S_GET_DATES_QUARTER   Get begin and end date of a qrtr
HR_99S_GET_QUARTER             Get quarter
HRPAYBE_DMFA                   Function pool for DMFA
HR_BE_DAQ_CONDT_QUARTER        Condition for declaring the Local Unit ID for DMFA
HR_BE_DAQ_QUARTER              Get occupation line relevant data for DMFA
HRPAYBE_DMFA_WORKFLOW          Workflow DMFA
HR_BE_DMFA_GET_QUARTER         Retrieve quarter declared
KRGE
KR_GET_HEADQUARTER_BPLACE
SLIM_DATE_TOOLS
SLIM_GET_QUARTERLY_PERIODS
STS2                           Time stream: Generate for periods
TSTR_PERIODS_QUARTERS          Generate Time Stream for Quarters

Explain the logic in the code

HI all,
Can anyone explain the logic in the code ?
This is to display the pages numbers in page 1 of 4
                                                         page 2 of 4
format.
i got this code in one of the forum.
if the lineno is less then 64, then why the control is not executing lines_left and its followed by statements ?
REPORT zreport_pages LINE-SIZE 80 LINE-COUNT 65(1) NO STANDARD PAGE HEADING.
DATA: imara TYPE TABLE OF mara WITH HEADER LINE.
SELECTION-SCREEN BEGIN OF BLOCK b1 WITH FRAME TITLE text-001 .
PARAMETERS: p_check TYPE c.
SELECTION-SCREEN END OF BLOCK b1.
START-OF-SELECTION.
PERFORM get_data.
PERFORM write_report.
END-OF-PAGE.
PERFORM end_of_page.
*FORM GET_DATA .
FORM get_data.
SELECT * INTO CORRESPONDING FIELDS OF TABLE imara
FROM mara UP TO 315 ROWS.
ENDFORM.                    "get_data
*FORM WRITE_REPORT .
FORM write_report.
DATA: xpage(4) TYPE c.
DATA: lines_left TYPE i.
LOOP AT imara.
    WRITE:/ imara-matnr.
    AT LAST.
      IF sy-linno < 64.
        lines_left = ( sy-linct - sy-linno ) - 1.
        SKIP lines_left.
        sy-pagno = sy-pagno - 1.
      ELSEIF sy-linno = 64.
        SKIP 1.
        sy-pagno = sy-pagno - 1.
      ENDIF.
    ENDAT.
ENDLOOP.
WRITE sy-pagno TO xpage LEFT-JUSTIFIED.
DO sy-pagno TIMES.
    READ LINE 65 OF PAGE sy-index.
    REPLACE '****' WITH xpage INTO sy-lisel.
    MODIFY CURRENT LINE.
ENDDO.
ENDFORM.                    "write_report
**Form end_of_page .
FORM end_of_page.
WRITE:/32 'Test Program', AT 62 'Page:', AT 67 sy-pagno, 'of', '****'.
ENDFORM.                    "end_of_page
Thanks in advance
krupali

Hi KR,
This program just displays first 315 MATNR values from MARA.
Every page consists of 65 lines. At bottom of every page, page number and total page number want to be displayed.
It is checked that last page is filled or incomplete.
If incomplete, those lines are skipped, Just to display page number.
Before that at the end of every page, "PAGE NO 1 OF ****" will be displayed.
After filling last page, the 'TOTAL NUMBER OF PAGES' at the end of every page '*****' replaced by original value.
Regards,
R.Nagarajan.

Using external C libraries from TOOL code

Hello,
As described in "Integrating with external systems", FORTE TOOL code can
interface with C libraries.
I finally got the DMathTime example running, thanks to Alain Dunan in UK who
put me on the right track.
At the begining I paid no attention to the fact that the documentation says
"interfacing with C functions". It is the "C" which is important, it means
that the declarations of all the externals of the library must comply to C
and not to C++ !
Therefore it's wrong to compile the DMathTime library with a C++ compiler
right away (CC -PIC -c *.c).
If you do so every thing works fine until you run the program. Then you get :
USER ERROR: The dynamic library
/sp1/soft/forte2e2/userapp/distmath/cl0/dmathtm for the project
DistMathAndTimeProject could not be found.
Class: qqsp_ExistenceException
Detected at: qqsh_DynScope::GetLoadedScope at 1
Last TOOL statement: method DistMathAndTimeTest.Runit, line 5
Error Time: Wed Aug 7 10:22:19
Exception occurred (remotely) on partition
"TestDistMathAndTimeProject_cl0_Part1", (partitionId =
C9731008-EAE4-11CF-B553-C56F3BFEAA77:0x160:0x42, taskId =
[C9731008-EAE4-11CF-B553-C56F3BFEAA77:0x21d:0x4.89]) in application
"AutoCompileSvc_cl0", pid 29598 on node nation in environment CentralEnv.
SYSTEM ERROR: System Error: ld.so.1:
/sp1/soft/forte2e2/install/bin/ftexec: fatal: relocation error: symbol not
found: OurTime: referenced in
/sp1/soft/forte2e2/userapp/distmath/cl0/dmathtm.so, loading the library
'/sp1/soft/forte2e2/userapp/distmath/cl0/dmathtm.so'
Class: qqos_DynamicLibraryException
Error #: [101, 29]
Detected at: qqos_DynamicLibrary::Load at 1
Error Time: Wed Aug 7 10:22:19
Exception occurred (remotely) on partition
"TestDistMathAndTimeProject_cl0_Part1", (partitionId =
C9731008-EAE4-11CF-B553-C56F3BFEAA77:0x160:0x42, taskId =
[C9731008-EAE4-11CF-B553-C56F3BFEAA77:0x21d:0x4.89]) in application
"AutoCompileSvc_cl0", pid 29598 on node nation in environment
CentralEnv.
It works if you change the external declarations of the library to read :
extern "C" <declaration>
prior to compiling the library with the C++ compiler (there might be other
ways to get the same result).
Alain told me that it works if instead of compiling the library with a C++
compiler, a C compiler is used; but unfortunately I don't have a C compiler
on the SPARC solaris here.
best regards,
Pierre Gelli
ADP GSI
Payroll and Human Resources Management
72-78, Grande Rue, F-92310 SEVRES
phone : +33 1 41 14 86 42 (direct) +33 1 41 14 85 00 (reception desk)
fax : +33 1 41 14 85 99

Apart from the Oracle documentation you mean?
http://technet.oracle.com/docs/products/oracle9i/doc_library/release2/appdev.920/a96590/adg11rtn.htm#1656
Cheers, APC

Running fscript commands directly from Tool code

Does any one know how to run fscript commands directly from Tool code.
Better still how to run a script file containing fscript commands
directly from Tool code
regards,
Manish shirke.
To unsubscribe, email '[email protected]' with
'unsubscribe forte-users' as the body of the message.
Searchable thread archive <URL:http://pinehurst.sageit.com/listarchive/>

Try that :
RunCommand('fscript < MyScript.fsc');
Hope this help you,
At 12:29 02/10/98 -0400, Shirke, Manish wrote:
Does any one know how to run fscript commands directly from Tool code.
Better still how to run a script file containing fscript commands
directly from Tool code
regards,
Manish shirke.
To unsubscribe, email '[email protected]' with
'unsubscribe forte-users' as the body of the message.
Searchable thread archive <URL:http://pinehurst.sageit.com/listarchive/>
Jean-Baptiste BRIAUD software engineer
SEMA GROUP france
16 rue barbes
92120 montrouge
mailto:[email protected]
To unsubscribe, email '[email protected]' with
'unsubscribe forte-users' as the body of the message.
Searchable thread archive <URL:http://pinehurst.sageit.com/listarchive/>

Web Tools Code missing under TABLES (Sync Manager)

Hello Experts,
I have recently did my testing on the Sbo_Demo Database.
I felt it was time for me to graduate and move on to the real data.
So i changed the database in SYNC manager to the one i would like to use.
Once i did this i started setting up my B2C Business partner and everything else needed for a successful sync.
i noticed an error stating PRX _ fields were missing. I figured i would start the procedure over using the document to successfuly uninstal any traces of WEBTOOLS.
So i started up a fresh install of web tools all seemed to go fine i setup my database when i went to sync manager under tables my WEB TOOLS CODE COLUMN was missing, in short my PRX_Fields were never constructed. i followed the removal process step by step from the included documents section page 13 " Removing the application"
Does anyone know what i am doing wrong? i thought the PRX files were created automattically with the webtools installer or sync manger
neither seem to be doing so.
Thank you very much for you time

Hello Sebastiano,
These columns are created by clicking "Install Plugin" on the first screen of the isynch manager. It is necessary to run this function every time you switch SBO databases. Also it is necessary to enter codes on the tables and click on the "Initialize Synch" button on the synchronization screen. This clears the webtools db of data from your previous SBO db. I believe this is covered in the installer guide.
Good luck,
James

How to understand the logic of existing code

Hi friends
I am new to java and I got the job in a company. Now they give me task to complete which use existing api developed by sr developers. Now my question is how can i understant such a large project with almost 200000 line of code.
It is web based project and using jsp and java mainly
Can anybody suggest me how can I understand it so that I can use this api and develop new code
Thanks

Use the javadoc tool to create documentation for the code.
Read the resulting documentation. Even if the senior developers didn't add any Javadoc comments (in which case, they're morons, despite being "senior"), it would be helpful just to see what the methods and classes are. In particular, look at the interfaces in the code. In well-crafted code, you get a good bird's-eye-view of the structure by looking at the interfaces and the relationships between them (in my opinion).
It's possible that the code is simply crap, in which case, you're in for a long hard slog my friend.

Can't install Logic, invalid key code that I know works

I bought Logic Express last year and I tried to install it today on my new refurbished iMac. I lost the instruction manual with the code on it so I looked up the license information on my old mac and wrote down the code, but when I tried to use that code it said it was invalid. Then I tried copying the program onto my external hard drive and then copying it again onto my hard drive on the mac, but it needed the code again and then said it was invalid.
Is this because I still have it installed on my old Mac? I tried to use migration assistant because I assume it was made for this type of thing, but it doesn't work either. I can't get a connection between the computers.

It's unlikely that having LE still installed on your old computer prevents you from using the code for installing it on the new one. Check if you copied the licence key right and its format first. Also, if you had your LE registered with Apple, you can get in touch with them via Support and retrieve your licence key, I guess.

C++ Code tool code doesn't print

Friends:
Using Xcode C++ Tool. Why doesn't this print? Thanks amigos, -Migs
#include <iostream>
#include <fstream>
using namespace std;
int main()
int i=1234;
char name[15];
float fval=123.456;
ofstream printer; // ofstream means out file stream
printer.open("lpt1");
cout<<"Enter a word (Max 14 chars): ";
cin.getline(name,14, '\n');
printer << "The values are: " << i <<" " << fval;
return 0;
}

Here some code for all that works!:=Migs
// An example of printing in C++ to the console and a printer
// Thanks etresoft!
// by Miguel Reznicek [email protected]
// Prints to local and networked printers
// Just make sure you printed to the printer you want to print
// just before this one is printed. (That chooses the printer)
#include <iostream>
#include <cstdio>
using namespace std;
int main()
// Some sample data including a prompt for a string (name)
int i=1234;
char name[15];
float fval=123.456;
FILE * printer_pipe = popen("/usr/bin/lpr", "w");
cout << "Enter a name: ";
cin >> name;
// Output to the console
// First a couple blank lines to the console;
cout << endl << endl;
// Second a string to the console
cout << "a string name: " << name << endl;
// Third a decimal integer to the console
cout << "A decimal integer: " << i<< endl;
// Fourth a floating pont number to the console
cout << "A floating point number: " << fval<< endl;
// Output to the printer
// %d = A decimal integer
// %f = A floating point number
// %c = A Character
// %s = A string
// First a couple blank lines to the printer:
fprintf(printer_pipe, "\n \n");
// Second a string (the name) to the printer:
fprintf(printer_pipe, "A string name: %s \n", name);
// Third a decimal number to the printer:
fprintf(printer_pipe, "A decimal integer: %i \n", i);
// Fourth a floating point number to the printer
fprintf(printer_pipe, "A floating point number: %f \n", fval);
// Last a couple blank lines to the printer:
fprintf(printer_pipe, "\n \n", name);
// Closing the printer
pclose(printer_pipe);
return 0;
}

Codification logic for Company codes

Dear Experts
We are debating on a logic for codification of company codes in our system. We are planning a single instance single client installation for ECC 6.0 and we have companies acrss the globe. We were debating whether to use go for simple all numeric code where the first 2 digits represents a number mapped to a country (for example 20 for india, 21 for china) and the next two digits as running serial number. We are also debating whether we just go with first 2 characters as alpha numeric representing the ISO code of the country as given by SAP (viz. IN for india, BR for brazil) and have the next 2 characters as running seral number.
Wanted to check with the experts if going with either logic does not make any difference or is there any specific advantage with any of them
Thanks
NSK

I would suggest to go with Numeric Codification.
If you choose alphanumeric codification, then user might face difficulwhile entering the data in SAP screen, as he has to navigate more for characters and digits on keyboards.
Also numeric codes, helps more in report development, program codes where ranges are used etc.
Regards,
Gaurav

Launching a logical link thru code

Hi all,
I manage to launch a logical link using the below in my code:
lr_navigation = cl_crm_ui_navigation_service=>get_instance( me ).
CHECK lr_navigation IS BOUND.
lr_navigation->navigate( iv_link_id = 'Logical Link Id' ).
But i notice that it only works if the logical link appear in the nav bar. Is that true? Any work around for this because the client do not want the link to appear at the nav bar.
Do give any suggestion.

You could make use of the generic OP mapping. Any logical link will have a target ID attached to it, this way you do not have to have the link in the navbar.
cheers Carsten

Logic board: error code 2ROM/1/2:0X12 i try to reinstall tiger for our G5

Need help:
logic board error: error code 2Rom/1/2:0x12 while doing the hardware test for G5 before reinstalling Tiger.
please need help
thanks.

Craig-
AHT isn't always dead on this is true.
Just out of curiosity, what are your symptoms? I am guessing that the start-up drive doesn't work if you put it into the 2nd bay?
Luck-
-DaddyPaycheck

Logical error in code, please help, thanks alot.

I have this file Socks.java which reads in a file containing information about a sock drawer. The file is of the format:
11
red athletic
green casual
blue athletic
blue athletic
red athletic
so when the program runs, it is supposed to output the socks that are pairs: so it would output
1 pair red athletic
1 pair blue athletic
my code compiles and runs fine and i am testing it with println statements, but I am not getting the desired ouput. Can someone look over it and see if they spot what is wrong. Right now in the code I am seeing what the value of socks[i] and socks[j] is by printing them out as you will notice. If anyone can help, I appreciate it. Thanks so much for all your wonderful help
Here is the code:
import java.io.*;
public class Socks {
public static void main(String args[])
try
String socks[] = new String[1000];
int pairs[] = new int[500];
int numOfsocks;
int i;
int j;
FileReader fr = new FileReader("test.txt");
BufferedReader inFile = new BufferedReader(fr);
numOfsocks = Integer.parseInt(inFile.readLine());
int possiblePairs = numOfsocks/2;
//System.out.println(numOfsocks);
//System.out.println(possiblePairs);
for(i = 0; i < numOfsocks; i++)
socks[i] = inFile.readLine();
//for(i = 0; i < numOfsocks; i++)
//System.out.println(socks);
for(i = 0; i <= possiblePairs;i++)
for(j = i; j <= possiblePairs;j++)
System.out.println(socks[i]);
System.out.println(socks[j]);
//if(pairs[i] >= 2)
//System.out.println(pairs[i]/2 + " pairs" + socks[i]);
inFile.close();
catch(IOException e){}
          System.out.println("File Not Found or no File Specified");

Try the following quickly revised version of your code.
import java.io.*;
public class Socks {
public static void main(String args[])
try
    String socks[] = new String[1000];
    int pairs[] = new int[500];
    int numOfsocks;
    int i;
    int j;
    FileReader fr = new FileReader("test.txt");
    BufferedReader inFile = new BufferedReader(fr);
    numOfsocks = Integer.parseInt(inFile.readLine());
    for(i = 0; i < numOfsocks; i++)
      socks[i] = inFile.readLine();
    for(i = 0; i < numOfsocks; i++)
      if (socks[i] != null)
        pairs[i]++;
        for(j = i + 1; j < numOfsocks; j++)
            if (socks.equals(socks[j]))
pairs[i]++;
socks[j] = null;
System.out.println(pairs[i]/2 + " pairs " + socks[i]);
inFile.close();
catch(IOException e){
e.printStackTrace();

Base64 algorithm logic in TOOL Code

Similar Messages

Maybe you are looking for