How to integrate an entreprise logo on a ipad?

please help me.... i hope yours solutions will be "simple"

iPhone Config Utility will not force a particular desktop wallpaper. You can select a wallpaper from the device by browsing to a photo, but there is nothing that would prevent the user from browsing to another picture and changing the wallpaper. Maybe there is a way of customizing the device case for him that would work........in my opinion, a case is a necessary addition to protect the device from drop damage.

Similar Messages

How to integrate address book in Pages for iPad?

In Pages for Mac, I could drag Address Book entries directly into Pages to automatically populate Name and Address placeholders.
How do I do that in Pages for iPad?
Currently, iOS Pages does not pull my details (name & address) automatically into letter templates either, as is the case with Mac Pages.

I have the same problem / need.
Does anybody know if there is any sort of integration of iOS pages with Contacts in iPad / iPhone?

How do I attach a logo to my ipad and iphone email signature?

I can only find a way to type a signature for my ipad and iphone email. I need to attach a logo. Does anyone know how to do that?

Not in the stock mail app, not a feature. Look in the app store for an app that will do this.

How to integrate web based application to windows based application

Hi,
Experts,
we developed web based application in this when we raising
invoice document after adding this we need to updated Amount
in integratee SAP B1 then that Amount we need Update The
Amount in OACT Table how we can Update in Amount Field
in OACT Particular Account Code. plz Guide me. and how to
integrate web absed application to windowbased application
plz help me.
Regds,
Samapth.

Dear sampathdevunuri kumar,
You may develop the addon based on SDK DIServer for required function.
The DI Server is an extension of the DI API and supports all its objects. It is intended for high-volume data integration, where numerous client connections must be managed simultaneously and optimized for speed. It is also suitable where Web-services architecture is preferred.
Please refer to SDK help and SDK DIServer sample for more information.
Best Regards
Jane Jing
SAP Business One Forums team

How can I change the logo in a template?

Hello everyone,
I have searched the Oracle Reports documentation, these forums and the Metalink forums, but I really can't find an answer to what should be a really simple question. My question is: How can I set a logo (an image) in a report template (*.tdf file)? Defining things like a company logo is exactly the purpose of using templates, I think, so I find it strange that is is so difficult to do this. I must be missing something very obvious...
All help will be much appreciated!
By the way, I use reports builder 10.1.2.
Regards,
Frans

I have got it!
In the template editor, there is a button 'Edit Margin' which you can press to edit the margin of a template. This is needed because the log is a part of the report margin.
Bye,
Frans

How to integrate BW Hierarchy into Webi?

Hi Everybody,
I need to create a report based on 0FIGL_V10_Q0001 in Webi and this query has a hierarchy and i have created the hierarchy from the designer itself. In webi, when i tried to pull 1 of the hierarchy dimension with key figure, it shows no data but if i remove the key figure i can view the information. May i know what went wrong with it or do you have a details on how to integrate BW hierarchy into Webi?
Your assistance on this is greatly appreciated.
Thanks
Best Regards,
Hizam

Hi,
use the following link:
https://sapmats-us.sap-ag.de/download/download.cgi?id=SOTBBWVP5VS0BRNUJFQWYL5A6L3GXGPDJ59UKUDZMA1UVE1WOQ
(should work properly in about 10 min)
- merge the regsitry file to your BusinessObjects Server
- Restart the Services via a restart of the Server Intelligence Agent
- re-run the report with keyfigures
You should see 2 logfiles being created on the C:\ root folder
attach the logfiles to this message (do not copy past the content).
I assume the underlying BI query works fine.
Ingo

How to integrate bing map for including or displaying multiple locations at the same time

how to integrate bing map for including or displaying multiple locations at the same time

Have you aware of the geolocation field that's been introduced with SharePoint 2013? You can store location data within a list and then integrate this within Bing. The second tutorial on this Bing team blog will show it well.
https://www.bing.com/blogs/site_blogs/b/maps/archive/2013/03/26/connecting-a-sharepoint-list-to-bing-maps.aspx
Steven Andrews
SharePoint Business Analyst: LiveNation Entertainment
Blog: baron72.wordpress.com
Twitter: Follow @backpackerd00d
My Wiki Articles:
CodePlex Corner Series
Please remember to mark your question as "answered" if this solves (or helps) your problem.

Problems concerning "How to integrate MS Exchange Server into SAP EP"

Hi,
I want to realize the scenario in "How to integrate Microsoft Exchange Server into SAP Enterprise Portal" from the Microsoft-Website.
We´re using SAP NetWeaver 04, SAP NetWeaver Portal 6.0.14.0.0 and KMC 6.0.14.2.0 and Microsoft Exchange Server 2000 SP3.
I have created (as described in the document) the HTTP-System and a WebDAV RM. But the repository doesn´t appeaer in the KM-Content-iView.
I checked the Component Monitor and got this error-message for "servers" (it was marked with a red square)
last-error-3   2006-05-16T13:12:11Z: PROPFIND /public: 401 Access Denied
last-error-4   2006-05-16T13:15:04Z: PROPFIND /public: 401 Access Denied
last-error-6   2006-05-16T13:26:35Z: PROPFIND /public: 401 Access Denied
errors   8
last-error-2   2006-05-16T13:12:10Z: PROPFIND /public: 401 Access Denied
requests   8
last-error-7   2006-05-16T13:26:35Z: PROPFIND /public: 401 Access Denied
bytes-per-second   0
successes   0
response-average   194
last-error-1   2006-05-16T13:11:55Z: PROPFIND /public: 401 Access Denied
last-error-0   2006-05-16T13:11:54Z: PROPFIND /public: 401 Access Denied
last-error-5   2006-05-16T13:15:05Z: PROPFIND /public: 401 Access Denied
failures   0
Any idea, what´s wrong? And how to solve the problem.
Thanks for help,
Sven
Message was edited by: Sven Keller

Hi James,
How can I check the KM ACLs/Security Zones?
I had a look on "System Administration - System Configuration - Knowledge Management - Content Management - Repository Managers - Security Manager - WebDAV ACL Security Manager".
There was just "WDAclSecurityManager" and the Permission Rendering Class was "com.sapportals.wcm.control.acl.ResourcePermissionControl".
Or where do I have to look for the ACL?

How to Integrate SAP R/3 ECC 6.0 with XI3.0 or PI7.0

Hi,
I am having access to one SAP R/3 ECC 6.0 server through internet.
I have stand alone SAP Net weaver PI 7.0 installed on my laptop.I do not know how to integrate both ,I mean to say that what are the steps I need to follow so that two systems can talk to each other.
Appreciate your details.
Thanks and Regards,
Viswanath

Hi,
It will be possible to do all the configurations related to RFC destination and partner profile as the experties have mentioned in above posts.
You need to also check with the way you could be able to access the SAP R/3 ECC 6.0 server through internet.
When you establish a connection to a client through a destination, the HTTP connection must first be entered in transaction SM59.
There are two types of HTTP connection in transaction SM59: Call transaction SM59 to display the different RFC destinations.
The HTTP connection to the external server (connection type G) and the HTTP connection to the R/3 system (connection type H) are different only in their logon procedures. Their technical settings are the same. To display the technical settings, double-click a connection.
You can choose from three tabs. Under Technical Settings, you can specify the following:
·        Target Host: The host to which you want to connect.
Note that if you are using HTTPS as a protocol, you have to specify the full host name (with domain).
·        Service No.: Here, you specify the port. The destination host must of course be configured in such a way that the specified port understands the corresponding protocol (HTTP or HTTPS). See Parameterizing the ICM and the ICM Server Cache.
·        Path Prefix: At the time when the connection to this destination is initiated, the system inserts this sub-path before ~request_uri.
·        HTTP Proxy Options: Here, you can configure a proxy for HTTP connections: You can determine the proxy host and service, as well as users and passwords for the HTTP connection.
The tab page Logon/Security will be different depending on whether you have selected a HTTP connection to an external server (connection type G) or a HTTP connection to an R/3 system (connection type H).
HTTP Connection to an External Server (Connection Type G)
Choose the connection you want to use. You can choose from the following logon procedures:
·        No Logon: The server program does not request a user or password.
·        Basic Authentication: The server program requests a user and password. Basic Authentication is a standard HTTP method for authenticating users. When a user logs on to the target system, he or she provides a user ID and password as authentication. This information is then sent in a header variable as a Base 64-encoded string to the server, through the HTTP connection.
·        SSL Client Certificate: If you use client certificates for authentication, the client authentication is performed through the Secure Sockets Layer (SSL) protocol. In this case, you must also select the SSL Client PSE of the SAP Web AS that contains the relevant certificate for the authentication. The target system must handle the issuer of the SAP Web AS client certificate as a trusted system.
Under Logon/Security, you can also activate SSL to ensure that HTTPS is the protocol used (if you select SSL, make sure that the correct port is entered under Technical Settings). In the security transaction STRUST you can determine which type of SSL client is used. (Getting Started with the Trust Manager, Trust Manager).
The field Authorization for Destination has been implemented as an additional level of protection. We recommend that you specify a user and password for the RFC destination.
Thanks
Swarup

How to Integrate SAP R/3 with Netweaver PI 7.0

Hi,
I am having access to one SAP R/3 ECC 6.0 server through internet.
I have stand alone SAP Net weaver PI 7.0 installed on my laptop.I do not know how to integrate both ,I mean to say that what are the steps I need to follow so that two systems can talk to each other.
Appreciate your details.
Thanks and Regards,
Viswanath

hi,
in R3 ECC
u create tcp/ip RFC's LCRSAPRFC and SAPSLDAPI.give these destinations in PI j2ee visual admin...JCORFC PROVIDER.
Tcode SLDAPICUST....give the setails of PI server hostname and iser PIAPPLUSER password..
then go to Tcode SXMB_ADM
integration engine configuration role of the business system application server
destnation http://<host>:<HTTPport>/sap/xi/engine?type=entry
then save
regards
ajai

How to integrate this plugin in adobe muse, how difficult is ! Help Me

How to integrate this plugin in adobe muse, how difficult is !
jQuery Horizontal automatic Scrollbars with mouse
Download the Code
www.htmldrive.net/media/2011/8/16/1313500122.zip
The Demo Here
http://www.htmldrive.net/items/demo_show/966
my project which I have not done work is this, DOWNLOAD HERE: http://we.tl/EwsMMGH1l1
How to integrate this plugin in adobe muse, how difficult is ! Help Me

COmo integrar este plugin en Muse ? Veo bastante dificil el integrarlo !

Need information on how to integrate bank interfaces for 820,824 transaction using B2B add on

HI All,
Can anyone share some knowledge on how to integrate 820,824 transactions using PI B2B add on .
I have downloaded B2B mapping kit and B2B toolkit into IR and uploaded SCA files into PI server.
But I can not see any mappings provided for 820/824 by SAP in B2B mapping kit.
Please share your comments.
Regards,
Dinesh

Hi Dimitri,
I am looking for 820,824 for ANSIX12 format.
And i guess SAP has provided example mappings only for 810,830 and 850.
I am unable to see the example mappings provided by sap for 820/824 in B2B mapping toolkit.
Is there any way or place to find the example mappings for these formats?
Regards,
DInesh Male

How do I put a logo into the address line of my browser?

How do I put a logo into my site so that it shows up on the browser address line at the top of the page?

Create a favicon.ico file and put it in the root folder, use this site to make one from an existing image file
Flush your browser cache, it won't appear right away but will show after a few loads

How to integrate a whole-house user setup

How to integrate a whole-house user setup

To start, I have seen an AppleTV box through the window of an Apple Store, about a year ago. That's about my degree of experience with one. I don't know what it needs in terms of file server support.
You don't need to add another computer in all this. Put the files on some central drive and share media off there using multiple libraries on each computer -- that's pretty much what you are doing now anyway. You might be able to piggy-back your current drive onto a Time Capsule or similar. The main issue will be transferring files to the drive without breaking links in existing libraries. They may be ways to facilitate that so they can be repaired easily. For that matter, as long as the present external drive remains unchanged then iTunes may not even notice it is connected differently and you'e up and running in no time.
You may be able to move your wife's collection to the external by consolidating to the media folder there. If all of her collection is unique you can probably even add it to the same media folder as the main one. If there's overlap in content that may be moderately risky (I personally would try it but would make sure I had a solid backup first).
iTunes 11 for Mac: Change where your iTunes files are stored - http://support.apple.com/kb/PH12165 - more information at: https://discussions.apple.com/message/22026652 - and steps 5-8 in https://discussions.apple.com/message/24491967
iTunes for Mac: Moving your iTunes Media folder - http://support.apple.com/kb/ht1449
Realize that iTunes does not actively scan the media folder for additions. If your wife puts a movie in her library it will add to the media folder but it won't automatically appear on another computer until a person actively goes to the media foler and adds that file to their iTunes library. It's like a public library (except now my library tells me if they have added a book by an author I like so I guess my analogies are starting to fall apart).

How to integrate c# library's function to use F# type expression for function of function?

i succeed to implement the initial prototype for function structure in c#
but i do not know how to integrate in F#
i make c# library's function to accept template T, for F# to pass type expression into it.
but how to write in c# to make template like type expression,
in Addvaluetoeachitem
hope make function structure depend on left or right, i got twisted in my mind when integrating into F#
if translate c# into F# , how to write for this class?
func1(func1(param1, param2), param2) etc
if i define funcvalue as
type expr =
| And of expr * expr
| Or of expr * expr
expr[] funcvalues = new expr[] {And, Or, And, Or, And, Or, And}
int[] values = new int[] { 1, 2, 3, 4, 5, 6, 7 };
got some error when translate member value and constructor into F#
// Learn more about F# at http://fsharp.net
// See the 'F# Tutorial' project for more help.
open System.Collections.Generic
type expr =
| And of expr * expr
| Or of expr * expr
| Param1
type BinaryTree =
let mutable value = 0
let left : BinaryTree = null
let right : BinaryTree = null
let mutable dict : Dictionary<int, BinaryTree> = new Dictionary<int, BinaryTree>();
member this.Load(tree : BinaryTree, values : int[], index : int) =
this.value = values.[index];
if index * 2 + 1 < values.Length then
this.left = new BinaryTree(values, index * 2 + 1)
if index * 2 + 2 < values.Length then
this.right = new BinaryTree(values, index * 2 + 2)
new() = BinaryTree(values : int[]) : this(values, 0) { }
//public BinaryTree(int[] values) : this(values, 0) { }
new() = BinaryTree(values : int[], index : int)
let dict = new Dictionary<int, BinaryTree>()
Load(this, values, index)
member this.Visit(tree : BinaryTree) =
dict.Add(dict.Count, tree);
member this.ChangeToString(m : List<int>) : String =
let result = "";
for i in m do
result = result + i.ToString()
result
member this.CopyList(queue : Queue<List<int>>) : Queue<List<int>> =
let mutable newqueue : Queue<List<int>> = new Queue<List<int>>();
if queue != null then
while (queue.Count > 0) do
let source : List<int> = queue.Dequeue()
let destination : List<int> = new List<int>();
for a in source do
destination.Add(a);
newqueue.Enqueue(destination)
for m in newqueue do
queue.Enqueue(m);
newqueue
member this.IsAscending(m : List<int>) : bool =
let mutable result = true
let mutable prev : int = 0
for i in m do
if prev > i then
result <- false
prev <- i
result
member this.Addvaluetoeachitem(queue : Queue<List<int>>, value : int, maxlimit : int, ref Dictionary<String , List<int>> allpath, Boolean IsBackUp, T func1, T param1, T param2, Dictionary<T, T> allfunctionstructure, Queue<List<T>> funcqueue, Boolean LeftOrRight) : Queue<List<int>>=
let newqueue : Queue<List<int>> = new Queue<List<int>>()
if queue != null then
while queue.Count > 0 do
List<int> path = queue.Dequeue();
//List<T> func = funcqueue.Dequeue();
let mutable afteradd = false
if path.Count < maxlimit then
path.Add(value);
afteradd <- true
if path.Count = maxlimit && afteradd = true && IsBackUp = false then
if IsAscending(path) = true then
if allpath.ContainsKey(ChangeToString(path)) = false then
allpath.Add(ChangeToString(path), path)
newqueue.Enqueue(path);
if queue = null then
let mutable path : List<int> = new List<int>();
let mutable afteradd = false
if path.Count < maxlimit then
path.Add(value)
afteradd <- true
if path.Count == maxlimit && afteradd == true && IsBackUp = false then
if IsAscending(path) = true then
if allpath.ContainsKey(ChangeToString(path)) = false then
allpath.Add(ChangeToString(path), path)
newqueue.Enqueue(path)
else
if queue.Count = 0 then
let mutable path : List<int> = new List<int>();
let mutable afteradd = false
if path.Count < maxlimit then
path.Add(value)
afteradd <- true
if path.Count = maxlimit && afteradd = true && IsBackUp = false then
if IsAscending(path) == true then
if allpath.ContainsKey(ChangeToString(path)) = false then
allpath.Add(ChangeToString(path), path)
newqueue.Enqueue(path)
newqueue
member this.Deepfirst(tree : BinaryTree, ref queuepath : Queue<List<int>>, backpath : Queue<List<int>>, maxlimit : int, ref allpath : Dictionary<String, List<int>>, func1 : expr, param1 : expr, param2 : expr, allfunctionstructure : Dictionary<expr, expr>, ref queuefunc : Queue<List<expr>>, LeftOrRight : bool) : Queue<List<int>>=
queuepath = Addvaluetoeachitem(queuepath, tree.value, maxlimit, ref allpath, false, func1, param1, param2, allfunctionstructure, queuefunc, LeftOrRight);
//path.Add(tree.value);
Queue<List<int>> newpath = new Queue<List<int>>();
newpath = CopyList(queuepath);
Queue<List<int>> newpath2 = new Queue<List<int>>();
newpath2 = CopyList(queuepath);
backpath = Addvaluetoeachitem(backpath, tree.value, maxlimit, ref allpath, false, func1, param1, param2, allfunctionstructure, queuefunc, LeftOrRight);
//Queue<List<int>> backpathx = new Queue<List<int>>();
Queue<List<int>> backpathx = backpath;//Addvaluetoeachitem(backpathx, tree.value, maxlimit, ref allpath, false);
Queue<List<int>> newpathx = new Queue<List<int>>();
newpathx = CopyList(queuepath);
Queue<List<int>> backpath1 = backpathx;
if tree.left != null then
newpathx = Deepfirst(tree.left, ref newpath, newpathx, maxlimit, ref allpath, func1, param1, param2, allfunctionstructure, ref queuefunc, false) // Left
if tree.value = 1 then
Console.WriteLine("")
Visit(tree)
for m in queuepath do
newpath2.Enqueue(m)
let mutable backpath2 : Queue<List<int>> = newpathx
if tree.right != null then
newpathx = Deepfirst(tree.right, ref newpath2, newpathx, maxlimit, ref allpath, func1, param1, param2, allfunctionstructure, ref queuefunc, true) // Right
if tree.value = 1 then
Console.WriteLine("")
if newpathx != null then
return newpathx
if backpath2 != null then
return backpath2
if backpath1 != null then
return backpath1
if backpath != null then
return backpath
else
return backpath
[<EntryPoint>]
let main argv =
printfn "%A" argv
0 // return an integer exit code
BinaryTree<int> b = new BinaryTree<int>(values);
Queue<List<int>> queuepath = new Queue<List<int>>();
Queue<List<int>> backpath = null;
Queue<List<int>> queuefunc = new Queue<List<int>>();
Dictionary<String, List<int>> allpath = new Dictionary<String, List<int>>();
Dictionary<int, int> allfunctionstructure = new Dictionary<int, int>();
int a3 = 0;
int b3 = 0;
int c3 = 0;
queuepath = b.Deepfirst(b, ref queuepath, backpath, 3, ref allpath, a3, b3, c3, allfunctionstructure, ref queuefunc, false);
using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;
using System.Threading.Tasks;
namespace testTable
public class BinaryTree<T>
public int value;
BinaryTree<T> left;
BinaryTree<T> right;
public Dictionary<int, BinaryTree<T>> dict;
public BinaryTree(int[] values) : this(values, 0) { }
BinaryTree(int[] values, int index)
dict = new Dictionary<int, BinaryTree<T>>();
Load(this, values, index);
public void Visit(BinaryTree<T> tree)
dict.Add(dict.Count, tree);
public String ChangeToString(List<int> m)
String result = "";
foreach (int i in m)
result = result + i.ToString();
return result;
public Queue<List<int>> CopyList(Queue<List<int>> queue)
Queue<List<int>> newqueue = new Queue<List<int>>();
if (queue != null)
while (queue.Count > 0)
List<int> source = queue.Dequeue();
List<int> destination = new List<int>();
foreach (int a in source)
destination.Add(a);
newqueue.Enqueue(destination);
foreach (List<int> m in newqueue)
queue.Enqueue(m);
return newqueue;
public Boolean IsAscending(List<int> m)
Boolean result = true;
int prev = 0;
foreach (int i in m)
if (prev > i)
result = false;
prev = i;
return result;
public Queue<List<int>> Addvaluetoeachitem<T>(Queue<List<int>> queue, int value, int maxlimit, ref Dictionary<String , List<int>> allpath, Boolean IsBackUp, T func1, T param1, T param2, Dictionary<T, T> allfunctionstructure, Queue<List<T>> funcqueue, Boolean LeftOrRight)
Queue<List<int>> newqueue = new Queue<List<int>>();
if (queue != null)
while (queue.Count > 0)
List<int> path = queue.Dequeue();
//List<T> func = funcqueue.Dequeue();
Boolean afteradd = false;
if (path.Count < maxlimit)
path.Add(value);
afteradd = true;
if (path.Count == maxlimit && afteradd == true && IsBackUp == false)
if( IsAscending(path) == true)
if(allpath.ContainsKey(ChangeToString(path)) == false)
allpath.Add(ChangeToString(path), path);
newqueue.Enqueue(path);
if (queue == null)
List<int> path = new List<int>();
Boolean afteradd = false;
if (path.Count < maxlimit)
path.Add(value);
afteradd = true;
if (path.Count == maxlimit && afteradd == true && IsBackUp == false)
if (IsAscending(path) == true)
if (allpath.ContainsKey(ChangeToString(path)) == false)
allpath.Add(ChangeToString(path), path);
newqueue.Enqueue(path);
else
if (queue.Count == 0)
List<int> path = new List<int>();
Boolean afteradd = false;
if (path.Count < maxlimit)
path.Add(value);
afteradd = true;
if (path.Count == maxlimit && afteradd == true && IsBackUp == false)
if (IsAscending(path) == true)
if (allpath.ContainsKey(ChangeToString(path)) == false)
allpath.Add(ChangeToString(path), path);
newqueue.Enqueue(path);
return newqueue;
public Queue<List<int>> Deepfirst(BinaryTree<T> tree, ref Queue<List<int>> queuepath, Queue<List<int>> backpath, int maxlimit, ref Dictionary<String, List<int>> allpath, T func1, T param1, T param2, Dictionary<T, T> allfunctionstructure, ref Queue<List<T>> queuefunc, Boolean LeftOrRight)
//if (path.Count < maxlimit)
queuepath = Addvaluetoeachitem(queuepath, tree.value, maxlimit, ref allpath, false, func1, param1, param2, allfunctionstructure, queuefunc, LeftOrRight);
//path.Add(tree.value);
Queue<List<int>> newpath = new Queue<List<int>>();
newpath = CopyList(queuepath);
Queue<List<int>> newpath2 = new Queue<List<int>>();
newpath2 = CopyList(queuepath);
backpath = Addvaluetoeachitem(backpath, tree.value, maxlimit, ref allpath, false, func1, param1, param2, allfunctionstructure, queuefunc, LeftOrRight);
//Queue<List<int>> backpathx = new Queue<List<int>>();
Queue<List<int>> backpathx = backpath;//Addvaluetoeachitem(backpathx, tree.value, maxlimit, ref allpath, false);
Queue<List<int>> newpathx = new Queue<List<int>>();
newpathx = CopyList(queuepath);
Queue<List<int>> backpath1 = backpathx;
if (tree.left != null)
newpathx = Deepfirst(tree.left, ref newpath, newpathx, maxlimit, ref allpath, func1, param1, param2, allfunctionstructure, ref queuefunc, false); // Left
if (tree.value == 1)
Console.WriteLine("");
Visit(tree);
if (backpath1 != null)
Boolean afteradd = false;
if (backpath1.Count < maxlimit)
backpath1.Add(tree.value);
afteradd = true;
if (backpath1.Count == maxlimit && afteradd == true)
allpath.Add(backpath1);
foreach (List<int> m in queuepath)
newpath2.Enqueue(m);
Queue<List<int>> backpath2 = newpathx;
if (tree.right != null)
newpathx = Deepfirst(tree.right, ref newpath2, newpathx, maxlimit, ref allpath, func1, param1, param2, allfunctionstructure, ref queuefunc, true); // Right
if (tree.value == 1)
Console.WriteLine("");
//Queue<List<int>> newpath3 = new Queue<List<int>>();
//newpath3 = CopyList(queuepath); // 2 -> 1 -> 3 1(2,3) difficult case
//return newpath3;
if (newpathx != null)
return newpathx;
if(backpath2 != null)
return backpath2;
if (backpath1 != null)
return backpath1;
if (backpath != null)
return backpath;
else
return backpath;
public void Load(BinaryTree<T> tree, int[] values, int index)
this.value = values[index];
if (index * 2 + 1 < values.Length)
this.left = new BinaryTree<T>(values, index * 2 + 1);
if (index * 2 + 2 < values.Length)
this.right = new BinaryTree<T>(values, index * 2 + 2);
computing nightmare

This builds, and fixes the most egregious style issues
open System
open System.Collections.Generic
type expr =
| And of expr * expr
| Or of expr * expr
| Param1
[<AllowNullLiteral>]
type BinaryTree(values : int[], index : int) =
let value = values.[index]
let left = if index * 2 + 1 < values.Length then
BinaryTree(values, index * 2 + 1)
else null
let right = if index * 2 + 2 < values.Length then
BinaryTree(values, index * 2 + 2)
else null
let dict : Dictionary<int, BinaryTree> = new Dictionary<int, BinaryTree>();
new(values : int[]) = BinaryTree(values, 0)
member this.Value with get() = value
member this.Left with get() = left
member this.Right with get() = right
member this.Visit(tree : BinaryTree) =
dict.Add(dict.Count, tree);
static member ChangeToString(m : List<int>) : String =
String.Join(String.Empty, m)
static member CopyList(queue : Queue<List<int>>) : Queue<List<int>> =
let newqueue = Queue<List<int>>();
if queue <> null then
while (queue.Count > 0) do
let source : List<int> = queue.Dequeue()
let destination : List<int> = new List<int>();
for a in source do
destination.Add(a);
newqueue.Enqueue(destination)
for m in newqueue do
queue.Enqueue(m);
newqueue
static member IsAscending(m : List<int>) : bool =
m
|> Seq.pairwise
|> Seq.forall (fun (x,y) -> y > x)
static member Addvaluetoeachitem(
queue : Queue<List<int>>,
value : int,
maxlimit : int,
allpath : Dictionary<String , List<int>> byref,
isBackUp : Boolean,
func1 : 'T,
param1 : 'T,
param2 : 'T,
allfunctionstructure : Dictionary<'T, 'T>,
funcqueue : Queue<List<'T>>,
leftOrRight : Boolean) : Queue<List<int>>=
let newqueue : Queue<List<int>> = new Queue<List<int>>()
if queue <> null then
while queue.Count > 0 do
let path = queue.Dequeue();
let afteradd = path.Count < maxlimit
if afteradd then
path.Add(value)
if path.Count = maxlimit && afteradd && (not isBackUp) then
if BinaryTree.IsAscending(path) then
if allpath.ContainsKey(BinaryTree.ChangeToString(path)) = false then
allpath.Add(BinaryTree.ChangeToString(path), path)
newqueue.Enqueue(path);
if (queue = null) || (queue.Count = 0) then
let path = List<int>();
let afteradd = path.Count < maxlimit
if afteradd then
path.Add(value)
if path.Count = maxlimit && afteradd && (not isBackUp) then
if BinaryTree.IsAscending(path) then
if not <| allpath.ContainsKey(BinaryTree.ChangeToString(path)) then
allpath.Add(BinaryTree.ChangeToString(path), path)
newqueue.Enqueue(path)
newqueue
member this.Deepfirst(tree : BinaryTree,
queuepath : Queue<List<int>> byref,
backpath : Queue<List<int>> byref,
maxlimit : int,
allpath : Dictionary<String, List<int>> byref,
func1 : expr, param1 : expr, param2 : expr,
allfunctionstructure : Dictionary<expr, expr>,
queuefunc : Queue<List<expr>> byref,
leftOrRight : bool) : Queue<List<int>>=
queuepath <- BinaryTree.Addvaluetoeachitem(queuepath, tree.Value, maxlimit, ref allpath, false, func1, param1, param2, allfunctionstructure, queuefunc, leftOrRight);
let newpath = BinaryTree.CopyList(queuepath);
let newpath2 = BinaryTree.CopyList(queuepath);
backpath <- BinaryTree.Addvaluetoeachitem(backpath, tree.Value, maxlimit, ref allpath, false, func1, param1, param2, allfunctionstructure, queuefunc, leftOrRight);
let backpathx = backpath;
let mutable newpathx = BinaryTree.CopyList(queuepath);
let backpath1 = backpathx;
if tree.Left <> null then
newpathx <- this.Deepfirst(tree.Left, ref newpath, ref newpathx, maxlimit, ref allpath, func1, param1, param2, allfunctionstructure, ref queuefunc, false) // Left
if tree.Value = 1 then
Console.WriteLine("")
this.Visit(tree)
for m in queuepath do
newpath2.Enqueue(m)
let backpath2 = newpathx
if tree.Right <> null then
newpathx <- this.Deepfirst(tree.Right, ref newpath2, ref newpathx, maxlimit, ref allpath, func1, param1, param2, allfunctionstructure, ref queuefunc, true) // Right
if tree.Value = 1 then
Console.WriteLine("")
if newpathx <> null then
newpathx
else if backpath2 <> null then
backpath2
else if backpath1 <> null then
backpath1
else backpath

How to integrate an entreprise logo on a ipad?

Similar Messages

Maybe you are looking for