Not logged in : Login
(Sponging disallowed)

About: Fibonacci function     Goto   Sponge   NotDistinct   Permalink

An Entity of Type : foaf:Document, within Data Space : linkeddata.uriburner.com:28898 associated with source document(s)

AttributesValues
type
Title
  • Fibonacci function
content
  • Example The Fibonacci function calculates number based on following algorithm: int fi (int i) { if (i < 2) return i; return fi (i-1) + fi (i-2) } The example contains code for a simple Fibonacci function service. It accepts an integer number as an input and calculates the Fibonacci number. The process like the Fibonacci function does a recursive syncronous invocation of itself. The example is allowed with values less than 6. If is entered value greater then 6, will be printed the message "Entry values greater then 6 are not allowed!" and the input entry value will be initialized to 6. To build and run the example follow the steps bellow: Login into the BPEL UI via http://host:port/BPELGUI. From the 'Home' tab page go to section 'Tasks' and click 'Upload Process' link. Another way is to choose 'Processes' tab and go to the 'Process Upload' sub-tab. For the given entry form in the "Process name" field type 'Fi' in order the process to be invoked successfully. In the "Load Deployment Descriptor URI" field type 'http://host:port/BPELDemo/fi/bpel.xml'. Choose the 'Import Process' button. Choose the 'Compile process' button. If compilation succeeds, will go to the 'Processes' page where the process will be in the given processes list. To test the process click "Test" in the listing. This goes to a page allowing you to enter a start message for creating a new instance of this process.
has container
description
  • Fibonacci function BPEL4WS process
dcterms:created_at
  • Fri, 27 Dec 2019 14:12:55 GMT
content:encoded
  • Example The Fibonacci function calculates number based on following algorithm: int fi (int i) { if (i < 2) return i; return fi (i-1) + fi (i-2) } The example contains code for a simple Fibonacci function service. It accepts an integer number as an input and calculates the Fibonacci number. The process like the Fibonacci function does a recursive syncronous invocation of itself. The example is allowed with values less than 6. If is entered value greater then 6, will be printed the message "Entry values greater then 6 are not allowed!" and the input entry value will be initialized to 6. To build and run the example follow the steps bellow: Login into the BPEL UI via http://host:port/BPELGUI. From the 'Home' tab page go to section 'Tasks' and click 'Upload Process' link. Another way is to choose 'Processes' tab and go to the 'Process Upload' sub-tab. For the given entry form in the "Process name" field type 'Fi' in order the process to be invoked successfully. In the "Load Deployment Descriptor URI" field type 'http://host:port/BPELDemo/fi/bpel.xml'. Choose the 'Import Process' button. Choose the 'Compile process' button. If compilation succeeds, will go to the 'Processes' page where the process will be in the given processes list. To test the process click "Test" in the listing. This goes to a page allowing you to enter a start message for creating a new instance of this process.
is container of of
Faceted Search & Find service v1.17_git150 as of Jan 20 2025


Alternative Linked Data Documents: iSPARQL | ODE     Content Formats:   [cxml] [csv]     RDF   [text] [turtle] [ld+json] [rdf+json] [rdf+xml]     ODATA   [atom+xml] [odata+json]     Microdata   [microdata+json] [html]    About   
This material is Open Knowledge   W3C Semantic Web Technology [RDF Data] Valid XHTML + RDFa
OpenLink Virtuoso version 08.03.3332 as of Jan 29 2025, on Linux (x86_64-generic-linux-glibc25), Single-Server Edition (378 GB total memory, 33 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2025 OpenLink Software