Items tagged with search search Tagged Items Feed

Assume we have a sreach with 10 for, for example


for i[1] from 1 by 1 to 5 do

    for i[2] from 1 by 1 to 5 do 


        if .... then answer=1: print(i[1],...,i[10]); "quitting the search"


     end do

end do

If I write break at qutting part, it will only exit from one for, one idea is putting if answer=1 break before end do of the rest for, that is why I used the local extra variable "answer" but is this the best idea? Any better idea which contains checking less if is apprecied.

Thank you in advance for your time.

I can search for any phrase or symbol in my Maple Worksheet but "sign symbol".

I have a very big result that I am not sure how many minus it has. When I search for - sign, no match found. I can see some minus in the worksheet but Maple can not find them.

Please help me.

I really appreciate.

A search in mapleprimes will not find anything answered as a reply.

Can this be fixed

I made reference to the show the enemy below and included part of the script an interesting part in the show. 

I did a mapleprimes search - only two returns none of which were what I was looking for.  I also did a google search which turned up nothing. 

Was my post deleted?

Hey I have a list of matrices and I want to define a proc that will search through the first matrices entries looking for zeroes, and if it finds one to move on to the next matrix in the list and look for zeroes and so on. if for some reason all matrices in the list have zeroes i would like the proc to answer with 0. otherwise I would like it to answer with the ndex of the first matrix wth all non-zero entries. I've played with things and occasionally made things work. But in general I do not have a solution. This is what I'e tried:

Things like this:

options trace;
local f,j,t,k;
for f from 1 to n while y<=q do;
for j from 1 to n do;
if evalb(C[k](f,j)=0) then;
else next;
end if;
end do;
end do;
end proc;

like this:

local f,j,t,k;
global S;
options trace;
if y=q then return "no";
end if;
for f from 1 to n do;
for j from 1 to n do;
if evalb(C[y](f,j)=0) then;
end if;
end do;
end do;
end proc;

And I think I understand well why these are not workinging however I wondered what I can do that will be syntactically (sp?) correct.


The search operation on both questions and posts doesn't work. I get the same set of results for both, and the same results regardless of the search term.

When I login and then create a question or post and click submit (or preview), I get a new request to login, and, after I do that login, the originally entered message body has been erased.


My Homies

I'm trying to find words which contradict the rule "i before e except after c". according to BBC program "QI" there are 923 exceptions, but below i get less than that. i guess its only as good as the dictionary, the 'inbuilt' has only 25k words but 'ospd3' (with 80k words) seems to stop before letter Q (with my sledgehammer code) when there are more words out there like "weird", "veil" and "reciept".

with(StringTools); with(PatternDictionary); bid := Create(ospd3);
words :=([seq])(LowerCase(Get(bid, i)), i = 1 .. Size(bid)-1);
tot := 0;
for n to nops(words) do
C := searchtext(cie, words[n]); E := searchtext(ei, words[n]);
if`and`(C = 0, E = 0) then next else tot := tot+1;
print([tot, words[n]]) end if
end do



I have a list of sets eg. L:=[{a},{b,c},{d,a,f},{b,d}] and I'm having problems doing operations on it. 

I want to be able to take the first element (a here), look for the next occurrence of it and return what is in the set with it (here d and f).

However I can't seem to use Search or Occurrences as they consider the sets themselves to be the elements. For instance Search(a, L) returns 0. 


What can I do?

I'm using Linearalgebra where I have a 10x1 matrix. I want to find the closest element of the matrix to origo, and the furthest away from origo. Can anyone help me to a understandable solution? :)


Is there a way of searching a list for two consecutive numbers?

Eg. I have the sequence:


I would like to ask, what is the way to use the Direct Search (or other similar package) to solve not a static optimization problem for, say f(x_1,x_2), but the dynamic one, say for f(x_1(t),x_2(t),t)?

I think there must be the way of adapting the algorithm for that.

Any ideas welcome.


Cannot find own answer in

via searching in my answers. Is it because original message is too old and thats why should be so?


How could we know which command to use to do a specific task such as:  "convert boolean value to {1,0}" . I know we could use evalhf() but if we search with keyword "convert true false to 0 1 " in the Maple help then we may not find the right command

Using the Online Help is a solution but I want to know an offline solution since I am not always with the Internet. Did anyone wrote a summary sheet with the content such as : (i.e a list of all commands with keywords for searching)

Hello to all,


I have a chunk of letters, numbers and others symbols like in this extract:


My goal is to be able to enter that chunk into Maple for character manipulation like searching if, for example, Qxp+zr6km is part of that chunk as is (and if possible his location).  Since there is some "+", I can't define it with chunk :=.  The source is a *.txt file.  Maybe a readdata?

I am quite busy for the moment so is there someone kind enough to help me.

Thanks in advance

Is it possible to search a variable or any word or a command in a long worksheet

Thanks in advance

1 2 3 Page 1 of 3